%------------------------------------------------------------------------------
% File : Vampire---5.0.1
% Problem : SWC389+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 : n016.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:03:46 PM UTC 2026
% Result : Theorem 3.03s 1.10s
% Output : Refutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 9
% Syntax : Number of formulae : 81 ( 14 unt; 1 def)
% Number of atoms : 362 ( 68 equ)
% Maximal formula atoms : 22 ( 4 avg)
% Number of connectives : 463 ( 182 ~; 166 |; 91 &)
% ( 6 <=>; 18 =>; 0 <=; 0 <~>)
% Maximal formula depth : 22 ( 6 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 10 ( 8 usr; 1 prp; 0-2 aty)
% Number of functors : 13 ( 13 usr; 5 con; 0-2 aty)
% Number of variables : 151 ( 115 !; 36 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f4,axiom,
! [X0] :
( ssList(X0)
=> ( singletonP(X0)
<=> ? [X1] :
( ssItem(X1)
& cons(X1,nil) = X0 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax4) ).
fof(f7,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( segmentP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& app(app(X2,X1),X3) = X0 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax7) ).
fof(f15,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ( neq(X0,X1)
<=> X0 != X1 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax15) ).
fof(f16,axiom,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssItem(X1)
=> ssList(cons(X1,X0)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax16) ).
fof(f17,axiom,
ssList(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax17) ).
fof(f39,axiom,
~ singletonP(nil),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax39) ).
fof(f55,axiom,
! [X0] :
( ssList(X0)
=> segmentP(X0,X0) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax55) ).
fof(f96,conjecture,
! [X0] :
( ssList(X0)
=> ! [X1] :
( ssList(X1)
=> ! [X2] :
( ssList(X2)
=> ! [X3] :
( ~ ssList(X3)
| X1 != X3
| X0 != X2
| ( ! [X4] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ~ ssList(X6)
| cons(X4,nil) != X2
| app(app(X5,X2),X6) != X3
| ? [X7] :
( ssItem(X7)
& memberP(X5,X7)
& lt(X4,X7) )
| ? [X8] :
( ssItem(X8)
& memberP(X6,X8)
& lt(X8,X4) ) ) ) )
& ( nil != X3
| nil != X2 ) )
| ( segmentP(X1,X0)
& ( ~ neq(X1,nil)
| singletonP(X0) ) ) ) ) ) ),
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] :
( ssItem(X4)
=> ! [X5] :
( ssList(X5)
=> ! [X6] :
( ~ ssList(X6)
| cons(X4,nil) != X2
| app(app(X5,X2),X6) != X3
| ? [X7] :
( ssItem(X7)
& memberP(X5,X7)
& lt(X4,X7) )
| ? [X8] :
( ssItem(X8)
& memberP(X6,X8)
& lt(X8,X4) ) ) ) )
& ( nil != X3
| nil != X2 ) )
| ( segmentP(X1,X0)
& ( ~ neq(X1,nil)
| singletonP(X0) ) ) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f96]) ).
fof(f98,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ssList(X3)
& X1 = X3
& X0 = X2
& ( ? [X4] :
( ? [X5] :
( ? [X6] :
( ssList(X6)
& cons(X4,nil) = X2
& app(app(X5,X2),X6) = X3
& ! [X7] :
( ~ ssItem(X7)
| ~ memberP(X5,X7)
| ~ lt(X4,X7) )
& ! [X8] :
( ~ ssItem(X8)
| ~ memberP(X6,X8)
| ~ lt(X8,X4) ) )
& ssList(X5) )
& ssItem(X4) )
| ( nil = X3
& nil = X2 ) )
& ( ~ segmentP(X1,X0)
| ( neq(X1,nil)
& ~ singletonP(X0) ) ) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(ennf_transformation,[],[f97]) ).
fof(f105,plain,
! [X0] :
( ! [X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f16]) ).
fof(f117,plain,
! [X0] :
( ! [X1] :
( ( neq(X0,X1)
<=> X0 != X1 )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f15]) ).
fof(f123,plain,
! [X0] :
( ( singletonP(X0)
<=> ? [X1] :
( ssItem(X1)
& cons(X1,nil) = X0 ) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f4]) ).
fof(f128,plain,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f55]) ).
fof(f133,plain,
! [X0] :
( ! [X1] :
( ( segmentP(X0,X1)
<=> ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& app(app(X2,X1),X3) = X0 ) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(ennf_transformation,[],[f7]) ).
fof(f149,definition,
! [X2,X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ssList(X6)
& cons(X4,nil) = X2
& app(app(X5,X2),X6) = X3
& ! [X7] :
( ~ ssItem(X7)
| ~ memberP(X5,X7)
| ~ lt(X4,X7) )
& ! [X8] :
( ~ ssItem(X8)
| ~ memberP(X6,X8)
| ~ lt(X8,X4) ) )
& ssList(X5) )
& ssItem(X4) )
| ~ sP0(X2,X3) ),
introduced(definition,[new_symbols(definition,[sP0])],[predicate_definition_introduction]) ).
fof(f150,plain,
? [X0] :
( ? [X1] :
( ? [X2] :
( ? [X3] :
( ssList(X3)
& X1 = X3
& X0 = X2
& ( sP0(X2,X3)
| ( nil = X3
& nil = X2 ) )
& ( ~ segmentP(X1,X0)
| ( neq(X1,nil)
& ~ singletonP(X0) ) ) )
& ssList(X2) )
& ssList(X1) )
& ssList(X0) ),
inference(definition_folding,[],[f98,f149]) ).
fof(f151,plain,
! [X2,X3] :
( ? [X4] :
( ? [X5] :
( ? [X6] :
( ssList(X6)
& cons(X4,nil) = X2
& app(app(X5,X2),X6) = X3
& ! [X7] :
( ~ ssItem(X7)
| ~ memberP(X5,X7)
| ~ lt(X4,X7) )
& ! [X8] :
( ~ ssItem(X8)
| ~ memberP(X6,X8)
| ~ lt(X8,X4) ) )
& ssList(X5) )
& ssItem(X4) )
| ~ sP0(X2,X3) ),
inference(nnf_transformation,[],[f149]) ).
fof(f152,plain,
! [X0,X1] :
( ? [X2] :
( ? [X3] :
( ? [X4] :
( ssList(X4)
& cons(X2,nil) = X0
& app(app(X3,X0),X4) = X1
& ! [X5] :
( ~ ssItem(X5)
| ~ memberP(X3,X5)
| ~ lt(X2,X5) )
& ! [X6] :
( ~ ssItem(X6)
| ~ memberP(X4,X6)
| ~ lt(X6,X2) ) )
& ssList(X3) )
& ssItem(X2) )
| ~ sP0(X0,X1) ),
inference(rectify,[],[f151]) ).
fof(f153,plain,
! [X0,X1] :
( ( ssList(sK3(X0,X1))
& cons(sK1(X0,X1),nil) = X0
& app(app(sK2(X0,X1),X0),sK3(X0,X1)) = X1
& ! [X5] :
( ~ ssItem(X5)
| ~ memberP(sK2(X0,X1),X5)
| ~ lt(sK1(X0,X1),X5) )
& ! [X6] :
( ~ ssItem(X6)
| ~ memberP(sK3(X0,X1),X6)
| ~ lt(X6,sK1(X0,X1)) )
& ssList(sK2(X0,X1))
& ssItem(sK1(X0,X1)) )
| ~ sP0(X0,X1) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK1,sK2,sK3]),skolemize(X2,sK1(X0,X1)),skolemize(X3,sK2(X0,X1)),skolemize(X4,sK3(X0,X1))],[f152]) ).
fof(f154,plain,
( ssList(sK7)
& sK5 = sK7
& sK4 = sK6
& ( sP0(sK6,sK7)
| ( nil = sK7
& nil = sK6 ) )
& ( ~ segmentP(sK5,sK4)
| ( neq(sK5,nil)
& ~ singletonP(sK4) ) )
& ssList(sK6)
& ssList(sK5)
& ssList(sK4) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK4,sK5,sK6,sK7]),skolemize(X0,sK4),skolemize(X1,sK5),skolemize(X2,sK6),skolemize(X3,sK7)],[f150]) ).
fof(f159,plain,
! [X0] :
( ! [X1] :
( ( ( neq(X0,X1)
| X0 = X1 )
& ( X0 != X1
| ~ neq(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f117]) ).
fof(f168,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,[],[f123]) ).
fof(f169,plain,
! [X0] :
( ( ( singletonP(X0)
| ! [X1] :
( ~ ssItem(X1)
| cons(X1,nil) != X0 ) )
& ( ? [X2] :
( ssItem(X2)
& cons(X2,nil) = X0 )
| ~ singletonP(X0) ) )
| ~ ssList(X0) ),
inference(rectify,[],[f168]) ).
fof(f170,plain,
! [X0] :
( ( ( singletonP(X0)
| ! [X1] :
( ~ ssItem(X1)
| cons(X1,nil) != X0 ) )
& ( ( ssItem(sK14(X0))
& cons(sK14(X0),nil) = X0 )
| ~ singletonP(X0) ) )
| ~ ssList(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK14]),skolemize(X2,sK14(X0))],[f169]) ).
fof(f172,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| ! [X3] :
( ~ ssList(X3)
| app(app(X2,X1),X3) != X0 ) ) )
& ( ? [X2] :
( ssList(X2)
& ? [X3] :
( ssList(X3)
& app(app(X2,X1),X3) = X0 ) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(nnf_transformation,[],[f133]) ).
fof(f173,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| ! [X3] :
( ~ ssList(X3)
| app(app(X2,X1),X3) != X0 ) ) )
& ( ? [X4] :
( ssList(X4)
& ? [X5] :
( ssList(X5)
& app(app(X4,X1),X5) = X0 ) )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(rectify,[],[f172]) ).
fof(f174,plain,
! [X0] :
( ! [X1] :
( ( ( segmentP(X0,X1)
| ! [X2] :
( ~ ssList(X2)
| ! [X3] :
( ~ ssList(X3)
| app(app(X2,X1),X3) != X0 ) ) )
& ( ( ssList(sK15(X0,X1))
& ssList(sK16(X0,X1))
& app(app(sK15(X0,X1),X1),sK16(X0,X1)) = X0 )
| ~ segmentP(X0,X1) ) )
| ~ ssList(X1) )
| ~ ssList(X0) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK15,sK16]),skolemize(X4,sK15(X0,X1)),skolemize(X5,sK16(X0,X1))],[f173]) ).
fof(f177,plain,
! [X0,X1] :
( ssItem(sK1(X0,X1))
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f153]) ).
fof(f178,plain,
! [X0,X1] :
( ssList(sK2(X0,X1))
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f153]) ).
fof(f181,plain,
! [X0,X1] :
( app(app(sK2(X0,X1),X0),sK3(X0,X1)) = X1
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f153]) ).
fof(f182,plain,
! [X0,X1] :
( cons(sK1(X0,X1),nil) = X0
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f153]) ).
fof(f183,plain,
! [X0,X1] :
( ssList(sK3(X0,X1))
| ~ sP0(X0,X1) ),
inference(cnf_transformation,[],[f153]) ).
fof(f186,plain,
ssList(sK6),
inference(cnf_transformation,[],[f154]) ).
fof(f187,plain,
( ~ segmentP(sK5,sK4)
| ~ singletonP(sK4) ),
inference(cnf_transformation,[],[f154]) ).
fof(f188,plain,
( ~ segmentP(sK5,sK4)
| neq(sK5,nil) ),
inference(cnf_transformation,[],[f154]) ).
fof(f189,plain,
( sP0(sK6,sK7)
| nil = sK6 ),
inference(cnf_transformation,[],[f154]) ).
fof(f190,plain,
( sP0(sK6,sK7)
| nil = sK7 ),
inference(cnf_transformation,[],[f154]) ).
fof(f191,plain,
sK4 = sK6,
inference(cnf_transformation,[],[f154]) ).
fof(f192,plain,
sK5 = sK7,
inference(cnf_transformation,[],[f154]) ).
fof(f193,plain,
ssList(sK7),
inference(cnf_transformation,[],[f154]) ).
fof(f204,plain,
! [X0,X1] :
( ssList(cons(X1,X0))
| ~ ssItem(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f105]) ).
fof(f216,plain,
! [X0,X1] :
( X0 != X1
| ~ neq(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f159]) ).
fof(f220,plain,
ssList(nil),
inference(cnf_transformation,[],[f17]) ).
fof(f232,plain,
~ singletonP(nil),
inference(cnf_transformation,[],[f39]) ).
fof(f235,plain,
! [X0,X1] :
( singletonP(X0)
| ~ ssItem(X1)
| cons(X1,nil) != X0
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f170]) ).
fof(f240,plain,
! [X0] :
( segmentP(X0,X0)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f128]) ).
fof(f246,plain,
! [X2,X3,X0,X1] :
( segmentP(X0,X1)
| ~ ssList(X2)
| ~ ssList(X3)
| app(app(X2,X1),X3) != X0
| ~ ssList(X1)
| ~ ssList(X0) ),
inference(cnf_transformation,[],[f174]) ).
fof(f258,plain,
( neq(sK7,nil)
| ~ segmentP(sK7,sK6) ),
inference(definition_unfolding,[],[f188,f192,f191,f192]) ).
fof(f259,plain,
( ~ segmentP(sK7,sK6)
| ~ singletonP(sK6) ),
inference(definition_unfolding,[],[f187,f192,f191,f191]) ).
fof(f264,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1)
| ~ ssList(X1) ),
inference(equality_resolution,[],[f216]) ).
fof(f268,plain,
! [X1] :
( singletonP(cons(X1,nil))
| ~ ssItem(X1)
| ~ ssList(cons(X1,nil)) ),
inference(equality_resolution,[],[f235]) ).
fof(f270,plain,
! [X2,X3,X1] :
( segmentP(app(app(X2,X1),X3),X1)
| ~ ssList(X2)
| ~ ssList(X3)
| ~ ssList(X1)
| ~ ssList(app(app(X2,X1),X3)) ),
inference(equality_resolution,[],[f246]) ).
fof(f275,plain,
! [X1] :
( ~ neq(X1,X1)
| ~ ssList(X1) ),
inference(duplicate_literal_removal,[],[f264]) ).
fof(f288,plain,
! [X0,X1] :
( ssList(X0)
| ~ ssItem(sK1(X0,X1))
| ~ ssList(nil)
| ~ sP0(X0,X1) ),
inference(superposition,[],[f204,f182]) ).
fof(f289,plain,
! [X0,X1] :
( ssList(X0)
| ~ ssItem(sK1(X0,X1))
| ~ sP0(X0,X1) ),
inference(forward_subsumption_resolution,[],[f288,f220]) ).
fof(f293,plain,
! [X0,X1] :
( ~ sP0(X0,X1)
| ssList(X0) ),
inference(forward_subsumption_resolution,[],[f289,f177]) ).
fof(f323,plain,
! [X0,X1] :
( singletonP(X0)
| ~ ssItem(sK1(X0,X1))
| ~ ssList(X0)
| ~ sP0(X0,X1) ),
inference(superposition,[],[f268,f182]) ).
fof(f326,plain,
! [X0,X1] :
( singletonP(X0)
| ~ ssList(X0)
| ~ sP0(X0,X1) ),
inference(forward_subsumption_resolution,[],[f323,f177]) ).
fof(f327,plain,
! [X0,X1] :
( ~ sP0(X0,X1)
| singletonP(X0) ),
inference(forward_subsumption_resolution,[],[f326,f293]) ).
fof(f328,plain,
( nil = sK7
| singletonP(sK6) ),
inference(resolution,[],[f327,f190]) ).
fof(f329,plain,
( nil = sK6
| singletonP(sK6) ),
inference(resolution,[],[f327,f189]) ).
fof(f339,plain,
( neq(sK7,sK7)
| ~ segmentP(sK7,sK6)
| singletonP(sK6) ),
inference(superposition,[],[f258,f328]) ).
fof(f344,plain,
( neq(sK7,sK7)
| ~ segmentP(sK7,sK6) ),
inference(forward_subsumption_resolution,[],[f339,f259]) ).
fof(f360,plain,
( sK6 = sK7
| singletonP(sK6)
| singletonP(sK6) ),
inference(superposition,[],[f328,f329]) ).
fof(f361,plain,
( sK6 = sK7
| singletonP(sK6) ),
inference(duplicate_literal_removal,[],[f360]) ).
fof(f379,plain,
( ~ segmentP(sK7,sK6)
| ~ ssList(sK7) ),
inference(resolution,[],[f344,f275]) ).
fof(f382,plain,
~ segmentP(sK7,sK6),
inference(forward_subsumption_resolution,[],[f379,f193]) ).
fof(f383,plain,
( ~ segmentP(sK6,sK6)
| singletonP(sK6) ),
inference(superposition,[],[f382,f361]) ).
fof(f388,plain,
( singletonP(sK6)
| ~ ssList(sK6) ),
inference(resolution,[],[f383,f240]) ).
fof(f389,plain,
singletonP(sK6),
inference(forward_subsumption_resolution,[],[f388,f186]) ).
fof(f1079,plain,
! [X0,X1] :
( segmentP(X0,X1)
| ~ ssList(sK2(X1,X0))
| ~ ssList(sK3(X1,X0))
| ~ ssList(X1)
| ~ ssList(X0)
| ~ sP0(X1,X0) ),
inference(superposition,[],[f270,f181]) ).
fof(f1093,plain,
! [X0,X1] :
( segmentP(X0,X1)
| ~ ssList(sK3(X1,X0))
| ~ ssList(X1)
| ~ ssList(X0)
| ~ sP0(X1,X0) ),
inference(forward_subsumption_resolution,[],[f1079,f178]) ).
fof(f1101,plain,
! [X0,X1] :
( segmentP(X0,X1)
| ~ ssList(X1)
| ~ ssList(X0)
| ~ sP0(X1,X0) ),
inference(forward_subsumption_resolution,[],[f1093,f183]) ).
fof(f1105,plain,
! [X0,X1] :
( segmentP(X0,X1)
| ~ ssList(X0)
| ~ sP0(X1,X0) ),
inference(forward_subsumption_resolution,[],[f1101,f293]) ).
fof(f1167,plain,
( ~ ssList(sK7)
| ~ sP0(sK6,sK7)
| ~ singletonP(sK6) ),
inference(resolution,[],[f1105,f259]) ).
fof(f1187,plain,
( ~ ssList(sK7)
| ~ sP0(sK6,sK7) ),
inference(forward_subsumption_resolution,[],[f1167,f327]) ).
fof(f1209,plain,
~ sP0(sK6,sK7),
inference(forward_subsumption_resolution,[],[f1187,f193]) ).
fof(f1221,plain,
nil = sK6,
inference(resolution,[],[f1209,f189]) ).
fof(f1267,plain,
~ singletonP(sK6),
inference(superposition,[],[f232,f1221]) ).
fof(f1288,plain,
$false,
inference(forward_subsumption_resolution,[],[f1267,f389]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SWC389+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.18 % Computer : n016.cluster.edu
% 0.09/0.18 % Model : x86_64 x86_64
% 0.09/0.18 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.18 % Memory : 8046.5625MB
% 0.09/0.18 % OS : Linux 6.8.0-71-generic
% 0.09/0.18 % CPULimit : 300
% 0.09/0.19 % WCLimit : 300
% 0.09/0.19 % DateTime : Mon Sep 28 09:30:34 UTC 2026
% 0.09/0.19 % CPUTime :
% 0.09/0.19 Running run_vampire /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.22 Running first-order theorem proving
% 0.09/0.22 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
% 3.03/1.10 % (3505135)Detected formulas, will run a generic FOF schedule.
% 3.03/1.10 % (3505140)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=1259614207:i=141193_2999 on theBenchmark for (2999ds/141193Mi)
% 3.03/1.10 % (3505145)dis-1011_1_sil=16000:fde=unused:s2agt=70:random_seed=4242157129:s2a=on:i=139:gtg=position_2999 on theBenchmark for (2999ds/139Mi)
% 3.03/1.10 % (3505144)dis-1010_2:3_sil=16000:sp=reverse_frequency:random_seed=2460085405:i=119:av=off:ss=axioms_2999 on theBenchmark for (2999ds/119Mi)
% 3.03/1.10 % (3505146)dis-21_1_sil=8000:lcm=predicate:random_seed=1776606557: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)
% 3.03/1.10 % (3505143)lrs+1010_1_to=lpo:sil=32000:sos=on:spb=goal_then_units:bce=on:random_seed=1492961448:i=109:sd=1:ins=1:gsp=on:ss=axioms_2999 on theBenchmark for (2999ds/109Mi)
% 3.03/1.10 % (3505142)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=2486538917:i=141695:sd=1:nm=32:gsp=on:ss=included_2999 on theBenchmark for (2999ds/141695Mi)
% 3.03/1.10 % (3505141)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=1880523372:i=134677:sd=20:aac=none:nm=16:ss=included:sgt=10_2999 on theBenchmark for (2999ds/134677Mi)
% 3.03/1.10 % (3505143)Refutation not found, incomplete strategy
% 3.03/1.10 % (3505143)------------------------------
% 3.03/1.10 % (3505143)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.03/1.10 % (3505143)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.03/1.10 % (3505143)CaDiCaL version: 2.1.3
% 3.03/1.10 % (3505143)Termination reason: Refutation not found, incomplete strategy
% 3.03/1.10 % (3505143)Time elapsed: 0.005 s
% 3.03/1.10 % (3505143)Peak memory usage: 88 MB
% 3.03/1.10 % (3505143)Instructions burned: 6 (million)
% 3.03/1.10 % (3505144)First to succeed.
% 3.03/1.10 % (3505144)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-3505135"
% 3.03/1.10 % (3505146)Instruction limit reached!
% 3.03/1.10 % (3505146)------------------------------
% 3.03/1.10 % (3505146)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.03/1.10 % (3505146)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.03/1.10 % (3505146)CaDiCaL version: 2.1.3
% 3.03/1.10 % (3505146)Termination reason: Instruction limit
% 3.03/1.10 % (3505146)Termination phase: Saturation
% 3.03/1.10 % (3505146)Time elapsed: 0.071 s
% 3.03/1.10 % (3505146)Peak memory usage: 90 MB
% 3.03/1.10 % (3505146)Instructions burned: 130 (million)
% 3.03/1.10 % (3505145)Instruction limit reached!
% 3.03/1.10 % (3505145)------------------------------
% 3.03/1.10 % (3505145)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 3.03/1.10 % (3505145)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 3.03/1.10 % (3505145)CaDiCaL version: 2.1.3
% 3.03/1.10 % (3505145)Termination reason: Instruction limit
% 3.03/1.10 % (3505145)Termination phase: Saturation
% 3.03/1.10 % (3505145)Time elapsed: 0.093 s
% 3.03/1.10 % (3505145)Peak memory usage: 90 MB
% 3.03/1.10 % (3505145)Instructions burned: 140 (million)
% 3.03/1.10 % (3505154)lrs+10_1_sil=8000:sp=occurrence:random_seed=2792899552:i=285:sd=3:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/285Mi)
% 3.03/1.10 % (3505155)lrs+10_1_sil=32000:urr=on:br=off:random_seed=874869246:i=157:sd=1:gtg=position:ss=axioms:sgt=8_2997 on theBenchmark for (2997ds/157Mi)
% 3.03/1.10 % (3505154)Also succeeded, but the first one will report.
% 3.03/1.10 % (3505143)------------------------------
% 3.03/1.10 % (3505143)------------------------------
% 3.03/1.10 % (3505144)Refutation found. Thanks to Tanya!
% 3.03/1.10 % SZS status Theorem for theBenchmark
% 3.03/1.10 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/1.20 % (3505144)------------------------------
% 0.18/1.20 % (3505144)Version: Vampire 5.0.1 (Release build, commit ea8961452 on 2026-07-16 15:14:34 +0200)
% 0.18/1.20 % (3505144)Linked with Z3 4.14.0.0 3c47fd96cf5645d0c42b2c819d9e9a84380aa721 z3-4.8.4-9178-g3c47fd96c
% 0.18/1.20 % (3505144)CaDiCaL version: 2.1.3
% 0.18/1.20 % (3505144)Termination reason: Refutation
% 0.18/1.20 % (3505144)Time elapsed: 0.028 s
% 0.18/1.20 % (3505144)Peak memory usage: 88 MB
% 0.18/1.20 % (3505144)Instructions burned: 50 (million)
% 0.18/1.20 % (3505144)------------------------------
% 0.18/1.20 % (3505144)------------------------------
% 0.18/1.20 % (3505135)Success in time 0.441 s
% 0.18/1.20 % Vampire exiting
%------------------------------------------------------------------------------