%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC181+1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 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:02:49 PM UTC 2026
% Result : Theorem 1.07s 0.96s
% Output : Refutation 3.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 8
% Syntax : Number of formulae : 76 ( 19 unt; 4 def)
% Number of atoms : 437 ( 81 equ)
% Maximal formula atoms : 27 ( 5 avg)
% Number of connectives : 581 ( 220 ~; 217 |; 107 &)
% ( 10 <=>; 27 =>; 0 <=; 0 <~>)
% Maximal formula depth : 28 ( 7 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 11 ( 9 usr; 5 prp; 0-2 aty)
% Number of functors : 19 ( 19 usr; 7 con; 0-2 aty)
% Number of variables : 176 ( 0 sgn 128 !; 48 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f12,axiom,
! [X0] :
( ssList(X0)
=> ( strictorderedP(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
=> lt(X1,X2) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax12) ).
fof(f13,axiom,
! [X0] :
( ssList(X0)
=> ( duplicatefreeP(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
=> X1 != X2 ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax13) ).
fof(f90,axiom,
! [X0] :
( ssItem(X0)
=> ~ lt(X0,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax90) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ssList(X3)
=> ( X1 != X3
| X0 != X2
| ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(app(X4,X2),X5) != X3
| ~ strictorderedP(X2)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(X7,cons(X6,nil)) = X4
& ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(X9)
& app(cons(X8,nil),X9) = X2
& lt(X6,X8) ) ) ) )
| ? [X10] :
( ssItem(X10)
& ? [X11] :
( ssList(X11)
& app(cons(X10,nil),X11) = X5
& ? [X12] :
( ssItem(X12)
& ? [X13] :
( ssList(X13)
& app(X13,cons(X12,nil)) = X2
& lt(X12,X10) ) ) ) ) ) ) )
| duplicatefreeP(X0)
| ( nil != X3
& nil = X2 ) ) ) ) ) ),
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
| ! [X4] :
( ssList(X4)
=> ! [X5] :
( ssList(X5)
=> ( app(app(X4,X2),X5) != X3
| ~ strictorderedP(X2)
| ? [X6] :
( ssItem(X6)
& ? [X7] :
( ssList(X7)
& app(X7,cons(X6,nil)) = X4
& ? [X8] :
( ssItem(X8)
& ? [X9] :
( ssList(X9)
& app(cons(X8,nil),X9) = X2
& lt(X6,X8) ) ) ) )
| ? [X10] :
( ssItem(X10)
& ? [X11] :
( ssList(X11)
& app(cons(X10,nil),X11) = X5
& ? [X12] :
( ssItem(X12)
& ? [X13] :
( ssList(X13)
& app(X13,cons(X12,nil)) = X2
& lt(X12,X10) ) ) ) ) ) ) )
| duplicatefreeP(X0)
| ( nil != X3
& nil = X2 ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ? [X4] :
( ? [X5] :
( app(app(X4,X2),X5) = X3
& strictorderedP(X2)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ~ ssList(X7)
| app(X7,cons(X6,nil)) != X4
| ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| app(cons(X8,nil),X9) != X2
| ~ lt(X6,X8) ) ) ) )
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ~ ssList(X11)
| app(cons(X10,nil),X11) != X5
| ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ ssList(X13)
| app(X13,cons(X12,nil)) != X2
| ~ lt(X12,X10) ) ) ) )
& ssList(X5) )
& ssList(X4) )
& ~ duplicatefreeP(X0)
& ( nil = X3
| nil != X2 )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f99,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( X1 = X3
& X0 = X2
& ? [X4] :
( ? [X5] :
( app(app(X4,X2),X5) = X3
& strictorderedP(X2)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ~ ssList(X7)
| app(X7,cons(X6,nil)) != X4
| ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| app(cons(X8,nil),X9) != X2
| ~ lt(X6,X8) ) ) ) )
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ~ ssList(X11)
| app(cons(X10,nil),X11) != X5
| ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ ssList(X13)
| app(X13,cons(X12,nil)) != X2
| ~ lt(X12,X10) ) ) ) )
& ssList(X5) )
& ssList(X4) )
& ~ duplicatefreeP(X0)
& ( nil = X3
| nil != X2 )
& ssList(X3) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(flattening,[],[f98]) ).
fof(f126,plain,
! [X0] :
( ( duplicatefreeP(X0)
<=> ! [X1] :
( ! [X2] :
( ! [X3] :
( ! [X4] :
( ! [X5] :
( 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,[],[f13]) ).
fof(f127,plain,
! [X0] :
( ( duplicatefreeP(X0)
<=> ! [X1] :
( ! [X2] :
( ! [X3] :
( ! [X4] :
( ! [X5] :
( 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,[],[f126]) ).
fof(f128,plain,
! [X0] :
( ( strictorderedP(X0)
<=> ! [X1] :
( ! [X2] :
( ! [X3] :
( ! [X4] :
( ! [X5] :
( lt(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,[],[f12]) ).
fof(f129,plain,
! [X0] :
( ( strictorderedP(X0)
<=> ! [X1] :
( ! [X2] :
( ! [X3] :
( ! [X4] :
( ! [X5] :
( lt(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,[],[f128]) ).
fof(f168,plain,
! [X0] :
( ~ lt(X0,X0)
| ~ ssItem(X0) ),
inference(ennf_transformation,[],[f90]) ).
fof(f183,plain,
( sK7 = sK9
& sK6 = sK8
& sK9 = app(app(sK10,sK8),sK11)
& strictorderedP(sK8)
& ! [X6] :
( ~ ssItem(X6)
| ! [X7] :
( ~ ssList(X7)
| app(X7,cons(X6,nil)) != sK10
| ! [X8] :
( ~ ssItem(X8)
| ! [X9] :
( ~ ssList(X9)
| app(cons(X8,nil),X9) != sK8
| ~ lt(X6,X8) ) ) ) )
& ! [X10] :
( ~ ssItem(X10)
| ! [X11] :
( ~ ssList(X11)
| app(cons(X10,nil),X11) != sK11
| ! [X12] :
( ~ ssItem(X12)
| ! [X13] :
( ~ ssList(X13)
| app(X13,cons(X12,nil)) != sK8
| ~ lt(X12,X10) ) ) ) )
& ssList(sK11)
& ssList(sK10)
& ~ duplicatefreeP(sK6)
& ( nil = sK9
| nil != sK8 )
& ssList(sK9)
& ssList(sK8)
& ssList(sK7)
& ssList(sK6) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK6,sK7,sK8,sK9,sK10,sK11]),skolemize(X0,sK6),skolemize(X1,sK7),skolemize(X2,sK8),skolemize(X3,sK9),skolemize(X4,sK10),skolemize(X5,sK11)],[f99]) ).
fof(f197,plain,
! [X0] :
( ( ( duplicatefreeP(X0)
| ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( X1 = X2
& app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
& ssList(X5) )
& ssList(X4) )
& ssList(X3) )
& ssItem(X2) )
& ssItem(X1) ) )
& ( ! [X1] :
( ! [X2] :
( ! [X3] :
( ! [X4] :
( ! [X5] :
( X1 != X2
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
| ~ ssList(X5) )
| ~ ssList(X4) )
| ~ ssList(X3) )
| ~ ssItem(X2) )
| ~ ssItem(X1) )
| ~ duplicatefreeP(X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f127]) ).
fof(f198,plain,
! [X0] :
( ( ( duplicatefreeP(X0)
| ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( X1 = X2
& app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
& ssList(X5) )
& ssList(X4) )
& ssList(X3) )
& ssItem(X2) )
& ssItem(X1) ) )
& ( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ! [X10] :
( X6 != X7
| app(app(X8,cons(X6,X9)),cons(X7,X10)) != X0
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssItem(X7) )
| ~ ssItem(X6) )
| ~ duplicatefreeP(X0) ) )
| ~ ssList(X0) ),
inference(rectify,[],[f197]) ).
fof(f199,plain,
! [X0] :
( ( ( duplicatefreeP(X0)
| ( sK20(X0) = sK21(X0)
& app(app(sK22(X0),cons(sK20(X0),sK23(X0))),cons(sK21(X0),sK24(X0))) = X0
& ssList(sK24(X0))
& ssList(sK23(X0))
& ssList(sK22(X0))
& ssItem(sK21(X0))
& ssItem(sK20(X0)) ) )
& ( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ! [X10] :
( X6 != X7
| app(app(X8,cons(X6,X9)),cons(X7,X10)) != X0
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssItem(X7) )
| ~ ssItem(X6) )
| ~ duplicatefreeP(X0) ) )
| ~ ssList(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK20,sK21,sK22,sK23,sK24]),skolemize(X1,sK20(X0)),skolemize(X2,sK21(X0)),skolemize(X3,sK22(X0)),skolemize(X4,sK23(X0)),skolemize(X5,sK24(X0))],[f198]) ).
fof(f200,plain,
! [X0] :
( ( ( strictorderedP(X0)
| ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ~ lt(X1,X2)
& app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
& ssList(X5) )
& ssList(X4) )
& ssList(X3) )
& ssItem(X2) )
& ssItem(X1) ) )
& ( ! [X1] :
( ! [X2] :
( ! [X3] :
( ! [X4] :
( ! [X5] :
( lt(X1,X2)
| app(app(X3,cons(X1,X4)),cons(X2,X5)) != X0
| ~ ssList(X5) )
| ~ ssList(X4) )
| ~ ssList(X3) )
| ~ ssItem(X2) )
| ~ ssItem(X1) )
| ~ strictorderedP(X0) ) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f129]) ).
fof(f201,plain,
! [X0] :
( ( ( strictorderedP(X0)
| ? [X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ? [X5] :
( ~ lt(X1,X2)
& app(app(X3,cons(X1,X4)),cons(X2,X5)) = X0
& ssList(X5) )
& ssList(X4) )
& ssList(X3) )
& ssItem(X2) )
& ssItem(X1) ) )
& ( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ! [X10] :
( lt(X6,X7)
| app(app(X8,cons(X6,X9)),cons(X7,X10)) != X0
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssItem(X7) )
| ~ ssItem(X6) )
| ~ strictorderedP(X0) ) )
| ~ ssList(X0) ),
inference(rectify,[],[f200]) ).
fof(f202,plain,
! [X0] :
( ( ( strictorderedP(X0)
| ( ~ lt(sK25(X0),sK26(X0))
& app(app(sK27(X0),cons(sK25(X0),sK28(X0))),cons(sK26(X0),sK29(X0))) = X0
& ssList(sK29(X0))
& ssList(sK28(X0))
& ssList(sK27(X0))
& ssItem(sK26(X0))
& ssItem(sK25(X0)) ) )
& ( ! [X6] :
( ! [X7] :
( ! [X8] :
( ! [X9] :
( ! [X10] :
( lt(X6,X7)
| app(app(X8,cons(X6,X9)),cons(X7,X10)) != X0
| ~ ssList(X10) )
| ~ ssList(X9) )
| ~ ssList(X8) )
| ~ ssItem(X7) )
| ~ ssItem(X6) )
| ~ strictorderedP(X0) ) )
| ~ ssList(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK25,sK26,sK27,sK28,sK29]),skolemize(X1,sK25(X0)),skolemize(X2,sK26(X0)),skolemize(X3,sK27(X0)),skolemize(X4,sK28(X0)),skolemize(X5,sK29(X0))],[f201]) ).
fof(f240,plain,
ssList(sK6),
inference(cnf_transformation,[],[f183]) ).
fof(f245,plain,
~ duplicatefreeP(sK6),
inference(cnf_transformation,[],[f183]) ).
fof(f250,plain,
strictorderedP(sK8),
inference(cnf_transformation,[],[f183]) ).
fof(f252,plain,
sK6 = sK8,
inference(cnf_transformation,[],[f183]) ).
fof(f301,plain,
! [X0] :
( ssItem(sK20(X0))
| duplicatefreeP(X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f199]) ).
fof(f303,plain,
! [X0] :
( ssList(sK22(X0))
| duplicatefreeP(X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f199]) ).
fof(f304,plain,
! [X0] :
( ssList(sK23(X0))
| duplicatefreeP(X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f199]) ).
fof(f305,plain,
! [X0] :
( ssList(sK24(X0))
| duplicatefreeP(X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f199]) ).
fof(f306,plain,
! [X0] :
( duplicatefreeP(X0)
| app(app(sK22(X0),cons(sK20(X0),sK23(X0))),cons(sK21(X0),sK24(X0))) = X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f199]) ).
fof(f307,plain,
! [X0] :
( duplicatefreeP(X0)
| sK20(X0) = sK21(X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f199]) ).
fof(f308,plain,
! [X10,X0,X8,X6,X9,X7] :
( lt(X6,X7)
| app(app(X8,cons(X6,X9)),cons(X7,X10)) != X0
| ~ ssList(X10)
| ~ ssList(X9)
| ~ ssList(X8)
| ~ ssItem(X7)
| ~ ssItem(X6)
| ~ strictorderedP(X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f202]) ).
fof(f400,plain,
! [X0] :
( ~ lt(X0,X0)
| ~ ssItem(X0) ),
inference(cnf_transformation,[],[f168]) ).
fof(f407,plain,
~ duplicatefreeP(sK8),
inference(definition_unfolding,[],[f245,f252]) ).
fof(f409,plain,
ssList(sK8),
inference(definition_unfolding,[],[f240,f252]) ).
fof(f419,plain,
! [X10,X8,X6,X9,X7] :
( ~ ssList(app(app(X8,cons(X6,X9)),cons(X7,X10)))
| ~ ssList(X10)
| ~ ssList(X9)
| ~ ssList(X8)
| ~ ssItem(X7)
| ~ ssItem(X6)
| ~ strictorderedP(app(app(X8,cons(X6,X9)),cons(X7,X10)))
| lt(X6,X7) ),
inference(equality_resolution,[],[f308]) ).
fof(f457,plain,
( sK20(sK8) = sK21(sK8)
| ~ ssList(sK8) ),
inference(resolution,[],[f307,f407]) ).
fof(f458,plain,
sK20(sK8) = sK21(sK8),
inference(forward_subsumption_resolution,[],[f457,f409]) ).
fof(f1342,plain,
( sK8 = app(app(sK22(sK8),cons(sK20(sK8),sK23(sK8))),cons(sK21(sK8),sK24(sK8)))
| ~ ssList(sK8) ),
inference(resolution,[],[f306,f407]) ).
fof(f1343,plain,
sK8 = app(app(sK22(sK8),cons(sK20(sK8),sK23(sK8))),cons(sK21(sK8),sK24(sK8))),
inference(forward_subsumption_resolution,[],[f1342,f409]) ).
fof(f1344,plain,
sK8 = app(app(sK22(sK8),cons(sK20(sK8),sK23(sK8))),cons(sK20(sK8),sK24(sK8))),
inference(forward_demodulation,[],[f1343,f458]) ).
fof(f1776,plain,
( ~ ssList(sK8)
| ~ ssList(sK24(sK8))
| ~ ssList(sK23(sK8))
| ~ ssList(sK22(sK8))
| ~ ssItem(sK20(sK8))
| ~ ssItem(sK20(sK8))
| ~ strictorderedP(sK8)
| lt(sK20(sK8),sK20(sK8)) ),
inference(superposition,[],[f419,f1344]) ).
fof(f1799,plain,
( ~ ssList(sK8)
| ~ ssList(sK24(sK8))
| ~ ssList(sK23(sK8))
| ~ ssList(sK22(sK8))
| ~ ssItem(sK20(sK8))
| ~ strictorderedP(sK8)
| lt(sK20(sK8),sK20(sK8)) ),
inference(duplicate_literal_removal,[],[f1776]) ).
fof(f1844,definition,
( spl57_58
<=> ssItem(sK20(sK8)) ),
introduced(definition,[new_symbols(definition,[spl57_58])],[avatar_definition]) ).
fof(f1846,plain,
( ~ ssItem(sK20(sK8))
| spl57_58 ),
inference(avatar_component_clause,[],[f1844]) ).
fof(f1848,definition,
( spl57_59
<=> ssList(sK24(sK8)) ),
introduced(definition,[new_symbols(definition,[spl57_59])],[avatar_definition]) ).
fof(f1850,plain,
( ~ ssList(sK24(sK8))
| spl57_59 ),
inference(avatar_component_clause,[],[f1848]) ).
fof(f1864,definition,
( spl57_63
<=> ssList(sK22(sK8)) ),
introduced(definition,[new_symbols(definition,[spl57_63])],[avatar_definition]) ).
fof(f1866,plain,
( ~ ssList(sK22(sK8))
| spl57_63 ),
inference(avatar_component_clause,[],[f1864]) ).
fof(f1878,plain,
( ~ ssList(sK24(sK8))
| ~ ssList(sK23(sK8))
| ~ ssList(sK22(sK8))
| ~ ssItem(sK20(sK8))
| ~ strictorderedP(sK8)
| lt(sK20(sK8),sK20(sK8)) ),
inference(forward_subsumption_resolution,[],[f1799,f409]) ).
fof(f1901,definition,
( spl57_70
<=> ssList(sK23(sK8)) ),
introduced(definition,[new_symbols(definition,[spl57_70])],[avatar_definition]) ).
fof(f1903,plain,
( ~ ssList(sK23(sK8))
| spl57_70 ),
inference(avatar_component_clause,[],[f1901]) ).
fof(f1909,plain,
( ~ ssList(sK24(sK8))
| ~ ssList(sK23(sK8))
| ~ ssList(sK22(sK8))
| ~ ssItem(sK20(sK8))
| lt(sK20(sK8),sK20(sK8)) ),
inference(forward_subsumption_resolution,[],[f1878,f250]) ).
fof(f1910,plain,
( ~ ssList(sK24(sK8))
| ~ ssList(sK23(sK8))
| ~ ssList(sK22(sK8))
| ~ ssItem(sK20(sK8)) ),
inference(forward_subsumption_resolution,[],[f1909,f400]) ).
fof(f1911,plain,
( ~ spl57_58
| ~ spl57_63
| ~ spl57_70
| ~ spl57_59 ),
inference(avatar_split_clause,[],[f1910,f1848,f1901,f1864,f1844]) ).
fof(f1912,plain,
( duplicatefreeP(sK8)
| ~ ssList(sK8)
| spl57_63 ),
inference(resolution,[],[f1866,f303]) ).
fof(f1913,plain,
( ~ ssList(sK8)
| spl57_63 ),
inference(forward_subsumption_resolution,[],[f1912,f407]) ).
fof(f1914,plain,
( $false
| spl57_63 ),
inference(forward_subsumption_resolution,[],[f1913,f409]) ).
fof(f1915,plain,
spl57_63,
inference(avatar_contradiction_clause,[],[f1914]) ).
fof(f1920,plain,
( duplicatefreeP(sK8)
| ~ ssList(sK8)
| spl57_58 ),
inference(resolution,[],[f1846,f301]) ).
fof(f1921,plain,
( ~ ssList(sK8)
| spl57_58 ),
inference(forward_subsumption_resolution,[],[f1920,f407]) ).
fof(f1922,plain,
( $false
| spl57_58 ),
inference(forward_subsumption_resolution,[],[f1921,f409]) ).
fof(f1923,plain,
spl57_58,
inference(avatar_contradiction_clause,[],[f1922]) ).
fof(f1940,plain,
( duplicatefreeP(sK8)
| ~ ssList(sK8)
| spl57_59 ),
inference(resolution,[],[f1850,f305]) ).
fof(f1941,plain,
( ~ ssList(sK8)
| spl57_59 ),
inference(forward_subsumption_resolution,[],[f1940,f407]) ).
fof(f1942,plain,
( $false
| spl57_59 ),
inference(forward_subsumption_resolution,[],[f1941,f409]) ).
fof(f1943,plain,
spl57_59,
inference(avatar_contradiction_clause,[],[f1942]) ).
fof(f2039,plain,
( duplicatefreeP(sK8)
| ~ ssList(sK8)
| spl57_70 ),
inference(resolution,[],[f1903,f304]) ).
fof(f2040,plain,
( ~ ssList(sK8)
| spl57_70 ),
inference(forward_subsumption_resolution,[],[f2039,f407]) ).
fof(f2041,plain,
( $false
| spl57_70 ),
inference(forward_subsumption_resolution,[],[f2040,f409]) ).
fof(f2042,plain,
spl57_70,
inference(avatar_contradiction_clause,[],[f2041]) ).
cnf(s75,plain,
( ~ spl57_58
| ~ spl57_59
| ~ spl57_63
| ~ spl57_70 ),
inference(sat_conversion,[],[f1911]) ).
cnf(s76,plain,
spl57_63,
inference(sat_conversion,[],[f1915]) ).
cnf(s77,plain,
spl57_58,
inference(sat_conversion,[],[f1923]) ).
cnf(s78,plain,
spl57_59,
inference(sat_conversion,[],[f1943]) ).
cnf(s79,plain,
spl57_70,
inference(sat_conversion,[],[f2042]) ).
cnf(s80,plain,
$false,
inference(rat,[],[s75,s79,s76,s78,s77]) ).
fof(f2043,plain,
$false,
inference(avatar_sat_refutation,[],[s80]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01 % Problem : SWC181+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.03 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.04/0.32 % Computer : n012.cluster.edu
% 0.04/0.32 % Model : x86_64 x86_64
% 0.04/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.32 % Memory : 8046.5625MB
% 0.04/0.32 % OS : Linux 6.8.0-71-generic
% 0.04/0.32 % CPULimit : 300
% 0.04/0.32 % WCLimit : 300
% 0.04/0.32 % DateTime : Mon Sep 28 08:19:51 UTC 2026
% 0.04/0.32 % CPUTime :
% 0.04/0.32 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.34 Running first-order theorem proving
% 0.07/0.34 Running: /export/starexec/sandbox/solver/bin/vampire --input_syntax tptp --output_axiom_names on --mode casc -m 16384 --cores 7 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 1.07/0.96 % (3230880)Detected formulas, will run a generic FOF schedule.
% 1.07/0.96 % (3230890)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=3330815766:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 1.07/0.96 % (3230888)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=414765328:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 1.07/0.96 % (3230887)lrs+1010_1_anc=all:sfv=off:to=kbo:ncem=casc2026/models/loop7.pt:sil=128000:npcc=on:prc=on:sos=all:bsr=unit_only:sac=on:random_seed=193989525:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 1.07/0.96 % (3230891)dis-21_1_sil=8000:lcm=predicate:random_seed=397017597:st=5:avsq=on:i=129:avsqr=1,16:sd=3:aac=none:ep=RS:fsr=off:ss=included_2999 on theBenchmark for (2999ds/129Mi)
% 1.07/0.96 % (3230889)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=4073634829:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 1.07/0.96 % (3230886)lrs+11_1_ncem=casc2026/models/loop8.pt:sil=128000:npcc=on:lma=off:spb=units:urr=ec_only:bce=on:s2agt=64:updr=off:random_seed=914841439:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 1.07/0.96 % (3230885)lrs+10_1_ncem=casc2026/models/loop8.pt:sil=128000:tgt=full:npcc=on:drc=off:sp=weighted_frequency:spb=goal:fd=preordered:foolp=on:random_seed=460932065:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 1.07/0.96 % (3230889)Instruction limit reached!
% 1.07/0.96 % (3230889)------------------------------
% 1.07/0.96 % (3230889)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.07/0.96 % (3230889)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.07/0.96 % (3230889)CaDiCaL version: 2.1.3
% 1.07/0.96 % (3230889)Termination reason: Instruction limit
% 1.07/0.96 % (3230889)Termination phase: Saturation
% 1.07/0.96 % (3230889)Time elapsed: 0.038 s
% 1.07/0.96 % (3230889)Peak memory usage: 88 MB
% 1.07/0.96 % (3230889)Instructions burned: 122 (million)
% 1.07/0.96 % (3230888)Instruction limit reached!
% 1.07/0.96 % (3230888)------------------------------
% 1.07/0.96 % (3230888)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.07/0.96 % (3230888)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.07/0.96 % (3230888)CaDiCaL version: 2.1.3
% 1.07/0.96 % (3230888)Termination reason: Instruction limit
% 1.07/0.96 % (3230888)Termination phase: Saturation
% 1.07/0.96 % (3230888)Time elapsed: 0.038 s
% 1.07/0.96 % (3230888)Peak memory usage: 89 MB
% 1.07/0.96 % (3230888)Instructions burned: 110 (million)
% 1.07/0.96 % (3230891)Instruction limit reached!
% 1.07/0.96 % (3230891)------------------------------
% 1.07/0.96 % (3230891)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.07/0.96 % (3230891)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.07/0.96 % (3230891)CaDiCaL version: 2.1.3
% 1.07/0.96 % (3230891)Termination reason: Instruction limit
% 1.07/0.96 % (3230891)Termination phase: Saturation
% 1.07/0.96 % (3230891)Time elapsed: 0.038 s
% 1.07/0.96 % (3230891)Peak memory usage: 91 MB
% 1.07/0.96 % (3230891)Instructions burned: 130 (million)
% 1.07/0.96 % (3230890)Instruction limit reached!
% 1.07/0.96 % (3230890)------------------------------
% 1.07/0.96 % (3230890)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.07/0.96 % (3230890)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.07/0.96 % (3230890)CaDiCaL version: 2.1.3
% 1.07/0.96 % (3230890)Termination reason: Instruction limit
% 1.07/0.96 % (3230890)Termination phase: Saturation
% 1.07/0.96 % (3230890)Time elapsed: 0.050 s
% 1.07/0.96 % (3230890)Peak memory usage: 90 MB
% 1.07/0.96 % (3230890)Instructions burned: 140 (million)
% 1.07/0.96 % (3230902)dis+10_5:1_slsqr=1,4:sil=8000:fde=unused:erd=off:urr=full:fd=off:s2agt=8:br=off:slsq=on:random_seed=875442121:s2a=on:i=248:s2at=1.23:gtg=position_2998 on theBenchmark for (2998ds/248Mi)
% 1.07/0.96 % (3230899)lrs+10_1_sil=8000:sp=occurrence:random_seed=2467402396:i=285:sd=3:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/285Mi)
% 1.07/0.96 % (3230900)lrs+10_1_sil=32000:urr=on:br=off:random_seed=2160584040:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2998 on theBenchmark for (2998ds/157Mi)
% 1.07/0.96 % (3230901)lrs+1011_1_sil=32000:sp=occurrence:random_seed=1969094754:i=325:sd=1:ss=axioms:sgt=32_2998 on theBenchmark for (2998ds/325Mi)
% 1.07/0.96 % (3230901)First to succeed.
% 1.07/0.96 % (3230901)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3230880"
% 1.07/0.96 % (3230899)Also succeeded, but the first one will report.
% 1.07/0.96 % (3230900)Instruction limit reached!
% 1.07/0.96 % (3230900)------------------------------
% 1.07/0.96 % (3230900)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.07/0.96 % (3230900)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.07/0.96 % (3230900)CaDiCaL version: 2.1.3
% 1.07/0.96 % (3230900)Termination reason: Instruction limit
% 1.07/0.96 % (3230900)Termination phase: Saturation
% 1.07/0.96 % (3230900)Time elapsed: 0.046 s
% 1.07/0.96 % (3230900)Peak memory usage: 94 MB
% 1.07/0.96 % (3230900)Instructions burned: 157 (million)
% 1.07/0.96 % (3230902)Instruction limit reached!
% 1.07/0.96 % (3230902)------------------------------
% 1.07/0.96 % (3230902)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 1.07/0.96 % (3230902)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 1.07/0.96 % (3230902)CaDiCaL version: 2.1.3
% 1.07/0.96 % (3230902)Termination reason: Instruction limit
% 1.07/0.96 % (3230902)Termination phase: Saturation
% 1.07/0.96 % (3230902)Time elapsed: 0.065 s
% 1.07/0.96 % (3230902)Peak memory usage: 94 MB
% 1.07/0.96 % (3230902)Instructions burned: 251 (million)
% 1.07/0.96 % (3230907)lrs+1002_1_to=lpo:sil=8000:sos=on:random_seed=3284520411:st=4:cts=off:i=294:sd=2:ins=7:amm=off:ss=axioms_2997 on theBenchmark for (2997ds/294Mi)
% 1.07/0.96 % (3230908)lrs+10_1_ncem=casc2026/models/loop7.pt:sil=32000:tgt=ground:npcc=on:random_seed=900967374:i=2350_2996 on theBenchmark for (2996ds/2350Mi)
% 1.07/0.96 % (3230901)Refutation found. Thanks to Tanya!
% 1.07/0.96 % SZS status Theorem for theBenchmark
% 1.07/0.96 % SZS output start Proof for theBenchmark
% See solution above
% 3.16/1.05 % (3230901)------------------------------
% 3.16/1.05 % (3230901)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.16/1.05 % (3230901)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.16/1.05 % (3230901)CaDiCaL version: 2.1.3
% 3.16/1.05 % (3230901)Termination reason: Refutation
% 3.16/1.05 % (3230901)Time elapsed: 0.027 s
% 3.16/1.05 % (3230901)Peak memory usage: 90 MB
% 3.16/1.05 % (3230901)Instructions burned: 74 (million)
% 3.16/1.05 % (3230901)------------------------------
% 3.16/1.05 % (3230901)------------------------------
% 3.16/1.05 % (3230880)Success in time 0.423 s
% 3.16/1.05 % Vampire exiting
%------------------------------------------------------------------------------