%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC382+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 : 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:05:48 PM UTC 2026
% Result : Theorem 7.32s 1.32s
% Output : Refutation 7.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 20
% Syntax : Number of formulae : 138 ( 22 unt; 8 def)
% Number of atoms : 436 ( 80 equ)
% Maximal formula atoms : 17 ( 3 avg)
% Number of connectives : 502 ( 204 ~; 220 |; 38 &)
% ( 14 <=>; 26 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 15 ( 13 usr; 9 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-2 aty)
% Number of variables : 98 ( 0 sgn 80 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0] :
( ssList(X0)
=> ( singletonP(X0)
<=> ? [X1] :
( ssItem(X1)
& cons(X1,nil) = X0 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax4) ).
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/sandbox/benchmark/Axioms/SWC001+0.ax',ax7) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(f16,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> ssList(cons(X1,X0)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(f22,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> ssItem(hd(X0)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax22) ).
fof(f24,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> ssList(tl(X0)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax24) ).
fof(f26,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ssList(app(X0,X1)) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(f78,axiom,
! [X0] :
( ssList(X0)
=> ( nil != X0
=> cons(hd(X0),tl(X0)) = X0 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax78) ).
fof(f81,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> cons(X1,X0) = app(cons(X1,nil),X0) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/SWC001+0.ax',ax81) ).
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)
& X2 != X4
& ? [X5] :
( ssItem(X5)
& cons(X5,nil) = X4
& hd(X3) = X5
& neq(nil,X3) ) )
| ( singletonP(X0)
& segmentP(X1,X0) ) )
& ( ~ neq(X1,nil)
| neq(X3,nil) ) ) ) ) ) ) ),
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)
& X2 != X4
& ? [X5] :
( ssItem(X5)
& cons(X5,nil) = X4
& hd(X3) = X5
& neq(nil,X3) ) )
| ( singletonP(X0)
& segmentP(X1,X0) ) )
& ( ~ neq(X1,nil)
| neq(X3,nil) ) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f100,plain,
! [X0] :
( ( singletonP(X0)
<=> ? [X1] :
( ssItem(X1)
& cons(X1,nil) = X0 ) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f4]) ).
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(f119,plain,
! [X0] :
( ! [X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f126,plain,
! [X0] :
( ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f22]) ).
fof(f127,plain,
! [X0] :
( ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f126]) ).
fof(f129,plain,
! [X0] :
( ssList(tl(X0))
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f24]) ).
fof(f130,plain,
! [X0] :
( ssList(tl(X0))
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f129]) ).
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(f192,plain,
! [X0] :
( cons(hd(X0),tl(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f78]) ).
fof(f193,plain,
! [X0] :
( cons(hd(X0),tl(X0)) = X0
| nil = X0
| ~ ssList(X0) ),
inference(flattening,[],[f192]) ).
fof(f198,plain,
! [X0] :
( ! [X1] :
( cons(X1,X0) = app(cons(X1,nil),X0)
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f81]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ( ( neq(X1,nil)
& ! [X4] :
( ~ ssList(X4)
| X2 = X4
| ! [X5] :
( ~ ssItem(X5)
| cons(X5,nil) != X4
| hd(X3) != X5
| ~ neq(nil,X3) ) )
& ( ~ singletonP(X0)
| ~ segmentP(X1,X0) ) )
| ( neq(X1,nil)
& ~ neq(X3,nil) ) )
& 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)
| X2 = X4
| ! [X5] :
( ~ ssItem(X5)
| cons(X5,nil) != X4
| hd(X3) != X5
| ~ neq(nil,X3) ) )
& ( ~ singletonP(X0)
| ~ segmentP(X1,X0) ) )
| ( neq(X1,nil)
& ~ neq(X3,nil) ) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f234,plain,
! [X0,X1] :
( ~ ssList(X0)
| cons(X1,nil) != X0
| ~ ssItem(X1)
| singletonP(X0) ),
inference(cnf_transformation,[],[f100]) ).
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(f304,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssList(X1)
| X0 != X1
| ~ neq(X0,X1) ),
inference(cnf_transformation,[],[f118]) ).
fof(f305,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f119]) ).
fof(f306,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f314,plain,
! [X0] :
( ssItem(hd(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f127]) ).
fof(f316,plain,
! [X0] :
( ssList(tl(X0))
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f130]) ).
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(f389,plain,
! [X0] :
( ~ ssList(X0)
| nil = X0
| cons(hd(X0),tl(X0)) = X0 ),
inference(cnf_transformation,[],[f193]) ).
fof(f392,plain,
! [X0,X1] :
( ~ ssList(X0)
| ~ ssItem(X1)
| cons(X1,X0) = app(cons(X1,nil),X0) ),
inference(cnf_transformation,[],[f198]) ).
fof(f412,plain,
! [X4,X5] :
( ~ neq(sK50,nil)
| ~ neq(nil,sK50)
| hd(sK50) != X5
| cons(X5,nil) != X4
| ~ ssItem(X5)
| sK49 = X4
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f222]) ).
fof(f413,plain,
( ~ neq(sK50,nil)
| ~ segmentP(sK48,sK47)
| ~ singletonP(sK47) ),
inference(cnf_transformation,[],[f222]) ).
fof(f415,plain,
neq(sK48,nil),
inference(cnf_transformation,[],[f222]) ).
fof(f417,plain,
ssList(sK50),
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(f426,plain,
neq(sK50,nil),
inference(definition_unfolding,[],[f415,f419]) ).
fof(f428,plain,
( ~ neq(sK50,nil)
| ~ segmentP(sK50,sK49)
| ~ singletonP(sK49) ),
inference(definition_unfolding,[],[f413,f419,f418,f418]) ).
fof(f432,plain,
! [X1] :
( singletonP(cons(X1,nil))
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil)) ),
inference(equality_resolution,[],[f234]) ).
fof(f435,plain,
! [X2,X3,X1] :
( segmentP(app(app(X2,X1),X3),X1)
| ~ ssList(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(app(app(X2,X1),X3)) ),
inference(equality_resolution,[],[f241]) ).
fof(f444,plain,
! [X1] :
( ~ ssList(X1)
| ~ ssList(X1)
| ~ neq(X1,X1) ),
inference(equality_resolution,[],[f304]) ).
fof(f455,plain,
! [X4] :
( ~ neq(sK50,nil)
| ~ neq(nil,sK50)
| cons(hd(sK50),nil) != X4
| ~ ssItem(hd(sK50))
| sK49 = X4
| ~ ssList(X4) ),
inference(equality_resolution,[],[f412]) ).
fof(f456,plain,
( ~ neq(sK50,nil)
| ~ neq(nil,sK50)
| ~ ssItem(hd(sK50))
| sK49 = cons(hd(sK50),nil)
| ~ ssList(cons(hd(sK50),nil)) ),
inference(equality_resolution,[],[f455]) ).
fof(f463,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f444]) ).
fof(f466,plain,
( ~ segmentP(sK50,sK49)
| ~ singletonP(sK49) ),
inference(forward_subsumption_resolution,[],[f428,f426]) ).
fof(f468,definition,
( spl51_1
<=> singletonP(sK49) ),
introduced(definition,[new_symbols(definition,[spl51_1])],[avatar_definition]) ).
fof(f470,plain,
( ~ singletonP(sK49)
| spl51_1 ),
inference(avatar_component_clause,[],[f468]) ).
fof(f472,definition,
( spl51_2
<=> segmentP(sK50,sK49) ),
introduced(definition,[new_symbols(definition,[spl51_2])],[avatar_definition]) ).
fof(f474,plain,
( ~ segmentP(sK50,sK49)
| spl51_2 ),
inference(avatar_component_clause,[],[f472]) ).
fof(f475,plain,
( ~ spl51_1
| ~ spl51_2 ),
inference(avatar_split_clause,[],[f466,f472,f468]) ).
fof(f476,plain,
( ~ neq(nil,sK50)
| ~ ssItem(hd(sK50))
| sK49 = cons(hd(sK50),nil)
| ~ ssList(cons(hd(sK50),nil)) ),
inference(forward_subsumption_resolution,[],[f456,f426]) ).
fof(f478,definition,
( spl51_3
<=> ssList(cons(hd(sK50),nil)) ),
introduced(definition,[new_symbols(definition,[spl51_3])],[avatar_definition]) ).
fof(f480,plain,
( ~ ssList(cons(hd(sK50),nil))
| spl51_3 ),
inference(avatar_component_clause,[],[f478]) ).
fof(f482,definition,
( spl51_4
<=> sK49 = cons(hd(sK50),nil) ),
introduced(definition,[new_symbols(definition,[spl51_4])],[avatar_definition]) ).
fof(f484,plain,
( sK49 = cons(hd(sK50),nil)
| ~ spl51_4 ),
inference(avatar_component_clause,[],[f482]) ).
fof(f486,definition,
( spl51_5
<=> ssItem(hd(sK50)) ),
introduced(definition,[new_symbols(definition,[spl51_5])],[avatar_definition]) ).
fof(f487,plain,
( ssItem(hd(sK50))
| ~ spl51_5 ),
inference(avatar_component_clause,[],[f486]) ).
fof(f488,plain,
( ~ ssItem(hd(sK50))
| spl51_5 ),
inference(avatar_component_clause,[],[f486]) ).
fof(f490,definition,
( spl51_6
<=> neq(nil,sK50) ),
introduced(definition,[new_symbols(definition,[spl51_6])],[avatar_definition]) ).
fof(f492,plain,
( ~ neq(nil,sK50)
| spl51_6 ),
inference(avatar_component_clause,[],[f490]) ).
fof(f493,plain,
( ~ spl51_3
| spl51_4
| ~ spl51_5
| ~ spl51_6 ),
inference(avatar_split_clause,[],[f476,f490,f486,f482,f478]) ).
fof(f515,plain,
sK49 = app(nil,sK49),
inference(resolution,[],[f320,f420]) ).
fof(f540,plain,
( ~ ssItem(hd(sK50))
| ~ ssList(nil)
| spl51_3 ),
inference(resolution,[],[f305,f480]) ).
fof(f543,plain,
( ~ ssItem(hd(sK50))
| spl51_3 ),
inference(forward_subsumption_resolution,[],[f540,f306]) ).
fof(f544,plain,
( ~ spl51_5
| spl51_3 ),
inference(avatar_split_clause,[],[f543,f478,f486]) ).
fof(f547,plain,
( nil = sK50
| ~ ssList(sK50)
| spl51_5 ),
inference(resolution,[],[f314,f488]) ).
fof(f548,plain,
( nil = sK50
| spl51_5 ),
inference(forward_subsumption_resolution,[],[f547,f417]) ).
fof(f550,plain,
( neq(nil,nil)
| spl51_5 ),
inference(superposition,[],[f426,f548]) ).
fof(f558,plain,
( ~ ssList(nil)
| spl51_5 ),
inference(resolution,[],[f550,f463]) ).
fof(f559,plain,
( $false
| spl51_5 ),
inference(forward_subsumption_resolution,[],[f558,f306]) ).
fof(f560,plain,
spl51_5,
inference(avatar_contradiction_clause,[],[f559]) ).
fof(f670,plain,
( ~ ssList(sK50)
| nil = sK50
| ~ ssList(nil)
| spl51_6 ),
inference(resolution,[],[f303,f492]) ).
fof(f673,plain,
( nil = sK50
| ~ ssList(nil)
| spl51_6 ),
inference(forward_subsumption_resolution,[],[f670,f417]) ).
fof(f674,plain,
( nil = sK50
| spl51_6 ),
inference(forward_subsumption_resolution,[],[f673,f306]) ).
fof(f676,plain,
( neq(nil,nil)
| spl51_6 ),
inference(superposition,[],[f426,f674]) ).
fof(f737,plain,
( ~ ssList(nil)
| spl51_6 ),
inference(resolution,[],[f676,f463]) ).
fof(f738,plain,
( $false
| spl51_6 ),
inference(forward_subsumption_resolution,[],[f737,f306]) ).
fof(f739,plain,
spl51_6,
inference(avatar_contradiction_clause,[],[f738]) ).
fof(f892,plain,
( singletonP(sK49)
| ~ ssItem(hd(sK50))
| ~ ssList(sK49)
| ~ spl51_4 ),
inference(superposition,[],[f432,f484]) ).
fof(f894,plain,
( ~ ssItem(hd(sK50))
| ~ ssList(sK49)
| spl51_1
| ~ spl51_4 ),
inference(forward_subsumption_resolution,[],[f892,f470]) ).
fof(f895,plain,
( ~ ssList(sK49)
| spl51_1
| ~ spl51_4
| ~ spl51_5 ),
inference(forward_subsumption_resolution,[],[f894,f487]) ).
fof(f896,plain,
( $false
| spl51_1
| ~ spl51_4
| ~ spl51_5 ),
inference(forward_subsumption_resolution,[],[f895,f420]) ).
fof(f897,plain,
( spl51_1
| ~ spl51_4
| ~ spl51_5 ),
inference(avatar_contradiction_clause,[],[f896]) ).
fof(f1053,plain,
( nil = sK50
| sK50 = cons(hd(sK50),tl(sK50)) ),
inference(resolution,[],[f389,f417]) ).
fof(f1169,plain,
( ! [X0] :
( ~ ssList(X0)
| cons(hd(sK50),X0) = app(cons(hd(sK50),nil),X0) )
| ~ spl51_5 ),
inference(resolution,[],[f392,f487]) ).
fof(f1191,plain,
( ! [X0] :
( ~ ssList(X0)
| cons(hd(sK50),X0) = app(sK49,X0) )
| ~ spl51_4
| ~ spl51_5 ),
inference(forward_demodulation,[],[f1169,f484]) ).
fof(f1204,definition,
( spl51_10
<=> nil = sK50 ),
introduced(definition,[new_symbols(definition,[spl51_10])],[avatar_definition]) ).
fof(f1205,plain,
( nil != sK50
| spl51_10 ),
inference(avatar_component_clause,[],[f1204]) ).
fof(f1206,plain,
( nil = sK50
| ~ spl51_10 ),
inference(avatar_component_clause,[],[f1204]) ).
fof(f1226,plain,
( neq(nil,nil)
| ~ spl51_10 ),
inference(superposition,[],[f426,f1206]) ).
fof(f1242,plain,
( ~ ssList(nil)
| ~ spl51_10 ),
inference(resolution,[],[f1226,f463]) ).
fof(f1243,plain,
( $false
| ~ spl51_10 ),
inference(forward_subsumption_resolution,[],[f1242,f306]) ).
fof(f1244,plain,
~ spl51_10,
inference(avatar_contradiction_clause,[],[f1243]) ).
fof(f2503,plain,
! [X0] :
( segmentP(app(sK49,X0),sK49)
| ~ ssList(sK49)
| ~ ssList(X0)
| ~ ssList(nil)
| ~ ssList(app(sK49,X0)) ),
inference(superposition,[],[f435,f515]) ).
fof(f2516,plain,
! [X0] :
( segmentP(app(sK49,X0),sK49)
| ~ ssList(sK49)
| ~ ssList(X0)
| ~ ssList(nil) ),
inference(forward_subsumption_resolution,[],[f2503,f318]) ).
fof(f2522,plain,
! [X0] :
( segmentP(app(sK49,X0),sK49)
| ~ ssList(X0)
| ~ ssList(nil) ),
inference(forward_subsumption_resolution,[],[f2516,f420]) ).
fof(f2525,plain,
! [X0] :
( segmentP(app(sK49,X0),sK49)
| ~ ssList(X0) ),
inference(forward_subsumption_resolution,[],[f2522,f306]) ).
fof(f2976,plain,
( sK50 = cons(hd(sK50),tl(sK50))
| spl51_10 ),
inference(forward_subsumption_resolution,[],[f1053,f1205]) ).
fof(f3084,definition,
( spl51_13
<=> ssList(tl(sK50)) ),
introduced(definition,[new_symbols(definition,[spl51_13])],[avatar_definition]) ).
fof(f3085,plain,
( ssList(tl(sK50))
| ~ spl51_13 ),
inference(avatar_component_clause,[],[f3084]) ).
fof(f3086,plain,
( ~ ssList(tl(sK50))
| spl51_13 ),
inference(avatar_component_clause,[],[f3084]) ).
fof(f3133,plain,
( nil = sK50
| ~ ssList(sK50)
| spl51_13 ),
inference(resolution,[],[f3086,f316]) ).
fof(f3134,plain,
( ~ ssList(sK50)
| spl51_10
| spl51_13 ),
inference(forward_subsumption_resolution,[],[f3133,f1205]) ).
fof(f3135,plain,
( $false
| spl51_10
| spl51_13 ),
inference(forward_subsumption_resolution,[],[f3134,f417]) ).
fof(f3136,plain,
( spl51_10
| spl51_13 ),
inference(avatar_contradiction_clause,[],[f3135]) ).
fof(f3160,plain,
( cons(hd(sK50),tl(sK50)) = app(sK49,tl(sK50))
| ~ spl51_4
| ~ spl51_5
| ~ spl51_13 ),
inference(resolution,[],[f3085,f1191]) ).
fof(f3167,plain,
( sK50 = app(sK49,tl(sK50))
| ~ spl51_4
| ~ spl51_5
| spl51_10
| ~ spl51_13 ),
inference(forward_demodulation,[],[f3160,f2976]) ).
fof(f3374,plain,
( segmentP(sK50,sK49)
| ~ ssList(tl(sK50))
| ~ spl51_4
| ~ spl51_5
| spl51_10
| ~ spl51_13 ),
inference(superposition,[],[f2525,f3167]) ).
fof(f3403,plain,
( ~ ssList(tl(sK50))
| spl51_2
| ~ spl51_4
| ~ spl51_5
| spl51_10
| ~ spl51_13 ),
inference(forward_subsumption_resolution,[],[f3374,f474]) ).
fof(f3416,plain,
( $false
| spl51_2
| ~ spl51_4
| ~ spl51_5
| spl51_10
| ~ spl51_13 ),
inference(forward_subsumption_resolution,[],[f3403,f3085]) ).
fof(f3417,plain,
( spl51_2
| ~ spl51_4
| ~ spl51_5
| spl51_10
| ~ spl51_13 ),
inference(avatar_contradiction_clause,[],[f3416]) ).
cnf(s1,plain,
( ~ spl51_1
| ~ spl51_2 ),
inference(sat_conversion,[],[f475]) ).
cnf(s2,plain,
( ~ spl51_3
| spl51_4
| ~ spl51_5
| ~ spl51_6 ),
inference(sat_conversion,[],[f493]) ).
cnf(s3,plain,
( spl51_3
| ~ spl51_5 ),
inference(sat_conversion,[],[f544]) ).
cnf(s4,plain,
spl51_5,
inference(sat_conversion,[],[f560]) ).
cnf(s5,plain,
spl51_6,
inference(sat_conversion,[],[f739]) ).
cnf(s6,plain,
( spl51_1
| ~ spl51_4
| ~ spl51_5 ),
inference(sat_conversion,[],[f897]) ).
cnf(s10,plain,
~ spl51_10,
inference(sat_conversion,[],[f1244]) ).
cnf(s14,plain,
( spl51_10
| spl51_13 ),
inference(sat_conversion,[],[f3136]) ).
cnf(s15,plain,
( spl51_2
| ~ spl51_4
| ~ spl51_5
| spl51_10
| ~ spl51_13 ),
inference(sat_conversion,[],[f3417]) ).
cnf(s16,plain,
spl51_13,
inference(rat,[],[s14,s10]) ).
cnf(s18,plain,
spl51_3,
inference(rat,[],[s3,s4]) ).
cnf(s19,plain,
spl51_4,
inference(rat,[],[s2,s5,s4,s18]) ).
cnf(s20,plain,
spl51_2,
inference(rat,[],[s15,s16,s10,s4,s19]) ).
cnf(s23,plain,
spl51_1,
inference(rat,[],[s6,s4,s19]) ).
cnf(s27,plain,
$false,
inference(rat,[],[s1,s20,s23]) ).
fof(f3418,plain,
$false,
inference(avatar_sat_refutation,[],[s27]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC382+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.17 % Computer : n001.cluster.edu
% 0.09/0.17 % Model : x86_64 x86_64
% 0.09/0.17 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.17 % Memory : 8046.5625MB
% 0.09/0.17 % OS : Linux 6.8.0-71-generic
% 0.09/0.17 % CPULimit : 300
% 0.09/0.17 % WCLimit : 300
% 0.09/0.17 % DateTime : Mon Sep 28 09:28:47 UTC 2026
% 0.09/0.17 % CPUTime :
% 0.09/0.17 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 SAT
% 0.09/0.20 Running first-order model finding
% 0.09/0.20 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
% 7.32/1.32 % (239871)Will run a generic schedule for satisfiability detection.
% 7.32/1.32 % (239877)% WARNING: option uhcvi not known.
% 7.32/1.32 % (239879)dis+10_1_sil=32000:sp=arity:random_seed=353365482:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 7.32/1.32 % (239876)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=1348103706_2999 on theBenchmark for (2999ds/0Mi)
% 7.32/1.32 % (239877)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=1135903679:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 7.32/1.32 % (239878)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=4280827320:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 7.32/1.32 % (239880)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=2724757825:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 7.32/1.32 % (239881)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=3217988979:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 7.32/1.32 % (239882)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=19788754:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 7.32/1.32 % TRYING [1]
% 7.32/1.32 % TRYING [2]
% 7.32/1.32 % TRYING [3]
% 7.32/1.32 % TRYING [4]
% 7.32/1.32 % (239881)Instruction limit reached!
% 7.32/1.32 % (239881)------------------------------
% 7.32/1.32 % (239881)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.32/1.32 % (239881)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.32/1.32 % (239881)CaDiCaL version: 2.1.3
% 7.32/1.32 % (239881)Termination reason: Instruction limit
% 7.32/1.32 % (239881)Termination phase: Saturation
% 7.32/1.32 % (239881)Time elapsed: 0.041 s
% 7.32/1.32 % (239881)Peak memory usage: 14 MB
% 7.32/1.32 % (239881)Instructions burned: 132 (million)
% 7.32/1.32 % (239890)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=747811476:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 7.32/1.32 % TRYING [1]
% 7.32/1.32 % (239879)Instruction limit reached!
% 7.32/1.32 % (239879)------------------------------
% 7.32/1.32 % (239879)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.32/1.32 % (239879)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.32/1.32 % (239879)CaDiCaL version: 2.1.3
% 7.32/1.32 % (239879)Termination reason: Instruction limit
% 7.32/1.32 % (239879)Termination phase: Saturation
% 7.32/1.32 % (239879)Time elapsed: 0.061 s
% 7.32/1.32 % (239879)Peak memory usage: 13 MB
% 7.32/1.32 % (239879)Instructions burned: 104 (million)
% 7.32/1.32 % TRYING [2]
% 7.32/1.32 % TRYING [3]
% 7.32/1.32 % (239880)Instruction limit reached!
% 7.32/1.32 % (239880)------------------------------
% 7.32/1.32 % (239880)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.32/1.32 % (239880)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.32/1.32 % (239880)CaDiCaL version: 2.1.3
% 7.32/1.32 % (239880)Termination reason: Instruction limit
% 7.32/1.32 % (239880)Termination phase: Saturation
% 7.32/1.32 % (239880)Time elapsed: 0.070 s
% 7.32/1.32 % (239880)Peak memory usage: 13 MB
% 7.32/1.32 % (239880)Instructions burned: 116 (million)
% 7.32/1.32 % TRYING [4]
% 7.32/1.32 % (239892)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2875054172:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 7.32/1.32 % TRYING [5]
% 7.32/1.32 % (239893)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=899865258:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 7.32/1.32 % TRYING [5]
% 7.32/1.32 % (239882)Instruction limit reached!
% 7.32/1.32 % (239882)------------------------------
% 7.32/1.32 % (239882)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.32/1.32 % (239882)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.32/1.32 % (239882)CaDiCaL version: 2.1.3
% 7.32/1.32 % (239882)Termination reason: Instruction limit
% 7.32/1.32 % (239882)Termination phase: Saturation
% 7.32/1.32 % (239882)Time elapsed: 0.106 s
% 7.32/1.32 % (239882)Peak memory usage: 15 MB
% 7.32/1.32 % (239882)Instructions burned: 160 (million)
% 7.32/1.32 % (239896)ott-21_1_sil=16000:fs=off:random_seed=3288116337:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 7.32/1.32 % (239892)Instruction limit reached!
% 7.32/1.32 % (239892)------------------------------
% 7.32/1.32 % (239892)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.32/1.32 % (239892)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.32/1.32 % (239892)CaDiCaL version: 2.1.3
% 7.32/1.32 % (239892)Termination reason: Instruction limit
% 7.32/1.32 % (239892)Termination phase: Saturation
% 7.32/1.32 % (239892)Time elapsed: 0.070 s
% 7.32/1.32 % (239892)Peak memory usage: 13 MB
% 7.32/1.32 % (239892)Instructions burned: 133 (million)
% 7.32/1.32 % (239898)dis+10_4_sil=64000:sp=reverse_arity:bsr=on:sac=on:cn=on:random_seed=2917731295:i=477:bd=all_2998 on theBenchmark for (2998ds/477Mi)
% 7.32/1.32 % TRYING [6]
% 7.32/1.32 % TRYING [6]
% 7.32/1.32 % (239890)Instruction limit reached!
% 7.32/1.32 % (239890)------------------------------
% 7.32/1.32 % (239890)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.32/1.32 % (239890)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.32/1.32 % (239890)CaDiCaL version: 2.1.3
% 7.32/1.32 % (239890)Termination reason: Instruction limit
% 7.32/1.32 % (239890)Termination phase: Finite model building constraint generation
% 7.32/1.32 % (239890)Time elapsed: 0.157 s
% 7.32/1.32 % (239890)Peak memory usage: 28 MB
% 7.32/1.32 % (239890)Instructions burned: 721 (million)
% 7.32/1.32 % (239896)Instruction limit reached!
% 7.32/1.32 % (239896)------------------------------
% 7.32/1.32 % (239896)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.32/1.32 % (239896)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.32/1.32 % (239896)CaDiCaL version: 2.1.3
% 7.32/1.32 % (239896)Termination reason: Instruction limit
% 7.32/1.32 % (239896)Termination phase: Saturation
% 7.32/1.32 % (239896)Time elapsed: 0.092 s
% 7.32/1.32 % (239896)Peak memory usage: 13 MB
% 7.32/1.32 % (239896)Instructions burned: 182 (million)
% 7.32/1.32 % (239900)fmb+10_1_sil=64000:erd=off:updr=off:random_seed=320936233:fmbsr=1.3:i=865:ins=25_2997 on theBenchmark for (2997ds/865Mi)
% 7.32/1.32 % TRYING [1]
% 7.32/1.32 % TRYING [2]
% 7.32/1.32 % TRYING [3]
% 7.32/1.32 % (239901)ott+10_1_to=lpo:sil=64000:tgt=full:sp=arity:spb=goal_then_units:random_seed=1719705186:i=1179_2997 on theBenchmark for (2997ds/1179Mi)
% 7.32/1.32 % TRYING [4]
% 7.32/1.32 % TRYING [5]
% 7.32/1.32 % (239900)Instruction limit reached!
% 7.32/1.32 % (239900)------------------------------
% 7.32/1.32 % (239900)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.32/1.32 % (239900)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.32/1.32 % (239900)CaDiCaL version: 2.1.3
% 7.32/1.32 % (239900)Termination reason: Instruction limit
% 7.32/1.32 % (239900)Termination phase: Finite model building SAT solving
% 7.32/1.32 % (239900)Time elapsed: 0.181 s
% 7.32/1.32 % (239900)Peak memory usage: 23 MB
% 7.32/1.32 % (239900)Instructions burned: 868 (million)
% 7.32/1.32 % (239904)fmb+10_1_sil=64000:erd=off:fmbss=14:random_seed=3123269491:i=889:ins=1_2995 on theBenchmark for (2995ds/889Mi)
% 7.32/1.32 % (239893)Instruction limit reached!
% 7.32/1.32 % (239893)------------------------------
% 7.32/1.32 % (239893)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.32/1.32 % (239893)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.32/1.32 % (239893)CaDiCaL version: 2.1.3
% 7.32/1.32 % (239893)Termination reason: Instruction limit
% 7.32/1.32 % (239893)Termination phase: Saturation
% 7.32/1.32 % (239893)Time elapsed: 0.374 s
% 7.32/1.32 % (239893)Peak memory usage: 21 MB
% 7.32/1.32 % (239893)Instructions burned: 687 (million)
% 7.32/1.32 % TRYING [14]
% 7.32/1.32 % TRYING [7]
% 7.32/1.32 % (239906)ott+1_16_sil=32000:plsq=on:plsqc=2:sas=cadical:avsql=on:sp=reverse_frequency:plsqr=128,1:bsr=unit_only:rp=on:newcnf=on:random_seed=3327700656:avsq=on:s2a=on:i=692:avsqr=8,1:kws=arity_squared:bs=unit_only:nm=2:rawr=on_2995 on theBenchmark for (2995ds/692Mi)
% 7.32/1.32 % (239898)Instruction limit reached!
% 7.32/1.32 % (239898)------------------------------
% 7.32/1.32 % (239898)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.32/1.32 % (239898)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.32/1.32 % (239898)CaDiCaL version: 2.1.3
% 7.32/1.32 % (239898)Termination reason: Instruction limit
% 7.32/1.32 % (239898)Termination phase: Saturation
% 7.32/1.32 % (239898)Time elapsed: 0.326 s
% 7.32/1.32 % (239898)Peak memory usage: 15 MB
% 7.32/1.32 % (239898)Instructions burned: 478 (million)
% 7.32/1.32 % (239908)dis-10_1_anc=none:sil=64000:spb=goal:newcnf=on:cn=on:random_seed=334774307:i=879:kws=inv_precedence:fsr=off_2994 on theBenchmark for (2994ds/879Mi)
% 7.32/1.32 % (239904)Instruction limit reached!
% 7.32/1.32 % (239904)------------------------------
% 7.32/1.32 % (239904)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.32/1.32 % (239904)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.32/1.32 % (239904)CaDiCaL version: 2.1.3
% 7.32/1.32 % (239904)Termination reason: Instruction limit
% 7.32/1.32 % (239904)Termination phase: Finite model building constraint generation
% 7.32/1.32 % (239904)Time elapsed: 0.181 s
% 7.32/1.32 % (239904)Peak memory usage: 70 MB
% 7.32/1.32 % (239904)Instructions burned: 891 (million)
% 7.32/1.32 % (239910)fmb+10_1_sil=64000:random_seed=97876893:i=22061:nm=2:gsp=on_2993 on theBenchmark for (2993ds/22061Mi)
% 7.32/1.32 % TRYING [1]
% 7.32/1.32 % TRYING [2]
% 7.32/1.32 % TRYING [3]
% 7.32/1.32 % TRYING [4]
% 7.32/1.32 % TRYING [5]
% 7.32/1.32 % (239906)Instruction limit reached!
% 7.32/1.32 % (239906)------------------------------
% 7.32/1.32 % (239906)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.32/1.32 % (239906)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.32/1.32 % (239906)CaDiCaL version: 2.1.3
% 7.32/1.32 % (239906)Termination reason: Instruction limit
% 7.32/1.32 % (239906)Termination phase: Saturation
% 7.32/1.32 % (239906)Time elapsed: 0.366 s
% 7.32/1.32 % (239906)Peak memory usage: 27 MB
% 7.32/1.32 % (239906)Instructions burned: 692 (million)
% 7.32/1.32 % (239912)fmb+10_1_sil=16000:sas=cadical:fmbss=20:random_seed=1304730802:i=9515:nm=5_2991 on theBenchmark for (2991ds/9515Mi)
% 7.32/1.32 % TRYING [6]
% 7.32/1.32 % TRYING [20]
% 7.32/1.32 % (239901)Instruction limit reached!
% 7.32/1.32 % (239901)------------------------------
% 7.32/1.32 % (239901)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.32/1.32 % (239901)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.32/1.32 % (239901)CaDiCaL version: 2.1.3
% 7.32/1.32 % (239901)Termination reason: Instruction limit
% 7.32/1.32 % (239901)Termination phase: Saturation
% 7.32/1.32 % (239901)Time elapsed: 0.651 s
% 7.32/1.32 % (239901)Peak memory usage: 28 MB
% 7.32/1.32 % (239901)Instructions burned: 1180 (million)
% 7.32/1.32 % (239914)fmb+10_1_sil=64000:sas=cadical:fmbss=8:random_seed=1709023894:fmbsr=1.7:i=920_2990 on theBenchmark for (2990ds/920Mi)
% 7.32/1.32 % TRYING [8]
% 7.32/1.32 % (239908)Instruction limit reached!
% 7.32/1.32 % (239908)------------------------------
% 7.32/1.32 % (239908)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.32/1.32 % (239908)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.32/1.32 % (239908)CaDiCaL version: 2.1.3
% 7.32/1.32 % (239908)Termination reason: Instruction limit
% 7.32/1.32 % (239908)Termination phase: Saturation
% 7.32/1.32 % (239908)Time elapsed: 0.445 s
% 7.32/1.32 % (239908)Peak memory usage: 21 MB
% 7.32/1.32 % (239908)Instructions burned: 880 (million)
% 7.32/1.32 % (239916)dis-4_1_sil=16000:drc=ordering:sp=const_frequency:sac=on:newcnf=on:random_seed=4192532538:i=5131_2990 on theBenchmark for (2990ds/5131Mi)
% 7.32/1.32 % TRYING [8]
% 7.32/1.32 % (239916) found proof, printing to "/export/starexec/sandbox/tmp/vampire-proof-239871-239916"...
% 7.32/1.32 % (239916)...printing done.
% 7.32/1.32 % (239916)Refutation found. Thanks to Tanya!
% 7.32/1.32 % SZS status Theorem for theBenchmark
% 7.32/1.32 % SZS output start Proof for theBenchmark
% See solution above
% 7.32/1.32 % (239916)------------------------------
% 7.32/1.32 % (239916)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 7.32/1.32 % (239916)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 7.32/1.32 % (239916)CaDiCaL version: 2.1.3
% 7.32/1.32 % (239916)Termination reason: Refutation
% 7.32/1.32 % (239916)Time elapsed: 0.076 s
% 7.32/1.32 % (239916)Peak memory usage: 14 MB
% 7.32/1.32 % (239916)Instructions burned: 137 (million)
% 7.32/1.32 % (239871)Success in time 1.115 s
% 7.32/1.32 % Vampire exiting
%------------------------------------------------------------------------------