%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC068-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 : n015.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:31 PM UTC 2026
% Result : Unsatisfiable 0.17s 0.54s
% Output : Refutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 15
% Number of leaves : 18
% Syntax : Number of formulae : 67 ( 16 unt; 5 def)
% Number of atoms : 173 ( 37 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 209 ( 103 ~; 101 |; 0 &)
% ( 5 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 6 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 26 ( 0 sgn 26 !; 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(f73,axiom,
! [X0] :
( ~ ssList(X0)
| app(X0,nil) = X0 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause73) ).
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(f156,axiom,
! [X0,X1] :
( nil != X0
| nil != X1
| ~ ssList(X1)
| ~ ssList(X0)
| app(X0,X1) = nil ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001-0.ax',clause145) ).
fof(f157,plain,
! [X0,X1] :
( nil != X0
| nil != X1
| ~ ssList(X1)
| ~ ssList(X0)
| nil = app(X0,X1) ),
inference(reorient_equations,[],[f156]) ).
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,
app(sk4,sk4) = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
fof(f205,plain,
sk3 = app(sk4,sk4),
inference(reorient_equations,[],[f204]) ).
fof(f206,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
fof(f207,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
fof(f208,negated_conjecture,
! [X0] :
( ~ ssList(X0)
| ~ neq(X0,nil)
| ~ segmentP(sk2,X0)
| ~ segmentP(sk1,X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
fof(f209,negated_conjecture,
( nil != sk2
| nil != sk1 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
fof(f212,plain,
! [X0] :
( ~ neq(X0,nil)
| ~ ssList(X0)
| ~ segmentP(sk4,X0)
| ~ segmentP(sk3,X0) ),
inference(definition_unfolding,[],[f208,f206,f207]) ).
fof(f213,plain,
( nil != sk4
| nil != sk3 ),
inference(definition_unfolding,[],[f209,f206,f207]) ).
fof(f226,plain,
! [X1] :
( nil != X1
| ~ ssList(X1)
| ~ ssList(nil)
| nil = app(nil,X1) ),
inference(equality_resolution,[],[f157]) ).
fof(f227,plain,
( ~ ssList(nil)
| ~ ssList(nil)
| nil = app(nil,nil) ),
inference(equality_resolution,[],[f226]) ).
fof(f228,plain,
! [X2,X0,X1] :
( ~ ssList(app(app(X0,X1),X2))
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| segmentP(app(app(X0,X1),X2),X1) ),
inference(equality_resolution,[],[f187]) ).
fof(f280,plain,
( ~ ssList(nil)
| nil = app(nil,nil) ),
inference(duplicate_literal_removal,[],[f227]) ).
fof(f286,definition,
( spl0_1
<=> nil = sk3 ),
introduced(definition,[new_symbols(definition,[spl0_1])],[avatar_definition]) ).
fof(f288,plain,
( nil != sk3
| spl0_1 ),
inference(avatar_component_clause,[],[f286]) ).
fof(f290,definition,
( spl0_2
<=> nil = sk4 ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f291,plain,
( nil = sk4
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f290]) ).
fof(f293,plain,
( ~ spl0_1
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f213,f290,f286]) ).
fof(f295,definition,
( spl0_3
<=> nil = app(nil,nil) ),
introduced(definition,[new_symbols(definition,[spl0_3])],[avatar_definition]) ).
fof(f297,plain,
( nil = app(nil,nil)
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f295]) ).
fof(f299,definition,
( spl0_4
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl0_4])],[avatar_definition]) ).
fof(f300,plain,
( ssList(nil)
| ~ spl0_4 ),
inference(avatar_component_clause,[],[f299]) ).
fof(f302,plain,
( spl0_3
| ~ spl0_4 ),
inference(avatar_split_clause,[],[f280,f299,f295]) ).
fof(f335,plain,
spl0_4,
inference(avatar_split_clause,[],[f8,f299]) ).
fof(f376,plain,
sk3 = app(sk3,nil),
inference(resolution,[],[f73,f202]) ).
fof(f522,plain,
! [X0] :
( ~ ssList(X0)
| ~ ssList(nil)
| nil = X0
| ~ ssList(X0)
| ~ segmentP(sk4,X0)
| ~ segmentP(sk3,X0) ),
inference(resolution,[],[f102,f212]) ).
fof(f525,plain,
! [X0] :
( ~ ssList(X0)
| ~ ssList(nil)
| nil = X0
| ~ segmentP(sk4,X0)
| ~ segmentP(sk3,X0) ),
inference(duplicate_literal_removal,[],[f522]) ).
fof(f526,plain,
( ! [X0] :
( ~ segmentP(sk4,X0)
| nil = X0
| ~ ssList(X0)
| ~ segmentP(sk3,X0) )
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[],[f525,f300]) ).
fof(f533,plain,
( nil = sk4
| ~ ssList(sk4)
| ~ segmentP(sk3,sk4)
| ~ ssList(sk4)
| ~ spl0_4 ),
inference(resolution,[],[f526,f57]) ).
fof(f534,plain,
( nil = sk4
| ~ ssList(sk4)
| ~ segmentP(sk3,sk4)
| ~ spl0_4 ),
inference(duplicate_literal_removal,[],[f533]) ).
fof(f535,plain,
( nil = sk4
| ~ segmentP(sk3,sk4)
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[],[f534,f203]) ).
fof(f537,definition,
( spl0_12
<=> segmentP(sk3,sk4) ),
introduced(definition,[new_symbols(definition,[spl0_12])],[avatar_definition]) ).
fof(f539,plain,
( ~ segmentP(sk3,sk4)
| spl0_12 ),
inference(avatar_component_clause,[],[f537]) ).
fof(f540,plain,
( ~ spl0_12
| spl0_2
| ~ spl0_4 ),
inference(avatar_split_clause,[],[f535,f299,f290,f537]) ).
fof(f603,plain,
( sk3 = app(nil,nil)
| ~ spl0_2 ),
inference(superposition,[],[f205,f291]) ).
fof(f610,plain,
( nil = sk3
| ~ spl0_2
| ~ spl0_3 ),
inference(forward_demodulation,[],[f603,f297]) ).
fof(f611,plain,
( $false
| spl0_1
| ~ spl0_2
| ~ spl0_3 ),
inference(forward_subsumption_resolution,[],[f610,f288]) ).
fof(f612,plain,
( spl0_1
| ~ spl0_2
| ~ spl0_3 ),
inference(avatar_contradiction_clause,[],[f611]) ).
fof(f1790,plain,
! [X0] :
( ~ ssList(app(sk3,X0))
| ~ ssList(sk4)
| ~ ssList(sk4)
| ~ ssList(X0)
| segmentP(app(sk3,X0),sk4) ),
inference(superposition,[],[f228,f205]) ).
fof(f1792,plain,
! [X0] :
( ~ ssList(app(sk3,X0))
| ~ ssList(sk4)
| ~ ssList(X0)
| segmentP(app(sk3,X0),sk4) ),
inference(duplicate_literal_removal,[],[f1790]) ).
fof(f1795,plain,
! [X0] :
( ~ ssList(app(sk3,X0))
| ~ ssList(X0)
| segmentP(app(sk3,X0),sk4) ),
inference(forward_subsumption_resolution,[],[f1792,f203]) ).
fof(f3602,plain,
( ~ ssList(sk3)
| ~ ssList(nil)
| segmentP(sk3,sk4) ),
inference(superposition,[],[f1795,f376]) ).
fof(f3604,plain,
( ~ ssList(nil)
| segmentP(sk3,sk4) ),
inference(forward_subsumption_resolution,[],[f3602,f202]) ).
fof(f3606,plain,
( segmentP(sk3,sk4)
| ~ spl0_4 ),
inference(forward_subsumption_resolution,[],[f3604,f300]) ).
fof(f3607,plain,
( $false
| ~ spl0_4
| spl0_12 ),
inference(forward_subsumption_resolution,[],[f3606,f539]) ).
fof(f3608,plain,
( ~ spl0_4
| spl0_12 ),
inference(avatar_contradiction_clause,[],[f3607]) ).
cnf(s1,plain,
( ~ spl0_1
| ~ spl0_2 ),
inference(sat_conversion,[],[f293]) ).
cnf(s2,plain,
( spl0_3
| ~ spl0_4 ),
inference(sat_conversion,[],[f302]) ).
cnf(s11,plain,
spl0_4,
inference(sat_conversion,[],[f335]) ).
cnf(s12,plain,
( spl0_2
| ~ spl0_4
| ~ spl0_12 ),
inference(sat_conversion,[],[f540]) ).
cnf(s14,plain,
( spl0_1
| ~ spl0_2
| ~ spl0_3 ),
inference(sat_conversion,[],[f612]) ).
cnf(s81,plain,
( ~ spl0_4
| spl0_12 ),
inference(sat_conversion,[],[f3608]) ).
cnf(s82,plain,
spl0_12,
inference(rat,[],[s81,s11]) ).
cnf(s83,plain,
spl0_2,
inference(rat,[],[s12,s82,s11]) ).
cnf(s87,plain,
spl0_3,
inference(rat,[],[s2,s11]) ).
cnf(s88,plain,
spl0_1,
inference(rat,[],[s14,s83,s87]) ).
cnf(s89,plain,
$false,
inference(rat,[],[s1,s83,s88]) ).
fof(f3609,plain,
$false,
inference(avatar_sat_refutation,[],[s89]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC068-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.11/0.38 % Computer : n015.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Mon Sep 28 07:46:17 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.11/0.41 Running first-order model finding
% 0.11/0.41 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.17/0.54 % (2454590)Will run a generic schedule for satisfiability detection.
% 0.17/0.54 % (2454599)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2836516322:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.17/0.54 % (2454596)% WARNING: option uhcvi not known.
% 0.17/0.54 % (2454595)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=3302640954_2999 on theBenchmark for (2999ds/0Mi)
% 0.17/0.54 % (2454596)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1879710746:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.17/0.54 % (2454597)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3508255539:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.17/0.54 % (2454598)dis+10_1_sil=32000:sp=arity:random_seed=327462523:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.17/0.54 % (2454601)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=4153506164:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.17/0.54 % (2454600)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=850636071:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.17/0.54 % TRYING [1]
% 0.17/0.54 % TRYING [2]
% 0.17/0.54 % TRYING [3]
% 0.17/0.54 % (2454599)Instruction limit reached!
% 0.17/0.54 % (2454599)------------------------------
% 0.17/0.54 % (2454599)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.54 % (2454599)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.54 % (2454599)CaDiCaL version: 2.1.3
% 0.17/0.54 % (2454599)Termination reason: Instruction limit
% 0.17/0.54 % (2454599)Termination phase: Saturation
% 0.17/0.54 % (2454599)Time elapsed: 0.034 s
% 0.17/0.54 % (2454599)Peak memory usage: 13 MB
% 0.17/0.54 % (2454599)Instructions burned: 116 (million)
% 0.17/0.54 % TRYING [4]
% 0.17/0.54 % (2454609)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2881396797:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.17/0.54 % TRYING [1]
% 0.17/0.54 % TRYING [2]
% 0.17/0.54 % (2454598)Instruction limit reached!
% 0.17/0.54 % (2454598)------------------------------
% 0.17/0.54 % (2454598)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.54 % (2454598)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.54 % (2454598)CaDiCaL version: 2.1.3
% 0.17/0.54 % (2454598)Termination reason: Instruction limit
% 0.17/0.54 % (2454598)Termination phase: Saturation
% 0.17/0.54 % (2454598)Time elapsed: 0.060 s
% 0.17/0.54 % (2454598)Peak memory usage: 13 MB
% 0.17/0.54 % (2454598)Instructions burned: 104 (million)
% 0.17/0.54 % TRYING [3]
% 0.17/0.54 % (2454600)Instruction limit reached!
% 0.17/0.54 % (2454600)------------------------------
% 0.17/0.54 % (2454600)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.54 % (2454600)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.54 % (2454600)CaDiCaL version: 2.1.3
% 0.17/0.54 % (2454600)Termination reason: Instruction limit
% 0.17/0.54 % (2454600)Termination phase: Saturation
% 0.17/0.54 % (2454600)Time elapsed: 0.067 s
% 0.17/0.54 % (2454600)Peak memory usage: 14 MB
% 0.17/0.54 % (2454600)Instructions burned: 132 (million)
% 0.17/0.54 % (2454596) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-2454590-2454596"...
% 0.17/0.54 % (2454596)...printing done.
% 0.17/0.54 % (2454596)Refutation found. Thanks to Tanya!
% 0.17/0.54 % SZS status Unsatisfiable for theBenchmark
% 0.17/0.54 % SZS output start Proof for theBenchmark
% See solution above
% 0.17/0.54 % (2454596)------------------------------
% 0.17/0.54 % (2454596)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.17/0.54 % (2454596)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.17/0.54 % (2454596)CaDiCaL version: 2.1.3
% 0.17/0.54 % (2454596)Termination reason: Refutation
% 0.17/0.54 % (2454596)Time elapsed: 0.076 s
% 0.17/0.54 % (2454596)Peak memory usage: 14 MB
% 0.17/0.54 % (2454596)Instructions burned: 125 (million)
% 0.17/0.54 % (2454590)Success in time 0.115 s
% 0.17/0.54 % Vampire exiting
%------------------------------------------------------------------------------