%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC021+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 : n012.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:19 PM UTC 2026
% Result : Theorem 0.58s 0.47s
% Output : Refutation 0.58s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 23
% Syntax : Number of formulae : 150 ( 22 unt; 12 def)
% Number of atoms : 456 ( 65 equ)
% Maximal formula atoms : 19 ( 3 avg)
% Number of connectives : 516 ( 210 ~; 223 |; 44 &)
% ( 16 <=>; 23 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 20 ( 18 usr; 13 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 92 ( 0 sgn 74 !; 18 ?)
% Comments :
%------------------------------------------------------------------------------
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(f16,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> ssList(cons(X1,X0)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(f20,axiom,
! [X0] :
( ssList(X0)
=> ( nil = X0
| ? [X1] :
( ssList(X1)
& ? [X2] :
( ssItem(X2)
& cons(X2,X1) = X0 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax20) ).
fof(f21,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> nil != cons(X1,X0) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax21) ).
fof(f42,axiom,
! [X0] :
( ssList(X0)
=> frontsegP(X0,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax42) ).
fof(f44,axiom,
! [X0] :
( ssItem(X0)
=> ! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( frontsegP(cons(X0,X2),cons(X1,X3))
<=> ( X0 = X1
& frontsegP(X2,X3) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax44) ).
fof(f45,axiom,
! [X0] :
( ssList(X0)
=> frontsegP(X0,nil) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax45) ).
fof(f57,axiom,
! [X0] :
( ssList(X0)
=> segmentP(X0,nil) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax57) ).
fof(f68,axiom,
! [X0] :
( ssItem(X0)
=> strictorderedP(cons(X0,nil)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax68) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ~ frontsegP(X3,X2)
| ~ strictorderedP(X2)
| ? [X4] :
( ssList(X4)
& neq(X4,nil)
& frontsegP(X1,X4)
& frontsegP(X0,X4) )
| ? [X5] :
( ssList(X5)
& neq(X2,X5)
& frontsegP(X3,X5)
& segmentP(X5,X2)
& strictorderedP(X5) )
| ( 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)
=> ( X1 != X3
| X0 != X2
| ~ frontsegP(X3,X2)
| ~ strictorderedP(X2)
| ? [X4] :
( ssList(X4)
& neq(X4,nil)
& frontsegP(X1,X4)
& frontsegP(X0,X4) )
| ? [X5] :
( ssList(X5)
& neq(X2,X5)
& frontsegP(X3,X5)
& segmentP(X5,X2)
& strictorderedP(X5) )
| ( nil = X1
& nil = X0 ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
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(f123,plain,
! [X0] :
( nil = X0
| ? [X1] :
( ssList(X1)
& ? [X2] :
( ssItem(X2)
& cons(X2,X1) = X0 ) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f20]) ).
fof(f124,plain,
! [X0] :
( nil = X0
| ? [X1] :
( ssList(X1)
& ? [X2] :
( ssItem(X2)
& cons(X2,X1) = X0 ) )
| ~ ssList(X0) ),
inference(flattening,[],[f123]) ).
fof(f125,plain,
! [X0] :
( ! [X1] :
( nil != cons(X1,X0)
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f21]) ).
fof(f153,plain,
! [X0] :
( frontsegP(X0,X0)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f42]) ).
fof(f156,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ! [X3] :
( ( frontsegP(cons(X0,X2),cons(X1,X3))
<=> ( X0 = X1
& frontsegP(X2,X3) ) )
| ~ ssList(X3) )
| ~ ssList(X2) )
| ~ ssItem(X1) )
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f44]) ).
fof(f157,plain,
! [X0] :
( frontsegP(X0,nil)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f45]) ).
fof(f175,plain,
! [X0] :
( segmentP(X0,nil)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f57]) ).
fof(f182,plain,
! [X0] :
( strictorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f68]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& frontsegP(X3,X2)
& strictorderedP(X2)
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ frontsegP(X1,X4)
| ~ frontsegP(X0,X4) )
& ! [X5] :
( ~ ssList(X5)
| ~ neq(X2,X5)
| ~ frontsegP(X3,X5)
| ~ segmentP(X5,X2)
| ~ strictorderedP(X5) )
& ( nil != X1
| nil != X0 )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f222,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& frontsegP(X3,X2)
& strictorderedP(X2)
& ! [X4] :
( ~ ssList(X4)
| ~ neq(X4,nil)
| ~ frontsegP(X1,X4)
| ~ frontsegP(X0,X4) )
& ! [X5] :
( ~ ssList(X5)
| ~ neq(X2,X5)
| ~ frontsegP(X3,X5)
| ~ segmentP(X5,X2)
| ~ strictorderedP(X5) )
& ( nil != X1
| nil != X0 )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f303,plain,
! [X0,X1] :
( neq(X0,X1)
| ~ ssList(X1)
| X0 = X1
| ~ ssList(X0) ),
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(f310,plain,
! [X0] :
( ~ ssList(X0)
| cons(sK44(X0),sK43(X0)) = X0
| nil = X0 ),
inference(cnf_transformation,[],[f124]) ).
fof(f311,plain,
! [X0] :
( ssItem(sK44(X0))
| ~ ssList(X0)
| nil = X0 ),
inference(cnf_transformation,[],[f124]) ).
fof(f312,plain,
! [X0] :
( ssList(sK43(X0))
| ~ ssList(X0)
| nil = X0 ),
inference(cnf_transformation,[],[f124]) ).
fof(f313,plain,
! [X0,X1] :
( nil != cons(X1,X0)
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f125]) ).
fof(f340,plain,
! [X0] :
( frontsegP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f153]) ).
fof(f344,plain,
! [X2,X3,X0,X1] :
( ~ ssItem(X0)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ frontsegP(X2,X3)
| X0 != X1
| frontsegP(cons(X0,X2),cons(X1,X3)) ),
inference(cnf_transformation,[],[f156]) ).
fof(f345,plain,
! [X0] :
( frontsegP(X0,nil)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f157]) ).
fof(f359,plain,
! [X0] :
( segmentP(X0,nil)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f175]) ).
fof(f374,plain,
! [X0] :
( strictorderedP(cons(X0,nil))
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f182]) ).
fof(f411,plain,
! [X4] :
( ~ frontsegP(sK47,X4)
| ~ frontsegP(sK48,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(cnf_transformation,[],[f222]) ).
fof(f412,plain,
! [X5] :
( ~ segmentP(X5,sK49)
| ~ strictorderedP(X5)
| ~ frontsegP(sK50,X5)
| ~ neq(sK49,X5)
| ~ ssList(X5) ),
inference(cnf_transformation,[],[f222]) ).
fof(f413,plain,
( nil != sK47
| nil != sK48 ),
inference(cnf_transformation,[],[f222]) ).
fof(f414,plain,
ssList(sK50),
inference(cnf_transformation,[],[f222]) ).
fof(f416,plain,
frontsegP(sK50,sK49),
inference(cnf_transformation,[],[f222]) ).
fof(f417,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f222]) ).
fof(f418,plain,
sK48 = sK50,
inference(cnf_transformation,[],[f222]) ).
fof(f419,plain,
ssList(sK49),
inference(cnf_transformation,[],[f222]) ).
fof(f424,plain,
( nil != sK49
| nil != sK50 ),
inference(definition_unfolding,[],[f413,f417,f418]) ).
fof(f425,plain,
! [X4] :
( ~ frontsegP(sK50,X4)
| ~ frontsegP(sK49,X4)
| ~ neq(X4,nil)
| ~ ssList(X4) ),
inference(definition_unfolding,[],[f411,f417,f418]) ).
fof(f442,plain,
! [X2,X3,X1] :
( ~ ssItem(X1)
| ~ ssItem(X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ frontsegP(X2,X3)
| frontsegP(cons(X1,X2),cons(X1,X3)) ),
inference(equality_resolution,[],[f344]) ).
fof(f453,plain,
! [X2,X3,X1] :
( frontsegP(cons(X1,X2),cons(X1,X3))
| ~ ssList(X2)
| ~ ssList(X3)
| ~ frontsegP(X2,X3)
| ~ ssItem(X1) ),
inference(duplicate_literal_removal,[],[f442]) ).
fof(f459,definition,
( spl51_1
<=> nil = sK50 ),
introduced(definition,[new_symbols(definition,[spl51_1])],[avatar_definition]) ).
fof(f461,plain,
( nil != sK50
| spl51_1 ),
inference(avatar_component_clause,[],[f459]) ).
fof(f463,definition,
( spl51_2
<=> nil = sK49 ),
introduced(definition,[new_symbols(definition,[spl51_2])],[avatar_definition]) ).
fof(f464,plain,
( nil = sK49
| ~ spl51_2 ),
inference(avatar_component_clause,[],[f463]) ).
fof(f465,plain,
( nil != sK49
| spl51_2 ),
inference(avatar_component_clause,[],[f463]) ).
fof(f466,plain,
( ~ spl51_1
| ~ spl51_2 ),
inference(avatar_split_clause,[],[f424,f463,f459]) ).
fof(f499,plain,
( ~ frontsegP(sK49,sK49)
| ~ neq(sK49,nil)
| ~ ssList(sK49) ),
inference(resolution,[],[f425,f416]) ).
fof(f500,plain,
( ~ frontsegP(sK49,sK49)
| ~ neq(sK49,nil) ),
inference(forward_subsumption_resolution,[],[f499,f419]) ).
fof(f502,definition,
( spl51_10
<=> neq(sK49,nil) ),
introduced(definition,[new_symbols(definition,[spl51_10])],[avatar_definition]) ).
fof(f504,plain,
( ~ neq(sK49,nil)
| spl51_10 ),
inference(avatar_component_clause,[],[f502]) ).
fof(f506,definition,
( spl51_11
<=> frontsegP(sK49,sK49) ),
introduced(definition,[new_symbols(definition,[spl51_11])],[avatar_definition]) ).
fof(f508,plain,
( ~ frontsegP(sK49,sK49)
| spl51_11 ),
inference(avatar_component_clause,[],[f506]) ).
fof(f509,plain,
( ~ spl51_10
| ~ spl51_11 ),
inference(avatar_split_clause,[],[f500,f506,f502]) ).
fof(f576,plain,
( ~ ssList(nil)
| nil = sK49
| ~ ssList(sK49)
| spl51_10 ),
inference(resolution,[],[f303,f504]) ).
fof(f587,plain,
( nil = sK49
| ~ ssList(sK49)
| spl51_10 ),
inference(forward_subsumption_resolution,[],[f576,f306]) ).
fof(f589,plain,
( nil = sK49
| spl51_10 ),
inference(forward_subsumption_resolution,[],[f587,f419]) ).
fof(f595,plain,
( ~ ssList(sK49)
| spl51_11 ),
inference(resolution,[],[f508,f340]) ).
fof(f596,plain,
( $false
| spl51_11 ),
inference(forward_subsumption_resolution,[],[f595,f419]) ).
fof(f597,plain,
spl51_11,
inference(avatar_contradiction_clause,[],[f596]) ).
fof(f598,plain,
( $false
| spl51_2
| spl51_10 ),
inference(forward_subsumption_resolution,[],[f589,f465]) ).
fof(f599,plain,
( spl51_2
| spl51_10 ),
inference(avatar_contradiction_clause,[],[f598]) ).
fof(f600,plain,
( ! [X0] :
( ~ segmentP(X0,nil)
| ~ strictorderedP(X0)
| ~ frontsegP(sK50,X0)
| ~ neq(nil,X0)
| ~ ssList(X0) )
| ~ spl51_2 ),
inference(superposition,[],[f412,f464]) ).
fof(f605,plain,
( ! [X0] :
( ~ frontsegP(sK50,X0)
| ~ strictorderedP(X0)
| ~ neq(nil,X0)
| ~ ssList(X0) )
| ~ spl51_2 ),
inference(forward_subsumption_resolution,[],[f600,f359]) ).
fof(f1841,plain,
( sK50 = cons(sK44(sK50),sK43(sK50))
| nil = sK50 ),
inference(resolution,[],[f310,f414]) ).
fof(f1842,plain,
( sK50 = cons(sK44(sK50),sK43(sK50))
| spl51_1 ),
inference(forward_subsumption_resolution,[],[f1841,f461]) ).
fof(f1861,definition,
( spl51_45
<=> ssList(sK43(sK50)) ),
introduced(definition,[new_symbols(definition,[spl51_45])],[avatar_definition]) ).
fof(f1863,plain,
( ~ ssList(sK43(sK50))
| spl51_45 ),
inference(avatar_component_clause,[],[f1861]) ).
fof(f1865,definition,
( spl51_46
<=> ssItem(sK44(sK50)) ),
introduced(definition,[new_symbols(definition,[spl51_46])],[avatar_definition]) ).
fof(f1866,plain,
( ssItem(sK44(sK50))
| ~ spl51_46 ),
inference(avatar_component_clause,[],[f1865]) ).
fof(f1867,plain,
( ~ ssItem(sK44(sK50))
| spl51_46 ),
inference(avatar_component_clause,[],[f1865]) ).
fof(f2518,plain,
( ! [X0] :
( frontsegP(sK50,cons(sK44(sK50),X0))
| ~ ssList(sK43(sK50))
| ~ ssList(X0)
| ~ frontsegP(sK43(sK50),X0)
| ~ ssItem(sK44(sK50)) )
| spl51_1 ),
inference(superposition,[],[f453,f1842]) ).
fof(f2525,definition,
( spl51_60
<=> ! [X0] :
( frontsegP(sK50,cons(sK44(sK50),X0))
| ~ frontsegP(sK43(sK50),X0)
| ~ ssList(X0) ) ),
introduced(definition,[new_symbols(definition,[spl51_60])],[avatar_definition]) ).
fof(f2526,plain,
( ! [X0] :
( ~ frontsegP(sK43(sK50),X0)
| frontsegP(sK50,cons(sK44(sK50),X0))
| ~ ssList(X0) )
| ~ spl51_60 ),
inference(avatar_component_clause,[],[f2525]) ).
fof(f2527,plain,
( ~ spl51_46
| ~ spl51_45
| spl51_60
| spl51_1 ),
inference(avatar_split_clause,[],[f2518,f459,f2525,f1861,f1865]) ).
fof(f2568,plain,
( frontsegP(sK50,cons(sK44(sK50),nil))
| ~ ssList(nil)
| ~ ssList(sK43(sK50))
| ~ spl51_60 ),
inference(resolution,[],[f2526,f345]) ).
fof(f2570,plain,
( frontsegP(sK50,cons(sK44(sK50),nil))
| ~ ssList(sK43(sK50))
| ~ spl51_60 ),
inference(forward_subsumption_resolution,[],[f2568,f306]) ).
fof(f2573,definition,
( spl51_62
<=> frontsegP(sK50,cons(sK44(sK50),nil)) ),
introduced(definition,[new_symbols(definition,[spl51_62])],[avatar_definition]) ).
fof(f2575,plain,
( frontsegP(sK50,cons(sK44(sK50),nil))
| ~ spl51_62 ),
inference(avatar_component_clause,[],[f2573]) ).
fof(f2576,plain,
( ~ spl51_45
| spl51_62
| ~ spl51_60 ),
inference(avatar_split_clause,[],[f2570,f2525,f2573,f1861]) ).
fof(f2577,plain,
( ~ strictorderedP(cons(sK44(sK50),nil))
| ~ neq(nil,cons(sK44(sK50),nil))
| ~ ssList(cons(sK44(sK50),nil))
| ~ spl51_2
| ~ spl51_62 ),
inference(resolution,[],[f2575,f605]) ).
fof(f2589,definition,
( spl51_63
<=> ssList(cons(sK44(sK50),nil)) ),
introduced(definition,[new_symbols(definition,[spl51_63])],[avatar_definition]) ).
fof(f2591,plain,
( ~ ssList(cons(sK44(sK50),nil))
| spl51_63 ),
inference(avatar_component_clause,[],[f2589]) ).
fof(f2593,definition,
( spl51_64
<=> neq(nil,cons(sK44(sK50),nil)) ),
introduced(definition,[new_symbols(definition,[spl51_64])],[avatar_definition]) ).
fof(f2595,plain,
( ~ neq(nil,cons(sK44(sK50),nil))
| spl51_64 ),
inference(avatar_component_clause,[],[f2593]) ).
fof(f2597,definition,
( spl51_65
<=> strictorderedP(cons(sK44(sK50),nil)) ),
introduced(definition,[new_symbols(definition,[spl51_65])],[avatar_definition]) ).
fof(f2599,plain,
( ~ strictorderedP(cons(sK44(sK50),nil))
| spl51_65 ),
inference(avatar_component_clause,[],[f2597]) ).
fof(f2600,plain,
( ~ spl51_63
| ~ spl51_64
| ~ spl51_65
| ~ spl51_2
| ~ spl51_62 ),
inference(avatar_split_clause,[],[f2577,f2573,f463,f2597,f2593,f2589]) ).
fof(f2632,plain,
( ~ ssItem(sK44(sK50))
| spl51_65 ),
inference(resolution,[],[f2599,f374]) ).
fof(f2707,plain,
( ~ ssList(sK50)
| nil = sK50
| spl51_65 ),
inference(resolution,[],[f2632,f311]) ).
fof(f2708,plain,
( nil = sK50
| spl51_65 ),
inference(forward_subsumption_resolution,[],[f2707,f414]) ).
fof(f2709,plain,
( $false
| spl51_1
| spl51_65 ),
inference(forward_subsumption_resolution,[],[f2708,f461]) ).
fof(f2710,plain,
( spl51_1
| spl51_65 ),
inference(avatar_contradiction_clause,[],[f2709]) ).
fof(f2713,plain,
( ~ ssList(cons(sK44(sK50),nil))
| nil = cons(sK44(sK50),nil)
| ~ ssList(nil)
| spl51_64 ),
inference(resolution,[],[f2595,f303]) ).
fof(f2716,definition,
( spl51_76
<=> nil = cons(sK44(sK50),nil) ),
introduced(definition,[new_symbols(definition,[spl51_76])],[avatar_definition]) ).
fof(f2718,plain,
( nil = cons(sK44(sK50),nil)
| ~ spl51_76 ),
inference(avatar_component_clause,[],[f2716]) ).
fof(f2724,plain,
( ~ ssList(cons(sK44(sK50),nil))
| nil = cons(sK44(sK50),nil)
| spl51_64 ),
inference(forward_subsumption_resolution,[],[f2713,f306]) ).
fof(f2725,plain,
( spl51_76
| ~ spl51_63
| spl51_64 ),
inference(avatar_split_clause,[],[f2724,f2593,f2589,f2716]) ).
fof(f2925,plain,
( nil != nil
| ~ ssItem(sK44(sK50))
| ~ ssList(nil)
| ~ spl51_76 ),
inference(superposition,[],[f313,f2718]) ).
fof(f2931,plain,
( ~ ssItem(sK44(sK50))
| ~ ssList(nil)
| ~ spl51_76 ),
inference(trivial_inequality_removal,[],[f2925]) ).
fof(f2938,plain,
( ~ ssItem(sK44(sK50))
| ~ spl51_76 ),
inference(forward_subsumption_resolution,[],[f2931,f306]) ).
fof(f3007,plain,
( ~ ssList(sK50)
| nil = sK50
| ~ spl51_76 ),
inference(resolution,[],[f2938,f311]) ).
fof(f3008,plain,
( nil = sK50
| ~ spl51_76 ),
inference(forward_subsumption_resolution,[],[f3007,f414]) ).
fof(f3009,plain,
( $false
| spl51_1
| ~ spl51_76 ),
inference(forward_subsumption_resolution,[],[f3008,f461]) ).
fof(f3010,plain,
( spl51_1
| ~ spl51_76 ),
inference(avatar_contradiction_clause,[],[f3009]) ).
fof(f3011,plain,
( ~ ssList(sK50)
| nil = sK50
| spl51_45 ),
inference(resolution,[],[f1863,f312]) ).
fof(f3012,plain,
( nil = sK50
| spl51_45 ),
inference(forward_subsumption_resolution,[],[f3011,f414]) ).
fof(f3013,plain,
( $false
| spl51_1
| spl51_45 ),
inference(forward_subsumption_resolution,[],[f3012,f461]) ).
fof(f3014,plain,
( spl51_1
| spl51_45 ),
inference(avatar_contradiction_clause,[],[f3013]) ).
fof(f3055,plain,
( ~ ssList(sK50)
| nil = sK50
| spl51_46 ),
inference(resolution,[],[f1867,f311]) ).
fof(f3056,plain,
( nil = sK50
| spl51_46 ),
inference(forward_subsumption_resolution,[],[f3055,f414]) ).
fof(f3057,plain,
( $false
| spl51_1
| spl51_46 ),
inference(forward_subsumption_resolution,[],[f3056,f461]) ).
fof(f3058,plain,
( spl51_1
| spl51_46 ),
inference(avatar_contradiction_clause,[],[f3057]) ).
fof(f3644,plain,
( ~ ssItem(sK44(sK50))
| ~ ssList(nil)
| spl51_63 ),
inference(resolution,[],[f2591,f305]) ).
fof(f3645,plain,
( ~ ssList(nil)
| ~ spl51_46
| spl51_63 ),
inference(forward_subsumption_resolution,[],[f3644,f1866]) ).
fof(f3646,plain,
( $false
| ~ spl51_46
| spl51_63 ),
inference(forward_subsumption_resolution,[],[f3645,f306]) ).
fof(f3647,plain,
( ~ spl51_46
| spl51_63 ),
inference(avatar_contradiction_clause,[],[f3646]) ).
cnf(s1,plain,
( ~ spl51_1
| ~ spl51_2 ),
inference(sat_conversion,[],[f466]) ).
cnf(s8,plain,
( ~ spl51_10
| ~ spl51_11 ),
inference(sat_conversion,[],[f509]) ).
cnf(s15,plain,
spl51_11,
inference(sat_conversion,[],[f597]) ).
cnf(s16,plain,
( spl51_2
| spl51_10 ),
inference(sat_conversion,[],[f599]) ).
cnf(s59,plain,
( spl51_1
| ~ spl51_45
| ~ spl51_46
| spl51_60 ),
inference(sat_conversion,[],[f2527]) ).
cnf(s61,plain,
( ~ spl51_45
| ~ spl51_60
| spl51_62 ),
inference(sat_conversion,[],[f2576]) ).
cnf(s62,plain,
( ~ spl51_2
| ~ spl51_62
| ~ spl51_63
| ~ spl51_64
| ~ spl51_65 ),
inference(sat_conversion,[],[f2600]) ).
cnf(s71,plain,
( spl51_1
| spl51_65 ),
inference(sat_conversion,[],[f2710]) ).
cnf(s73,plain,
( ~ spl51_63
| spl51_64
| spl51_76 ),
inference(sat_conversion,[],[f2725]) ).
cnf(s90,plain,
( spl51_1
| ~ spl51_76 ),
inference(sat_conversion,[],[f3010]) ).
cnf(s91,plain,
( spl51_1
| spl51_45 ),
inference(sat_conversion,[],[f3014]) ).
cnf(s96,plain,
( spl51_1
| spl51_46 ),
inference(sat_conversion,[],[f3058]) ).
cnf(s120,plain,
( ~ spl51_46
| spl51_63 ),
inference(sat_conversion,[],[f3647]) ).
cnf(s121,plain,
~ spl51_10,
inference(rat,[],[s8,s15]) ).
cnf(s122,plain,
spl51_2,
inference(rat,[],[s16,s121]) ).
cnf(s131,plain,
~ spl51_1,
inference(rat,[],[s1,s122]) ).
cnf(s132,plain,
spl51_46,
inference(rat,[],[s96,s131]) ).
cnf(s133,plain,
spl51_45,
inference(rat,[],[s91,s131]) ).
cnf(s134,plain,
~ spl51_76,
inference(rat,[],[s90,s131]) ).
cnf(s135,plain,
spl51_65,
inference(rat,[],[s71,s131]) ).
cnf(s138,plain,
spl51_63,
inference(rat,[],[s120,s132]) ).
cnf(s139,plain,
spl51_60,
inference(rat,[],[s59,s131,s132,s133]) ).
cnf(s147,plain,
spl51_64,
inference(rat,[],[s73,s134,s138]) ).
cnf(s148,plain,
~ spl51_62,
inference(rat,[],[s62,s135,s147,s122,s138]) ).
cnf(s149,plain,
$false,
inference(rat,[],[s61,s133,s148,s139]) ).
fof(f3648,plain,
$false,
inference(avatar_sat_refutation,[],[s149]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SWC021+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.03 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.03/0.31 % Computer : n012.cluster.edu
% 0.03/0.31 % Model : x86_64 x86_64
% 0.03/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.03/0.31 % Memory : 8046.5625MB
% 0.03/0.31 % OS : Linux 6.8.0-71-generic
% 0.03/0.31 % CPULimit : 300
% 0.03/0.31 % WCLimit : 300
% 0.03/0.31 % DateTime : Mon Sep 28 07:27:04 UTC 2026
% 0.03/0.31 % CPUTime :
% 0.03/0.31 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.07/0.33 Running first-order model finding
% 0.07/0.33 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.58/0.47 % (3213854)Will run a generic schedule for satisfiability detection.
% 0.58/0.47 % (3213860)% WARNING: option uhcvi not known.
% 0.58/0.47 % (3213859)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2139179606_2999 on theBenchmark for (2999ds/0Mi)
% 0.58/0.47 % (3213863)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1593003208:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.58/0.47 % (3213862)dis+10_1_sil=32000:sp=arity:random_seed=3773402825:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.58/0.47 % (3213864)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=4089286833:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.58/0.47 % (3213860)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=891066782:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.58/0.47 % (3213861)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=1140107770:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.58/0.47 % (3213865)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=683450867:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.58/0.47 % TRYING [1]
% 0.58/0.47 % TRYING [2]
% 0.58/0.47 % TRYING [3]
% 0.58/0.47 % TRYING [4]
% 0.58/0.47 % (3213862)Instruction limit reached!
% 0.58/0.47 % (3213862)------------------------------
% 0.58/0.47 % (3213862)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.58/0.47 % (3213862)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.58/0.47 % (3213862)CaDiCaL version: 2.1.3
% 0.58/0.47 % (3213862)Termination reason: Instruction limit
% 0.58/0.47 % (3213862)Termination phase: Saturation
% 0.58/0.47 % (3213862)Time elapsed: 0.034 s
% 0.58/0.47 % (3213862)Peak memory usage: 13 MB
% 0.58/0.47 % (3213862)Instructions burned: 105 (million)
% 0.58/0.47 % (3213863)Instruction limit reached!
% 0.58/0.47 % (3213863)------------------------------
% 0.58/0.47 % (3213863)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.58/0.47 % (3213863)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.58/0.47 % (3213863)CaDiCaL version: 2.1.3
% 0.58/0.47 % (3213863)Termination reason: Instruction limit
% 0.58/0.47 % (3213863)Termination phase: Saturation
% 0.58/0.47 % (3213863)Time elapsed: 0.038 s
% 0.58/0.47 % (3213863)Peak memory usage: 13 MB
% 0.58/0.47 % (3213863)Instructions burned: 116 (million)
% 0.58/0.47 % (3213864)Instruction limit reached!
% 0.58/0.47 % (3213864)------------------------------
% 0.58/0.47 % (3213864)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.58/0.47 % (3213864)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.58/0.47 % (3213864)CaDiCaL version: 2.1.3
% 0.58/0.47 % (3213864)Termination reason: Instruction limit
% 0.58/0.47 % (3213864)Termination phase: Saturation
% 0.58/0.47 % (3213864)Time elapsed: 0.043 s
% 0.58/0.47 % (3213864)Peak memory usage: 14 MB
% 0.58/0.47 % (3213864)Instructions burned: 133 (million)
% 0.58/0.47 % (3213873)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=592220608:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.58/0.47 % TRYING [5]
% 0.58/0.47 % (3213874)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=4143445506:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 0.58/0.47 % TRYING [1]
% 0.58/0.47 % (3213875)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=1917846106:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 0.58/0.47 % TRYING [2]
% 0.58/0.47 % TRYING [3]
% 0.58/0.47 % (3213865)Instruction limit reached!
% 0.58/0.47 % (3213865)------------------------------
% 0.58/0.47 % (3213865)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.58/0.47 % (3213865)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.58/0.47 % (3213865)CaDiCaL version: 2.1.3
% 0.58/0.47 % (3213865)Termination reason: Instruction limit
% 0.58/0.47 % (3213865)Termination phase: Saturation
% 0.58/0.47 % (3213865)Time elapsed: 0.057 s
% 0.58/0.47 % (3213865)Peak memory usage: 15 MB
% 0.58/0.47 % (3213865)Instructions burned: 162 (million)
% 0.58/0.47 % TRYING [4]
% 0.58/0.47 % (3213879)ott-21_1_sil=16000:fs=off:random_seed=2007639896:i=180:av=off:fsr=off_2999 on theBenchmark for (2999ds/180Mi)
% 0.58/0.47 % (3213874)Instruction limit reached!
% 0.58/0.47 % (3213874)------------------------------
% 0.58/0.47 % (3213874)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.58/0.47 % (3213874)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.58/0.47 % (3213874)CaDiCaL version: 2.1.3
% 0.58/0.47 % (3213874)Termination reason: Instruction limit
% 0.58/0.47 % (3213874)Termination phase: Saturation
% 0.58/0.47 % (3213874)Time elapsed: 0.041 s
% 0.58/0.47 % (3213874)Peak memory usage: 13 MB
% 0.58/0.47 % (3213874)Instructions burned: 134 (million)
% 0.58/0.47 % TRYING [5]
% 0.58/0.47 % (3213875) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-3213854-3213875"...
% 0.58/0.47 % (3213875)...printing done.
% 0.58/0.47 % (3213875)Refutation found. Thanks to Tanya!
% 0.58/0.47 % SZS status Theorem for theBenchmark
% 0.58/0.47 % SZS output start Proof for theBenchmark
% See solution above
% 0.58/0.47 % (3213875)------------------------------
% 0.58/0.47 % (3213875)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.58/0.47 % (3213875)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.58/0.47 % (3213875)CaDiCaL version: 2.1.3
% 0.58/0.47 % (3213875)Termination reason: Refutation
% 0.58/0.47 % (3213875)Time elapsed: 0.046 s
% 0.58/0.47 % (3213875)Peak memory usage: 14 MB
% 0.58/0.47 % (3213875)Instructions burned: 137 (million)
% 0.58/0.47 % (3213854)Success in time 0.132 s
% 0.58/0.47 % Vampire exiting
%------------------------------------------------------------------------------