%------------------------------------------------------------------------------
% 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 : n003.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 : Theorem 0.15s 0.52s
% Output : Refutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 13
% Syntax : Number of formulae : 82 ( 17 unt; 6 def)
% Number of atoms : 249 ( 60 equ)
% Maximal formula atoms : 13 ( 3 avg)
% Number of connectives : 286 ( 119 ~; 109 |; 30 &)
% ( 12 <=>; 16 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 7 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 59 ( 0 sgn 45 !; 14 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f7,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( segmentP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& app(app(X2,X1),X3) = X0 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax7) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(f55,axiom,
! [X0] :
( ssList(X0)
=> segmentP(X0,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax55) ).
fof(f83,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( nil = app(X0,X1)
<=> ( nil = X1
& nil = X0 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax83) ).
fof(f84,axiom,
! [X0] :
( ssList(X0)
=> app(X0,nil) = X0 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax84) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( app(X3,X3) != X2
| X1 != X3
| X0 != X2
| ? [X4] :
( ssList(X4)
& neq(X4,nil)
& segmentP(X1,X4)
& segmentP(X0,X4) )
| ( nil = X1
& nil = X0 ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( app(X3,X3) != X2
| X1 != X3
| X0 != X2
| ? [X4] :
( ssList(X4)
& neq(X4,nil)
& segmentP(X1,X4)
& segmentP(X0,X4) )
| ( nil = X1
& nil = X0 ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f103,plain,
! [X0] :
( ! [X1] :
( ( segmentP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& app(app(X2,X1),X3) = X0 ) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f7]) ).
fof(f118,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f172,plain,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f55]) ).
fof(f200,plain,
! [X0] :
( ! [X1] :
( ( nil = app(X0,X1)
<=> ( nil = X1
& nil = X0 ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f83]) ).
fof(f201,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f84]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( app(X3,X3) = X2
& X1 = X3
& X0 = X2
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ segmentP(X1,X4)
| ~ segmentP(X0,X4) )
& ( nil != X1
| nil != X0 )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( app(X3,X3) = X2
& X1 = X3
& X0 = X2
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ segmentP(X1,X4)
| ~ segmentP(X0,X4) )
& ( nil != X1
| nil != X0 )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f241,plain,
! [X2,X3,X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| app(app(X2,X1),X3) != X0
| ~ ssList(X3)
| ~ ssList(X2)
| segmentP(X0,X1) ),
inference(cnf_transformation,[],[f103]) ).
fof(f303,plain,
! [X0,X1] :
( neq(X0,X1)
| ~ ssList(X1)
| X0 = X1
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f118]) ).
fof(f306,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f357,plain,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f172]) ).
fof(f396,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| nil != X0
| nil != X1
| nil = app(X0,X1) ),
inference(cnf_transformation,[],[f200]) ).
fof(f397,plain,
! [X0] :
( ~ ssList(X0)
| app(X0,nil) = X0 ),
inference(cnf_transformation,[],[f201]) ).
fof(f411,plain,
! [X4] :
( ~ segmentP(sK47,X4)
| ~ segmentP(sK48,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f222]) ).
fof(f412,plain,
( nil != sK47
| nil != sK48 ),
inference(cnf_transformation,[],[f222]) ).
fof(f413,plain,
ssList(sK50),
inference(cnf_transformation,[],[f222]) ).
fof(f414,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f222]) ).
fof(f415,plain,
sK48 = sK50,
inference(cnf_transformation,[],[f222]) ).
fof(f416,plain,
sK49 = app(sK50,sK50),
inference(cnf_transformation,[],[f222]) ).
fof(f417,plain,
ssList(sK49),
inference(cnf_transformation,[],[f222]) ).
fof(f422,plain,
( nil != sK49
| nil != sK50 ),
inference(definition_unfolding,[],[f412,f414,f415]) ).
fof(f423,plain,
! [X4] :
( ~ segmentP(sK50,X4)
| ~ segmentP(sK49,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(definition_unfolding,[],[f411,f414,f415]) ).
fof(f429,plain,
! [X2,X3,X1] :
( ~ ssList(app(app(X2,X1),X3))
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| segmentP(app(app(X2,X1),X3),X1) ),
inference(equality_resolution,[],[f241]) ).
fof(f446,plain,
! [X1] :
( ~ ssList(nil)
| ~ ssList(X1)
| nil != X1
| nil = app(nil,X1) ),
inference(equality_resolution,[],[f396]) ).
fof(f447,plain,
( ~ ssList(nil)
| ~ ssList(nil)
| nil = app(nil,nil) ),
inference(equality_resolution,[],[f446]) ).
fof(f530,plain,
( ~ ssList(nil)
| nil = app(nil,nil) ),
inference(duplicate_literal_removal,[],[f447]) ).
fof(f537,definition,
( spl51_1
<=> nil = sK50 ),
introduced(definition,[new_symbols(definition,[spl51_1])],[avatar_definition]) ).
fof(f538,plain,
( nil = sK50
| ~ spl51_1 ),
inference(avatar_component_clause,[],[f537]) ).
fof(f541,definition,
( spl51_2
<=> nil = sK49 ),
introduced(definition,[new_symbols(definition,[spl51_2])],[avatar_definition]) ).
fof(f544,plain,
( ~ spl51_1
| ~ spl51_2 ),
inference(avatar_split_clause,[],[f422,f541,f537]) ).
fof(f546,definition,
( spl51_3
<=> nil = app(nil,nil) ),
introduced(definition,[new_symbols(definition,[spl51_3])],[avatar_definition]) ).
fof(f548,plain,
( nil = app(nil,nil)
| ~ spl51_3 ),
inference(avatar_component_clause,[],[f546]) ).
fof(f550,definition,
( spl51_4
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl51_4])],[avatar_definition]) ).
fof(f551,plain,
( ssList(nil)
| ~ spl51_4 ),
inference(avatar_component_clause,[],[f550]) ).
fof(f553,plain,
( spl51_3
| ~ spl51_4 ),
inference(avatar_split_clause,[],[f530,f550,f546]) ).
fof(f579,plain,
spl51_4,
inference(avatar_split_clause,[],[f306,f550]) ).
fof(f580,plain,
( ~ ssList(sK50)
| ~ segmentP(sK49,sK50)
| ~ neq(sK50,nil)
| ~ ssList(sK50) ),
inference(resolution,[],[f357,f423]) ).
fof(f581,plain,
( ~ ssList(sK50)
| ~ segmentP(sK49,sK50)
| ~ neq(sK50,nil) ),
inference(duplicate_literal_removal,[],[f580]) ).
fof(f582,plain,
( ~ segmentP(sK49,sK50)
| ~ neq(sK50,nil) ),
inference(forward_subsumption_resolution,[],[f581,f413]) ).
fof(f584,definition,
( spl51_10
<=> neq(sK50,nil) ),
introduced(definition,[new_symbols(definition,[spl51_10])],[avatar_definition]) ).
fof(f586,plain,
( ~ neq(sK50,nil)
| spl51_10 ),
inference(avatar_component_clause,[],[f584]) ).
fof(f588,definition,
( spl51_11
<=> segmentP(sK49,sK50) ),
introduced(definition,[new_symbols(definition,[spl51_11])],[avatar_definition]) ).
fof(f590,plain,
( ~ segmentP(sK49,sK50)
| spl51_11 ),
inference(avatar_component_clause,[],[f588]) ).
fof(f591,plain,
( ~ spl51_10
| ~ spl51_11 ),
inference(avatar_split_clause,[],[f582,f588,f584]) ).
fof(f630,plain,
sK49 = app(sK49,nil),
inference(resolution,[],[f397,f417]) ).
fof(f682,plain,
( ~ ssList(nil)
| nil = sK50
| ~ ssList(sK50)
| spl51_10 ),
inference(resolution,[],[f303,f586]) ).
fof(f689,plain,
( nil = sK50
| ~ ssList(sK50)
| ~ spl51_4
| spl51_10 ),
inference(forward_subsumption_resolution,[],[f682,f551]) ).
fof(f694,plain,
( nil = sK50
| ~ spl51_4
| spl51_10 ),
inference(forward_subsumption_resolution,[],[f689,f413]) ).
fof(f695,plain,
( spl51_1
| ~ spl51_4
| spl51_10 ),
inference(avatar_split_clause,[],[f694,f584,f550,f537]) ).
fof(f697,plain,
( sK49 = app(nil,nil)
| ~ spl51_1 ),
inference(superposition,[],[f416,f538]) ).
fof(f702,plain,
( nil = sK49
| ~ spl51_1
| ~ spl51_3 ),
inference(forward_demodulation,[],[f697,f548]) ).
fof(f703,plain,
( spl51_2
| ~ spl51_1
| ~ spl51_3 ),
inference(avatar_split_clause,[],[f702,f546,f537,f541]) ).
fof(f1800,plain,
! [X0] :
( ~ ssList(app(sK49,X0))
| ~ ssList(sK50)
| ~ ssList(X0)
| ~ ssList(sK50)
| segmentP(app(sK49,X0),sK50) ),
inference(superposition,[],[f429,f416]) ).
fof(f1807,plain,
! [X0] :
( ~ ssList(app(sK49,X0))
| ~ ssList(sK50)
| ~ ssList(X0)
| segmentP(app(sK49,X0),sK50) ),
inference(duplicate_literal_removal,[],[f1800]) ).
fof(f1811,plain,
! [X0] :
( ~ ssList(app(sK49,X0))
| ~ ssList(X0)
| segmentP(app(sK49,X0),sK50) ),
inference(forward_subsumption_resolution,[],[f1807,f413]) ).
fof(f3450,plain,
( ~ ssList(sK49)
| ~ ssList(nil)
| segmentP(sK49,sK50) ),
inference(superposition,[],[f1811,f630]) ).
fof(f3452,plain,
( ~ ssList(nil)
| segmentP(sK49,sK50) ),
inference(forward_subsumption_resolution,[],[f3450,f417]) ).
fof(f3454,plain,
( segmentP(sK49,sK50)
| ~ spl51_4 ),
inference(forward_subsumption_resolution,[],[f3452,f551]) ).
fof(f3455,plain,
( $false
| ~ spl51_4
| spl51_11 ),
inference(forward_subsumption_resolution,[],[f3454,f590]) ).
fof(f3456,plain,
( ~ spl51_4
| spl51_11 ),
inference(avatar_contradiction_clause,[],[f3455]) ).
cnf(s1,plain,
( ~ spl51_1
| ~ spl51_2 ),
inference(sat_conversion,[],[f544]) ).
cnf(s2,plain,
( spl51_3
| ~ spl51_4 ),
inference(sat_conversion,[],[f553]) ).
cnf(s10,plain,
spl51_4,
inference(sat_conversion,[],[f579]) ).
cnf(s11,plain,
( ~ spl51_10
| ~ spl51_11 ),
inference(sat_conversion,[],[f591]) ).
cnf(s16,plain,
( spl51_1
| ~ spl51_4
| spl51_10 ),
inference(sat_conversion,[],[f695]) ).
cnf(s17,plain,
( ~ spl51_1
| spl51_2
| ~ spl51_3 ),
inference(sat_conversion,[],[f703]) ).
cnf(s205,plain,
( ~ spl51_4
| spl51_11 ),
inference(sat_conversion,[],[f3456]) ).
cnf(s242,plain,
spl51_11,
inference(rat,[],[s205,s10]) ).
cnf(s243,plain,
~ spl51_10,
inference(rat,[],[s11,s242]) ).
cnf(s244,plain,
spl51_1,
inference(rat,[],[s16,s10,s243]) ).
cnf(s248,plain,
spl51_3,
inference(rat,[],[s2,s10]) ).
cnf(s249,plain,
spl51_2,
inference(rat,[],[s17,s244,s248]) ).
cnf(s250,plain,
$false,
inference(rat,[],[s1,s249,s244]) ).
fof(f3457,plain,
$false,
inference(avatar_sat_refutation,[],[s250]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % 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 : n003.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:44:42 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.15/0.52 % (1412606)Will run a generic schedule for satisfiability detection.
% 0.15/0.52 % (1412611)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1786647691_2999 on theBenchmark for (2999ds/0Mi)
% 0.15/0.52 % (1412612)% WARNING: option uhcvi not known.
% 0.15/0.52 % (1412612)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=460109177:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.15/0.52 % (1412613)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=665304704:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.15/0.52 % TRYING [1]
% 0.15/0.52 % (1412614)dis+10_1_sil=32000:sp=arity:random_seed=1898613086:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.15/0.52 % (1412615)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=675509158:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.15/0.52 % TRYING [2]
% 0.15/0.52 % (1412617)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3092826976:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.15/0.52 % (1412616)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=24499247:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.15/0.52 % TRYING [3]
% 0.15/0.52 % TRYING [4]
% 0.15/0.52 % TRYING [5]
% 0.15/0.52 % (1412614)Instruction limit reached!
% 0.15/0.52 % (1412614)------------------------------
% 0.15/0.52 % (1412614)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.15/0.52 % (1412614)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.15/0.52 % (1412614)CaDiCaL version: 2.1.3
% 0.15/0.52 % (1412614)Termination reason: Instruction limit
% 0.15/0.52 % (1412614)Termination phase: Saturation
% 0.15/0.52 % (1412614)Time elapsed: 0.062 s
% 0.15/0.52 % (1412614)Peak memory usage: 13 MB
% 0.15/0.52 % (1412614)Instructions burned: 104 (million)
% 0.15/0.52 % (1412612) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1412606-1412612"...
% 0.15/0.52 % (1412612)...printing done.
% 0.15/0.52 % (1412612)Refutation found. Thanks to Tanya!
% 0.15/0.52 % SZS status Theorem for theBenchmark
% 0.15/0.52 % SZS output start Proof for theBenchmark
% See solution above
% 0.15/0.52 % (1412612)------------------------------
% 0.15/0.52 % (1412612)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.15/0.52 % (1412612)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.15/0.52 % (1412612)CaDiCaL version: 2.1.3
% 0.15/0.52 % (1412612)Termination reason: Refutation
% 0.15/0.52 % (1412612)Time elapsed: 0.065 s
% 0.15/0.52 % (1412612)Peak memory usage: 14 MB
% 0.15/0.52 % (1412612)Instructions burned: 100 (million)
% 0.15/0.52 % (1412606)Success in time 0.1 s
% 0.15/0.52 % Vampire exiting
%------------------------------------------------------------------------------