%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC071-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 : n009.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:04:32 PM UTC 2026
% Result : Unsatisfiable 0.38s 0.51s
% Output : Refutation 0.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 24
% Syntax : Number of formulae : 78 ( 13 unt; 8 def)
% Number of atoms : 223 ( 36 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 276 ( 131 ~; 137 |; 0 &)
% ( 8 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 14 ( 12 usr; 9 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 8 con; 0-2 aty)
% Number of variables : 21 ( 0 sgn 21 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause8) ).
fof(f57,axiom,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause57) ).
fof(f98,axiom,
! [X0,X1] :
( cons(X0,X1) != nil
| ~ ssItem(X0)
| ~ ssList(X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause98) ).
fof(f99,plain,
! [X0,X1] :
( nil != cons(X0,X1)
| ~ ssItem(X0)
| ~ ssList(X1) ),
inference(reorient_equations,[],[f98]) ).
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(f187,axiom,
! [X2,X3,X0,X1] :
( app(app(X0,X1),X2) != X3
| ~ ssList(X2)
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X3)
| segmentP(X3,X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause173) ).
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(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] :
( ~ ssList(X0)
| ~ neq(X0,nil)
| ~ segmentP(sk2,X0)
| ~ segmentP(sk1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
fof(f207,negated_conjecture,
( nil != sk2
| nil != sk1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
fof(f208,negated_conjecture,
( ssItem(sk5)
| nil = sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
fof(f212,negated_conjecture,
( cons(sk5,nil) = sk3
| nil = sk4 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).
fof(f213,plain,
( sk3 = cons(sk5,nil)
| nil = sk4 ),
inference(reorient_equations,[],[f212]) ).
fof(f218,negated_conjecture,
( ssList(sk6)
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_17) ).
fof(f219,negated_conjecture,
( ssList(sk7)
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_18) ).
fof(f222,negated_conjecture,
( app(app(sk6,sk3),sk7) = sk4
| nil = sk3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_20) ).
fof(f223,plain,
( sk4 = app(app(sk6,sk3),sk7)
| nil = sk3 ),
inference(reorient_equations,[],[f222]) ).
fof(f228,plain,
! [X0] :
( ~ neq(X0,nil)
| ~ ssList(X0)
| ~ segmentP(sk4,X0)
| ~ segmentP(sk3,X0) ),
inference(definition_unfolding,[],[f206,f204,f205]) ).
fof(f229,plain,
( nil != sk4
| nil != sk3 ),
inference(definition_unfolding,[],[f207,f204,f205]) ).
fof(f244,plain,
! [X2,X0,X1] :
( segmentP(app(app(X0,X1),X2),X1)
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(app(app(X0,X1),X2))
| ~ ssList(X2) ),
inference(equality_resolution,[],[f187]) ).
fof(f261,definition,
( spl0_1
<=> nil = sk3 ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f262,plain,
( nil != sk3
| spl0_1 ),
inference(avatar_component_clause,[],[f261]) ).
fof(f273,definition,
( spl0_4
<=> sk4 = app(app(sk6,sk3),sk7) ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f275,plain,
( sk4 = app(app(sk6,sk3),sk7)
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f273]) ).
fof(f276,plain,
( spl0_1
| spl0_4 ),
inference(avatar_split_clause,[],[f223,f273,f261]) ).
fof(f278,definition,
( spl0_5
<=> sk3 = cons(sk5,nil) ),
introduced(definition,[new_symbols(definition,[spl0_5])],[avatar_definition]) ).
fof(f280,plain,
( sk3 = cons(sk5,nil)
| ~ spl0_5 ),
inference(avatar_component_clause,[],[f278]) ).
fof(f283,definition,
( spl0_6
<=> ssList(sk7) ),
introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).
fof(f285,plain,
( ssList(sk7)
| ~ spl0_6 ),
inference(avatar_component_clause,[],[f283]) ).
fof(f286,plain,
( spl0_1
| spl0_6 ),
inference(avatar_split_clause,[],[f219,f283,f261]) ).
fof(f288,definition,
( spl0_7
<=> ssList(sk6) ),
introduced(definition,[new_symbols(definition,[spl0_7])],[avatar_definition]) ).
fof(f290,plain,
( ssList(sk6)
| ~ spl0_7 ),
inference(avatar_component_clause,[],[f288]) ).
fof(f291,plain,
( spl0_1
| spl0_7 ),
inference(avatar_split_clause,[],[f218,f288,f261]) ).
fof(f293,definition,
( spl0_8
<=> nil = sk4 ),
introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition]) ).
fof(f299,plain,
( spl0_8
| spl0_5 ),
inference(avatar_split_clause,[],[f213,f278,f293]) ).
fof(f303,definition,
( spl0_9
<=> ssItem(sk5) ),
introduced(definition,[new_symbols(definition,[spl0_9])],[avatar_definition]) ).
fof(f305,plain,
( ssItem(sk5)
| ~ spl0_9 ),
inference(avatar_component_clause,[],[f303]) ).
fof(f307,plain,
( spl0_8
| spl0_9 ),
inference(avatar_split_clause,[],[f208,f303,f293]) ).
fof(f308,plain,
( ~ spl0_1
| ~ spl0_8 ),
inference(avatar_split_clause,[],[f229,f293,f261]) ).
fof(f314,definition,
( spl0_11
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl0_11])],[avatar_definition]) ).
fof(f315,plain,
( ssList(nil)
| ~ spl0_11 ),
inference(avatar_component_clause,[],[f314]) ).
fof(f350,plain,
spl0_11,
inference(avatar_split_clause,[],[f8,f314]) ).
fof(f561,plain,
! [X0] :
( ~ ssList(X0)
| ~ ssList(nil)
| nil = X0
| ~ ssList(X0)
| ~ segmentP(sk4,X0)
| ~ segmentP(sk3,X0) ),
inference(resolution,[],[f102,f228]) ).
fof(f564,plain,
! [X0] :
( ~ ssList(X0)
| ~ ssList(nil)
| nil = X0
| ~ segmentP(sk4,X0)
| ~ segmentP(sk3,X0) ),
inference(duplicate_literal_removal,[],[f561]) ).
fof(f565,plain,
( ! [X0] :
( ~ segmentP(sk4,X0)
| nil = X0
| ~ ssList(X0)
| ~ segmentP(sk3,X0) )
| ~ spl0_11 ),
inference(forward_subsumption_resolution,[],[f564,f315]) ).
fof(f1505,plain,
( nil != sk3
| ~ ssItem(sk5)
| ~ ssList(nil)
| ~ spl0_5 ),
inference(superposition,[],[f99,f280]) ).
fof(f3419,plain,
( segmentP(sk4,sk3)
| ~ ssList(sk6)
| ~ ssList(sk3)
| ~ ssList(sk4)
| ~ ssList(sk7)
| ~ spl0_4 ),
inference(superposition,[],[f244,f275]) ).
fof(f3426,plain,
( segmentP(sk4,sk3)
| ~ ssList(sk3)
| ~ ssList(sk4)
| ~ ssList(sk7)
| ~ spl0_4
| ~ spl0_7 ),
inference(forward_subsumption_resolution,[],[f3419,f290]) ).
fof(f3435,plain,
( segmentP(sk4,sk3)
| ~ ssList(sk4)
| ~ ssList(sk7)
| ~ spl0_4
| ~ spl0_7 ),
inference(forward_subsumption_resolution,[],[f3426,f202]) ).
fof(f3444,plain,
( segmentP(sk4,sk3)
| ~ ssList(sk7)
| ~ spl0_4
| ~ spl0_7 ),
inference(forward_subsumption_resolution,[],[f3435,f203]) ).
fof(f3448,plain,
( segmentP(sk4,sk3)
| ~ spl0_4
| ~ spl0_6
| ~ spl0_7 ),
inference(forward_subsumption_resolution,[],[f3444,f285]) ).
fof(f3450,plain,
( nil = sk3
| ~ ssList(sk3)
| ~ segmentP(sk3,sk3)
| ~ spl0_4
| ~ spl0_6
| ~ spl0_7
| ~ spl0_11 ),
inference(resolution,[],[f3448,f565]) ).
fof(f3456,plain,
( ~ ssList(sk3)
| ~ segmentP(sk3,sk3)
| spl0_1
| ~ spl0_4
| ~ spl0_6
| ~ spl0_7
| ~ spl0_11 ),
inference(forward_subsumption_resolution,[],[f3450,f262]) ).
fof(f3459,plain,
( ~ segmentP(sk3,sk3)
| spl0_1
| ~ spl0_4
| ~ spl0_6
| ~ spl0_7
| ~ spl0_11 ),
inference(forward_subsumption_resolution,[],[f3456,f202]) ).
fof(f3503,plain,
( ~ ssList(sk3)
| spl0_1
| ~ spl0_4
| ~ spl0_6
| ~ spl0_7
| ~ spl0_11 ),
inference(resolution,[],[f3459,f57]) ).
fof(f3504,plain,
( $false
| spl0_1
| ~ spl0_4
| ~ spl0_6
| ~ spl0_7
| ~ spl0_11 ),
inference(forward_subsumption_resolution,[],[f3503,f202]) ).
fof(f3505,plain,
( spl0_1
| ~ spl0_4
| ~ spl0_6
| ~ spl0_7
| ~ spl0_11 ),
inference(avatar_contradiction_clause,[],[f3504]) ).
fof(f3512,plain,
( nil != sk3
| ~ ssList(nil)
| ~ spl0_5
| ~ spl0_9 ),
inference(forward_subsumption_resolution,[],[f1505,f305]) ).
fof(f3530,plain,
( nil != sk3
| ~ spl0_5
| ~ spl0_9
| ~ spl0_11 ),
inference(forward_subsumption_resolution,[],[f3512,f315]) ).
fof(f3544,plain,
( ~ spl0_1
| ~ spl0_5
| ~ spl0_9
| ~ spl0_11 ),
inference(avatar_split_clause,[],[f3530,f314,f303,f278,f261]) ).
cnf(s3,plain,
( spl0_1
| spl0_4 ),
inference(sat_conversion,[],[f276]) ).
cnf(s5,plain,
( spl0_1
| spl0_6 ),
inference(sat_conversion,[],[f286]) ).
cnf(s6,plain,
( spl0_1
| spl0_7 ),
inference(sat_conversion,[],[f291]) ).
cnf(s10,plain,
( spl0_5
| spl0_8 ),
inference(sat_conversion,[],[f299]) ).
cnf(s14,plain,
( spl0_8
| spl0_9 ),
inference(sat_conversion,[],[f307]) ).
cnf(s15,plain,
( ~ spl0_1
| ~ spl0_8 ),
inference(sat_conversion,[],[f308]) ).
cnf(s25,plain,
spl0_11,
inference(sat_conversion,[],[f350]) ).
cnf(s100,plain,
( spl0_1
| ~ spl0_4
| ~ spl0_6
| ~ spl0_7
| ~ spl0_11 ),
inference(sat_conversion,[],[f3505]) ).
cnf(s107,plain,
( ~ spl0_1
| ~ spl0_5
| ~ spl0_9
| ~ spl0_11 ),
inference(sat_conversion,[],[f3544]) ).
cnf(s116,plain,
spl0_1,
inference(rat,[],[s100,s3,s5,s6,s25]) ).
cnf(s117,plain,
~ spl0_8,
inference(rat,[],[s15,s116]) ).
cnf(s123,plain,
spl0_9,
inference(rat,[],[s14,s117]) ).
cnf(s126,plain,
spl0_5,
inference(rat,[],[s10,s117]) ).
cnf(s131,plain,
$false,
inference(rat,[],[s107,s25,s116,s123,s126]) ).
fof(f3550,plain,
$false,
inference(avatar_sat_refutation,[],[s131]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC071-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.10/0.36 % Computer : n009.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 28 07:43:30 UTC 2026
% 0.10/0.36 % CPUTime :
% 0.10/0.36 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.10/0.39 Running first-order model finding
% 0.10/0.39 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.38/0.51 % (2867421)Will run a generic schedule for satisfiability detection.
% 0.38/0.51 % (2867431)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=600060044:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.38/0.51 % (2867427)% WARNING: option uhcvi not known.
% 0.38/0.51 % (2867429)dis+10_1_sil=32000:sp=arity:random_seed=2294252652:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.38/0.51 % (2867426)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=4223993738_2999 on theBenchmark for (2999ds/0Mi)
% 0.38/0.51 % (2867427)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=4271514061:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.38/0.51 % (2867428)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1184403802:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.38/0.51 % (2867430)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3176911513:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.38/0.51 % (2867432)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2327944334:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.38/0.51 % TRYING [1]
% 0.38/0.51 % TRYING [2]
% 0.38/0.51 % TRYING [3]
% 0.38/0.51 % (2867431)Instruction limit reached!
% 0.38/0.51 % (2867431)------------------------------
% 0.38/0.51 % (2867431)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.38/0.51 % (2867431)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.38/0.51 % (2867431)CaDiCaL version: 2.1.3
% 0.38/0.51 % (2867431)Termination reason: Instruction limit
% 0.38/0.51 % (2867431)Termination phase: Saturation
% 0.38/0.51 % (2867431)Time elapsed: 0.038 s
% 0.38/0.51 % (2867431)Peak memory usage: 14 MB
% 0.38/0.51 % (2867431)Instructions burned: 133 (million)
% 0.38/0.51 % TRYING [4]
% 0.38/0.51 % (2867440)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=901386980:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.38/0.51 % (2867429) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2867421-2867429"...
% 0.38/0.51 % (2867430)Instruction limit reached!
% 0.38/0.51 % (2867430)------------------------------
% 0.38/0.51 % (2867430)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.38/0.51 % (2867430)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.38/0.51 % (2867430)CaDiCaL version: 2.1.3
% 0.38/0.51 % (2867430)Termination reason: Instruction limit
% 0.38/0.51 % (2867430)Termination phase: Saturation
% 0.38/0.51 % (2867430)Time elapsed: 0.062 s
% 0.38/0.51 % (2867430)Peak memory usage: 13 MB
% 0.38/0.51 % (2867430)Instructions burned: 116 (million)
% 0.38/0.51 % (2867427) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2867421-2867427"...
% 0.38/0.51 % TRYING [1]
% 0.38/0.51 % (2867429)...printing done.
% 0.38/0.51 % TRYING [2]
% 0.38/0.51 % (2867429)Refutation found. Thanks to Tanya!
% 0.38/0.51 % SZS status Unsatisfiable for theBenchmark
% 0.38/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.38/0.51 % (2867429)------------------------------
% 0.38/0.51 % (2867429)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.38/0.51 % (2867429)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.38/0.51 % (2867429)CaDiCaL version: 2.1.3
% 0.38/0.51 % (2867429)Termination reason: Refutation
% 0.38/0.51 % (2867429)Time elapsed: 0.062 s
% 0.38/0.51 % (2867429)Peak memory usage: 14 MB
% 0.38/0.51 % (2867429)Instructions burned: 100 (million)
% 0.38/0.51 % (2867421)Success in time 0.106 s
% 0.38/0.51 % Vampire exiting
%------------------------------------------------------------------------------