%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC085+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 : n002.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:36 PM UTC 2026
% Result : Theorem 1.86s 0.71s
% Output : Refutation 1.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 15
% Syntax : Number of formulae : 111 ( 17 unt; 7 def)
% Number of atoms : 352 ( 38 equ)
% Maximal formula atoms : 15 ( 3 avg)
% Number of connectives : 436 ( 195 ~; 181 |; 30 &)
% ( 11 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 8 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 72 ( 0 sgn 60 !; 12 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( frontsegP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& app(X1,X2) = X0 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax5) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(f55,axiom,
! [X0] :
( ssList(X0)
=> segmentP(X0,X0) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax55) ).
fof(f56,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( segmentP(X0,X1)
=> segmentP(app(app(X2,X0),X3),X1) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax56) ).
fof(f57,axiom,
! [X0] :
( ssList(X0)
=> segmentP(X0,nil) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax57) ).
fof(f58,axiom,
! [X0] :
( ssList(X0)
=> ( segmentP(nil,X0)
<=> nil = X0 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax58) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ~ neq(X1,nil)
| ? [X4] :
( ssList(X4)
& neq(X4,nil)
& segmentP(X1,X4)
& segmentP(X0,X4) )
| ( ( nil != X3
| nil != X2 )
& ( ~ neq(X2,nil)
| ~ frontsegP(X3,X2) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',co1) ).
fof(f97,negated_conjecture,
~ ! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ~ neq(X1,nil)
| ? [X4] :
( ssList(X4)
& neq(X4,nil)
& segmentP(X1,X4)
& segmentP(X0,X4) )
| ( ( nil != X3
| nil != X2 )
& ( ~ neq(X2,nil)
| ~ frontsegP(X3,X2) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f101,plain,
! [X0] :
( ! [X1] :
( ( frontsegP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& app(X1,X2) = X0 ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f5]) ).
fof(f134,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f28]) ).
fof(f172,plain,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f55]) ).
fof(f173,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ! [X3] :
( segmentP(app(app(X2,X0),X3),X1)
| ~ segmentP(X0,X1)
| ~ ssList(X3) )
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f56]) ).
fof(f174,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ! [X3] :
( segmentP(app(app(X2,X0),X3),X1)
| ~ segmentP(X0,X1)
| ~ ssList(X3) )
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(flattening,[],[f173]) ).
fof(f175,plain,
! [X0] :
( segmentP(X0,nil)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f57]) ).
fof(f176,plain,
! [X0] :
( ( segmentP(nil,X0)
<=> nil = X0 )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f58]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& neq(X1,nil)
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ segmentP(X1,X4)
| ~ segmentP(X0,X4) )
& ( ( nil = X3
& nil = X2 )
| ( neq(X2,nil)
& frontsegP(X3,X2) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& neq(X1,nil)
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ segmentP(X1,X4)
| ~ segmentP(X0,X4) )
& ( ( nil = X3
& nil = X2 )
| ( neq(X2,nil)
& frontsegP(X3,X2) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f235,plain,
! [X0,X1] :
( ~ frontsegP(X0,X1)
| ~ ssList(X1)
| app(X1,sK5(X0,X1)) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f101]) ).
fof(f236,plain,
! [X0,X1] :
( ssList(sK5(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0)
| ~ frontsegP(X0,X1) ),
inference(cnf_transformation,[],[f101]) ).
fof(f306,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f320,plain,
! [X0] :
( ~ ssList(X0)
| app(nil,X0) = X0 ),
inference(cnf_transformation,[],[f134]) ).
fof(f357,plain,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f172]) ).
fof(f358,plain,
! [X2,X3,X0,X1] :
( ~ segmentP(X0,X1)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X0)
| segmentP(app(app(X2,X0),X3),X1) ),
inference(cnf_transformation,[],[f174]) ).
fof(f359,plain,
! [X0] :
( segmentP(X0,nil)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f175]) ).
fof(f360,plain,
! [X0] :
( ~ ssList(X0)
| nil != X0
| segmentP(nil,X0) ),
inference(cnf_transformation,[],[f176]) ).
fof(f411,plain,
! [X4] :
( ~ segmentP(sK47,X4)
| ~ segmentP(sK48,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f222]) ).
fof(f412,plain,
( neq(sK49,nil)
| nil = sK49 ),
inference(cnf_transformation,[],[f222]) ).
fof(f413,plain,
( neq(sK49,nil)
| nil = sK50 ),
inference(cnf_transformation,[],[f222]) ).
fof(f414,plain,
( frontsegP(sK50,sK49)
| nil = sK49 ),
inference(cnf_transformation,[],[f222]) ).
fof(f416,plain,
ssList(sK50),
inference(cnf_transformation,[],[f222]) ).
fof(f417,plain,
neq(sK48,nil),
inference(cnf_transformation,[],[f222]) ).
fof(f418,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f222]) ).
fof(f419,plain,
sK48 = sK50,
inference(cnf_transformation,[],[f222]) ).
fof(f420,plain,
ssList(sK49),
inference(cnf_transformation,[],[f222]) ).
fof(f425,plain,
neq(sK50,nil),
inference(definition_unfolding,[],[f417,f419]) ).
fof(f426,plain,
! [X4] :
( ~ segmentP(sK50,X4)
| ~ segmentP(sK49,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(definition_unfolding,[],[f411,f418,f419]) ).
fof(f446,plain,
( ~ ssList(nil)
| segmentP(nil,nil) ),
inference(equality_resolution,[],[f360]) ).
fof(f460,definition,
( spl51_1
<=> nil = sK49 ),
introduced(definition,[new_symbols(definition,[spl51_1])],[avatar_definition]) ).
fof(f462,plain,
( nil = sK49
| ~ spl51_1 ),
inference(avatar_component_clause,[],[f460]) ).
fof(f464,definition,
( spl51_2
<=> neq(sK49,nil) ),
introduced(definition,[new_symbols(definition,[spl51_2])],[avatar_definition]) ).
fof(f466,plain,
( neq(sK49,nil)
| ~ spl51_2 ),
inference(avatar_component_clause,[],[f464]) ).
fof(f467,plain,
( spl51_1
| spl51_2 ),
inference(avatar_split_clause,[],[f412,f464,f460]) ).
fof(f469,definition,
( spl51_3
<=> nil = sK50 ),
introduced(definition,[new_symbols(definition,[spl51_3])],[avatar_definition]) ).
fof(f471,plain,
( nil = sK50
| ~ spl51_3 ),
inference(avatar_component_clause,[],[f469]) ).
fof(f472,plain,
( spl51_3
| spl51_2 ),
inference(avatar_split_clause,[],[f413,f464,f469]) ).
fof(f474,definition,
( spl51_4
<=> frontsegP(sK50,sK49) ),
introduced(definition,[new_symbols(definition,[spl51_4])],[avatar_definition]) ).
fof(f476,plain,
( frontsegP(sK50,sK49)
| ~ spl51_4 ),
inference(avatar_component_clause,[],[f474]) ).
fof(f477,plain,
( spl51_1
| spl51_4 ),
inference(avatar_split_clause,[],[f414,f474,f460]) ).
fof(f484,definition,
( spl51_6
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl51_6])],[avatar_definition]) ).
fof(f486,plain,
( ~ ssList(nil)
| spl51_6 ),
inference(avatar_component_clause,[],[f484]) ).
fof(f497,definition,
( spl51_9
<=> segmentP(nil,nil) ),
introduced(definition,[new_symbols(definition,[spl51_9])],[avatar_definition]) ).
fof(f499,plain,
( segmentP(nil,nil)
| ~ spl51_9 ),
inference(avatar_component_clause,[],[f497]) ).
fof(f500,plain,
( spl51_9
| ~ spl51_6 ),
inference(avatar_split_clause,[],[f446,f484,f497]) ).
fof(f511,plain,
( ssList(nil)
| ~ spl51_1 ),
inference(superposition,[],[f420,f462]) ).
fof(f512,plain,
( neq(nil,nil)
| ~ spl51_3 ),
inference(superposition,[],[f425,f471]) ).
fof(f514,plain,
( ! [X4] :
( ~ segmentP(sK50,X4)
| ~ segmentP(nil,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
| ~ spl51_1 ),
inference(forward_demodulation,[],[f426,f462]) ).
fof(f515,plain,
( ! [X4] :
( ~ segmentP(nil,X4)
| ~ segmentP(nil,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
| ~ spl51_1
| ~ spl51_3 ),
inference(forward_demodulation,[],[f514,f471]) ).
fof(f516,plain,
( ! [X4] :
( ~ segmentP(nil,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
| ~ spl51_1
| ~ spl51_3 ),
inference(duplicate_literal_removal,[],[f515]) ).
fof(f517,plain,
( ~ neq(nil,nil)
| ~ ssList(nil)
| ~ spl51_1
| ~ spl51_3
| ~ spl51_9 ),
inference(resolution,[],[f499,f516]) ).
fof(f518,plain,
( ~ ssList(nil)
| ~ spl51_1
| ~ spl51_3
| ~ spl51_9 ),
inference(forward_subsumption_resolution,[],[f517,f512]) ).
fof(f519,plain,
( $false
| ~ spl51_1
| ~ spl51_3
| ~ spl51_9 ),
inference(forward_subsumption_resolution,[],[f518,f511]) ).
fof(f520,plain,
( ~ spl51_1
| ~ spl51_3
| ~ spl51_9 ),
inference(avatar_contradiction_clause,[],[f519]) ).
fof(f523,plain,
( neq(nil,nil)
| ~ spl51_1
| ~ spl51_2 ),
inference(forward_demodulation,[],[f466,f462]) ).
fof(f529,plain,
( ~ ssList(sK50)
| ~ segmentP(nil,nil)
| ~ neq(nil,nil)
| ~ ssList(nil)
| ~ spl51_1 ),
inference(resolution,[],[f359,f514]) ).
fof(f530,plain,
( ~ segmentP(nil,nil)
| ~ neq(nil,nil)
| ~ ssList(nil)
| ~ spl51_1 ),
inference(forward_subsumption_resolution,[],[f529,f416]) ).
fof(f531,plain,
( ~ neq(nil,nil)
| ~ ssList(nil)
| ~ spl51_1
| ~ spl51_9 ),
inference(forward_subsumption_resolution,[],[f530,f499]) ).
fof(f532,plain,
( ~ ssList(nil)
| ~ spl51_1
| ~ spl51_2
| ~ spl51_9 ),
inference(forward_subsumption_resolution,[],[f531,f523]) ).
fof(f533,plain,
( $false
| ~ spl51_1
| ~ spl51_2
| ~ spl51_9 ),
inference(forward_subsumption_resolution,[],[f532,f511]) ).
fof(f534,plain,
( ~ spl51_1
| ~ spl51_2
| ~ spl51_9 ),
inference(avatar_contradiction_clause,[],[f533]) ).
fof(f550,plain,
( $false
| spl51_6 ),
inference(forward_subsumption_resolution,[],[f486,f306]) ).
fof(f551,plain,
spl51_6,
inference(avatar_contradiction_clause,[],[f550]) ).
fof(f604,plain,
( ~ ssList(sK49)
| sK50 = app(sK49,sK5(sK50,sK49))
| ~ ssList(sK50)
| ~ spl51_4 ),
inference(resolution,[],[f235,f476]) ).
fof(f609,plain,
( sK50 = app(sK49,sK5(sK50,sK49))
| ~ ssList(sK50)
| ~ spl51_4 ),
inference(forward_subsumption_resolution,[],[f604,f420]) ).
fof(f612,plain,
( sK50 = app(sK49,sK5(sK50,sK49))
| ~ spl51_4 ),
inference(forward_subsumption_resolution,[],[f609,f416]) ).
fof(f664,definition,
( spl51_20
<=> ssList(sK5(sK50,sK49)) ),
introduced(definition,[new_symbols(definition,[spl51_20])],[avatar_definition]) ).
fof(f665,plain,
( ssList(sK5(sK50,sK49))
| ~ spl51_20 ),
inference(avatar_component_clause,[],[f664]) ).
fof(f666,plain,
( ~ ssList(sK5(sK50,sK49))
| spl51_20 ),
inference(avatar_component_clause,[],[f664]) ).
fof(f671,plain,
( ~ ssList(sK49)
| ~ ssList(sK50)
| ~ frontsegP(sK50,sK49)
| spl51_20 ),
inference(resolution,[],[f666,f236]) ).
fof(f672,plain,
( ~ ssList(sK50)
| ~ frontsegP(sK50,sK49)
| spl51_20 ),
inference(forward_subsumption_resolution,[],[f671,f420]) ).
fof(f673,plain,
( ~ frontsegP(sK50,sK49)
| spl51_20 ),
inference(forward_subsumption_resolution,[],[f672,f416]) ).
fof(f674,plain,
( $false
| ~ spl51_4
| spl51_20 ),
inference(forward_subsumption_resolution,[],[f673,f476]) ).
fof(f675,plain,
( ~ spl51_4
| spl51_20 ),
inference(avatar_contradiction_clause,[],[f674]) ).
fof(f1149,plain,
sK49 = app(nil,sK49),
inference(resolution,[],[f320,f420]) ).
fof(f3750,plain,
! [X2,X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X0)
| segmentP(app(app(X1,X0),X2),X0)
| ~ ssList(X0) ),
inference(resolution,[],[f358,f357]) ).
fof(f3755,plain,
! [X2,X0,X1] :
( segmentP(app(app(X1,X0),X2),X0)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ ssList(X0) ),
inference(duplicate_literal_removal,[],[f3750]) ).
fof(f8120,plain,
! [X0] :
( segmentP(app(sK49,X0),sK49)
| ~ ssList(nil)
| ~ ssList(X0)
| ~ ssList(sK49) ),
inference(superposition,[],[f3755,f1149]) ).
fof(f8132,plain,
! [X0] :
( segmentP(app(sK49,X0),sK49)
| ~ ssList(X0)
| ~ ssList(sK49) ),
inference(forward_subsumption_resolution,[],[f8120,f306]) ).
fof(f8166,plain,
! [X0] :
( segmentP(app(sK49,X0),sK49)
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f8132,f420]) ).
fof(f8252,plain,
( segmentP(sK50,sK49)
| ~ ssList(sK5(sK50,sK49))
| ~ spl51_4 ),
inference(superposition,[],[f8166,f612]) ).
fof(f8258,plain,
( segmentP(sK50,sK49)
| ~ spl51_4
| ~ spl51_20 ),
inference(forward_subsumption_resolution,[],[f8252,f665]) ).
fof(f8272,plain,
( ~ segmentP(sK49,sK49)
| ~ neq(sK49,nil)
| ~ ssList(sK49)
| ~ spl51_4
| ~ spl51_20 ),
inference(resolution,[],[f8258,f426]) ).
fof(f8280,plain,
( ~ neq(sK49,nil)
| ~ ssList(sK49)
| ~ spl51_4
| ~ spl51_20 ),
inference(forward_subsumption_resolution,[],[f8272,f357]) ).
fof(f8284,plain,
( ~ ssList(sK49)
| ~ spl51_2
| ~ spl51_4
| ~ spl51_20 ),
inference(forward_subsumption_resolution,[],[f8280,f466]) ).
fof(f8285,plain,
( $false
| ~ spl51_2
| ~ spl51_4
| ~ spl51_20 ),
inference(forward_subsumption_resolution,[],[f8284,f420]) ).
fof(f8286,plain,
( ~ spl51_2
| ~ spl51_4
| ~ spl51_20 ),
inference(avatar_contradiction_clause,[],[f8285]) ).
cnf(s1,plain,
( spl51_1
| spl51_2 ),
inference(sat_conversion,[],[f467]) ).
cnf(s2,plain,
( spl51_2
| spl51_3 ),
inference(sat_conversion,[],[f472]) ).
cnf(s3,plain,
( spl51_1
| spl51_4 ),
inference(sat_conversion,[],[f477]) ).
cnf(s8,plain,
( ~ spl51_6
| spl51_9 ),
inference(sat_conversion,[],[f500]) ).
cnf(s11,plain,
( ~ spl51_1
| ~ spl51_3
| ~ spl51_9 ),
inference(sat_conversion,[],[f520]) ).
cnf(s13,plain,
( ~ spl51_1
| ~ spl51_2
| ~ spl51_9 ),
inference(sat_conversion,[],[f534]) ).
cnf(s15,plain,
spl51_6,
inference(sat_conversion,[],[f551]) ).
cnf(s20,plain,
( ~ spl51_4
| spl51_20 ),
inference(sat_conversion,[],[f675]) ).
cnf(s322,plain,
( ~ spl51_2
| ~ spl51_4
| ~ spl51_20 ),
inference(sat_conversion,[],[f8286]) ).
cnf(s349,plain,
spl51_9,
inference(rat,[],[s8,s15]) ).
cnf(s353,plain,
spl51_1,
inference(rat,[],[s322,s20,s1,s3]) ).
cnf(s354,plain,
~ spl51_2,
inference(rat,[],[s13,s349,s353]) ).
cnf(s355,plain,
~ spl51_3,
inference(rat,[],[s11,s349,s353]) ).
cnf(s356,plain,
$false,
inference(rat,[],[s2,s355,s354]) ).
fof(f8287,plain,
$false,
inference(avatar_sat_refutation,[],[s356]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC085+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.37 % Computer : n002.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Mon Sep 28 07:50:08 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.40 Running first-order model finding
% 0.09/0.40 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
% 1.86/0.71 % (196566)Will run a generic schedule for satisfiability detection.
% 1.86/0.71 % (196571)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2851507496_2999 on theBenchmark for (2999ds/0Mi)
% 1.86/0.71 % (196572)% WARNING: option uhcvi not known.
% 1.86/0.71 % (196572)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1485458514:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 1.86/0.71 % (196573)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1286657373:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 1.86/0.71 % (196574)dis+10_1_sil=32000:sp=arity:random_seed=3697498014:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 1.86/0.71 % TRYING [1]
% 1.86/0.71 % (196575)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3411810048:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 1.86/0.71 % (196577)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=3698856972:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 1.86/0.71 % TRYING [2]
% 1.86/0.71 % (196576)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4019994331:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 1.86/0.71 % TRYING [3]
% 1.86/0.71 % TRYING [4]
% 1.86/0.71 % TRYING [5]
% 1.86/0.71 % (196574)Instruction limit reached!
% 1.86/0.71 % (196574)------------------------------
% 1.86/0.71 % (196574)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.86/0.71 % (196574)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.86/0.71 % (196574)CaDiCaL version: 2.1.3
% 1.86/0.71 % (196574)Termination reason: Instruction limit
% 1.86/0.71 % (196574)Termination phase: Saturation
% 1.86/0.71 % (196574)Time elapsed: 0.061 s
% 1.86/0.71 % (196574)Peak memory usage: 13 MB
% 1.86/0.71 % (196574)Instructions burned: 103 (million)
% 1.86/0.71 % (196575)Instruction limit reached!
% 1.86/0.71 % (196575)------------------------------
% 1.86/0.71 % (196575)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.86/0.71 % (196575)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.86/0.71 % (196575)CaDiCaL version: 2.1.3
% 1.86/0.71 % (196575)Termination reason: Instruction limit
% 1.86/0.71 % (196575)Termination phase: Saturation
% 1.86/0.71 % (196575)Time elapsed: 0.071 s
% 1.86/0.71 % (196575)Peak memory usage: 13 MB
% 1.86/0.71 % (196575)Instructions burned: 117 (million)
% 1.86/0.71 % (196576)Instruction limit reached!
% 1.86/0.71 % (196576)------------------------------
% 1.86/0.71 % (196576)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.86/0.71 % (196576)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.86/0.71 % (196576)CaDiCaL version: 2.1.3
% 1.86/0.71 % (196576)Termination reason: Instruction limit
% 1.86/0.71 % (196576)Termination phase: Saturation
% 1.86/0.71 % (196576)Time elapsed: 0.076 s
% 1.86/0.71 % (196576)Peak memory usage: 14 MB
% 1.86/0.71 % (196576)Instructions burned: 132 (million)
% 1.86/0.71 % (196585)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=2844761245:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 1.86/0.71 % (196586)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=610229274:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 1.86/0.71 % (196587)dis+11_32_anc=none:slsqr=2,1:sil=64000:sas=cadical:lma=off:lsd=50:s2agt=8:slsqc=1:kmz=on:newcnf=on:slsq=on:random_seed=144926342:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 1.86/0.71 % TRYING [1]
% 1.86/0.71 % TRYING [2]
% 1.86/0.71 % (196577)Instruction limit reached!
% 1.86/0.71 % (196577)------------------------------
% 1.86/0.71 % (196577)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.86/0.71 % (196577)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.86/0.71 % (196577)CaDiCaL version: 2.1.3
% 1.86/0.71 % (196577)Termination reason: Instruction limit
% 1.86/0.71 % (196577)Termination phase: Saturation
% 1.86/0.71 % (196577)Time elapsed: 0.098 s
% 1.86/0.71 % (196577)Peak memory usage: 15 MB
% 1.86/0.71 % (196577)Instructions burned: 159 (million)
% 1.86/0.71 % TRYING [3]
% 1.86/0.71 % TRYING [6]
% 1.86/0.71 % TRYING [4]
% 1.86/0.71 % (196591)ott-21_1_sil=16000:fs=off:random_seed=164128995:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 1.86/0.71 % (196586)Instruction limit reached!
% 1.86/0.71 % (196586)------------------------------
% 1.86/0.71 % (196586)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.86/0.71 % (196586)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.86/0.71 % (196586)CaDiCaL version: 2.1.3
% 1.86/0.71 % (196586)Termination reason: Instruction limit
% 1.86/0.71 % (196586)Termination phase: Saturation
% 1.86/0.71 % (196586)Time elapsed: 0.073 s
% 1.86/0.71 % (196586)Peak memory usage: 14 MB
% 1.86/0.71 % (196586)Instructions burned: 131 (million)
% 1.86/0.71 % TRYING [5]
% 1.86/0.71 % (196593)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=1223731734:i=477:bd=all_2997 on theBenchmark for (2997ds/477Mi)
% 1.86/0.71 % (196591)Instruction limit reached!
% 1.86/0.71 % (196591)------------------------------
% 1.86/0.71 % (196591)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.86/0.71 % (196591)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.86/0.71 % (196591)CaDiCaL version: 2.1.3
% 1.86/0.71 % (196591)Termination reason: Instruction limit
% 1.86/0.71 % (196591)Termination phase: Saturation
% 1.86/0.71 % (196591)Time elapsed: 0.092 s
% 1.86/0.71 % (196591)Peak memory usage: 14 MB
% 1.86/0.71 % (196591)Instructions burned: 181 (million)
% 1.86/0.71 % (196595)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=2688820030:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 1.86/0.71 % TRYING [1]
% 1.86/0.71 % TRYING [2]
% 1.86/0.71 % (196587) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-196566-196587"...
% 1.86/0.71 % (196587)...printing done.
% 1.86/0.71 % (196587)Refutation found. Thanks to Tanya!
% 1.86/0.71 % SZS status Theorem for theBenchmark
% 1.86/0.71 % SZS output start Proof for theBenchmark
% See solution above
% 1.86/0.71 % (196587)------------------------------
% 1.86/0.71 % (196587)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.86/0.71 % (196587)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.86/0.71 % (196587)CaDiCaL version: 2.1.3
% 1.86/0.71 % (196587)Termination reason: Refutation
% 1.86/0.71 % (196587)Time elapsed: 0.155 s
% 1.86/0.71 % (196587)Peak memory usage: 16 MB
% 1.86/0.71 % (196587)Instructions burned: 263 (million)
% 1.86/0.71 % (196566)Success in time 0.296 s
% 1.86/0.71 % Vampire exiting
%------------------------------------------------------------------------------