%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC229+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 : 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:11 PM UTC 2026
% Result : Theorem 0.20s 0.37s
% Output : Refutation 0.52s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 12
% Syntax : Number of formulae : 96 ( 17 unt; 4 def)
% Number of atoms : 361 ( 72 equ)
% Maximal formula atoms : 19 ( 3 avg)
% Number of connectives : 456 ( 191 ~; 179 |; 59 &)
% ( 10 <=>; 17 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 5 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-3 aty)
% Number of variables : 94 ( 0 sgn 74 !; 20 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0] :
( ssList(X0)
=> ( singletonP(X0)
<=> ? [X1] :
( ssItem(X1)
& cons(X1,nil) = X0 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax4) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax15) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).
fof(f28,axiom,
! [X0] :
( ssList(X0)
=> app(nil,X0) = X0 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax28) ).
fof(f38,axiom,
! [X0] :
( ssItem(X0)
=> ~ memberP(nil,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax38) ).
fof(f58,axiom,
! [X0] :
( ssList(X0)
=> ( segmentP(nil,X0)
<=> nil = X0 ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax58) ).
fof(f84,axiom,
! [X0] :
( ssList(X0)
=> app(X0,nil) = X0 ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax84) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ~ segmentP(X3,X2)
| nil = X0
| ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& app(app(X5,cons(X4,nil)),X6) = X0
& ! [X7] :
( ssItem(X7)
=> ( ~ memberP(X5,X7)
| ~ memberP(X6,X7)
| ~ leq(X4,X7)
| leq(X7,X4) ) ) ) ) )
| ( ~ singletonP(X2)
& neq(X3,nil) ) ) ) ) ) ),
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
| ~ segmentP(X3,X2)
| nil = X0
| ? [X4] :
( ssItem(X4)
& ? [X5] :
( ssList(X5)
& ? [X6] :
( ssList(X6)
& app(app(X5,cons(X4,nil)),X6) = X0
& ! [X7] :
( ssItem(X7)
=> ( ~ memberP(X5,X7)
| ~ memberP(X6,X7)
| ~ leq(X4,X7)
| leq(X7,X4) ) ) ) ) )
| ( ~ singletonP(X2)
& 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(f118,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f134,plain,
! [X0] :
( app(nil,X0) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f28]) ).
fof(f148,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f38]) ).
fof(f176,plain,
! [X0] :
( ( segmentP(nil,X0)
<=> nil = X0 )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f58]) ).
fof(f201,plain,
! [X0] :
( app(X0,nil) = X0
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f84]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& segmentP(X3,X2)
& nil != X0
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != X0
| ? [X7] :
( memberP(X5,X7)
& memberP(X6,X7)
& leq(X4,X7)
& ~ leq(X7,X4)
& ssItem(X7) ) ) ) )
& ( singletonP(X2)
| ~ 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
& segmentP(X3,X2)
& nil != X0
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != X0
| ? [X7] :
( memberP(X5,X7)
& memberP(X6,X7)
& leq(X4,X7)
& ~ leq(X7,X4)
& ssItem(X7) ) ) ) )
& ( singletonP(X2)
| ~ neq(X3,nil) )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f221]) ).
fof(f237,plain,
! [X0] :
( ( ( singletonP(X0)
| ! [X1] :
( ~ ssItem(X1)
| cons(X1,nil) != X0 ) )
& ( ? [X1] :
( ssItem(X1)
& cons(X1,nil) = X0 )
| ~ singletonP(X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f100]) ).
fof(f238,plain,
! [X0] :
( ( ( singletonP(X0)
| ! [X1] :
( ~ ssItem(X1)
| cons(X1,nil) != X0 ) )
& ( ? [X2] :
( ssItem(X2)
& cons(X2,nil) = X0 )
| ~ singletonP(X0) ) )
| ~ ssList(X0) ),
inference(rectify,[],[f237]) ).
fof(f239,plain,
! [X0] :
( ( ( singletonP(X0)
| ! [X1] :
( ~ ssItem(X1)
| cons(X1,nil) != X0 ) )
& ( ( ssItem(sK10(X0))
& cons(sK10(X0),nil) = X0 )
| ~ singletonP(X0) ) )
| ~ ssList(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK10]),skolemize(X2,sK10(X0))],[f238]) ).
fof(f273,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f118]) ).
fof(f285,plain,
! [X0] :
( ( ( segmentP(nil,X0)
| nil != X0 )
& ( nil = X0
| ~ segmentP(nil,X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f176]) ).
fof(f296,plain,
( sK54 = sK56
& sK53 = sK55
& segmentP(sK56,sK55)
& nil != sK53
& ! [X4] :
( ~ ssItem(X4)
| ! [X5] :
( ~ ssList(X5)
| ! [X6] :
( ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != sK53
| ( memberP(X5,sK57(X4,X5,X6))
& memberP(X6,sK57(X4,X5,X6))
& leq(X4,sK57(X4,X5,X6))
& ~ leq(sK57(X4,X5,X6),X4)
& ssItem(sK57(X4,X5,X6)) ) ) ) )
& ( singletonP(sK55)
| ~ neq(sK56,nil) )
& ssList(sK56)
& ssList(sK55)
& ssList(sK54)
& ssList(sK53) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK53,sK54,sK55,sK56,sK57]),skolemize(X0,sK53),skolemize(X1,sK54),skolemize(X2,sK55),skolemize(X3,sK56),skolemize(X7,sK57(X4,X5,X6))],[f222]) ).
fof(f306,plain,
! [X0] :
( ~ singletonP(X0)
| cons(sK10(X0),nil) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f239]) ).
fof(f307,plain,
! [X0] :
( ssItem(sK10(X0))
| ~ singletonP(X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f239]) ).
fof(f387,plain,
! [X0,X1] :
( neq(X0,X1)
| X0 = X1
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f273]) ).
fof(f389,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f403,plain,
! [X0] :
( ~ ssList(X0)
| app(nil,X0) = X0 ),
inference(cnf_transformation,[],[f134]) ).
fof(f419,plain,
! [X0] :
( ~ memberP(nil,X0)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f148]) ).
fof(f443,plain,
! [X0] :
( ~ segmentP(nil,X0)
| nil = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f285]) ).
fof(f482,plain,
! [X0] :
( ~ ssList(X0)
| app(X0,nil) = X0 ),
inference(cnf_transformation,[],[f201]) ).
fof(f498,plain,
ssList(sK55),
inference(cnf_transformation,[],[f296]) ).
fof(f499,plain,
ssList(sK56),
inference(cnf_transformation,[],[f296]) ).
fof(f500,plain,
( singletonP(sK55)
| ~ neq(sK56,nil) ),
inference(cnf_transformation,[],[f296]) ).
fof(f501,plain,
! [X6,X4,X5] :
( ~ ssItem(X4)
| ~ ssList(X5)
| ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != sK53
| ssItem(sK57(X4,X5,X6)) ),
inference(cnf_transformation,[],[f296]) ).
fof(f505,plain,
! [X6,X4,X5] :
( ~ ssItem(X4)
| ~ ssList(X5)
| ~ ssList(X6)
| app(app(X5,cons(X4,nil)),X6) != sK53
| memberP(X5,sK57(X4,X5,X6)) ),
inference(cnf_transformation,[],[f296]) ).
fof(f506,plain,
nil != sK53,
inference(cnf_transformation,[],[f296]) ).
fof(f507,plain,
segmentP(sK56,sK55),
inference(cnf_transformation,[],[f296]) ).
fof(f508,plain,
sK53 = sK55,
inference(cnf_transformation,[],[f296]) ).
fof(f510,plain,
nil != sK55,
inference(definition_unfolding,[],[f506,f508]) ).
fof(f511,plain,
! [X6,X4,X5] :
( app(app(X5,cons(X4,nil)),X6) != sK55
| ~ ssList(X5)
| ~ ssList(X6)
| ~ ssItem(X4)
| memberP(X5,sK57(X4,X5,X6)) ),
inference(definition_unfolding,[],[f505,f508]) ).
fof(f515,plain,
! [X6,X4,X5] :
( app(app(X5,cons(X4,nil)),X6) != sK55
| ~ ssList(X5)
| ~ ssList(X6)
| ~ ssItem(X4)
| ssItem(sK57(X4,X5,X6)) ),
inference(definition_unfolding,[],[f501,f508]) ).
fof(f570,definition,
( spl58_6
<=> neq(sK56,nil) ),
introduced(definition,[new_symbols(definition,[spl58_6])],[avatar_definition]) ).
fof(f572,plain,
( ~ neq(sK56,nil)
| spl58_6 ),
inference(avatar_component_clause,[],[f570]) ).
fof(f574,definition,
( spl58_7
<=> singletonP(sK55) ),
introduced(definition,[new_symbols(definition,[spl58_7])],[avatar_definition]) ).
fof(f576,plain,
( singletonP(sK55)
| ~ spl58_7 ),
inference(avatar_component_clause,[],[f574]) ).
fof(f577,plain,
( ~ spl58_6
| spl58_7 ),
inference(avatar_split_clause,[],[f500,f574,f570]) ).
fof(f914,plain,
sK55 = app(nil,sK55),
inference(resolution,[],[f403,f498]) ).
fof(f934,plain,
sK55 = app(sK55,nil),
inference(resolution,[],[f482,f498]) ).
fof(f1873,definition,
( spl58_139
<=> nil = sK56 ),
introduced(definition,[new_symbols(definition,[spl58_139])],[avatar_definition]) ).
fof(f1875,plain,
( nil = sK56
| ~ spl58_139 ),
inference(avatar_component_clause,[],[f1873]) ).
fof(f2684,plain,
( nil = sK56
| ~ ssList(nil)
| ~ ssList(sK56)
| spl58_6 ),
inference(resolution,[],[f387,f572]) ).
fof(f2688,plain,
( nil = sK56
| ~ ssList(sK56)
| spl58_6 ),
inference(forward_subsumption_resolution,[],[f2684,f389]) ).
fof(f2689,plain,
( nil = sK56
| spl58_6 ),
inference(forward_subsumption_resolution,[],[f2688,f499]) ).
fof(f2690,plain,
( spl58_139
| spl58_6 ),
inference(avatar_split_clause,[],[f2689,f570,f1873]) ).
fof(f2692,plain,
( segmentP(nil,sK55)
| ~ spl58_139 ),
inference(superposition,[],[f507,f1875]) ).
fof(f2704,plain,
( nil = sK55
| ~ ssList(sK55)
| ~ spl58_139 ),
inference(resolution,[],[f2692,f443]) ).
fof(f2705,plain,
( ~ ssList(sK55)
| ~ spl58_139 ),
inference(forward_subsumption_resolution,[],[f2704,f510]) ).
fof(f2706,plain,
( $false
| ~ spl58_139 ),
inference(forward_subsumption_resolution,[],[f2705,f498]) ).
fof(f2707,plain,
~ spl58_139,
inference(avatar_contradiction_clause,[],[f2706]) ).
fof(f2708,plain,
( sK55 = cons(sK10(sK55),nil)
| ~ ssList(sK55)
| ~ spl58_7 ),
inference(resolution,[],[f576,f306]) ).
fof(f2709,plain,
( sK55 = cons(sK10(sK55),nil)
| ~ spl58_7 ),
inference(forward_subsumption_resolution,[],[f2708,f498]) ).
fof(f2716,plain,
( ! [X0,X1] :
( sK55 != app(app(X0,sK55),X1)
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssItem(sK10(sK55))
| ssItem(sK57(sK10(sK55),X0,X1)) )
| ~ spl58_7 ),
inference(superposition,[],[f515,f2709]) ).
fof(f2848,definition,
( spl58_149
<=> ssItem(sK10(sK55)) ),
introduced(definition,[new_symbols(definition,[spl58_149])],[avatar_definition]) ).
fof(f2849,plain,
( ssItem(sK10(sK55))
| ~ spl58_149 ),
inference(avatar_component_clause,[],[f2848]) ).
fof(f2850,plain,
( ~ ssItem(sK10(sK55))
| spl58_149 ),
inference(avatar_component_clause,[],[f2848]) ).
fof(f2858,plain,
( ~ singletonP(sK55)
| ~ ssList(sK55)
| spl58_149 ),
inference(resolution,[],[f2850,f307]) ).
fof(f2859,plain,
( ~ ssList(sK55)
| ~ spl58_7
| spl58_149 ),
inference(forward_subsumption_resolution,[],[f2858,f576]) ).
fof(f2860,plain,
( $false
| ~ spl58_7
| spl58_149 ),
inference(forward_subsumption_resolution,[],[f2859,f498]) ).
fof(f2861,plain,
( ~ spl58_7
| spl58_149 ),
inference(avatar_contradiction_clause,[],[f2860]) ).
fof(f2880,plain,
( ! [X0,X1] :
( sK55 != app(app(X0,sK55),X1)
| ~ ssList(X0)
| ~ ssList(X1)
| ~ ssItem(sK10(sK55))
| memberP(X0,sK57(sK10(sK55),X0,X1)) )
| ~ spl58_7 ),
inference(superposition,[],[f511,f2709]) ).
fof(f2881,plain,
( ! [X0,X1] :
( sK55 != app(app(X0,sK55),X1)
| ~ ssList(X0)
| ~ ssList(X1)
| memberP(X0,sK57(sK10(sK55),X0,X1)) )
| ~ spl58_7
| ~ spl58_149 ),
inference(forward_subsumption_resolution,[],[f2880,f2849]) ).
fof(f2893,plain,
( ! [X0] :
( sK55 != app(sK55,X0)
| ~ ssList(nil)
| ~ ssList(X0)
| memberP(nil,sK57(sK10(sK55),nil,X0)) )
| ~ spl58_7
| ~ spl58_149 ),
inference(superposition,[],[f2881,f914]) ).
fof(f2894,plain,
( ! [X0] :
( sK55 != app(sK55,X0)
| ~ ssList(X0)
| memberP(nil,sK57(sK10(sK55),nil,X0)) )
| ~ spl58_7
| ~ spl58_149 ),
inference(forward_subsumption_resolution,[],[f2893,f389]) ).
fof(f2913,plain,
( ! [X0,X1] :
( sK55 != app(app(X0,sK55),X1)
| ~ ssList(X0)
| ~ ssList(X1)
| ssItem(sK57(sK10(sK55),X0,X1)) )
| ~ spl58_7
| ~ spl58_149 ),
inference(forward_subsumption_resolution,[],[f2716,f2849]) ).
fof(f2917,plain,
( ! [X0] :
( sK55 != app(sK55,X0)
| ~ ssList(nil)
| ~ ssList(X0)
| ssItem(sK57(sK10(sK55),nil,X0)) )
| ~ spl58_7
| ~ spl58_149 ),
inference(superposition,[],[f2913,f914]) ).
fof(f2918,plain,
( ! [X0] :
( sK55 != app(sK55,X0)
| ~ ssList(X0)
| ssItem(sK57(sK10(sK55),nil,X0)) )
| ~ spl58_7
| ~ spl58_149 ),
inference(forward_subsumption_resolution,[],[f2917,f389]) ).
fof(f2927,plain,
( sK55 != sK55
| ~ ssList(nil)
| memberP(nil,sK57(sK10(sK55),nil,nil))
| ~ spl58_7
| ~ spl58_149 ),
inference(superposition,[],[f2894,f934]) ).
fof(f2928,plain,
( ~ ssList(nil)
| memberP(nil,sK57(sK10(sK55),nil,nil))
| ~ spl58_7
| ~ spl58_149 ),
inference(trivial_inequality_removal,[],[f2927]) ).
fof(f2929,plain,
( memberP(nil,sK57(sK10(sK55),nil,nil))
| ~ spl58_7
| ~ spl58_149 ),
inference(forward_subsumption_resolution,[],[f2928,f389]) ).
fof(f2938,plain,
( ~ ssItem(sK57(sK10(sK55),nil,nil))
| ~ spl58_7
| ~ spl58_149 ),
inference(resolution,[],[f2929,f419]) ).
fof(f2942,plain,
( sK55 != sK55
| ~ ssList(nil)
| ssItem(sK57(sK10(sK55),nil,nil))
| ~ spl58_7
| ~ spl58_149 ),
inference(superposition,[],[f2918,f934]) ).
fof(f2943,plain,
( ~ ssList(nil)
| ssItem(sK57(sK10(sK55),nil,nil))
| ~ spl58_7
| ~ spl58_149 ),
inference(trivial_inequality_removal,[],[f2942]) ).
fof(f2944,plain,
( ssItem(sK57(sK10(sK55),nil,nil))
| ~ spl58_7
| ~ spl58_149 ),
inference(forward_subsumption_resolution,[],[f2943,f389]) ).
fof(f2945,plain,
( $false
| ~ spl58_7
| ~ spl58_149 ),
inference(forward_subsumption_resolution,[],[f2944,f2938]) ).
fof(f2946,plain,
( ~ spl58_7
| ~ spl58_149 ),
inference(avatar_contradiction_clause,[],[f2945]) ).
cnf(s232,plain,
( ~ spl58_6
| spl58_7 ),
inference(sat_conversion,[],[f577]) ).
cnf(s1610,plain,
( spl58_6
| spl58_139 ),
inference(sat_conversion,[],[f2690]) ).
cnf(s1620,plain,
~ spl58_139,
inference(sat_conversion,[],[f2707]) ).
cnf(s1705,plain,
( ~ spl58_7
| spl58_149 ),
inference(sat_conversion,[],[f2861]) ).
cnf(s1763,plain,
( ~ spl58_7
| ~ spl58_149 ),
inference(sat_conversion,[],[f2946]) ).
cnf(s1764,plain,
spl58_6,
inference(rat,[],[s1610,s1620]) ).
cnf(s1768,plain,
spl58_7,
inference(rat,[],[s232,s1764]) ).
cnf(s1769,plain,
~ spl58_149,
inference(rat,[],[s1763,s1768]) ).
cnf(s1776,plain,
$false,
inference(rat,[],[s1705,s1769,s1768]) ).
fof(f2947,plain,
$false,
inference(avatar_sat_refutation,[],[s1776]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC229+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.06 % Command : run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.19 % Computer : n001.cluster.edu
% 0.09/0.19 % Model : x86_64 x86_64
% 0.09/0.19 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.19 % Memory : 8046.5625MB
% 0.09/0.19 % OS : Linux 6.8.0-71-generic
% 0.09/0.19 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Mon Sep 28 08:40:17 UTC 2026
% 0.09/0.20 % CPUTime :
% 0.09/0.20 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.09/0.23 Running first-order model finding
% 0.09/0.23 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.20/0.37 % (218991)Will run a generic schedule for satisfiability detection.
% 0.20/0.37 % (219002)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=541576244:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 0.20/0.37 % (218997)% WARNING: option uhcvi not known.
% 0.20/0.37 % (218998)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=3510900180:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 0.20/0.37 % (219000)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=886518217:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 0.20/0.37 % (218996)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=2211558299_2999 on theBenchmark for (2999ds/0Mi)
% 0.20/0.37 % (218999)dis+10_1_sil=32000:sp=arity:random_seed=969510179:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 0.20/0.37 % (218997)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2021140516:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 0.20/0.37 % (219001)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=2375941462:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.37 % TRYING [1]
% 0.20/0.37 % TRYING [2]
% 0.20/0.37 % TRYING [3]
% 0.20/0.37 % TRYING [4]
% 0.20/0.37 % (219002)Instruction limit reached!
% 0.20/0.37 % (219002)------------------------------
% 0.20/0.37 % (219002)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.37 % (219002)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.37 % (219002)CaDiCaL version: 2.1.3
% 0.20/0.37 % (219002)Termination reason: Instruction limit
% 0.20/0.37 % (219002)Termination phase: Saturation
% 0.20/0.37 % (219002)Time elapsed: 0.057 s
% 0.20/0.37 % (219002)Peak memory usage: 15 MB
% 0.20/0.37 % (219002)Instructions burned: 159 (million)
% 0.20/0.37 % (218999)Instruction limit reached!
% 0.20/0.37 % (218999)------------------------------
% 0.20/0.37 % (218999)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.37 % (218999)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.37 % (218999)CaDiCaL version: 2.1.3
% 0.20/0.37 % (218999)Termination reason: Instruction limit
% 0.20/0.37 % (218999)Termination phase: Saturation
% 0.20/0.37 % (218999)Time elapsed: 0.060 s
% 0.20/0.37 % (218999)Peak memory usage: 13 MB
% 0.20/0.37 % (218999)Instructions burned: 104 (million)
% 0.20/0.37 % (219000)Instruction limit reached!
% 0.20/0.37 % (219000)------------------------------
% 0.20/0.37 % (219000)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.37 % (219000)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.37 % (219000)CaDiCaL version: 2.1.3
% 0.20/0.37 % (219000)Termination reason: Instruction limit
% 0.20/0.37 % (219000)Termination phase: Saturation
% 0.20/0.37 % (219000)Time elapsed: 0.062 s
% 0.20/0.37 % (219000)Peak memory usage: 14 MB
% 0.20/0.37 % (219000)Instructions burned: 117 (million)
% 0.20/0.37 % (219010)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1983360989:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 0.20/0.37 % (219001)Instruction limit reached!
% 0.20/0.37 % (219001)------------------------------
% 0.20/0.37 % (219001)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.20/0.37 % (219001)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.20/0.37 % (219001)CaDiCaL version: 2.1.3
% 0.20/0.37 % (219001)Termination reason: Instruction limit
% 0.20/0.37 % (219001)Termination phase: Saturation
% 0.20/0.37 % (219001)Time elapsed: 0.073 s
% 0.20/0.37 % (219001)Peak memory usage: 14 MB
% 0.20/0.37 % (219001)Instructions burned: 131 (million)
% 0.20/0.37 % TRYING [1]
% 0.20/0.37 % TRYING [2]
% 0.20/0.37 % (219011)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=1301371533:i=131:bd=preordered:fsd=on_2999 on theBenchmark for (2999ds/131Mi)
% 0.20/0.37 % TRYING [3]
% 0.20/0.37 % (219012)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=2146437008:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2999 on theBenchmark for (2999ds/684Mi)
% 0.20/0.37 % (218998) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-218991-218998"...
% 0.20/0.37 % TRYING [4]
% 0.20/0.37 % (218998)...printing done.
% 0.20/0.37 % (219012) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-218991-219012"...
% 0.20/0.37 % (218998)Refutation found. Thanks to Tanya!
% 0.20/0.37 % SZS status Theorem for theBenchmark
% 0.20/0.37 % SZS output start Proof for theBenchmark
% See solution above
% 0.52/0.37 % (218998)------------------------------
% 0.52/0.37 % (218998)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 0.52/0.37 % (218998)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.52/0.37 % (218998)CaDiCaL version: 2.1.3
% 0.52/0.37 % (218998)Termination reason: Refutation
% 0.52/0.37 % (218998)Time elapsed: 0.091 s
% 0.52/0.37 % (218998)Peak memory usage: 15 MB
% 0.52/0.37 % (218998)Instructions burned: 148 (million)
% 0.52/0.37 % (218991)Success in time 0.133 s
% 0.52/0.37 % Vampire exiting
%------------------------------------------------------------------------------