%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC118-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 : n005.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:44 PM UTC 2026
% Result : Unsatisfiable 0.50s 0.51s
% Output : Refutation 0.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 18
% Syntax : Number of formulae : 54 ( 18 unt; 5 def)
% Number of atoms : 118 ( 19 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 122 ( 58 ~; 59 |; 0 &)
% ( 5 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 6 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 7 con; 0-2 aty)
% Number of variables : 11 ( 0 sgn 11 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001-0.ax',clause8) ).
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(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/sandbox/benchmark/Axioms/SWC001-0.ax',clause173) ).
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,
ssList(sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
fof(f207,negated_conjecture,
ssList(sk6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
fof(f208,negated_conjecture,
app(app(sk5,sk3),sk6) = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
fof(f209,plain,
sk4 = app(app(sk5,sk3),sk6),
inference(reorient_equations,[],[f208]) ).
fof(f215,negated_conjecture,
( nil = sk4
| nil != sk3 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
fof(f216,negated_conjecture,
( nil != sk2
| nil != sk1 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_14) ).
fof(f217,negated_conjecture,
( ~ neq(sk1,nil)
| ~ segmentP(sk2,sk1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_15) ).
fof(f220,plain,
( nil != sk4
| nil != sk3 ),
inference(definition_unfolding,[],[f216,f204,f205]) ).
fof(f221,plain,
( ~ neq(sk3,nil)
| ~ segmentP(sk4,sk3) ),
inference(definition_unfolding,[],[f217,f205,f204,f205]) ).
fof(f236,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(f253,definition,
( spl0_1
<=> segmentP(sk4,sk3) ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f255,plain,
( ~ segmentP(sk4,sk3)
| spl0_1 ),
inference(avatar_component_clause,[],[f253]) ).
fof(f257,definition,
( spl0_2
<=> neq(sk3,nil) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f259,plain,
( ~ neq(sk3,nil)
| spl0_2 ),
inference(avatar_component_clause,[],[f257]) ).
fof(f260,plain,
( ~ spl0_1
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f221,f257,f253]) ).
fof(f262,definition,
( spl0_3
<=> nil = sk3 ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f264,plain,
( nil != sk3
| spl0_3 ),
inference(avatar_component_clause,[],[f262]) ).
fof(f266,definition,
( spl0_4
<=> nil = sk4 ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f269,plain,
( ~ spl0_3
| ~ spl0_4 ),
inference(avatar_split_clause,[],[f220,f266,f262]) ).
fof(f270,plain,
( ~ spl0_3
| spl0_4 ),
inference(avatar_split_clause,[],[f215,f266,f262]) ).
fof(f276,definition,
( spl0_6
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl0_6])],[avatar_definition]) ).
fof(f277,plain,
( ssList(nil)
| ~ spl0_6 ),
inference(avatar_component_clause,[],[f276]) ).
fof(f312,plain,
spl0_6,
inference(avatar_split_clause,[],[f8,f276]) ).
fof(f516,plain,
( ~ ssList(sk3)
| ~ ssList(nil)
| nil = sk3
| spl0_2 ),
inference(resolution,[],[f102,f259]) ).
fof(f519,plain,
( ~ ssList(nil)
| nil = sk3
| spl0_2 ),
inference(forward_subsumption_resolution,[],[f516,f202]) ).
fof(f520,plain,
( nil = sk3
| spl0_2
| ~ spl0_6 ),
inference(forward_subsumption_resolution,[],[f519,f277]) ).
fof(f521,plain,
( $false
| spl0_2
| spl0_3
| ~ spl0_6 ),
inference(forward_subsumption_resolution,[],[f520,f264]) ).
fof(f522,plain,
( spl0_2
| spl0_3
| ~ spl0_6 ),
inference(avatar_contradiction_clause,[],[f521]) ).
fof(f2903,plain,
( segmentP(sk4,sk3)
| ~ ssList(sk5)
| ~ ssList(sk3)
| ~ ssList(sk4)
| ~ ssList(sk6) ),
inference(superposition,[],[f236,f209]) ).
fof(f2908,plain,
( ~ ssList(sk5)
| ~ ssList(sk3)
| ~ ssList(sk4)
| ~ ssList(sk6)
| spl0_1 ),
inference(forward_subsumption_resolution,[],[f2903,f255]) ).
fof(f2914,plain,
( ~ ssList(sk3)
| ~ ssList(sk4)
| ~ ssList(sk6)
| spl0_1 ),
inference(forward_subsumption_resolution,[],[f2908,f206]) ).
fof(f2920,plain,
( ~ ssList(sk4)
| ~ ssList(sk6)
| spl0_1 ),
inference(forward_subsumption_resolution,[],[f2914,f202]) ).
fof(f2922,plain,
( ~ ssList(sk6)
| spl0_1 ),
inference(forward_subsumption_resolution,[],[f2920,f203]) ).
fof(f2924,plain,
( $false
| spl0_1 ),
inference(forward_subsumption_resolution,[],[f2922,f207]) ).
fof(f2925,plain,
spl0_1,
inference(avatar_contradiction_clause,[],[f2924]) ).
cnf(s1,plain,
( ~ spl0_1
| ~ spl0_2 ),
inference(sat_conversion,[],[f260]) ).
cnf(s2,plain,
( ~ spl0_3
| ~ spl0_4 ),
inference(sat_conversion,[],[f269]) ).
cnf(s3,plain,
( ~ spl0_3
| spl0_4 ),
inference(sat_conversion,[],[f270]) ).
cnf(s13,plain,
spl0_6,
inference(sat_conversion,[],[f312]) ).
cnf(s14,plain,
( spl0_2
| spl0_3
| ~ spl0_6 ),
inference(sat_conversion,[],[f522]) ).
cnf(s131,plain,
spl0_1,
inference(sat_conversion,[],[f2925]) ).
cnf(s143,plain,
~ spl0_2,
inference(rat,[],[s1,s131]) ).
cnf(s144,plain,
spl0_3,
inference(rat,[],[s14,s13,s143]) ).
cnf(s145,plain,
spl0_4,
inference(rat,[],[s3,s144]) ).
cnf(s146,plain,
$false,
inference(rat,[],[s2,s145,s144]) ).
fof(f2926,plain,
$false,
inference(avatar_sat_refutation,[],[s146]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC118-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.37 % Computer : n005.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 28 07:59:31 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.11/0.41 Running first-order model finding
% 0.11/0.41 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.50/0.51 % (630742)Will run a generic schedule for satisfiability detection.
% 0.50/0.51 % (630753)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3707274070:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.50/0.51 % (630747)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=768360920_2999 on theBenchmark for (2999ds/0Mi)
% 0.50/0.51 % (630749)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1798389740:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.50/0.51 % (630750)dis+10_1_sil=32000:sp=arity:random_seed=4147308122:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.50/0.51 % (630751)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3534773576:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.50/0.51 % (630752)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=34728670:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.50/0.51 % (630748)% WARNING: option uhcvi not known.
% 0.50/0.51 % (630748)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2426849670:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.50/0.51 % TRYING [1]
% 0.50/0.51 % TRYING [2]
% 0.50/0.51 % TRYING [3]
% 0.50/0.51 % TRYING [4]
% 0.50/0.51 % (630753)Instruction limit reached!
% 0.50/0.51 % (630753)------------------------------
% 0.50/0.51 % (630753)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.50/0.51 % (630753)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.50/0.51 % (630753)CaDiCaL version: 2.1.3
% 0.50/0.51 % (630753)Termination reason: Instruction limit
% 0.50/0.51 % (630753)Termination phase: Saturation
% 0.50/0.51 % (630753)Time elapsed: 0.049 s
% 0.50/0.51 % (630753)Peak memory usage: 13 MB
% 0.50/0.51 % (630753)Instructions burned: 161 (million)
% 0.50/0.51 % (630750) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-630742-630750"...
% 0.50/0.51 % (630750)...printing done.
% 0.50/0.51 % (630748) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-630742-630748"...
% 0.50/0.51 % (630750)Refutation found. Thanks to Tanya!
% 0.50/0.51 % SZS status Unsatisfiable for theBenchmark
% 0.50/0.51 % SZS output start Proof for theBenchmark
% See solution above
% 0.50/0.51 % (630750)------------------------------
% 0.50/0.51 % (630750)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.50/0.51 % (630750)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.50/0.51 % (630750)CaDiCaL version: 2.1.3
% 0.50/0.51 % (630750)Termination reason: Refutation
% 0.50/0.51 % (630750)Time elapsed: 0.050 s
% 0.50/0.51 % (630750)Peak memory usage: 13 MB
% 0.50/0.51 % (630750)Instructions burned: 86 (million)
% 0.50/0.51 % (630742)Success in time 0.088 s
% 0.50/0.51 % Vampire exiting
%------------------------------------------------------------------------------