%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC229-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% Computer : n011.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:11 PM UTC 2026
% Result : Unsatisfiable 0.21s 0.29s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 22
% Syntax : Number of formulae : 82 ( 20 unt; 6 def)
% Number of atoms : 231 ( 36 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 288 ( 139 ~; 143 |; 0 &)
% ( 6 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 14 ( 12 usr; 7 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-3 aty)
% Number of variables : 44 ( 0 sgn 44 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
fof(f47,axiom,
! [X0] : ssItem(skaf44(X0)),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause47) ).
fof(f71,axiom,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause71) ).
fof(f73,axiom,
! [X0] :
( ~ ssList(X0)
| app(X0,nil) = X0 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause73) ).
fof(f74,axiom,
! [X0] :
( ~ ssList(X0)
| app(nil,X0) = X0 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause74) ).
fof(f80,axiom,
! [X0] :
( ~ segmentP(nil,X0)
| ~ ssList(X0)
| nil = X0 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause80) ).
fof(f101,axiom,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| neq(X1,X0)
| X1 = X0 ),
file('/export/starexec/sandbox2/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/sandbox2/benchmark/Axioms/SWC001-0.ax',clause101) ).
fof(f202,negated_conjecture,
ssList(sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_3) ).
fof(f203,negated_conjecture,
ssList(sk4),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_4) ).
fof(f205,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
fof(f206,negated_conjecture,
segmentP(sk4,sk3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
fof(f207,negated_conjecture,
nil != sk1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
fof(f208,negated_conjecture,
! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| app(app(X1,cons(X0,nil)),X2) != sk1
| ssItem(sk5(X2,X1,X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
fof(f209,plain,
! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| sk1 != app(app(X1,cons(X0,nil)),X2)
| ssItem(sk5(X2,X1,X0)) ),
inference(reorient_equations,[],[f208]) ).
fof(f210,negated_conjecture,
! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| app(app(X1,cons(X0,nil)),X2) != sk1
| memberP(X1,sk5(X2,X1,X0)) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
fof(f211,plain,
! [X2,X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| sk1 != app(app(X1,cons(X0,nil)),X2)
| memberP(X1,sk5(X2,X1,X0)) ),
inference(reorient_equations,[],[f210]) ).
fof(f218,negated_conjecture,
( singletonP(sk3)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).
fof(f221,plain,
nil != sk3,
inference(definition_unfolding,[],[f207,f205]) ).
fof(f222,plain,
! [X2,X0,X1] :
( sk3 != app(app(X1,cons(X0,nil)),X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssItem(X0)
| ssItem(sk5(X2,X1,X0)) ),
inference(definition_unfolding,[],[f209,f205]) ).
fof(f223,plain,
! [X2,X0,X1] :
( sk3 != app(app(X1,cons(X0,nil)),X2)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssItem(X0)
| memberP(X1,sk5(X2,X1,X0)) ),
inference(definition_unfolding,[],[f211,f205]) ).
fof(f258,definition,
( spl0_1
<=> neq(sk4,nil) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f260,plain,
( ~ neq(sk4,nil)
| spl0_1 ),
inference(avatar_component_clause,[],[f258]) ).
fof(f262,definition,
( spl0_2
<=> singletonP(sk3) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f264,plain,
( singletonP(sk3)
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f262]) ).
fof(f265,plain,
( ~ spl0_1
| spl0_2 ),
inference(avatar_split_clause,[],[f218,f262,f258]) ).
fof(f271,definition,
( spl0_4
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f272,plain,
( ssList(nil)
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f271]) ).
fof(f307,plain,
spl0_4,
inference(avatar_split_clause,[],[f8,f271]) ).
fof(f352,plain,
sk3 = app(sk3,nil),
inference(resolution,[],[f73,f202]) ).
fof(f382,plain,
sk3 = app(nil,sk3),
inference(resolution,[],[f74,f202]) ).
fof(f501,plain,
( ~ ssList(sk4)
| ~ ssList(nil)
| nil = sk4
| spl0_1 ),
inference(resolution,[],[f102,f260]) ).
fof(f504,plain,
( ~ ssList(nil)
| nil = sk4
| spl0_1 ),
inference(forward_subsumption_resolution,[],[f501,f203]) ).
fof(f505,plain,
( nil = sk4
| spl0_1
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[],[f504,f272]) ).
fof(f507,plain,
( segmentP(nil,sk3)
| spl0_1
| ~ spl0_4 ),
inference(superposition,[],[f206,f505]) ).
fof(f512,plain,
( ~ ssList(sk3)
| nil = sk3
| spl0_1
| ~ spl0_4 ),
inference(resolution,[],[f507,f80]) ).
fof(f513,plain,
( nil = sk3
| spl0_1
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[],[f512,f202]) ).
fof(f514,plain,
( $false
| spl0_1
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[],[f513,f221]) ).
fof(f515,plain,
( spl0_1
| ~ spl0_4 ),
inference(avatar_contradiction_clause,[],[f514]) ).
fof(f516,plain,
( ~ ssList(sk3)
| sk3 = cons(skaf44(sk3),nil)
| ~ spl0_2 ),
inference(resolution,[],[f264,f103]) ).
fof(f517,plain,
( sk3 = cons(skaf44(sk3),nil)
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f516,f202]) ).
fof(f521,plain,
( ! [X0,X1] :
( sk3 != app(app(X0,sk3),X1)
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssItem(skaf44(sk3))
| ssItem(sk5(X1,X0,skaf44(sk3))) )
| ~ spl0_2 ),
inference(superposition,[],[f222,f517]) ).
fof(f560,definition,
( spl0_12
<=> ssItem(skaf44(sk3)) ),
introduced(definition,[new_symbols(definition,[spl0_12])],[avatar_definition]) ).
fof(f562,plain,
( ~ ssItem(skaf44(sk3))
| spl0_12 ),
inference(avatar_component_clause,[],[f560]) ).
fof(f564,definition,
( spl0_13
<=> ! [X0,X1] :
( sk3 != app(app(X0,sk3),X1)
| ssItem(sk5(X1,X0,skaf44(sk3)))
| ~ ssList(X1)
| ~ ssList(X0) ) ),
introduced(definition,[new_symbols(definition,[spl0_13])],[avatar_definition]) ).
fof(f565,plain,
( ! [X0,X1] :
( sk3 != app(app(X0,sk3),X1)
| ssItem(sk5(X1,X0,skaf44(sk3)))
| ~ ssList(X1)
| ~ ssList(X0) )
| ~ spl0_13 ),
inference(avatar_component_clause,[],[f564]) ).
fof(f566,plain,
( ~ spl0_12
| spl0_13
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f521,f262,f564,f560]) ).
fof(f567,plain,
( ! [X0,X1] :
( sk3 != app(app(X0,sk3),X1)
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssItem(skaf44(sk3))
| memberP(X0,sk5(X1,X0,skaf44(sk3))) )
| ~ spl0_2 ),
inference(superposition,[],[f223,f517]) ).
fof(f569,definition,
( spl0_14
<=> ! [X0,X1] :
( sk3 != app(app(X0,sk3),X1)
| memberP(X0,sk5(X1,X0,skaf44(sk3)))
| ~ ssList(X1)
| ~ ssList(X0) ) ),
introduced(definition,[new_symbols(definition,[spl0_14])],[avatar_definition]) ).
fof(f570,plain,
( ! [X0,X1] :
( sk3 != app(app(X0,sk3),X1)
| memberP(X0,sk5(X1,X0,skaf44(sk3)))
| ~ ssList(X1)
| ~ ssList(X0) )
| ~ spl0_14 ),
inference(avatar_component_clause,[],[f569]) ).
fof(f571,plain,
( ~ spl0_12
| spl0_14
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f567,f262,f569,f560]) ).
fof(f575,plain,
( $false
| spl0_12 ),
inference(resolution,[],[f47,f562]) ).
fof(f576,plain,
spl0_12,
inference(avatar_contradiction_clause,[],[f575]) ).
fof(f612,plain,
( ! [X0] :
( sk3 != app(sk3,X0)
| ssItem(sk5(X0,nil,skaf44(sk3)))
| ~ ssList(X0)
| ~ ssList(nil) )
| ~ spl0_13 ),
inference(superposition,[],[f565,f382]) ).
fof(f613,plain,
( ! [X0] :
( sk3 != app(sk3,X0)
| ssItem(sk5(X0,nil,skaf44(sk3)))
| ~ ssList(X0) )
| ~ spl0_4
| ~ spl0_13 ),
inference(forward_subsumption_resolution,[],[f612,f272]) ).
fof(f614,plain,
( sk3 != sk3
| ssItem(sk5(nil,nil,skaf44(sk3)))
| ~ ssList(nil)
| ~ spl0_4
| ~ spl0_13 ),
inference(superposition,[],[f613,f352]) ).
fof(f615,plain,
( ssItem(sk5(nil,nil,skaf44(sk3)))
| ~ ssList(nil)
| ~ spl0_4
| ~ spl0_13 ),
inference(trivial_inequality_removal,[],[f614]) ).
fof(f616,plain,
( ssItem(sk5(nil,nil,skaf44(sk3)))
| ~ spl0_4
| ~ spl0_13 ),
inference(forward_subsumption_resolution,[],[f615,f272]) ).
fof(f619,plain,
( ! [X0] :
( sk3 != app(sk3,X0)
| memberP(nil,sk5(X0,nil,skaf44(sk3)))
| ~ ssList(X0)
| ~ ssList(nil) )
| ~ spl0_14 ),
inference(superposition,[],[f570,f382]) ).
fof(f620,plain,
( ! [X0] :
( sk3 != app(sk3,X0)
| memberP(nil,sk5(X0,nil,skaf44(sk3)))
| ~ ssList(X0) )
| ~ spl0_4
| ~ spl0_14 ),
inference(forward_subsumption_resolution,[],[f619,f272]) ).
fof(f623,plain,
( sk3 != sk3
| memberP(nil,sk5(nil,nil,skaf44(sk3)))
| ~ ssList(nil)
| ~ spl0_4
| ~ spl0_14 ),
inference(superposition,[],[f620,f352]) ).
fof(f624,plain,
( memberP(nil,sk5(nil,nil,skaf44(sk3)))
| ~ ssList(nil)
| ~ spl0_4
| ~ spl0_14 ),
inference(trivial_inequality_removal,[],[f623]) ).
fof(f625,plain,
( memberP(nil,sk5(nil,nil,skaf44(sk3)))
| ~ spl0_4
| ~ spl0_14 ),
inference(forward_subsumption_resolution,[],[f624,f272]) ).
fof(f626,plain,
( ~ ssItem(sk5(nil,nil,skaf44(sk3)))
| ~ spl0_4
| ~ spl0_14 ),
inference(resolution,[],[f625,f71]) ).
fof(f627,plain,
( $false
| ~ spl0_4
| ~ spl0_13
| ~ spl0_14 ),
inference(forward_subsumption_resolution,[],[f626,f616]) ).
fof(f628,plain,
( ~ spl0_4
| ~ spl0_13
| ~ spl0_14 ),
inference(avatar_contradiction_clause,[],[f627]) ).
cnf(s1,plain,
( ~ spl0_1
| spl0_2 ),
inference(sat_conversion,[],[f265]) ).
cnf(s11,plain,
spl0_4,
inference(sat_conversion,[],[f307]) ).
cnf(s12,plain,
( spl0_1
| ~ spl0_4 ),
inference(sat_conversion,[],[f515]) ).
cnf(s14,plain,
( ~ spl0_2
| ~ spl0_12
| spl0_13 ),
inference(sat_conversion,[],[f566]) ).
cnf(s15,plain,
( ~ spl0_2
| ~ spl0_12
| spl0_14 ),
inference(sat_conversion,[],[f571]) ).
cnf(s16,plain,
spl0_12,
inference(sat_conversion,[],[f576]) ).
cnf(s17,plain,
( ~ spl0_4
| ~ spl0_13
| ~ spl0_14 ),
inference(sat_conversion,[],[f628]) ).
cnf(s18,plain,
( ~ spl0_2
| spl0_14 ),
inference(rat,[],[s15,s16]) ).
cnf(s19,plain,
( ~ spl0_2
| spl0_13 ),
inference(rat,[],[s14,s16]) ).
cnf(s20,plain,
spl0_1,
inference(rat,[],[s12,s11]) ).
cnf(s25,plain,
spl0_2,
inference(rat,[],[s1,s20]) ).
cnf(s26,plain,
spl0_14,
inference(rat,[],[s18,s25]) ).
cnf(s27,plain,
spl0_13,
inference(rat,[],[s19,s25]) ).
cnf(s29,plain,
$false,
inference(rat,[],[s17,s11,s26,s27]) ).
fof(f629,plain,
$false,
inference(avatar_sat_refutation,[],[s29]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC229-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.18 % Computer : n011.cluster.edu
% 0.09/0.18 % Model : x86_64 x86_64
% 0.09/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18 % Memory : 8046.5625MB
% 0.09/0.18 % OS : Linux 6.8.0-71-generic
% 0.09/0.18 % CPULimit : 300
% 0.09/0.18 % WCLimit : 300
% 0.09/0.18 % DateTime : Mon Sep 28 08:35:16 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.22 Running first-order model finding
% 0.09/0.22 Running: /export/starexec/sandbox2/solver/bin/vampire-ho --input_syntax tptp --output_axiom_names on --mode casc --intent sat -m 16384 --cores 7 -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.29 % (3251588)Will run a generic schedule for satisfiability detection.
% 0.21/0.29 % (3251595)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1842711643:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.21/0.29 % (3251594)% WARNING: option uhcvi not known.
% 0.21/0.29 % (3251593)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1363922439_2999 on theBenchmark for (2999ds/0Mi)
% 0.21/0.29 % (3251594)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=3478158494:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.21/0.29 % (3251596)dis+10_1_sil=32000:sp=arity:random_seed=2757974285:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.21/0.29 % (3251597)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=188115137:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.21/0.29 % (3251598)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3924251458:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.21/0.29 % (3251599)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=139146510:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.21/0.29 % TRYING [1]
% 0.21/0.29 % (3251596) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3251588-3251596"...
% 0.21/0.29 % TRYING [2]
% 0.21/0.29 % (3251596)...printing done.
% 0.21/0.29 % (3251594) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3251588-3251594"...
% 0.21/0.29 % (3251596)Refutation found. Thanks to Tanya!
% 0.21/0.29 % SZS status Unsatisfiable for theBenchmark
% 0.21/0.29 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.29 % (3251596)------------------------------
% 0.21/0.29 % (3251596)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.21/0.29 % (3251596)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.21/0.29 % (3251596)CaDiCaL version: 2.1.3
% 0.21/0.29 % (3251596)Termination reason: Refutation
% 0.21/0.29 % (3251596)Time elapsed: 0.013 s
% 0.21/0.29 % (3251596)Peak memory usage: 12 MB
% 0.21/0.29 % (3251596)Instructions burned: 19 (million)
% 0.21/0.29 % (3251588)Success in time 0.058 s
% 0.21/0.29 % Vampire exiting
%------------------------------------------------------------------------------