%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC320-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 : n017.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:32 PM UTC 2026
% Result : Unsatisfiable 0.20s 0.29s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 19
% Syntax : Number of formulae : 63 ( 8 unt; 8 def)
% Number of atoms : 165 ( 44 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 203 ( 101 ~; 94 |; 0 &)
% ( 8 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 9 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 16 ( 0 sgn 16 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f204,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
fof(f205,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
fof(f206,negated_conjecture,
( nil = sk3
| nil != sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
fof(f207,negated_conjecture,
( ssItem(sk5)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
fof(f208,negated_conjecture,
( ssList(sk6)
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
fof(f209,negated_conjecture,
( app(cons(sk5,nil),sk6) = sk3
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
fof(f210,plain,
( sk3 = app(cons(sk5,nil),sk6)
| ~ neq(sk4,nil) ),
inference(reorient_equations,[],[f209]) ).
fof(f211,negated_conjecture,
( app(sk6,cons(sk5,nil)) = sk4
| ~ neq(sk4,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
fof(f212,plain,
( sk4 = app(sk6,cons(sk5,nil))
| ~ neq(sk4,nil) ),
inference(reorient_equations,[],[f211]) ).
fof(f213,negated_conjecture,
( nil = sk2
| neq(sk2,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
fof(f214,negated_conjecture,
! [X0,X1] :
( nil = sk2
| ~ ssItem(X0)
| ~ ssList(X1)
| app(cons(X0,nil),X1) != sk1
| app(X1,cons(X0,nil)) != sk2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).
fof(f215,plain,
! [X0,X1] :
( nil = sk2
| ~ ssItem(X0)
| ~ ssList(X1)
| app(cons(X0,nil),X1) != sk1
| sk2 != app(X1,cons(X0,nil)) ),
inference(reorient_equations,[],[f214]) ).
fof(f216,negated_conjecture,
( nil != sk1
| neq(sk2,nil) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).
fof(f217,negated_conjecture,
! [X0,X1] :
( nil != sk1
| ~ ssItem(X0)
| ~ ssList(X1)
| app(cons(X0,nil),X1) != sk1
| app(X1,cons(X0,nil)) != sk2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_15) ).
fof(f218,plain,
! [X0,X1] :
( nil != sk1
| ~ ssItem(X0)
| ~ ssList(X1)
| app(cons(X0,nil),X1) != sk1
| sk2 != app(X1,cons(X0,nil)) ),
inference(reorient_equations,[],[f217]) ).
fof(f221,plain,
( nil = sk4
| neq(sk4,nil) ),
inference(definition_unfolding,[],[f213,f204,f204]) ).
fof(f222,plain,
! [X0,X1] :
( nil = sk4
| ~ ssItem(X0)
| ~ ssList(X1)
| app(cons(X0,nil),X1) != sk3
| sk4 != app(X1,cons(X0,nil)) ),
inference(definition_unfolding,[],[f215,f204,f205,f204]) ).
fof(f223,plain,
( nil != sk3
| neq(sk4,nil) ),
inference(definition_unfolding,[],[f216,f205,f204]) ).
fof(f224,plain,
! [X0,X1] :
( nil != sk3
| ~ ssItem(X0)
| ~ ssList(X1)
| app(cons(X0,nil),X1) != sk3
| sk4 != app(X1,cons(X0,nil)) ),
inference(definition_unfolding,[],[f218,f205,f205,f204]) ).
fof(f256,definition,
( spl0_1
<=> ! [X0,X1] :
( ~ ssItem(X0)
| sk4 != app(X1,cons(X0,nil))
| app(cons(X0,nil),X1) != sk3
| ~ ssList(X1) ) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f257,plain,
( ! [X0,X1] :
( sk4 != app(X1,cons(X0,nil))
| ~ ssItem(X0)
| app(cons(X0,nil),X1) != sk3
| ~ ssList(X1) )
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f256]) ).
fof(f259,definition,
( spl0_2
<=> nil = sk3 ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f262,plain,
( spl0_1
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f224,f259,f256]) ).
fof(f264,definition,
( spl0_3
<=> neq(sk4,nil) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f267,plain,
( spl0_3
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f223,f259,f264]) ).
fof(f269,definition,
( spl0_4
<=> nil = sk4 ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f272,plain,
( spl0_1
| spl0_4 ),
inference(avatar_split_clause,[],[f222,f269,f256]) ).
fof(f273,plain,
( spl0_3
| spl0_4 ),
inference(avatar_split_clause,[],[f221,f269,f264]) ).
fof(f275,definition,
( spl0_5
<=> sk4 = app(sk6,cons(sk5,nil)) ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
fof(f277,plain,
( sk4 = app(sk6,cons(sk5,nil))
| ~ spl0_5 ),
inference(avatar_component_clause,[],[f275]) ).
fof(f278,plain,
( ~ spl0_3
| spl0_5 ),
inference(avatar_split_clause,[],[f212,f275,f264]) ).
fof(f280,definition,
( spl0_6
<=> sk3 = app(cons(sk5,nil),sk6) ),
introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).
fof(f282,plain,
( sk3 = app(cons(sk5,nil),sk6)
| ~ spl0_6 ),
inference(avatar_component_clause,[],[f280]) ).
fof(f283,plain,
( ~ spl0_3
| spl0_6 ),
inference(avatar_split_clause,[],[f210,f280,f264]) ).
fof(f285,definition,
( spl0_7
<=> ssList(sk6) ),
introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition]) ).
fof(f287,plain,
( ssList(sk6)
| ~ spl0_7 ),
inference(avatar_component_clause,[],[f285]) ).
fof(f288,plain,
( ~ spl0_3
| spl0_7 ),
inference(avatar_split_clause,[],[f208,f285,f264]) ).
fof(f290,definition,
( spl0_8
<=> ssItem(sk5) ),
introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition]) ).
fof(f292,plain,
( ssItem(sk5)
| ~ spl0_8 ),
inference(avatar_component_clause,[],[f290]) ).
fof(f293,plain,
( ~ spl0_3
| spl0_8 ),
inference(avatar_split_clause,[],[f207,f290,f264]) ).
fof(f294,plain,
( ~ spl0_4
| spl0_2 ),
inference(avatar_split_clause,[],[f206,f259,f269]) ).
fof(f347,plain,
( sk4 != sk4
| ~ ssItem(sk5)
| sk3 != app(cons(sk5,nil),sk6)
| ~ ssList(sk6)
| ~ spl0_1
| ~ spl0_5 ),
inference(superposition,[],[f257,f277]) ).
fof(f348,plain,
( ~ ssItem(sk5)
| sk3 != app(cons(sk5,nil),sk6)
| ~ ssList(sk6)
| ~ spl0_1
| ~ spl0_5 ),
inference(trivial_inequality_removal,[],[f347]) ).
fof(f349,plain,
( sk3 != app(cons(sk5,nil),sk6)
| ~ ssList(sk6)
| ~ spl0_1
| ~ spl0_5
| ~ spl0_8 ),
inference(forward_subsumption_resolution,[],[f348,f292]) ).
fof(f350,plain,
( ~ ssList(sk6)
| ~ spl0_1
| ~ spl0_5
| ~ spl0_6
| ~ spl0_8 ),
inference(forward_subsumption_resolution,[],[f349,f282]) ).
fof(f351,plain,
( $false
| ~ spl0_1
| ~ spl0_5
| ~ spl0_6
| ~ spl0_7
| ~ spl0_8 ),
inference(forward_subsumption_resolution,[],[f350,f287]) ).
fof(f352,plain,
( ~ spl0_1
| ~ spl0_5
| ~ spl0_6
| ~ spl0_7
| ~ spl0_8 ),
inference(avatar_contradiction_clause,[],[f351]) ).
cnf(s1,plain,
( spl0_1
| ~ spl0_2 ),
inference(sat_conversion,[],[f262]) ).
cnf(s2,plain,
( ~ spl0_2
| spl0_3 ),
inference(sat_conversion,[],[f267]) ).
cnf(s3,plain,
( spl0_1
| spl0_4 ),
inference(sat_conversion,[],[f272]) ).
cnf(s4,plain,
( spl0_3
| spl0_4 ),
inference(sat_conversion,[],[f273]) ).
cnf(s5,plain,
( ~ spl0_3
| spl0_5 ),
inference(sat_conversion,[],[f278]) ).
cnf(s6,plain,
( ~ spl0_3
| spl0_6 ),
inference(sat_conversion,[],[f283]) ).
cnf(s7,plain,
( ~ spl0_3
| spl0_7 ),
inference(sat_conversion,[],[f288]) ).
cnf(s8,plain,
( ~ spl0_3
| spl0_8 ),
inference(sat_conversion,[],[f293]) ).
cnf(s9,plain,
( spl0_2
| ~ spl0_4 ),
inference(sat_conversion,[],[f294]) ).
cnf(s22,plain,
( ~ spl0_1
| ~ spl0_5
| ~ spl0_6
| ~ spl0_7
| ~ spl0_8 ),
inference(sat_conversion,[],[f352]) ).
cnf(s27,plain,
spl0_1,
inference(rat,[],[s9,s1,s3]) ).
cnf(s28,plain,
~ spl0_3,
inference(rat,[],[s22,s5,s6,s7,s8,s27]) ).
cnf(s29,plain,
spl0_4,
inference(rat,[],[s4,s28]) ).
cnf(s30,plain,
~ spl0_2,
inference(rat,[],[s2,s28]) ).
cnf(s31,plain,
$false,
inference(rat,[],[s9,s29,s30]) ).
fof(f353,plain,
$false,
inference(avatar_sat_refutation,[],[s31]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC320-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.08/0.20 % Computer : n017.cluster.edu
% 0.08/0.20 % Model : x86_64 x86_64
% 0.08/0.20 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.20 % Memory : 8046.5625MB
% 0.08/0.20 % OS : Linux 6.8.0-71-generic
% 0.08/0.20 % CPULimit : 300
% 0.08/0.20 % WCLimit : 300
% 0.08/0.20 % DateTime : Mon Sep 28 08:59:51 UTC 2026
% 0.08/0.20 % CPUTime :
% 0.08/0.20 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.08/0.23 Running first-order model finding
% 0.08/0.23 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.20/0.29 % (3413894)Will run a generic schedule for satisfiability detection.
% 0.20/0.29 % (3413899)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4266950581_2999 on theBenchmark for (2999ds/0Mi)
% 0.20/0.29 % (3413900)% WARNING: option uhcvi not known.
% 0.20/0.29 % TRYING [1]
% 0.20/0.29 % (3413903)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=875421841:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.29 % (3413900)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=372291580:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.29 % (3413901)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3233158378:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.29 % TRYING [2]
% 0.20/0.29 % (3413902)dis+10_1_sil=32000:sp=arity:random_seed=3097805929:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.29 % (3413904)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4078456880:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.29 % (3413905)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2986368781:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.20/0.29 % TRYING [3]
% 0.20/0.29 % (3413902) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3413894-3413902"...
% 0.20/0.29 % (3413900) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3413894-3413900"...
% 0.20/0.29 % (3413902)...printing done.
% 0.20/0.29 % (3413900)...printing done.
% 0.20/0.29 % (3413904) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3413894-3413904"...
% 0.20/0.29 % (3413905) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3413894-3413905"...
% 0.20/0.29 % (3413902)Refutation found. Thanks to Tanya!
% 0.20/0.29 % SZS status Unsatisfiable for theBenchmark
% 0.20/0.29 % SZS output start Proof for theBenchmark
% See solution above
% 0.20/0.29 % (3413902)------------------------------
% 0.20/0.29 % (3413902)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.29 % (3413902)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.29 % (3413902)CaDiCaL version: 2.1.3
% 0.20/0.29 % (3413902)Termination reason: Refutation
% 0.20/0.29 % (3413902)Time elapsed: 0.005 s
% 0.20/0.29 % (3413902)Peak memory usage: 12 MB
% 0.20/0.29 % (3413902)Instructions burned: 6 (million)
% 0.20/0.29 % (3413894)Success in time 0.046 s
% 0.20/0.29 % Vampire exiting
%------------------------------------------------------------------------------