%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC322-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 : n012.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.02s 0.22s
% Output : Refutation 0.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 18
% Syntax : Number of formulae : 68 ( 10 unt; 6 def)
% Number of atoms : 146 ( 50 equ)
% Maximal formula atoms : 5 ( 2 avg)
% Number of connectives : 142 ( 64 ~; 72 |; 0 &)
% ( 6 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 7 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 4 ( 0 sgn 4 !; 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,
! [X0,X1] :
( ~ ssItem(X0)
| ~ ssList(X1)
| app(cons(X0,nil),X1) = sk3
| app(X1,cons(X0,nil)) != sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
fof(f207,plain,
! [X0,X1] :
( sk4 != app(X1,cons(X0,nil))
| ~ ssList(X1)
| app(cons(X0,nil),X1) = sk3
| ~ ssItem(X0) ),
inference(reorient_equations,[],[f206]) ).
fof(f208,negated_conjecture,
( nil = sk3
| nil != sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
fof(f209,negated_conjecture,
( ssItem(sk5)
| nil = sk2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
fof(f210,negated_conjecture,
( ssItem(sk5)
| nil != sk1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
fof(f211,negated_conjecture,
( ssList(sk6)
| nil = sk2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
fof(f212,negated_conjecture,
( app(sk6,cons(sk5,nil)) = sk2
| nil = sk2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
fof(f213,plain,
( sk2 = app(sk6,cons(sk5,nil))
| nil = sk2 ),
inference(reorient_equations,[],[f212]) ).
fof(f214,negated_conjecture,
( app(cons(sk5,nil),sk6) != sk1
| nil = sk2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).
fof(f215,plain,
( sk1 != app(cons(sk5,nil),sk6)
| nil = sk2 ),
inference(reorient_equations,[],[f214]) ).
fof(f216,negated_conjecture,
( ssList(sk6)
| nil != sk1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).
fof(f217,negated_conjecture,
( app(sk6,cons(sk5,nil)) = sk2
| nil != sk1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_15) ).
fof(f218,plain,
( sk2 = app(sk6,cons(sk5,nil))
| nil != sk1 ),
inference(reorient_equations,[],[f217]) ).
fof(f219,negated_conjecture,
( app(cons(sk5,nil),sk6) != sk1
| nil != sk1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_16) ).
fof(f220,plain,
( sk1 != app(cons(sk5,nil),sk6)
| nil != sk1 ),
inference(reorient_equations,[],[f219]) ).
fof(f223,plain,
( ssItem(sk5)
| nil = sk4 ),
inference(definition_unfolding,[],[f209,f204]) ).
fof(f224,plain,
( ssItem(sk5)
| nil != sk3 ),
inference(definition_unfolding,[],[f210,f205]) ).
fof(f225,plain,
( ssList(sk6)
| nil = sk4 ),
inference(definition_unfolding,[],[f211,f204]) ).
fof(f226,plain,
( sk4 = app(sk6,cons(sk5,nil))
| nil = sk4 ),
inference(definition_unfolding,[],[f213,f204,f204]) ).
fof(f227,plain,
( sk3 != app(cons(sk5,nil),sk6)
| nil = sk4 ),
inference(definition_unfolding,[],[f215,f205,f204]) ).
fof(f228,plain,
( ssList(sk6)
| nil != sk3 ),
inference(definition_unfolding,[],[f216,f205]) ).
fof(f229,plain,
( sk4 = app(sk6,cons(sk5,nil))
| nil != sk3 ),
inference(definition_unfolding,[],[f218,f204,f205]) ).
fof(f230,plain,
( sk3 != app(cons(sk5,nil),sk6)
| nil != sk3 ),
inference(definition_unfolding,[],[f220,f205,f205]) ).
fof(f262,definition,
( spl0_1
<=> nil = sk3 ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f266,definition,
( spl0_2
<=> sk3 = app(cons(sk5,nil),sk6) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f268,plain,
( sk3 != app(cons(sk5,nil),sk6)
| spl0_2 ),
inference(avatar_component_clause,[],[f266]) ).
fof(f269,plain,
( ~ spl0_1
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f230,f266,f262]) ).
fof(f271,definition,
( spl0_3
<=> sk4 = app(sk6,cons(sk5,nil)) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f273,plain,
( sk4 = app(sk6,cons(sk5,nil))
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f271]) ).
fof(f274,plain,
( ~ spl0_1
| spl0_3 ),
inference(avatar_split_clause,[],[f229,f271,f262]) ).
fof(f276,definition,
( spl0_4
<=> ssList(sk6) ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f278,plain,
( ssList(sk6)
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f276]) ).
fof(f279,plain,
( ~ spl0_1
| spl0_4 ),
inference(avatar_split_clause,[],[f228,f276,f262]) ).
fof(f281,definition,
( spl0_5
<=> nil = sk4 ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
fof(f284,plain,
( spl0_5
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f227,f266,f281]) ).
fof(f285,plain,
( spl0_5
| spl0_3 ),
inference(avatar_split_clause,[],[f226,f271,f281]) ).
fof(f286,plain,
( spl0_5
| spl0_4 ),
inference(avatar_split_clause,[],[f225,f276,f281]) ).
fof(f288,definition,
( spl0_6
<=> ssItem(sk5) ),
introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).
fof(f290,plain,
( ssItem(sk5)
| ~ spl0_6 ),
inference(avatar_component_clause,[],[f288]) ).
fof(f291,plain,
( ~ spl0_1
| spl0_6 ),
inference(avatar_split_clause,[],[f224,f288,f262]) ).
fof(f292,plain,
( spl0_5
| spl0_6 ),
inference(avatar_split_clause,[],[f223,f288,f281]) ).
fof(f293,plain,
( ~ spl0_5
| spl0_1 ),
inference(avatar_split_clause,[],[f208,f262,f281]) ).
fof(f336,plain,
( sk4 != sk4
| ~ ssList(sk6)
| sk3 = app(cons(sk5,nil),sk6)
| ~ ssItem(sk5)
| ~ spl0_3 ),
inference(superposition,[],[f207,f273]) ).
fof(f337,plain,
( ~ ssList(sk6)
| sk3 = app(cons(sk5,nil),sk6)
| ~ ssItem(sk5)
| ~ spl0_3 ),
inference(trivial_inequality_removal,[],[f336]) ).
fof(f338,plain,
( sk3 = app(cons(sk5,nil),sk6)
| ~ ssItem(sk5)
| ~ spl0_3
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[],[f337,f278]) ).
fof(f339,plain,
( ~ ssItem(sk5)
| spl0_2
| ~ spl0_3
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[],[f338,f268]) ).
fof(f340,plain,
( $false
| spl0_2
| ~ spl0_3
| ~ spl0_4
| ~ spl0_6 ),
inference(forward_subsumption_resolution,[],[f339,f290]) ).
fof(f341,plain,
( spl0_2
| ~ spl0_3
| ~ spl0_4
| ~ spl0_6 ),
inference(avatar_contradiction_clause,[],[f340]) ).
cnf(s1,plain,
( ~ spl0_1
| ~ spl0_2 ),
inference(sat_conversion,[],[f269]) ).
cnf(s2,plain,
( ~ spl0_1
| spl0_3 ),
inference(sat_conversion,[],[f274]) ).
cnf(s3,plain,
( ~ spl0_1
| spl0_4 ),
inference(sat_conversion,[],[f279]) ).
cnf(s4,plain,
( ~ spl0_2
| spl0_5 ),
inference(sat_conversion,[],[f284]) ).
cnf(s5,plain,
( spl0_3
| spl0_5 ),
inference(sat_conversion,[],[f285]) ).
cnf(s6,plain,
( spl0_4
| spl0_5 ),
inference(sat_conversion,[],[f286]) ).
cnf(s7,plain,
( ~ spl0_1
| spl0_6 ),
inference(sat_conversion,[],[f291]) ).
cnf(s8,plain,
( spl0_5
| spl0_6 ),
inference(sat_conversion,[],[f292]) ).
cnf(s9,plain,
( spl0_1
| ~ spl0_5 ),
inference(sat_conversion,[],[f293]) ).
cnf(s20,plain,
( spl0_2
| ~ spl0_3
| ~ spl0_4
| ~ spl0_6 ),
inference(sat_conversion,[],[f341]) ).
cnf(s25,plain,
spl0_5,
inference(rat,[],[s20,s4,s5,s6,s8]) ).
cnf(s26,plain,
spl0_1,
inference(rat,[],[s9,s25]) ).
cnf(s27,plain,
spl0_6,
inference(rat,[],[s7,s26]) ).
cnf(s28,plain,
spl0_4,
inference(rat,[],[s3,s26]) ).
cnf(s29,plain,
spl0_3,
inference(rat,[],[s2,s26]) ).
cnf(s30,plain,
~ spl0_2,
inference(rat,[],[s1,s26]) ).
cnf(s31,plain,
$false,
inference(rat,[],[s20,s27,s28,s29,s30]) ).
fof(f342,plain,
$false,
inference(avatar_sat_refutation,[],[s31]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SWC322-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.02 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.02/0.17 % Computer : n012.cluster.edu
% 0.02/0.17 % Model : x86_64 x86_64
% 0.02/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.02/0.17 % Memory : 8046.5625MB
% 0.02/0.17 % OS : Linux 6.8.0-71-generic
% 0.02/0.17 % CPULimit : 300
% 0.02/0.17 % WCLimit : 300
% 0.02/0.17 % DateTime : Mon Sep 28 09:04:49 UTC 2026
% 0.02/0.17 % CPUTime :
% 0.02/0.17 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.02/0.19 Running first-order model finding
% 0.02/0.19 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.02/0.22 % (3248409)Will run a generic schedule for satisfiability detection.
% 0.02/0.22 % (3248415)% WARNING: option uhcvi not known.
% 0.02/0.22 % (3248415)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=886280806:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.02/0.22 % (3248416)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3891587462:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.02/0.22 % (3248417)dis+10_1_sil=32000:sp=arity:random_seed=2520166360:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.02/0.22 % (3248418)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1232766587:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.02/0.22 % (3248420)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=1807715578:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.02/0.22 % (3248414)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3091346820_2999 on theBenchmark for (2999ds/0Mi)
% 0.02/0.22 % (3248415) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3248409-3248415"...
% 0.02/0.22 % (3248417) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3248409-3248417"...
% 0.02/0.22 % (3248417)...printing done.
% 0.02/0.22 % (3248415)...printing done.
% 0.02/0.22 % (3248420) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3248409-3248420"...
% 0.02/0.22 % (3248419)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=910703822:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.02/0.22 % (3248417)Refutation found. Thanks to Tanya!
% 0.02/0.22 % SZS status Unsatisfiable for theBenchmark
% 0.02/0.22 % SZS output start Proof for theBenchmark
% See solution above
% 0.02/0.22 % (3248417)------------------------------
% 0.02/0.22 % (3248417)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.02/0.22 % (3248417)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.02/0.22 % (3248417)CaDiCaL version: 2.1.3
% 0.02/0.22 % (3248417)Termination reason: Refutation
% 0.02/0.22 % (3248417)Time elapsed: 0.002 s
% 0.02/0.22 % (3248417)Peak memory usage: 12 MB
% 0.02/0.22 % (3248417)Instructions burned: 5 (million)
% 0.02/0.22 % (3248409)Success in time 0.028 s
% 0.02/0.22 % Vampire exiting
%------------------------------------------------------------------------------