%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC332-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% Computer : n020.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue Sep 29 01:05:35 PM UTC 2026
% Result : Unsatisfiable 0.17s 0.29s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 19
% Syntax : Number of formulae : 56 ( 17 unt; 5 def)
% Number of atoms : 126 ( 13 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 127 ( 57 ~; 65 |; 0 &)
% ( 5 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 6 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 8 ( 0 sgn 8 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
equalelemsP(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause1) ).
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
fof(f47,axiom,
! [X0] : ssItem(skaf44(X0)),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause47) ).
fof(f64,axiom,
! [X0] :
( equalelemsP(cons(X0,nil))
| ~ ssItem(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause64) ).
fof(f80,axiom,
! [X0] :
( ~ segmentP(nil,X0)
| ~ ssList(X0)
| nil = X0 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause80) ).
fof(f101,axiom,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| neq(X1,X0)
| X1 = X0 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause100) ).
fof(f102,plain,
! [X0,X1] :
( neq(X1,X0)
| ~ ssList(X1)
| ~ ssList(X0)
| X0 = X1 ),
inference(reorient_equations,[],[f101]) ).
fof(f103,axiom,
! [X0] :
( ~ singletonP(X0)
| ~ ssList(X0)
| cons(skaf44(X0),nil) = X0 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause101) ).
fof(f202,negated_conjecture,
ssList(sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_3) ).
fof(f203,negated_conjecture,
ssList(sk4),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_4) ).
fof(f204,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_5) ).
fof(f205,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_6) ).
fof(f206,negated_conjecture,
segmentP(sk4,sk3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
fof(f207,negated_conjecture,
( singletonP(sk3)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
fof(f208,negated_conjecture,
( ~ segmentP(sk2,sk1)
| ~ equalelemsP(sk1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
fof(f211,plain,
( ~ segmentP(sk4,sk3)
| ~ equalelemsP(sk3) ),
inference(definition_unfolding,[],[f208,f204,f205,f205]) ).
fof(f243,definition,
( spl0_1
<=> equalelemsP(sk3) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f245,plain,
( ~ equalelemsP(sk3)
| spl0_1 ),
inference(avatar_component_clause,[],[f243]) ).
fof(f247,definition,
( spl0_2
<=> segmentP(sk4,sk3) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f248,plain,
( segmentP(sk4,sk3)
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f247]) ).
fof(f250,plain,
( ~ spl0_1
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f211,f247,f243]) ).
fof(f252,definition,
( spl0_3
<=> neq(sk4,nil) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f254,plain,
( ~ neq(sk4,nil)
| spl0_3 ),
inference(avatar_component_clause,[],[f252]) ).
fof(f256,definition,
( spl0_4
<=> singletonP(sk3) ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f258,plain,
( singletonP(sk3)
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f256]) ).
fof(f259,plain,
( ~ spl0_3
| spl0_4 ),
inference(avatar_split_clause,[],[f207,f256,f252]) ).
fof(f260,plain,
spl0_2,
inference(avatar_split_clause,[],[f206,f247]) ).
fof(f266,definition,
( spl0_6
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).
fof(f267,plain,
( ssList(nil)
| ~ spl0_6 ),
inference(avatar_component_clause,[],[f266]) ).
fof(f302,plain,
spl0_6,
inference(avatar_split_clause,[],[f8,f266]) ).
fof(f491,plain,
( ~ ssList(sk4)
| ~ ssList(nil)
| nil = sk4
| spl0_3 ),
inference(resolution,[],[f102,f254]) ).
fof(f494,plain,
( ~ ssList(nil)
| nil = sk4
| spl0_3 ),
inference(forward_subsumption_resolution,[],[f491,f203]) ).
fof(f495,plain,
( nil = sk4
| spl0_3
| ~ spl0_6 ),
inference(forward_subsumption_resolution,[],[f494,f267]) ).
fof(f497,plain,
( segmentP(nil,sk3)
| ~ spl0_2
| spl0_3
| ~ spl0_6 ),
inference(superposition,[],[f248,f495]) ).
fof(f502,plain,
( ~ ssList(sk3)
| nil = sk3
| ~ spl0_2
| spl0_3
| ~ spl0_6 ),
inference(resolution,[],[f497,f80]) ).
fof(f503,plain,
( nil = sk3
| ~ spl0_2
| spl0_3
| ~ spl0_6 ),
inference(forward_subsumption_resolution,[],[f502,f202]) ).
fof(f507,plain,
( ~ equalelemsP(nil)
| spl0_1
| ~ spl0_2
| spl0_3
| ~ spl0_6 ),
inference(superposition,[],[f245,f503]) ).
fof(f515,plain,
( $false
| spl0_1
| ~ spl0_2
| spl0_3
| ~ spl0_6 ),
inference(forward_subsumption_resolution,[],[f507,f1]) ).
fof(f516,plain,
( spl0_1
| ~ spl0_2
| spl0_3
| ~ spl0_6 ),
inference(avatar_contradiction_clause,[],[f515]) ).
fof(f517,plain,
( ~ ssList(sk3)
| sk3 = cons(skaf44(sk3),nil)
| ~ spl0_4 ),
inference(resolution,[],[f258,f103]) ).
fof(f518,plain,
( sk3 = cons(skaf44(sk3),nil)
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[],[f517,f202]) ).
fof(f574,plain,
( equalelemsP(sk3)
| ~ ssItem(skaf44(sk3))
| ~ spl0_4 ),
inference(superposition,[],[f64,f518]) ).
fof(f575,plain,
( ~ ssItem(skaf44(sk3))
| spl0_1
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[],[f574,f245]) ).
fof(f576,plain,
( $false
| spl0_1
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[],[f575,f47]) ).
fof(f577,plain,
( spl0_1
| ~ spl0_4 ),
inference(avatar_contradiction_clause,[],[f576]) ).
cnf(s1,plain,
( ~ spl0_1
| ~ spl0_2 ),
inference(sat_conversion,[],[f250]) ).
cnf(s2,plain,
( ~ spl0_3
| spl0_4 ),
inference(sat_conversion,[],[f259]) ).
cnf(s3,plain,
spl0_2,
inference(sat_conversion,[],[f260]) ).
cnf(s13,plain,
spl0_6,
inference(sat_conversion,[],[f302]) ).
cnf(s14,plain,
( spl0_1
| ~ spl0_2
| spl0_3
| ~ spl0_6 ),
inference(sat_conversion,[],[f516]) ).
cnf(s16,plain,
( spl0_1
| ~ spl0_4 ),
inference(sat_conversion,[],[f577]) ).
cnf(s21,plain,
~ spl0_1,
inference(rat,[],[s1,s3]) ).
cnf(s22,plain,
~ spl0_4,
inference(rat,[],[s16,s21]) ).
cnf(s23,plain,
spl0_3,
inference(rat,[],[s14,s13,s3,s21]) ).
cnf(s24,plain,
$false,
inference(rat,[],[s2,s22,s23]) ).
fof(f578,plain,
$false,
inference(avatar_sat_refutation,[],[s24]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC332-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.20 % Computer : n020.cluster.edu
% 0.07/0.20 % Model : x86_64 x86_64
% 0.07/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.20 % Memory : 8046.5625MB
% 0.07/0.20 % OS : Linux 6.8.0-71-generic
% 0.07/0.20 % CPULimit : 300
% 0.07/0.20 % WCLimit : 300
% 0.07/0.20 % DateTime : Mon Sep 28 09:09:35 UTC 2026
% 0.07/0.20 % CPUTime :
% 0.07/0.20 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.07/0.23 Running first-order model finding
% 0.07/0.23 Running: /export/starexec/sandbox/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.17/0.29 % (45571)Will run a generic schedule for satisfiability detection.
% 0.17/0.29 % (45581)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1833440546:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/0.29 % (45577)% WARNING: option uhcvi not known.
% 0.17/0.29 % (45576)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2348554367_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/0.29 % (45580)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3321681806:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/0.29 % (45577)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3588997385:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/0.29 % (45578)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3672116564:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/0.29 % (45579)dis+10_1_sil=32000:sp=arity:random_seed=2271111662:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/0.29 % (45582)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=802503715:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.17/0.29 % (45579) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-45571-45579"...
% 0.17/0.29 % (45577) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-45571-45577"...
% 0.17/0.29 % TRYING [1]
% 0.17/0.29 % (45579)...printing done.
% 0.17/0.29 % TRYING [2]
% 0.17/0.29 % (45577)...printing done.
% 0.17/0.29 % (45579)Refutation found. Thanks to Tanya!
% 0.17/0.29 % SZS status Unsatisfiable for theBenchmark
% 0.17/0.29 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.29 % (45579)------------------------------
% 0.17/0.29 % (45579)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.29 % (45579)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.29 % (45579)CaDiCaL version: 2.1.3
% 0.17/0.29 % (45579)Termination reason: Refutation
% 0.17/0.29 % (45579)Time elapsed: 0.010 s
% 0.17/0.29 % (45579)Peak memory usage: 12 MB
% 0.17/0.29 % (45579)Instructions burned: 15 (million)
% 0.17/0.29 % (45571)Success in time 0.053 s
% 0.17/0.29 % Vampire exiting
%------------------------------------------------------------------------------