%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC081+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 : n011.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:35 PM UTC 2026
% Result : Theorem 0.96s 0.63s
% Output : Refutation 0.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 17
% Syntax : Number of formulae : 125 ( 20 unt; 9 def)
% Number of atoms : 407 ( 43 equ)
% Maximal formula atoms : 17 ( 3 avg)
% Number of connectives : 495 ( 213 ~; 210 |; 38 &)
% ( 15 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 15 ( 13 usr; 10 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 71 ( 0 sgn 53 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f5,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( frontsegP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& app(X1,X2) = X0 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax5) ).
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(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(f26,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ssList(app(X0,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(f57,axiom,
! [X0] :
( ssList(X0)
=> segmentP(X0,nil) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax57) ).
fof(f58,axiom,
! [X0] :
( ssList(X0)
=> ( segmentP(nil,X0)
<=> nil = X0 ) ),
file('/export/starexec/sandbox2/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) )
| ( ! [X5] :
( ssList(X5)
=> ( ~ neq(X5,nil)
| ~ frontsegP(X3,X5)
| ~ frontsegP(X2,X5) ) )
& ( nil != X3
| nil != X2 ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/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) )
| ( ! [X5] :
( ssList(X5)
=> ( ~ neq(X5,nil)
| ~ frontsegP(X3,X5)
| ~ frontsegP(X2,X5) ) )
& ( nil != X3
| nil != 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(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(f132,plain,
! [X0] :
( ! [X1] :
( ssList(app(X0,X1))
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f134,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f28]) ).
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) )
& ( ? [X5] :
( neq(X5,nil)
& frontsegP(X3,X5)
& frontsegP(X2,X5)
& ssList(X5) )
| ( nil = X3
& nil = 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) )
& ( ? [X5] :
( neq(X5,nil)
& frontsegP(X3,X5)
& frontsegP(X2,X5)
& ssList(X5) )
| ( nil = X3
& nil = 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(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(f306,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f318,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f132]) ).
fof(f320,plain,
! [X0] :
( ~ ssList(X0)
| app(nil,X0) = X0 ),
inference(cnf_transformation,[],[f134]) ).
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,
( nil = sK50
| ssList(sK51) ),
inference(cnf_transformation,[],[f222]) ).
fof(f412,plain,
( nil = sK50
| frontsegP(sK49,sK51) ),
inference(cnf_transformation,[],[f222]) ).
fof(f413,plain,
( nil = sK50
| frontsegP(sK50,sK51) ),
inference(cnf_transformation,[],[f222]) ).
fof(f414,plain,
( nil = sK50
| neq(sK51,nil) ),
inference(cnf_transformation,[],[f222]) ).
fof(f419,plain,
! [X4] :
( ~ segmentP(sK47,X4)
| ~ segmentP(sK48,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f222]) ).
fof(f420,plain,
ssList(sK50),
inference(cnf_transformation,[],[f222]) ).
fof(f421,plain,
neq(sK48,nil),
inference(cnf_transformation,[],[f222]) ).
fof(f422,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f222]) ).
fof(f423,plain,
sK48 = sK50,
inference(cnf_transformation,[],[f222]) ).
fof(f424,plain,
ssList(sK49),
inference(cnf_transformation,[],[f222]) ).
fof(f429,plain,
neq(sK50,nil),
inference(definition_unfolding,[],[f421,f423]) ).
fof(f430,plain,
! [X4] :
( ~ segmentP(sK50,X4)
| ~ segmentP(sK49,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(definition_unfolding,[],[f419,f422,f423]) ).
fof(f436,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(f450,plain,
( ~ ssList(nil)
| segmentP(nil,nil) ),
inference(equality_resolution,[],[f360]) ).
fof(f464,definition,
( spl52_1
<=> ssList(sK51) ),
introduced(definition,[new_symbols(definition,[spl52_1])],[avatar_definition]) ).
fof(f466,plain,
( ssList(sK51)
| ~ spl52_1 ),
inference(avatar_component_clause,[],[f464]) ).
fof(f468,definition,
( spl52_2
<=> nil = sK50 ),
introduced(definition,[new_symbols(definition,[spl52_2])],[avatar_definition]) ).
fof(f470,plain,
( nil = sK50
| ~ spl52_2 ),
inference(avatar_component_clause,[],[f468]) ).
fof(f471,plain,
( spl52_1
| spl52_2 ),
inference(avatar_split_clause,[],[f411,f468,f464]) ).
fof(f473,definition,
( spl52_3
<=> frontsegP(sK49,sK51) ),
introduced(definition,[new_symbols(definition,[spl52_3])],[avatar_definition]) ).
fof(f475,plain,
( frontsegP(sK49,sK51)
| ~ spl52_3 ),
inference(avatar_component_clause,[],[f473]) ).
fof(f476,plain,
( spl52_3
| spl52_2 ),
inference(avatar_split_clause,[],[f412,f468,f473]) ).
fof(f478,definition,
( spl52_4
<=> frontsegP(sK50,sK51) ),
introduced(definition,[new_symbols(definition,[spl52_4])],[avatar_definition]) ).
fof(f480,plain,
( frontsegP(sK50,sK51)
| ~ spl52_4 ),
inference(avatar_component_clause,[],[f478]) ).
fof(f481,plain,
( spl52_4
| spl52_2 ),
inference(avatar_split_clause,[],[f413,f468,f478]) ).
fof(f483,definition,
( spl52_5
<=> neq(sK51,nil) ),
introduced(definition,[new_symbols(definition,[spl52_5])],[avatar_definition]) ).
fof(f485,plain,
( neq(sK51,nil)
| ~ spl52_5 ),
inference(avatar_component_clause,[],[f483]) ).
fof(f486,plain,
( spl52_5
| spl52_2 ),
inference(avatar_split_clause,[],[f414,f468,f483]) ).
fof(f500,definition,
( spl52_8
<=> ssList(nil) ),
introduced(definition,[new_symbols(definition,[spl52_8])],[avatar_definition]) ).
fof(f502,plain,
( ~ ssList(nil)
| spl52_8 ),
inference(avatar_component_clause,[],[f500]) ).
fof(f513,definition,
( spl52_11
<=> segmentP(nil,nil) ),
introduced(definition,[new_symbols(definition,[spl52_11])],[avatar_definition]) ).
fof(f515,plain,
( segmentP(nil,nil)
| ~ spl52_11 ),
inference(avatar_component_clause,[],[f513]) ).
fof(f516,plain,
( spl52_11
| ~ spl52_8 ),
inference(avatar_split_clause,[],[f450,f500,f513]) ).
fof(f527,plain,
( neq(nil,nil)
| ~ spl52_2 ),
inference(superposition,[],[f429,f470]) ).
fof(f528,plain,
( ssList(nil)
| ~ spl52_2 ),
inference(superposition,[],[f420,f470]) ).
fof(f540,plain,
( ! [X4] :
( ~ segmentP(sK49,X4)
| ~ segmentP(nil,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) )
| ~ spl52_2 ),
inference(forward_demodulation,[],[f430,f470]) ).
fof(f553,plain,
( ~ ssList(sK49)
| ~ segmentP(nil,nil)
| ~ neq(nil,nil)
| ~ ssList(nil)
| ~ spl52_2 ),
inference(resolution,[],[f359,f540]) ).
fof(f554,plain,
( ~ segmentP(nil,nil)
| ~ neq(nil,nil)
| ~ ssList(nil)
| ~ spl52_2 ),
inference(forward_subsumption_resolution,[],[f553,f424]) ).
fof(f555,plain,
( ~ neq(nil,nil)
| ~ ssList(nil)
| ~ spl52_2
| ~ spl52_11 ),
inference(forward_subsumption_resolution,[],[f554,f515]) ).
fof(f556,plain,
( ~ ssList(nil)
| ~ spl52_2
| ~ spl52_11 ),
inference(forward_subsumption_resolution,[],[f555,f527]) ).
fof(f557,plain,
( $false
| ~ spl52_2
| ~ spl52_11 ),
inference(forward_subsumption_resolution,[],[f556,f528]) ).
fof(f558,plain,
( ~ spl52_2
| ~ spl52_11 ),
inference(avatar_contradiction_clause,[],[f557]) ).
fof(f574,plain,
( $false
| spl52_8 ),
inference(forward_subsumption_resolution,[],[f306,f502]) ).
fof(f575,plain,
spl52_8,
inference(avatar_contradiction_clause,[],[f574]) ).
fof(f636,plain,
( ~ ssList(sK51)
| sK49 = app(sK51,sK5(sK49,sK51))
| ~ ssList(sK49)
| ~ spl52_3 ),
inference(resolution,[],[f235,f475]) ).
fof(f637,plain,
( ~ ssList(sK51)
| sK50 = app(sK51,sK5(sK50,sK51))
| ~ ssList(sK50)
| ~ spl52_4 ),
inference(resolution,[],[f235,f480]) ).
fof(f648,plain,
( sK50 = app(sK51,sK5(sK50,sK51))
| ~ ssList(sK50)
| ~ spl52_1
| ~ spl52_4 ),
inference(forward_subsumption_resolution,[],[f637,f466]) ).
fof(f649,plain,
( sK49 = app(sK51,sK5(sK49,sK51))
| ~ ssList(sK49)
| ~ spl52_1
| ~ spl52_3 ),
inference(forward_subsumption_resolution,[],[f636,f466]) ).
fof(f650,plain,
( sK50 = app(sK51,sK5(sK50,sK51))
| ~ spl52_1
| ~ spl52_4 ),
inference(forward_subsumption_resolution,[],[f648,f420]) ).
fof(f651,plain,
( sK49 = app(sK51,sK5(sK49,sK51))
| ~ spl52_1
| ~ spl52_3 ),
inference(forward_subsumption_resolution,[],[f649,f424]) ).
fof(f698,definition,
( spl52_22
<=> ssList(sK5(sK49,sK51)) ),
introduced(definition,[new_symbols(definition,[spl52_22])],[avatar_definition]) ).
fof(f699,plain,
( ssList(sK5(sK49,sK51))
| ~ spl52_22 ),
inference(avatar_component_clause,[],[f698]) ).
fof(f700,plain,
( ~ ssList(sK5(sK49,sK51))
| spl52_22 ),
inference(avatar_component_clause,[],[f698]) ).
fof(f706,definition,
( spl52_24
<=> ssList(sK5(sK50,sK51)) ),
introduced(definition,[new_symbols(definition,[spl52_24])],[avatar_definition]) ).
fof(f707,plain,
( ssList(sK5(sK50,sK51))
| ~ spl52_24 ),
inference(avatar_component_clause,[],[f706]) ).
fof(f708,plain,
( ~ ssList(sK5(sK50,sK51))
| spl52_24 ),
inference(avatar_component_clause,[],[f706]) ).
fof(f737,plain,
( ~ ssList(sK51)
| ~ ssList(sK49)
| ~ frontsegP(sK49,sK51)
| spl52_22 ),
inference(resolution,[],[f700,f236]) ).
fof(f738,plain,
( ~ ssList(sK49)
| ~ frontsegP(sK49,sK51)
| ~ spl52_1
| spl52_22 ),
inference(forward_subsumption_resolution,[],[f737,f466]) ).
fof(f739,plain,
( ~ frontsegP(sK49,sK51)
| ~ spl52_1
| spl52_22 ),
inference(forward_subsumption_resolution,[],[f738,f424]) ).
fof(f740,plain,
( $false
| ~ spl52_1
| ~ spl52_3
| spl52_22 ),
inference(forward_subsumption_resolution,[],[f739,f475]) ).
fof(f741,plain,
( ~ spl52_1
| ~ spl52_3
| spl52_22 ),
inference(avatar_contradiction_clause,[],[f740]) ).
fof(f764,plain,
( ~ ssList(sK51)
| ~ ssList(sK50)
| ~ frontsegP(sK50,sK51)
| spl52_24 ),
inference(resolution,[],[f708,f236]) ).
fof(f765,plain,
( ~ ssList(sK50)
| ~ frontsegP(sK50,sK51)
| ~ spl52_1
| spl52_24 ),
inference(forward_subsumption_resolution,[],[f764,f466]) ).
fof(f766,plain,
( ~ frontsegP(sK50,sK51)
| ~ spl52_1
| spl52_24 ),
inference(forward_subsumption_resolution,[],[f765,f420]) ).
fof(f767,plain,
( $false
| ~ spl52_1
| ~ spl52_4
| spl52_24 ),
inference(forward_subsumption_resolution,[],[f766,f480]) ).
fof(f768,plain,
( ~ spl52_1
| ~ spl52_4
| spl52_24 ),
inference(avatar_contradiction_clause,[],[f767]) ).
fof(f1130,plain,
( sK51 = app(nil,sK51)
| ~ spl52_1 ),
inference(resolution,[],[f320,f466]) ).
fof(f2292,plain,
( ! [X0] :
( ~ ssList(app(sK51,X0))
| ~ ssList(sK51)
| ~ ssList(X0)
| ~ ssList(nil)
| segmentP(app(sK51,X0),sK51) )
| ~ spl52_1 ),
inference(superposition,[],[f436,f1130]) ).
fof(f2298,plain,
( ! [X0] :
( ~ ssList(sK51)
| ~ ssList(X0)
| ~ ssList(nil)
| segmentP(app(sK51,X0),sK51) )
| ~ spl52_1 ),
inference(forward_subsumption_resolution,[],[f2292,f318]) ).
fof(f2334,plain,
( ! [X0] :
( ~ ssList(X0)
| ~ ssList(nil)
| segmentP(app(sK51,X0),sK51) )
| ~ spl52_1 ),
inference(forward_subsumption_resolution,[],[f2298,f466]) ).
fof(f2369,plain,
( ! [X0] :
( segmentP(app(sK51,X0),sK51)
| ~ ssList(X0) )
| ~ spl52_1 ),
inference(forward_subsumption_resolution,[],[f2334,f306]) ).
fof(f4325,plain,
( segmentP(sK49,sK51)
| ~ ssList(sK5(sK49,sK51))
| ~ spl52_1
| ~ spl52_3 ),
inference(superposition,[],[f2369,f651]) ).
fof(f4326,plain,
( segmentP(sK50,sK51)
| ~ ssList(sK5(sK50,sK51))
| ~ spl52_1
| ~ spl52_4 ),
inference(superposition,[],[f2369,f650]) ).
fof(f4329,plain,
( segmentP(sK50,sK51)
| ~ spl52_1
| ~ spl52_4
| ~ spl52_24 ),
inference(forward_subsumption_resolution,[],[f4326,f707]) ).
fof(f4330,plain,
( segmentP(sK49,sK51)
| ~ spl52_1
| ~ spl52_3
| ~ spl52_22 ),
inference(forward_subsumption_resolution,[],[f4325,f699]) ).
fof(f4351,plain,
( ~ segmentP(sK49,sK51)
| ~ neq(sK51,nil)
| ~ ssList(sK51)
| ~ spl52_1
| ~ spl52_4
| ~ spl52_24 ),
inference(resolution,[],[f4329,f430]) ).
fof(f4360,plain,
( ~ segmentP(sK49,sK51)
| ~ ssList(sK51)
| ~ spl52_1
| ~ spl52_4
| ~ spl52_5
| ~ spl52_24 ),
inference(forward_subsumption_resolution,[],[f4351,f485]) ).
fof(f4365,plain,
( ~ segmentP(sK49,sK51)
| ~ spl52_1
| ~ spl52_4
| ~ spl52_5
| ~ spl52_24 ),
inference(forward_subsumption_resolution,[],[f4360,f466]) ).
fof(f4654,plain,
( $false
| ~ spl52_1
| ~ spl52_3
| ~ spl52_4
| ~ spl52_5
| ~ spl52_22
| ~ spl52_24 ),
inference(forward_subsumption_resolution,[],[f4365,f4330]) ).
fof(f4655,plain,
( ~ spl52_1
| ~ spl52_3
| ~ spl52_4
| ~ spl52_5
| ~ spl52_22
| ~ spl52_24 ),
inference(avatar_contradiction_clause,[],[f4654]) ).
cnf(s1,plain,
( spl52_1
| spl52_2 ),
inference(sat_conversion,[],[f471]) ).
cnf(s2,plain,
( spl52_2
| spl52_3 ),
inference(sat_conversion,[],[f476]) ).
cnf(s3,plain,
( spl52_2
| spl52_4 ),
inference(sat_conversion,[],[f481]) ).
cnf(s4,plain,
( spl52_2
| spl52_5 ),
inference(sat_conversion,[],[f486]) ).
cnf(s12,plain,
( ~ spl52_8
| spl52_11 ),
inference(sat_conversion,[],[f516]) ).
cnf(s18,plain,
( ~ spl52_2
| ~ spl52_11 ),
inference(sat_conversion,[],[f558]) ).
cnf(s20,plain,
spl52_8,
inference(sat_conversion,[],[f575]) ).
cnf(s28,plain,
( ~ spl52_1
| ~ spl52_3
| spl52_22 ),
inference(sat_conversion,[],[f741]) ).
cnf(s29,plain,
( ~ spl52_1
| ~ spl52_4
| spl52_24 ),
inference(sat_conversion,[],[f768]) ).
cnf(s259,plain,
( ~ spl52_1
| ~ spl52_3
| ~ spl52_4
| ~ spl52_5
| ~ spl52_22
| ~ spl52_24 ),
inference(sat_conversion,[],[f4655]) ).
cnf(s277,plain,
spl52_11,
inference(rat,[],[s12,s20]) ).
cnf(s278,plain,
~ spl52_2,
inference(rat,[],[s18,s277]) ).
cnf(s306,plain,
spl52_5,
inference(rat,[],[s4,s278]) ).
cnf(s307,plain,
spl52_4,
inference(rat,[],[s3,s278]) ).
cnf(s308,plain,
spl52_3,
inference(rat,[],[s2,s278]) ).
cnf(s309,plain,
spl52_1,
inference(rat,[],[s1,s278]) ).
cnf(s315,plain,
spl52_24,
inference(rat,[],[s29,s307,s309]) ).
cnf(s316,plain,
spl52_22,
inference(rat,[],[s28,s308,s309]) ).
cnf(s322,plain,
$false,
inference(rat,[],[s259,s309,s308,s306,s307,s315,s316]) ).
fof(f4656,plain,
$false,
inference(avatar_sat_refutation,[],[s322]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC081+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.09/0.36 % Computer : n011.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 28 07:45:00 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.37 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.40 Running first-order model finding
% 0.09/0.40 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.96/0.63 % (3234119)Will run a generic schedule for satisfiability detection.
% 0.96/0.63 % (3234130)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2335067735:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.96/0.63 % (3234125)% WARNING: option uhcvi not known.
% 0.96/0.63 % (3234124)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=739994474_2999 on theBenchmark for (2999ds/0Mi)
% 0.96/0.63 % (3234127)dis+10_1_sil=32000:sp=arity:random_seed=872425940:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.96/0.63 % (3234126)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3784718780:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.96/0.63 % (3234128)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=3000171191:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.96/0.63 % (3234129)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=890788880:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.96/0.63 % (3234125)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2499517674:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.96/0.63 % TRYING [1]
% 0.96/0.63 % TRYING [2]
% 0.96/0.63 % TRYING [3]
% 0.96/0.63 % TRYING [4]
% 0.96/0.63 % (3234130)Instruction limit reached!
% 0.96/0.63 % (3234130)------------------------------
% 0.96/0.63 % (3234130)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.96/0.63 % (3234130)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.96/0.63 % (3234130)CaDiCaL version: 2.1.3
% 0.96/0.63 % (3234130)Termination reason: Instruction limit
% 0.96/0.63 % (3234130)Termination phase: Saturation
% 0.96/0.63 % (3234130)Time elapsed: 0.056 s
% 0.96/0.63 % (3234130)Peak memory usage: 15 MB
% 0.96/0.63 % (3234130)Instructions burned: 161 (million)
% 0.96/0.63 % (3234127)Instruction limit reached!
% 0.96/0.63 % (3234127)------------------------------
% 0.96/0.63 % (3234127)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.96/0.63 % (3234127)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.96/0.63 % (3234127)CaDiCaL version: 2.1.3
% 0.96/0.63 % (3234127)Termination reason: Instruction limit
% 0.96/0.63 % (3234127)Termination phase: Saturation
% 0.96/0.63 % (3234127)Time elapsed: 0.062 s
% 0.96/0.63 % (3234127)Peak memory usage: 13 MB
% 0.96/0.63 % (3234127)Instructions burned: 104 (million)
% 0.96/0.63 % (3234138)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1102295969:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.96/0.63 % (3234128)Instruction limit reached!
% 0.96/0.63 % (3234128)------------------------------
% 0.96/0.63 % (3234128)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.96/0.63 % (3234128)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.96/0.63 % (3234128)CaDiCaL version: 2.1.3
% 0.96/0.63 % (3234128)Termination reason: Instruction limit
% 0.96/0.63 % (3234128)Termination phase: Saturation
% 0.96/0.63 % (3234128)Time elapsed: 0.072 s
% 0.96/0.63 % (3234128)Peak memory usage: 13 MB
% 0.96/0.63 % (3234128)Instructions burned: 117 (million)
% 0.96/0.63 % (3234129)Instruction limit reached!
% 0.96/0.63 % (3234129)------------------------------
% 0.96/0.63 % (3234129)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.96/0.63 % (3234129)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.96/0.63 % (3234129)CaDiCaL version: 2.1.3
% 0.96/0.63 % (3234129)Termination reason: Instruction limit
% 0.96/0.63 % (3234129)Termination phase: Saturation
% 0.96/0.63 % (3234129)Time elapsed: 0.078 s
% 0.96/0.63 % (3234129)Peak memory usage: 15 MB
% 0.96/0.63 % (3234129)Instructions burned: 132 (million)
% 0.96/0.63 % (3234139)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=3661375943:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 0.96/0.63 % TRYING [1]
% 0.96/0.63 % TRYING [2]
% 0.96/0.63 % TRYING [5]
% 0.96/0.63 % TRYING [3]
% 0.96/0.63 % (3234141)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=936371971:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 0.96/0.63 % (3234142)ott-21_1_sil=16000:fs=off:random_seed=3435526681:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 0.96/0.63 % TRYING [4]
% 0.96/0.63 % TRYING [5]
% 0.96/0.63 % (3234139)Instruction limit reached!
% 0.96/0.63 % (3234139)------------------------------
% 0.96/0.63 % (3234139)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.96/0.63 % (3234139)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.96/0.63 % (3234139)CaDiCaL version: 2.1.3
% 0.96/0.63 % (3234139)Termination reason: Instruction limit
% 0.96/0.63 % (3234139)Termination phase: Saturation
% 0.96/0.63 % (3234139)Time elapsed: 0.070 s
% 0.96/0.63 % (3234139)Peak memory usage: 13 MB
% 0.96/0.63 % (3234139)Instructions burned: 132 (million)
% 0.96/0.63 % (3234146)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=2441866337:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 0.96/0.63 % (3234141) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3234119-3234141"...
% 0.96/0.63 % (3234141)...printing done.
% 0.96/0.63 % (3234141)Refutation found. Thanks to Tanya!
% 0.96/0.63 % SZS status Theorem for theBenchmark
% 0.96/0.63 % SZS output start Proof for theBenchmark
% See solution above
% 0.96/0.64 % (3234141)------------------------------
% 0.96/0.64 % (3234141)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.96/0.64 % (3234141)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.96/0.64 % (3234141)CaDiCaL version: 2.1.3
% 0.96/0.64 % (3234141)Termination reason: Refutation
% 0.96/0.64 % (3234141)Time elapsed: 0.089 s
% 0.96/0.64 % (3234141)Peak memory usage: 15 MB
% 0.96/0.64 % (3234141)Instructions burned: 135 (million)
% 0.96/0.64 % (3234119)Success in time 0.225 s
% 0.96/0.64 % Vampire exiting
%------------------------------------------------------------------------------