%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC083-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n001.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:02:21 PM UTC 2026
% Result : Unsatisfiable 2.55s 1.29s
% Output : Refutation 3.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 21
% Syntax : Number of formulae : 87 ( 26 unt; 3 def)
% Number of atoms : 215 ( 32 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 258 ( 130 ~; 125 |; 0 &)
% ( 3 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 4 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 8 con; 0-2 aty)
% Number of variables : 31 ( 0 sgn 31 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f8,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause8) ).
fof(f57,axiom,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause57) ).
fof(f73,axiom,
! [X0] :
( ~ ssList(X0)
| app(X0,nil) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause73) ).
fof(f74,axiom,
! [X0] :
( ~ ssList(X0)
| app(nil,X0) = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause74) ).
fof(f85,axiom,
! [X0,X1] :
( ssList(app(X1,X0))
| ~ ssList(X1)
| ~ ssList(X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',clause85) ).
fof(f101,axiom,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| neq(X1,X0)
| X1 = X0 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',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/theBenchmark.p',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,
neq(sk2,nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_7) ).
fof(f207,negated_conjecture,
! [X0] :
( ~ ssList(X0)
| ~ neq(X0,nil)
| ~ segmentP(sk2,X0)
| ~ segmentP(sk1,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_8) ).
fof(f208,negated_conjecture,
ssList(sk5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_9) ).
fof(f209,negated_conjecture,
ssList(sk6),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_10) ).
fof(f210,negated_conjecture,
ssList(sk7),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_11) ).
fof(f211,negated_conjecture,
app(app(sk5,sk6),sk7) = sk3,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_12) ).
fof(f212,plain,
sk3 = app(app(sk5,sk6),sk7),
inference(reorient_equations,[],[f211]) ).
fof(f213,negated_conjecture,
app(sk5,sk7) = sk4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1_13) ).
fof(f214,plain,
sk4 = app(sk5,sk7),
inference(reorient_equations,[],[f213]) ).
fof(f217,plain,
neq(sk4,nil),
inference(definition_unfolding,[],[f206,f204]) ).
fof(f218,plain,
! [X0] :
( ~ neq(X0,nil)
| ~ ssList(X0)
| ~ segmentP(sk4,X0)
| ~ segmentP(sk3,X0) ),
inference(definition_unfolding,[],[f207,f204,f205]) ).
fof(f220,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(f226,plain,
( ~ ssList(sk4)
| ~ segmentP(sk4,sk4)
| ~ segmentP(sk3,sk4) ),
inference(resolution,[],[f218,f217]) ).
fof(f227,plain,
( ~ ssList(sk4)
| ~ segmentP(sk3,sk4) ),
inference(forward_subsumption_resolution,[],[f226,f57]) ).
fof(f228,plain,
~ segmentP(sk3,sk4),
inference(forward_subsumption_resolution,[],[f227,f203]) ).
fof(f230,plain,
sk3 = app(sk3,nil),
inference(resolution,[],[f73,f202]) ).
fof(f231,plain,
sk4 = app(sk4,nil),
inference(resolution,[],[f73,f203]) ).
fof(f232,plain,
sk5 = app(sk5,nil),
inference(resolution,[],[f73,f208]) ).
fof(f237,plain,
sk4 = app(nil,sk4),
inference(resolution,[],[f74,f203]) ).
fof(f252,plain,
! [X0] :
( ~ ssList(X0)
| ~ ssList(nil)
| nil = X0
| ~ ssList(X0)
| ~ segmentP(sk4,X0)
| ~ segmentP(sk3,X0) ),
inference(resolution,[],[f102,f218]) ).
fof(f255,plain,
! [X0] :
( ~ ssList(X0)
| ~ ssList(nil)
| nil = X0
| ~ segmentP(sk4,X0)
| ~ segmentP(sk3,X0) ),
inference(duplicate_literal_removal,[],[f252]) ).
fof(f256,plain,
! [X0] :
( ~ segmentP(sk4,X0)
| nil = X0
| ~ ssList(X0)
| ~ segmentP(sk3,X0) ),
inference(forward_subsumption_resolution,[],[f255,f8]) ).
fof(f271,definition,
( spl0_2
<=> ssList(app(sk5,sk6)) ),
introduced(definition,[new_symbols(definition,[spl0_2])],[avatar_definition]) ).
fof(f272,plain,
( ssList(app(sk5,sk6))
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f271]) ).
fof(f273,plain,
( ~ ssList(app(sk5,sk6))
| spl0_2 ),
inference(avatar_component_clause,[],[f271]) ).
fof(f291,plain,
( ~ ssList(sk5)
| ~ ssList(sk6)
| spl0_2 ),
inference(resolution,[],[f273,f85]) ).
fof(f292,plain,
( ~ ssList(sk6)
| spl0_2 ),
inference(forward_subsumption_resolution,[],[f291,f208]) ).
fof(f293,plain,
( $false
| spl0_2 ),
inference(forward_subsumption_resolution,[],[f292,f209]) ).
fof(f294,plain,
spl0_2,
inference(avatar_contradiction_clause,[],[f293]) ).
fof(f491,plain,
! [X0] :
( segmentP(app(sk4,X0),sk4)
| ~ ssList(nil)
| ~ ssList(sk4)
| ~ ssList(app(sk4,X0))
| ~ ssList(X0) ),
inference(superposition,[],[f220,f237]) ).
fof(f493,plain,
! [X0] :
( segmentP(app(sk4,X0),sk7)
| ~ ssList(sk5)
| ~ ssList(sk7)
| ~ ssList(app(sk4,X0))
| ~ ssList(X0) ),
inference(superposition,[],[f220,f214]) ).
fof(f494,plain,
! [X0] :
( segmentP(app(sk3,X0),sk7)
| ~ ssList(app(sk5,sk6))
| ~ ssList(sk7)
| ~ ssList(app(sk3,X0))
| ~ ssList(X0) ),
inference(superposition,[],[f220,f212]) ).
fof(f499,plain,
( ! [X0] :
( segmentP(app(sk3,X0),sk7)
| ~ ssList(sk7)
| ~ ssList(app(sk3,X0))
| ~ ssList(X0) )
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f494,f272]) ).
fof(f500,plain,
! [X0] :
( segmentP(app(sk4,X0),sk7)
| ~ ssList(sk7)
| ~ ssList(app(sk4,X0))
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f493,f208]) ).
fof(f502,plain,
! [X0] :
( segmentP(app(sk4,X0),sk4)
| ~ ssList(nil)
| ~ ssList(sk4)
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f491,f85]) ).
fof(f505,plain,
( ! [X0] :
( segmentP(app(sk3,X0),sk7)
| ~ ssList(app(sk3,X0))
| ~ ssList(X0) )
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f499,f210]) ).
fof(f506,plain,
! [X0] :
( segmentP(app(sk4,X0),sk7)
| ~ ssList(app(sk4,X0))
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f500,f210]) ).
fof(f508,plain,
! [X0] :
( segmentP(app(sk4,X0),sk4)
| ~ ssList(sk4)
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f502,f8]) ).
fof(f512,plain,
! [X0] :
( segmentP(app(sk4,X0),sk4)
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f508,f203]) ).
fof(f592,definition,
( spl0_8
<=> nil = sk7 ),
introduced(definition,[new_symbols(definition,[spl0_8])],[avatar_definition]) ).
fof(f594,plain,
( nil = sk7
| ~ spl0_8 ),
inference(avatar_component_clause,[],[f592]) ).
fof(f596,definition,
( spl0_9
<=> sk4 = sk5 ),
introduced(definition,[new_symbols(definition,[spl0_9])],[avatar_definition]) ).
fof(f597,plain,
( sk4 = sk5
| ~ spl0_9 ),
inference(avatar_component_clause,[],[f596]) ).
fof(f598,plain,
( sk4 != sk5
| spl0_9 ),
inference(avatar_component_clause,[],[f596]) ).
fof(f623,plain,
( segmentP(sk3,sk7)
| ~ ssList(sk3)
| ~ ssList(nil)
| ~ spl0_2 ),
inference(superposition,[],[f505,f230]) ).
fof(f626,plain,
( segmentP(sk3,sk7)
| ~ ssList(nil)
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f623,f202]) ).
fof(f629,plain,
( segmentP(sk3,sk7)
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f626,f8]) ).
fof(f647,plain,
( segmentP(sk4,sk7)
| ~ ssList(sk4)
| ~ ssList(nil) ),
inference(superposition,[],[f506,f231]) ).
fof(f650,plain,
( segmentP(sk4,sk7)
| ~ ssList(nil) ),
inference(forward_subsumption_resolution,[],[f647,f203]) ).
fof(f653,plain,
segmentP(sk4,sk7),
inference(forward_subsumption_resolution,[],[f650,f8]) ).
fof(f654,plain,
( nil = sk7
| ~ ssList(sk7)
| ~ segmentP(sk3,sk7) ),
inference(resolution,[],[f653,f256]) ).
fof(f659,plain,
( nil = sk7
| ~ segmentP(sk3,sk7) ),
inference(forward_subsumption_resolution,[],[f654,f210]) ).
fof(f662,plain,
( nil = sk7
| ~ spl0_2 ),
inference(forward_subsumption_resolution,[],[f659,f629]) ).
fof(f664,plain,
( spl0_8
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f662,f271,f592]) ).
fof(f667,plain,
( sk4 = app(sk5,nil)
| ~ spl0_8 ),
inference(superposition,[],[f214,f594]) ).
fof(f799,plain,
( sk4 = sk5
| ~ spl0_8 ),
inference(superposition,[],[f232,f667]) ).
fof(f813,plain,
( $false
| ~ spl0_8
| spl0_9 ),
inference(forward_subsumption_resolution,[],[f799,f598]) ).
fof(f814,plain,
( ~ spl0_8
| spl0_9 ),
inference(avatar_contradiction_clause,[],[f813]) ).
fof(f831,plain,
( sk3 = app(app(sk4,sk6),sk7)
| ~ spl0_9 ),
inference(superposition,[],[f212,f597]) ).
fof(f835,plain,
( ssList(app(sk4,sk6))
| ~ spl0_2
| ~ spl0_9 ),
inference(superposition,[],[f272,f597]) ).
fof(f846,plain,
( sk3 = app(app(sk4,sk6),nil)
| ~ spl0_8
| ~ spl0_9 ),
inference(forward_demodulation,[],[f831,f594]) ).
fof(f872,plain,
( app(sk4,sk6) = app(app(sk4,sk6),nil)
| ~ spl0_2
| ~ spl0_9 ),
inference(resolution,[],[f835,f73]) ).
fof(f886,plain,
( sk3 = app(sk4,sk6)
| ~ spl0_2
| ~ spl0_8
| ~ spl0_9 ),
inference(forward_demodulation,[],[f872,f846]) ).
fof(f1002,plain,
( segmentP(sk3,sk4)
| ~ ssList(sk6)
| ~ spl0_2
| ~ spl0_8
| ~ spl0_9 ),
inference(superposition,[],[f512,f886]) ).
fof(f1003,plain,
( ~ ssList(sk6)
| ~ spl0_2
| ~ spl0_8
| ~ spl0_9 ),
inference(forward_subsumption_resolution,[],[f1002,f228]) ).
fof(f1004,plain,
( $false
| ~ spl0_2
| ~ spl0_8
| ~ spl0_9 ),
inference(forward_subsumption_resolution,[],[f1003,f209]) ).
fof(f1005,plain,
( ~ spl0_2
| ~ spl0_8
| ~ spl0_9 ),
inference(avatar_contradiction_clause,[],[f1004]) ).
cnf(s3,plain,
spl0_2,
inference(sat_conversion,[],[f294]) ).
cnf(s9,plain,
( ~ spl0_2
| spl0_8 ),
inference(sat_conversion,[],[f664]) ).
cnf(s11,plain,
( ~ spl0_8
| spl0_9 ),
inference(sat_conversion,[],[f814]) ).
cnf(s13,plain,
( ~ spl0_2
| ~ spl0_8
| ~ spl0_9 ),
inference(sat_conversion,[],[f1005]) ).
cnf(s14,plain,
spl0_8,
inference(rat,[],[s9,s3]) ).
cnf(s15,plain,
~ spl0_9,
inference(rat,[],[s13,s3,s14]) ).
cnf(s16,plain,
$false,
inference(rat,[],[s11,s15,s14]) ).
fof(f1006,plain,
$false,
inference(avatar_sat_refutation,[],[s16]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC083-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.38 % Computer : n001.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Mon Sep 28 07:53:20 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.41 Running first-order theorem proving
% 0.10/0.41 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 2.55/1.29 % (194995)Input is clausal, will run a generic CNF schedule.
% 2.55/1.29 % (195001)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:urr=on:br=off:random_seed=1185719517:i=132376:av=off_2999 on theBenchmark for (2999ds/132376Mi)
% 2.55/1.29 % (195004)dis-1002_1_to=lpo:sil=16000:fd=off:random_seed=2201044440:st=1.5:i=114:aac=none:ins=7:ss=axioms:fsd=on_2999 on theBenchmark for (2999ds/114Mi)
% 2.55/1.29 % (195003)lrs+10_1_sil=8000:sp=occurrence:random_seed=3642014674:i=107:sd=3:ss=axioms:sgt=8_2999 on theBenchmark for (2999ds/107Mi)
% 2.55/1.29 % (195002)lrs+1002_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=ground:npcc=on:sp=reverse_frequency:spb=intro:random_seed=2776808978:i=137899:s2at=10:gtgl=3:kws=precedence:add=on:bd=preordered:gtg=position_2999 on theBenchmark for (2999ds/137899Mi)
% 2.55/1.29 % (195000)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=933247669:i=140167_2999 on theBenchmark for (2999ds/140167Mi)
% 2.55/1.29 % (195005)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=2563618664:s2a=on:i=180:gtg=position_2999 on theBenchmark for (2999ds/180Mi)
% 2.55/1.29 % (195006)dis-21_1_sil=8000:lcm=predicate:random_seed=1019939751:st=5:avsq=on:i=117:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/117Mi)
% 2.55/1.29 % (195003)First to succeed.
% 2.55/1.29 % (195003)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-194995"
% 2.55/1.29 % (195004)Instruction limit reached!
% 2.55/1.29 % (195004)------------------------------
% 2.55/1.29 % (195004)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.55/1.29 % (195004)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.55/1.29 % (195004)CaDiCaL version: 2.1.3
% 2.55/1.29 % (195004)Termination reason: Instruction limit
% 2.55/1.29 % (195004)Termination phase: Saturation
% 2.55/1.29 % (195004)Time elapsed: 0.065 s
% 2.55/1.29 % (195004)Peak memory usage: 89 MB
% 2.55/1.29 % (195004)Instructions burned: 115 (million)
% 2.55/1.29 % (195006)Instruction limit reached!
% 2.55/1.29 % (195006)------------------------------
% 2.55/1.29 % (195006)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 2.55/1.29 % (195006)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 2.55/1.29 % (195006)CaDiCaL version: 2.1.3
% 2.55/1.29 % (195006)Termination reason: Instruction limit
% 2.55/1.29 % (195006)Termination phase: Saturation
% 2.55/1.29 % (195006)Time elapsed: 0.052 s
% 2.55/1.29 % (195006)Peak memory usage: 89 MB
% 2.55/1.29 % (195006)Instructions burned: 117 (million)
% 2.55/1.29 % (195005)Also succeeded, but the first one will report.
% 2.55/1.29 % (195015)ott-1010_1_to=lpo:sil=16000:sos=on:spb=units:urr=on:bce=on:br=off:random_seed=1812226661:st=3:avsq=on:s2a=on:i=189:s2at=1.2:avsqr=1,16:sd=2:bd=all:nm=64:ss=axioms:sgt=30_2997 on theBenchmark for (2997ds/189Mi)
% 2.55/1.29 % (195014)dis+1010_3_sil=8000:plsq=on:drc=off:fde=none:plsqc=1:bsd=on:plsqr=7,2:sos=on:spb=goal_then_units:random_seed=3923959063:i=143:sd=2:aac=none:ss=axioms:sgt=16_2997 on theBenchmark for (2997ds/143Mi)
% 2.55/1.29 % (195014)Also succeeded, but the first one will report.
% 2.55/1.29 % (195003)Refutation found. Thanks to Tanya!
% 2.55/1.29 % SZS status Unsatisfiable for theBenchmark
% 2.55/1.29 % SZS output start Proof for theBenchmark
% See solution above
% 3.57/1.49 % (195003)------------------------------
% 3.57/1.49 % (195003)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.57/1.49 % (195003)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.57/1.49 % (195003)CaDiCaL version: 2.1.3
% 3.57/1.49 % (195003)Termination reason: Refutation
% 3.57/1.49 % (195003)Time elapsed: 0.020 s
% 3.57/1.49 % (195003)Peak memory usage: 90 MB
% 3.57/1.49 % (195003)Instructions burned: 29 (million)
% 3.57/1.49 % (195003)------------------------------
% 3.57/1.49 % (195003)------------------------------
% 3.57/1.49 % (194995)Success in time 0.428 s
% 3.57/1.49 % Vampire exiting
%------------------------------------------------------------------------------