%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC366-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 : n018.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:44 PM UTC 2026
% Result : Unsatisfiable 0.23s 0.26s
% Output : Refutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 22
% Syntax : Number of formulae : 90 ( 18 unt; 8 def)
% Number of atoms : 245 ( 24 equ)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 292 ( 137 ~; 147 |; 0 &)
% ( 8 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 14 ( 12 usr; 9 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 26 ( 0 sgn 26 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
fof(f76,axiom,
! [X0] :
( ssItem(hd(X0))
| ~ ssList(X0)
| nil = X0 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause76) ).
fof(f85,axiom,
! [X0,X1] :
( ssList(app(X1,X0))
| ~ ssList(X1)
| ~ ssList(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause85) ).
fof(f86,axiom,
! [X0,X1] :
( ssList(cons(X0,X1))
| ~ ssList(X1)
| ~ ssItem(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause86) ).
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(f118,axiom,
! [X0,X1] :
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause115) ).
fof(f154,axiom,
! [X2,X0,X1] :
( app(X0,X1) != X2
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| rearsegP(X2,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause143) ).
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,
( neq(sk2,nil)
| neq(sk2,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
fof(f210,negated_conjecture,
! [X2,X0,X1] :
( ~ ssList(X0)
| sk4 = X0
| ~ ssList(X1)
| app(X1,sk3) != X0
| ~ ssItem(X2)
| cons(X2,nil) != X1
| hd(sk4) != X2
| ~ neq(nil,sk4)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
fof(f211,negated_conjecture,
( ~ rearsegP(sk2,sk1)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
fof(f214,plain,
( neq(sk4,nil)
| neq(sk4,nil) ),
inference(definition_unfolding,[],[f206,f204,f204]) ).
fof(f218,plain,
( ~ rearsegP(sk4,sk3)
| ~ neq(sk4,nil) ),
inference(definition_unfolding,[],[f211,f204,f205]) ).
fof(f225,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f118]) ).
fof(f229,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(app(X0,X1))
| rearsegP(app(X0,X1),X1) ),
inference(equality_resolution,[],[f154]) ).
fof(f246,plain,
! [X2,X1] :
( ~ ssList(app(X1,sk3))
| sk4 = app(X1,sk3)
| ~ ssList(X1)
| ~ ssItem(X2)
| cons(X2,nil) != X1
| hd(sk4) != X2
| ~ neq(nil,sk4)
| ~ neq(sk4,nil) ),
inference(equality_resolution,[],[f210]) ).
fof(f247,plain,
! [X2] :
( ~ ssList(app(cons(X2,nil),sk3))
| sk4 = app(cons(X2,nil),sk3)
| ~ ssList(cons(X2,nil))
| ~ ssItem(X2)
| hd(sk4) != X2
| ~ neq(nil,sk4)
| ~ neq(sk4,nil) ),
inference(equality_resolution,[],[f246]) ).
fof(f248,plain,
( ~ ssList(app(cons(hd(sk4),nil),sk3))
| sk4 = app(cons(hd(sk4),nil),sk3)
| ~ ssList(cons(hd(sk4),nil))
| ~ ssItem(hd(sk4))
| ~ neq(nil,sk4)
| ~ neq(sk4,nil) ),
inference(equality_resolution,[],[f247]) ).
fof(f249,plain,
neq(sk4,nil),
inference(duplicate_literal_removal,[],[f214]) ).
fof(f254,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f225]) ).
fof(f257,definition,
( spl0_1
<=> neq(sk4,nil) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f258,plain,
( neq(sk4,nil)
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f257]) ).
fof(f261,definition,
( spl0_2
<=> rearsegP(sk4,sk3) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f263,plain,
( ~ rearsegP(sk4,sk3)
| spl0_2 ),
inference(avatar_component_clause,[],[f261]) ).
fof(f264,plain,
( ~ spl0_1
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f218,f261,f257]) ).
fof(f266,definition,
( spl0_3
<=> neq(nil,sk4) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f268,plain,
( ~ neq(nil,sk4)
| spl0_3 ),
inference(avatar_component_clause,[],[f266]) ).
fof(f270,definition,
( spl0_4
<=> ssItem(hd(sk4)) ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f271,plain,
( ssItem(hd(sk4))
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f270]) ).
fof(f272,plain,
( ~ ssItem(hd(sk4))
| spl0_4 ),
inference(avatar_component_clause,[],[f270]) ).
fof(f274,definition,
( spl0_5
<=> ssList(cons(hd(sk4),nil)) ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
fof(f275,plain,
( ssList(cons(hd(sk4),nil))
| ~ spl0_5 ),
inference(avatar_component_clause,[],[f274]) ).
fof(f276,plain,
( ~ ssList(cons(hd(sk4),nil))
| spl0_5 ),
inference(avatar_component_clause,[],[f274]) ).
fof(f278,definition,
( spl0_6
<=> sk4 = app(cons(hd(sk4),nil),sk3) ),
introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).
fof(f280,plain,
( sk4 = app(cons(hd(sk4),nil),sk3)
| ~ spl0_6 ),
inference(avatar_component_clause,[],[f278]) ).
fof(f282,definition,
( spl0_7
<=> ssList(app(cons(hd(sk4),nil),sk3)) ),
introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition]) ).
fof(f284,plain,
( ~ ssList(app(cons(hd(sk4),nil),sk3))
| spl0_7 ),
inference(avatar_component_clause,[],[f282]) ).
fof(f285,plain,
( ~ spl0_1
| ~ spl0_3
| ~ spl0_4
| ~ spl0_5
| spl0_6
| ~ spl0_7 ),
inference(avatar_split_clause,[],[f248,f282,f278,f274,f270,f266,f257]) ).
fof(f288,plain,
spl0_1,
inference(avatar_split_clause,[],[f249,f257]) ).
fof(f294,definition,
( spl0_9
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl0_9])],[avatar_definition]) ).
fof(f295,plain,
( ssList(nil)
| ~ spl0_9 ),
inference(avatar_component_clause,[],[f294]) ).
fof(f330,plain,
spl0_9,
inference(avatar_split_clause,[],[f8,f294]) ).
fof(f519,plain,
( ~ ssList(nil)
| ~ ssList(sk4)
| nil = sk4
| spl0_3 ),
inference(resolution,[],[f102,f268]) ).
fof(f522,plain,
( ~ ssList(sk4)
| nil = sk4
| spl0_3
| ~ spl0_9 ),
inference(forward_subsumption_resolution,[],[f519,f295]) ).
fof(f523,plain,
( nil = sk4
| spl0_3
| ~ spl0_9 ),
inference(forward_subsumption_resolution,[],[f522,f203]) ).
fof(f525,plain,
( neq(nil,nil)
| ~ spl0_1
| spl0_3
| ~ spl0_9 ),
inference(superposition,[],[f258,f523]) ).
fof(f527,plain,
( ~ neq(nil,nil)
| spl0_3
| ~ spl0_9 ),
inference(superposition,[],[f268,f523]) ).
fof(f533,plain,
( $false
| ~ spl0_1
| spl0_3
| ~ spl0_9 ),
inference(forward_subsumption_resolution,[],[f527,f525]) ).
fof(f534,plain,
( ~ spl0_1
| spl0_3
| ~ spl0_9 ),
inference(avatar_contradiction_clause,[],[f533]) ).
fof(f571,plain,
( ~ ssList(sk4)
| nil = sk4
| spl0_4 ),
inference(resolution,[],[f76,f272]) ).
fof(f572,plain,
( nil = sk4
| spl0_4 ),
inference(forward_subsumption_resolution,[],[f571,f203]) ).
fof(f574,plain,
( neq(nil,nil)
| ~ spl0_1
| spl0_4 ),
inference(superposition,[],[f258,f572]) ).
fof(f581,plain,
( ~ ssList(nil)
| ~ spl0_1
| spl0_4 ),
inference(resolution,[],[f574,f254]) ).
fof(f583,plain,
( $false
| ~ spl0_1
| spl0_4
| ~ spl0_9 ),
inference(forward_subsumption_resolution,[],[f581,f295]) ).
fof(f584,plain,
( ~ spl0_1
| spl0_4
| ~ spl0_9 ),
inference(avatar_contradiction_clause,[],[f583]) ).
fof(f585,plain,
( ~ ssList(nil)
| ~ ssItem(hd(sk4))
| spl0_5 ),
inference(resolution,[],[f86,f276]) ).
fof(f589,plain,
( ~ ssItem(hd(sk4))
| spl0_5
| ~ spl0_9 ),
inference(forward_subsumption_resolution,[],[f585,f295]) ).
fof(f590,plain,
( $false
| ~ spl0_4
| spl0_5
| ~ spl0_9 ),
inference(forward_subsumption_resolution,[],[f589,f271]) ).
fof(f591,plain,
( ~ spl0_4
| spl0_5
| ~ spl0_9 ),
inference(avatar_contradiction_clause,[],[f590]) ).
fof(f595,plain,
( ~ ssList(cons(hd(sk4),nil))
| ~ ssList(sk3)
| spl0_7 ),
inference(resolution,[],[f284,f85]) ).
fof(f596,plain,
( ~ ssList(sk3)
| ~ spl0_5
| spl0_7 ),
inference(forward_subsumption_resolution,[],[f595,f275]) ).
fof(f597,plain,
( $false
| ~ spl0_5
| spl0_7 ),
inference(forward_subsumption_resolution,[],[f596,f202]) ).
fof(f598,plain,
( ~ spl0_5
| spl0_7 ),
inference(avatar_contradiction_clause,[],[f597]) ).
fof(f1101,plain,
! [X0,X1] :
( rearsegP(app(X0,X1),X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f229,f85]) ).
fof(f1124,plain,
( rearsegP(sk4,sk3)
| ~ ssList(sk3)
| ~ ssList(cons(hd(sk4),nil))
| ~ spl0_6 ),
inference(superposition,[],[f1101,f280]) ).
fof(f1128,plain,
( ~ ssList(sk3)
| ~ ssList(cons(hd(sk4),nil))
| spl0_2
| ~ spl0_6 ),
inference(forward_subsumption_resolution,[],[f1124,f263]) ).
fof(f1130,plain,
( ~ ssList(cons(hd(sk4),nil))
| spl0_2
| ~ spl0_6 ),
inference(forward_subsumption_resolution,[],[f1128,f202]) ).
fof(f1131,plain,
( $false
| spl0_2
| ~ spl0_5
| ~ spl0_6 ),
inference(forward_subsumption_resolution,[],[f1130,f275]) ).
fof(f1132,plain,
( spl0_2
| ~ spl0_5
| ~ spl0_6 ),
inference(avatar_contradiction_clause,[],[f1131]) ).
cnf(s1,plain,
( ~ spl0_1
| ~ spl0_2 ),
inference(sat_conversion,[],[f264]) ).
cnf(s2,plain,
( ~ spl0_1
| ~ spl0_3
| ~ spl0_4
| ~ spl0_5
| spl0_6
| ~ spl0_7 ),
inference(sat_conversion,[],[f285]) ).
cnf(s5,plain,
spl0_1,
inference(sat_conversion,[],[f288]) ).
cnf(s15,plain,
spl0_9,
inference(sat_conversion,[],[f330]) ).
cnf(s17,plain,
( ~ spl0_1
| spl0_3
| ~ spl0_9 ),
inference(sat_conversion,[],[f534]) ).
cnf(s18,plain,
( ~ spl0_1
| spl0_4
| ~ spl0_9 ),
inference(sat_conversion,[],[f584]) ).
cnf(s19,plain,
( ~ spl0_4
| spl0_5
| ~ spl0_9 ),
inference(sat_conversion,[],[f591]) ).
cnf(s20,plain,
( ~ spl0_5
| spl0_7 ),
inference(sat_conversion,[],[f598]) ).
cnf(s45,plain,
( spl0_2
| ~ spl0_5
| ~ spl0_6 ),
inference(sat_conversion,[],[f1132]) ).
cnf(s50,plain,
spl0_4,
inference(rat,[],[s18,s15,s5]) ).
cnf(s51,plain,
spl0_3,
inference(rat,[],[s17,s15,s5]) ).
cnf(s53,plain,
spl0_5,
inference(rat,[],[s19,s15,s50]) ).
cnf(s56,plain,
spl0_7,
inference(rat,[],[s20,s53]) ).
cnf(s57,plain,
spl0_6,
inference(rat,[],[s2,s56,s53,s50,s51,s5]) ).
cnf(s59,plain,
spl0_2,
inference(rat,[],[s45,s53,s57]) ).
cnf(s65,plain,
$false,
inference(rat,[],[s1,s59,s5]) ).
fof(f1133,plain,
$false,
inference(avatar_sat_refutation,[],[s65]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC366-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.08/0.18 % Computer : n018.cluster.edu
% 0.08/0.18 % Model : x86_64 x86_64
% 0.08/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18 % Memory : 8046.5625MB
% 0.08/0.18 % OS : Linux 6.8.0-71-generic
% 0.08/0.18 % CPULimit : 300
% 0.08/0.18 % WCLimit : 300
% 0.08/0.18 % DateTime : Mon Sep 28 09:22:31 UTC 2026
% 0.08/0.18 % CPUTime :
% 0.08/0.18 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.08/0.21 Running first-order model finding
% 0.08/0.21 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.23/0.26 % (3247156)Will run a generic schedule for satisfiability detection.
% 0.23/0.26 % (3247161)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=220989280_2999 on theBenchmark for (2999ds/0Mi)
% 0.23/0.26 % (3247163)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3440554325:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.23/0.26 % (3247165)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2692639688:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.23/0.26 % (3247166)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2577875140:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.23/0.26 % (3247167)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2661949452:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.23/0.26 % (3247164)dis+10_1_sil=32000:sp=arity:random_seed=885699912:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.23/0.26 % (3247162)% WARNING: option uhcvi not known.
% 0.23/0.26 % (3247162)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=900968642:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.23/0.26 % TRYING [1]
% 0.23/0.26 % TRYING [2]
% 0.23/0.26 % (3247164) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-3247156-3247164"...
% 0.23/0.26 % (3247164)...printing done.
% 0.23/0.26 % (3247164)Refutation found. Thanks to Tanya!
% 0.23/0.26 % SZS status Unsatisfiable for theBenchmark
% 0.23/0.26 % SZS output start Proof for theBenchmark
% See solution above
% 0.23/0.26 % (3247164)------------------------------
% 0.23/0.26 % (3247164)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.23/0.26 % (3247164)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.23/0.26 % (3247164)CaDiCaL version: 2.1.3
% 0.23/0.26 % (3247164)Termination reason: Refutation
% 0.23/0.26 % (3247164)Time elapsed: 0.011 s
% 0.23/0.26 % (3247164)Peak memory usage: 13 MB
% 0.23/0.26 % (3247164)Instructions burned: 32 (million)
% 0.23/0.26 % (3247156)Success in time 0.048 s
% 0.23/0.26 % Vampire exiting
%------------------------------------------------------------------------------