%------------------------------------------------------------------------------
% File : Vampire-SAT---5.0.1
% Problem : SWC261+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 : n014.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:18 PM UTC 2026
% Result : Theorem 1.00s 0.39s
% Output : Refutation 1.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 17
% Number of leaves : 19
% Syntax : Number of formulae : 140 ( 25 unt; 12 def)
% Number of atoms : 416 ( 26 equ)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 478 ( 202 ~; 216 |; 16 &)
% ( 19 <=>; 25 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 19 ( 17 usr; 13 prp; 0-2 aty)
% Number of functors : 10 ( 10 usr; 3 con; 0-2 aty)
% Number of variables : 86 ( 0 sgn 75 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f3,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> ( memberP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& app(X2,cons(X1,X3)) = X0 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax3) ).
fof(f11,axiom,
! [X0] :
( ssList(X0)
=> ( totalorderedP(X0)
<=> ! [X1] :
( ssItem(X1)
=> ! [X2] :
( ssItem(X2)
=> ! [X3] :
( ssList(X3)
=> ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
=> leq(X1,X2) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax11) ).
fof(f16,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> ssList(cons(X1,X0)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax16) ).
fof(f26,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ssList(app(X0,X1)) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax26) ).
fof(f31,axiom,
! [X0] :
( ssItem(X0)
=> leq(X0,X0) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax31) ).
fof(f36,axiom,
! [X0] :
( ssItem(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ( memberP(app(X1,X2),X0)
<=> ( memberP(X1,X0)
| memberP(X2,X0) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax36) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ~ ssList(X3)
| X1 != X3
| X0 != X2
| ! [X4] :
( ssItem(X4)
=> ? [X5] :
( ssItem(X5)
& X4 != X5
& memberP(X2,X5) ) )
| totalorderedP(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
| ! [X4] :
( ssItem(X4)
=> ? [X5] :
( ssItem(X5)
& X4 != X5
& memberP(X2,X5) ) )
| totalorderedP(X0) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f99,plain,
! [X0] :
( ! [X1] :
( ( memberP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& app(X2,cons(X1,X3)) = X0 ) ) )
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f3]) ).
fof(f110,plain,
! [X0] :
( ( totalorderedP(X0)
<=> ! [X1] :
( ! [X2] :
( ! [X3] :
( ! [X4] :
( ! [X5] :
( leq(X1,X2)
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
| ~ ssList(X5) )
| ~ ssList(X4) )
| ~ ssList(X3) )
| ~ ssItem(X2) )
| ~ ssItem(X1) ) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f11]) ).
fof(f111,plain,
! [X0] :
( ( totalorderedP(X0)
<=> ! [X1] :
( ! [X2] :
( ! [X3] :
( ! [X4] :
( ! [X5] :
( leq(X1,X2)
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
| ~ ssList(X5) )
| ~ ssList(X4) )
| ~ ssList(X3) )
| ~ ssItem(X2) )
| ~ ssItem(X1) ) )
| ~ ssList(X0) ),
inference(flattening,[],[f110]) ).
fof(f119,plain,
! [X0] :
( ! [X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f132,plain,
! [X0] :
( ! [X1] :
( ssList(app(X0,X1))
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f26]) ).
fof(f139,plain,
! [X0] :
( leq(X0,X0)
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f31]) ).
fof(f146,plain,
! [X0] :
( ! [X1] :
( ! [X2] :
( ( memberP(app(X1,X2),X0)
<=> ( memberP(X1,X0)
| memberP(X2,X0) ) )
| ~ ssList(X2) )
| ~ ssList(X1) )
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f36]) ).
fof(f221,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ssList(X3)
& X1 = X3
& X0 = X2
& ? [X4] :
( ! [X5] :
( ~ ssItem(X5)
| X4 = X5
| ~ memberP(X2,X5) )
& ssItem(X4) )
& ~ totalorderedP(X0) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f227,plain,
! [X2,X3,X0,X1] :
( ~ ssList(X0)
| ~ ssItem(X1)
| app(X2,cons(X1,X3)) != X0
| ~ ssList(X3)
| ~ ssList(X2)
| memberP(X0,X1) ),
inference(cnf_transformation,[],[f99]) ).
fof(f272,plain,
! [X0] :
( ssList(sK28(X0))
| ~ ssList(X0)
| totalorderedP(X0) ),
inference(cnf_transformation,[],[f111]) ).
fof(f273,plain,
! [X0] :
( ~ ssList(X0)
| app(app(sK26(X0),cons(sK24(X0),sK27(X0))),cons(sK25(X0),sK28(X0))) = X0
| totalorderedP(X0) ),
inference(cnf_transformation,[],[f111]) ).
fof(f274,plain,
! [X0] :
( ~ leq(sK24(X0),sK25(X0))
| ~ ssList(X0)
| totalorderedP(X0) ),
inference(cnf_transformation,[],[f111]) ).
fof(f275,plain,
! [X0] :
( ssList(sK27(X0))
| ~ ssList(X0)
| totalorderedP(X0) ),
inference(cnf_transformation,[],[f111]) ).
fof(f276,plain,
! [X0] :
( ssList(sK26(X0))
| ~ ssList(X0)
| totalorderedP(X0) ),
inference(cnf_transformation,[],[f111]) ).
fof(f277,plain,
! [X0] :
( ssItem(sK25(X0))
| ~ ssList(X0)
| totalorderedP(X0) ),
inference(cnf_transformation,[],[f111]) ).
fof(f278,plain,
! [X0] :
( ssItem(sK24(X0))
| ~ ssList(X0)
| totalorderedP(X0) ),
inference(cnf_transformation,[],[f111]) ).
fof(f304,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f119]) ).
fof(f317,plain,
! [X0,X1] :
( ssList(app(X0,X1))
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f132]) ).
fof(f322,plain,
! [X0] :
( leq(X0,X0)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f139]) ).
fof(f331,plain,
! [X2,X0,X1] :
( memberP(app(X1,X2),X0)
| ~ ssList(X1)
| ~ ssList(X2)
| ~ memberP(X1,X0)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f146]) ).
fof(f410,plain,
! [X5] :
( ~ memberP(sK49,X5)
| sK51 = X5
| ~ ssItem(X5) ),
inference(cnf_transformation,[],[f221]) ).
fof(f411,plain,
ssItem(sK51),
inference(cnf_transformation,[],[f221]) ).
fof(f412,plain,
~ totalorderedP(sK47),
inference(cnf_transformation,[],[f221]) ).
fof(f413,plain,
sK47 = sK49,
inference(cnf_transformation,[],[f221]) ).
fof(f416,plain,
ssList(sK49),
inference(cnf_transformation,[],[f221]) ).
fof(f421,plain,
~ totalorderedP(sK49),
inference(definition_unfolding,[],[f412,f413]) ).
fof(f423,plain,
! [X2,X3,X1] :
( memberP(app(X2,cons(X1,X3)),X1)
| ~ ssItem(X1)
| ~ ssList(X3)
| ~ ssList(X2)
| ~ ssList(app(X2,cons(X1,X3))) ),
inference(equality_resolution,[],[f227]) ).
fof(f518,plain,
( sK49 = app(app(sK26(sK49),cons(sK24(sK49),sK27(sK49))),cons(sK25(sK49),sK28(sK49)))
| totalorderedP(sK49) ),
inference(resolution,[],[f273,f416]) ).
fof(f529,plain,
sK49 = app(app(sK26(sK49),cons(sK24(sK49),sK27(sK49))),cons(sK25(sK49),sK28(sK49))),
inference(forward_subsumption_resolution,[],[f518,f421]) ).
fof(f532,plain,
( memberP(sK49,sK25(sK49))
| ~ ssItem(sK25(sK49))
| ~ ssList(sK28(sK49))
| ~ ssList(app(sK26(sK49),cons(sK24(sK49),sK27(sK49))))
| ~ ssList(sK49) ),
inference(superposition,[],[f423,f529]) ).
fof(f534,plain,
! [X0] :
( memberP(sK49,X0)
| ~ ssList(app(sK26(sK49),cons(sK24(sK49),sK27(sK49))))
| ~ ssList(cons(sK25(sK49),sK28(sK49)))
| ~ memberP(app(sK26(sK49),cons(sK24(sK49),sK27(sK49))),X0)
| ~ ssItem(X0) ),
inference(superposition,[],[f331,f529]) ).
fof(f537,definition,
( spl52_10
<=> ssList(cons(sK25(sK49),sK28(sK49))) ),
introduced(definition,[new_symbols(definition,[spl52_10])],[avatar_definition]) ).
fof(f539,plain,
( ~ ssList(cons(sK25(sK49),sK28(sK49)))
| spl52_10 ),
inference(avatar_component_clause,[],[f537]) ).
fof(f541,definition,
( spl52_11
<=> ssList(app(sK26(sK49),cons(sK24(sK49),sK27(sK49)))) ),
introduced(definition,[new_symbols(definition,[spl52_11])],[avatar_definition]) ).
fof(f543,plain,
( ~ ssList(app(sK26(sK49),cons(sK24(sK49),sK27(sK49))))
| spl52_11 ),
inference(avatar_component_clause,[],[f541]) ).
fof(f549,definition,
( spl52_13
<=> ! [X0] :
( memberP(sK49,X0)
| ~ ssItem(X0)
| ~ memberP(app(sK26(sK49),cons(sK24(sK49),sK27(sK49))),X0) ) ),
introduced(definition,[new_symbols(definition,[spl52_13])],[avatar_definition]) ).
fof(f550,plain,
( ! [X0] :
( ~ memberP(app(sK26(sK49),cons(sK24(sK49),sK27(sK49))),X0)
| ~ ssItem(X0)
| memberP(sK49,X0) )
| ~ spl52_13 ),
inference(avatar_component_clause,[],[f549]) ).
fof(f551,plain,
( ~ spl52_10
| ~ spl52_11
| spl52_13 ),
inference(avatar_split_clause,[],[f534,f549,f541,f537]) ).
fof(f556,plain,
( memberP(sK49,sK25(sK49))
| ~ ssItem(sK25(sK49))
| ~ ssList(sK28(sK49))
| ~ ssList(app(sK26(sK49),cons(sK24(sK49),sK27(sK49)))) ),
inference(forward_subsumption_resolution,[],[f532,f416]) ).
fof(f558,definition,
( spl52_15
<=> ssList(sK28(sK49)) ),
introduced(definition,[new_symbols(definition,[spl52_15])],[avatar_definition]) ).
fof(f559,plain,
( ssList(sK28(sK49))
| ~ spl52_15 ),
inference(avatar_component_clause,[],[f558]) ).
fof(f560,plain,
( ~ ssList(sK28(sK49))
| spl52_15 ),
inference(avatar_component_clause,[],[f558]) ).
fof(f562,definition,
( spl52_16
<=> ssItem(sK25(sK49)) ),
introduced(definition,[new_symbols(definition,[spl52_16])],[avatar_definition]) ).
fof(f564,plain,
( ~ ssItem(sK25(sK49))
| spl52_16 ),
inference(avatar_component_clause,[],[f562]) ).
fof(f566,definition,
( spl52_17
<=> memberP(sK49,sK25(sK49)) ),
introduced(definition,[new_symbols(definition,[spl52_17])],[avatar_definition]) ).
fof(f568,plain,
( memberP(sK49,sK25(sK49))
| ~ spl52_17 ),
inference(avatar_component_clause,[],[f566]) ).
fof(f569,plain,
( ~ spl52_11
| ~ spl52_15
| ~ spl52_16
| spl52_17 ),
inference(avatar_split_clause,[],[f556,f566,f562,f558,f541]) ).
fof(f570,plain,
( sK51 = sK25(sK49)
| ~ ssItem(sK25(sK49))
| ~ spl52_17 ),
inference(resolution,[],[f568,f410]) ).
fof(f574,definition,
( spl52_18
<=> sK51 = sK25(sK49) ),
introduced(definition,[new_symbols(definition,[spl52_18])],[avatar_definition]) ).
fof(f576,plain,
( sK51 = sK25(sK49)
| ~ spl52_18 ),
inference(avatar_component_clause,[],[f574]) ).
fof(f577,plain,
( ~ spl52_16
| spl52_18
| ~ spl52_17 ),
inference(avatar_split_clause,[],[f570,f566,f574,f562]) ).
fof(f585,plain,
( ~ leq(sK24(sK49),sK51)
| ~ ssList(sK49)
| totalorderedP(sK49)
| ~ spl52_18 ),
inference(superposition,[],[f274,f576]) ).
fof(f587,plain,
( ~ leq(sK24(sK49),sK51)
| totalorderedP(sK49)
| ~ spl52_18 ),
inference(forward_subsumption_resolution,[],[f585,f416]) ).
fof(f588,plain,
( ~ leq(sK24(sK49),sK51)
| ~ spl52_18 ),
inference(forward_subsumption_resolution,[],[f587,f421]) ).
fof(f655,plain,
( ~ ssItem(sK24(sK49))
| memberP(sK49,sK24(sK49))
| ~ ssItem(sK24(sK49))
| ~ ssList(sK27(sK49))
| ~ ssList(sK26(sK49))
| ~ ssList(app(sK26(sK49),cons(sK24(sK49),sK27(sK49))))
| ~ spl52_13 ),
inference(resolution,[],[f550,f423]) ).
fof(f656,plain,
( ~ ssItem(sK24(sK49))
| memberP(sK49,sK24(sK49))
| ~ ssList(sK27(sK49))
| ~ ssList(sK26(sK49))
| ~ ssList(app(sK26(sK49),cons(sK24(sK49),sK27(sK49))))
| ~ spl52_13 ),
inference(duplicate_literal_removal,[],[f655]) ).
fof(f660,definition,
( spl52_29
<=> ssList(sK26(sK49)) ),
introduced(definition,[new_symbols(definition,[spl52_29])],[avatar_definition]) ).
fof(f661,plain,
( ssList(sK26(sK49))
| ~ spl52_29 ),
inference(avatar_component_clause,[],[f660]) ).
fof(f662,plain,
( ~ ssList(sK26(sK49))
| spl52_29 ),
inference(avatar_component_clause,[],[f660]) ).
fof(f664,definition,
( spl52_30
<=> ssList(sK27(sK49)) ),
introduced(definition,[new_symbols(definition,[spl52_30])],[avatar_definition]) ).
fof(f665,plain,
( ssList(sK27(sK49))
| ~ spl52_30 ),
inference(avatar_component_clause,[],[f664]) ).
fof(f666,plain,
( ~ ssList(sK27(sK49))
| spl52_30 ),
inference(avatar_component_clause,[],[f664]) ).
fof(f668,definition,
( spl52_31
<=> memberP(sK49,sK24(sK49)) ),
introduced(definition,[new_symbols(definition,[spl52_31])],[avatar_definition]) ).
fof(f670,plain,
( memberP(sK49,sK24(sK49))
| ~ spl52_31 ),
inference(avatar_component_clause,[],[f668]) ).
fof(f672,definition,
( spl52_32
<=> ssItem(sK24(sK49)) ),
introduced(definition,[new_symbols(definition,[spl52_32])],[avatar_definition]) ).
fof(f673,plain,
( ssItem(sK24(sK49))
| ~ spl52_32 ),
inference(avatar_component_clause,[],[f672]) ).
fof(f674,plain,
( ~ ssItem(sK24(sK49))
| spl52_32 ),
inference(avatar_component_clause,[],[f672]) ).
fof(f675,plain,
( ~ spl52_11
| ~ spl52_29
| ~ spl52_30
| spl52_31
| ~ spl52_32
| ~ spl52_13 ),
inference(avatar_split_clause,[],[f656,f549,f672,f668,f664,f660,f541]) ).
fof(f688,plain,
( sK51 = sK24(sK49)
| ~ ssItem(sK24(sK49))
| ~ spl52_31 ),
inference(resolution,[],[f670,f410]) ).
fof(f692,definition,
( spl52_36
<=> sK51 = sK24(sK49) ),
introduced(definition,[new_symbols(definition,[spl52_36])],[avatar_definition]) ).
fof(f694,plain,
( sK51 = sK24(sK49)
| ~ spl52_36 ),
inference(avatar_component_clause,[],[f692]) ).
fof(f695,plain,
( ~ spl52_32
| spl52_36
| ~ spl52_31 ),
inference(avatar_split_clause,[],[f688,f668,f692,f672]) ).
fof(f703,plain,
( ~ leq(sK51,sK51)
| ~ spl52_18
| ~ spl52_36 ),
inference(superposition,[],[f588,f694]) ).
fof(f711,plain,
( ~ ssItem(sK51)
| ~ spl52_18
| ~ spl52_36 ),
inference(resolution,[],[f703,f322]) ).
fof(f712,plain,
( $false
| ~ spl52_18
| ~ spl52_36 ),
inference(forward_subsumption_resolution,[],[f711,f411]) ).
fof(f713,plain,
( ~ spl52_18
| ~ spl52_36 ),
inference(avatar_contradiction_clause,[],[f712]) ).
fof(f714,plain,
( ~ ssList(sK49)
| totalorderedP(sK49)
| spl52_32 ),
inference(resolution,[],[f674,f278]) ).
fof(f715,plain,
( totalorderedP(sK49)
| spl52_32 ),
inference(forward_subsumption_resolution,[],[f714,f416]) ).
fof(f716,plain,
( $false
| spl52_32 ),
inference(forward_subsumption_resolution,[],[f715,f421]) ).
fof(f717,plain,
spl52_32,
inference(avatar_contradiction_clause,[],[f716]) ).
fof(f718,plain,
( ~ ssList(sK49)
| totalorderedP(sK49)
| spl52_30 ),
inference(resolution,[],[f666,f275]) ).
fof(f719,plain,
( totalorderedP(sK49)
| spl52_30 ),
inference(forward_subsumption_resolution,[],[f718,f416]) ).
fof(f720,plain,
( $false
| spl52_30 ),
inference(forward_subsumption_resolution,[],[f719,f421]) ).
fof(f721,plain,
spl52_30,
inference(avatar_contradiction_clause,[],[f720]) ).
fof(f722,plain,
( ~ ssList(sK49)
| totalorderedP(sK49)
| spl52_29 ),
inference(resolution,[],[f662,f276]) ).
fof(f723,plain,
( totalorderedP(sK49)
| spl52_29 ),
inference(forward_subsumption_resolution,[],[f722,f416]) ).
fof(f724,plain,
( $false
| spl52_29 ),
inference(forward_subsumption_resolution,[],[f723,f421]) ).
fof(f725,plain,
spl52_29,
inference(avatar_contradiction_clause,[],[f724]) ).
fof(f1180,plain,
( ~ ssList(cons(sK24(sK49),sK27(sK49)))
| ~ ssList(sK26(sK49))
| spl52_11 ),
inference(resolution,[],[f317,f543]) ).
fof(f1213,plain,
( ~ ssList(cons(sK24(sK49),sK27(sK49)))
| spl52_11
| ~ spl52_29 ),
inference(forward_subsumption_resolution,[],[f1180,f661]) ).
fof(f1230,plain,
( ~ ssItem(sK24(sK49))
| ~ ssList(sK27(sK49))
| spl52_11
| ~ spl52_29 ),
inference(resolution,[],[f1213,f304]) ).
fof(f1231,plain,
( ~ ssList(sK27(sK49))
| spl52_11
| ~ spl52_29
| ~ spl52_32 ),
inference(forward_subsumption_resolution,[],[f1230,f673]) ).
fof(f1232,plain,
( $false
| spl52_11
| ~ spl52_29
| ~ spl52_30
| ~ spl52_32 ),
inference(forward_subsumption_resolution,[],[f1231,f665]) ).
fof(f1233,plain,
( spl52_11
| ~ spl52_29
| ~ spl52_30
| ~ spl52_32 ),
inference(avatar_contradiction_clause,[],[f1232]) ).
fof(f1246,plain,
( ~ ssList(sK49)
| totalorderedP(sK49)
| spl52_15 ),
inference(resolution,[],[f560,f272]) ).
fof(f1247,plain,
( totalorderedP(sK49)
| spl52_15 ),
inference(forward_subsumption_resolution,[],[f1246,f416]) ).
fof(f1248,plain,
( $false
| spl52_15 ),
inference(forward_subsumption_resolution,[],[f1247,f421]) ).
fof(f1249,plain,
spl52_15,
inference(avatar_contradiction_clause,[],[f1248]) ).
fof(f1272,plain,
( ~ ssList(sK49)
| totalorderedP(sK49)
| spl52_16 ),
inference(resolution,[],[f564,f277]) ).
fof(f1273,plain,
( totalorderedP(sK49)
| spl52_16 ),
inference(forward_subsumption_resolution,[],[f1272,f416]) ).
fof(f1274,plain,
( $false
| spl52_16 ),
inference(forward_subsumption_resolution,[],[f1273,f421]) ).
fof(f1275,plain,
spl52_16,
inference(avatar_contradiction_clause,[],[f1274]) ).
fof(f1370,plain,
( ~ ssList(cons(sK51,sK28(sK49)))
| spl52_10
| ~ spl52_18 ),
inference(forward_demodulation,[],[f539,f576]) ).
fof(f1371,plain,
( ~ ssItem(sK51)
| ~ ssList(sK28(sK49))
| spl52_10
| ~ spl52_18 ),
inference(resolution,[],[f1370,f304]) ).
fof(f1372,plain,
( ~ ssList(sK28(sK49))
| spl52_10
| ~ spl52_18 ),
inference(forward_subsumption_resolution,[],[f1371,f411]) ).
fof(f1373,plain,
( $false
| spl52_10
| ~ spl52_15
| ~ spl52_18 ),
inference(forward_subsumption_resolution,[],[f1372,f559]) ).
fof(f1374,plain,
( spl52_10
| ~ spl52_15
| ~ spl52_18 ),
inference(avatar_contradiction_clause,[],[f1373]) ).
cnf(s10,plain,
( ~ spl52_10
| ~ spl52_11
| spl52_13 ),
inference(sat_conversion,[],[f551]) ).
cnf(s12,plain,
( ~ spl52_11
| ~ spl52_15
| ~ spl52_16
| spl52_17 ),
inference(sat_conversion,[],[f569]) ).
cnf(s13,plain,
( ~ spl52_16
| ~ spl52_17
| spl52_18 ),
inference(sat_conversion,[],[f577]) ).
cnf(s22,plain,
( ~ spl52_11
| ~ spl52_13
| ~ spl52_29
| ~ spl52_30
| spl52_31
| ~ spl52_32 ),
inference(sat_conversion,[],[f675]) ).
cnf(s25,plain,
( ~ spl52_31
| ~ spl52_32
| spl52_36 ),
inference(sat_conversion,[],[f695]) ).
cnf(s27,plain,
( ~ spl52_18
| ~ spl52_36 ),
inference(sat_conversion,[],[f713]) ).
cnf(s28,plain,
spl52_32,
inference(sat_conversion,[],[f717]) ).
cnf(s29,plain,
spl52_30,
inference(sat_conversion,[],[f721]) ).
cnf(s30,plain,
spl52_29,
inference(sat_conversion,[],[f725]) ).
cnf(s55,plain,
( spl52_11
| ~ spl52_29
| ~ spl52_30
| ~ spl52_32 ),
inference(sat_conversion,[],[f1233]) ).
cnf(s59,plain,
spl52_15,
inference(sat_conversion,[],[f1249]) ).
cnf(s61,plain,
spl52_16,
inference(sat_conversion,[],[f1275]) ).
cnf(s75,plain,
( spl52_10
| ~ spl52_15
| ~ spl52_18 ),
inference(sat_conversion,[],[f1374]) ).
cnf(s78,plain,
spl52_11,
inference(rat,[],[s55,s29,s30,s28]) ).
cnf(s82,plain,
( ~ spl52_31
| spl52_36 ),
inference(rat,[],[s25,s28]) ).
cnf(s85,plain,
( ~ spl52_13
| spl52_31 ),
inference(rat,[],[s22,s28,s29,s30,s78]) ).
cnf(s88,plain,
( ~ spl52_17
| spl52_18 ),
inference(rat,[],[s13,s61]) ).
cnf(s89,plain,
spl52_17,
inference(rat,[],[s12,s61,s59,s78]) ).
cnf(s90,plain,
spl52_18,
inference(rat,[],[s88,s89]) ).
cnf(s91,plain,
spl52_10,
inference(rat,[],[s75,s59,s90]) ).
cnf(s92,plain,
~ spl52_36,
inference(rat,[],[s27,s90]) ).
cnf(s96,plain,
~ spl52_31,
inference(rat,[],[s82,s92]) ).
cnf(s97,plain,
~ spl52_13,
inference(rat,[],[s85,s96]) ).
cnf(s99,plain,
$false,
inference(rat,[],[s10,s97,s78,s91]) ).
fof(f1375,plain,
$false,
inference(avatar_sat_refutation,[],[s99]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC261+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.07/0.18 % Computer : n014.cluster.edu
% 0.07/0.18 % Model : x86_64 x86_64
% 0.07/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18 % Memory : 8046.5625MB
% 0.07/0.18 % OS : Linux 6.8.0-71-generic
% 0.07/0.18 % CPULimit : 300
% 0.07/0.19 % WCLimit : 300
% 0.07/0.19 % DateTime : Mon Sep 28 08:45:16 UTC 2026
% 0.07/0.19 % CPUTime :
% 0.07/0.19 Running run_vampire /export/starexec/sandbox2/benchmark/theBenchmark.p 300 SAT
% 0.07/0.22 Running first-order model finding
% 0.07/0.22 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
% 1.00/0.39 % (1637815)Will run a generic schedule for satisfiability detection.
% 1.00/0.39 % (1637820)fmb+10_1_sas=cadical:bce=on:rp=on:random_seed=840070382_2999 on theBenchmark for (2999ds/0Mi)
% 1.00/0.39 % (1637821)% WARNING: option uhcvi not known.
% 1.00/0.39 % TRYING [1]
% 1.00/0.39 % (1637821)dis+11_61:31_drc=ordering:lsd=5:bsr=unit_only:rp=on:newcnf=on:random_seed=2129370089:i=135531:add=off:rawr=on_2999 on theBenchmark for (2999ds/135531Mi)
% 1.00/0.39 % (1637822)dis+10_161_sil=256000:plsq=on:plsqr=61199697,1048576:gs=on:alpa=true:sac=on:slsq=on:cn=on:random_seed=2629219463:i=88024:add=on:rawr=on_2999 on theBenchmark for (2999ds/88024Mi)
% 1.00/0.39 % (1637823)dis+10_1_sil=32000:sp=arity:random_seed=2353507332:i=103:fgj=on_2999 on theBenchmark for (2999ds/103Mi)
% 1.00/0.39 % (1637824)ott+31_1_sil=16000:lcm=predicate:bce=on:newcnf=on:random_seed=1879399629:i=116_2999 on theBenchmark for (2999ds/116Mi)
% 1.00/0.39 % TRYING [2]
% 1.00/0.39 % (1637826)ott-3_16_to=lpo:sil=16000:sp=arity:fd=off:rp=on:random_seed=2082866420:i=159:bs=unit_only:nicw=on:fsr=off:amm=off_2999 on theBenchmark for (2999ds/159Mi)
% 1.00/0.39 % (1637825)ott+1_1_to=lpo:sil=16000:sp=reverse_arity:erd=off:random_seed=1730251424:i=131_2999 on theBenchmark for (2999ds/131Mi)
% 1.00/0.39 % TRYING [3]
% 1.00/0.39 % TRYING [4]
% 1.00/0.39 % TRYING [5]
% 1.00/0.39 % (1637823)Instruction limit reached!
% 1.00/0.39 % (1637823)------------------------------
% 1.00/0.39 % (1637823)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.00/0.39 % (1637823)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.00/0.39 % (1637823)CaDiCaL version: 2.1.3
% 1.00/0.39 % (1637823)Termination reason: Instruction limit
% 1.00/0.39 % (1637823)Termination phase: Saturation
% 1.00/0.39 % (1637823)Time elapsed: 0.060 s
% 1.00/0.39 % (1637823)Peak memory usage: 13 MB
% 1.00/0.39 % (1637823)Instructions burned: 105 (million)
% 1.00/0.39 % (1637824)Instruction limit reached!
% 1.00/0.39 % (1637824)------------------------------
% 1.00/0.39 % (1637824)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.00/0.39 % (1637824)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.00/0.39 % (1637824)CaDiCaL version: 2.1.3
% 1.00/0.39 % (1637824)Termination reason: Instruction limit
% 1.00/0.39 % (1637824)Termination phase: Saturation
% 1.00/0.39 % (1637824)Time elapsed: 0.068 s
% 1.00/0.39 % (1637824)Peak memory usage: 13 MB
% 1.00/0.39 % (1637824)Instructions burned: 116 (million)
% 1.00/0.39 % (1637825)Instruction limit reached!
% 1.00/0.39 % (1637825)------------------------------
% 1.00/0.39 % (1637825)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.00/0.39 % (1637825)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.00/0.39 % (1637825)CaDiCaL version: 2.1.3
% 1.00/0.39 % (1637825)Termination reason: Instruction limit
% 1.00/0.39 % (1637825)Termination phase: Saturation
% 1.00/0.39 % (1637825)Time elapsed: 0.076 s
% 1.00/0.39 % (1637825)Peak memory usage: 14 MB
% 1.00/0.39 % (1637825)Instructions burned: 135 (million)
% 1.00/0.39 % (1637834)fmb+10_1_fmbas=predicate:sil=64000:sas=cadical:random_seed=1228205918:i=714:nm=2_2999 on theBenchmark for (2999ds/714Mi)
% 1.00/0.39 % (1637835)ott+32_1_sil=16000:bsd=on:sp=const_max:bce=on:random_seed=2778610335:i=131:bd=preordered:fsd=on_2998 on theBenchmark for (2998ds/131Mi)
% 1.00/0.39 % TRYING [1]
% 1.00/0.39 % TRYING [2]
% 1.00/0.39 % (1637836)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=3276379460:i=684:slsql=off:bs=unit_only:nicw=on:rawr=on_2998 on theBenchmark for (2998ds/684Mi)
% 1.00/0.39 % TRYING [6]
% 1.00/0.39 % TRYING [3]
% 1.00/0.39 % (1637826)Instruction limit reached!
% 1.00/0.39 % (1637826)------------------------------
% 1.00/0.39 % (1637826)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.00/0.39 % (1637826)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.00/0.39 % (1637826)CaDiCaL version: 2.1.3
% 1.00/0.39 % (1637826)Termination reason: Instruction limit
% 1.00/0.39 % (1637826)Termination phase: Saturation
% 1.00/0.39 % (1637826)Time elapsed: 0.101 s
% 1.00/0.39 % (1637826)Peak memory usage: 15 MB
% 1.00/0.39 % (1637826)Instructions burned: 160 (million)
% 1.00/0.39 % TRYING [4]
% 1.00/0.39 % (1637840)ott-21_1_sil=16000:fs=off:random_seed=1653766936:i=180:av=off:fsr=off_2998 on theBenchmark for (2998ds/180Mi)
% 1.00/0.39 % (1637836) found proof, printing to "/export/starexec/sandbox2/tmp/vampire-proof-1637815-1637836"...
% 1.00/0.39 % (1637836)...printing done.
% 1.00/0.39 % (1637836)Refutation found. Thanks to Tanya!
% 1.00/0.39 % SZS status Theorem for theBenchmark
% 1.00/0.39 % SZS output start Proof for theBenchmark
% See solution above
% 1.00/0.39 % (1637836)------------------------------
% 1.00/0.39 % (1637836)Version: Vampire 5.0.1 (Release build, commit 5ef7c2677 on 2026-07-16 16:54:09 +0200)
% 1.00/0.39 % (1637836)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.00/0.39 % (1637836)CaDiCaL version: 2.1.3
% 1.00/0.39 % (1637836)Termination reason: Refutation
% 1.00/0.39 % (1637836)Time elapsed: 0.029 s
% 1.00/0.39 % (1637836)Peak memory usage: 14 MB
% 1.00/0.39 % (1637836)Instructions burned: 42 (million)
% 1.00/0.39 % (1637815)Success in time 0.163 s
% 1.00/0.39 % Vampire exiting
%------------------------------------------------------------------------------