TSTP Solution File: PRO011+4 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : PRO011+4 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% Computer : n008.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sun May 5 08:47:36 EDT 2024
% Result : Theorem 0.22s 0.42s
% Output : Refutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 22
% Number of leaves : 14
% Syntax : Number of formulae : 66 ( 4 unt; 0 def)
% Number of atoms : 322 ( 10 equ)
% Maximal formula atoms : 16 ( 4 avg)
% Number of connectives : 348 ( 92 ~; 88 |; 143 &)
% ( 5 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 7 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 12 ( 10 usr; 1 prp; 0-3 aty)
% Number of functors : 14 ( 14 usr; 6 con; 0-2 aty)
% Number of variables : 178 ( 117 !; 61 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f430,plain,
$false,
inference(resolution,[],[f429,f185]) ).
fof(f185,plain,
occurrence_of(sK3,tptp0),
inference(cnf_transformation,[],[f141]) ).
fof(f141,plain,
( ! [X1,X2] :
( ( min_precedes(X1,sK4(X1),tptp0)
& subactivity_occurrence(sK4(X1),sK3)
& occurrence_of(sK4(X1),tptp1)
& occurrence_of(X2,tptp2) )
| sP0(X1,sK3,X2)
| ~ leaf_occ(X2,sK3) )
& occurrence_of(sK3,tptp0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK3,sK4])],[f132,f140,f139]) ).
fof(f139,plain,
( ? [X0] :
( ! [X1,X2] :
( ( ? [X3] :
( min_precedes(X1,X3,tptp0)
& subactivity_occurrence(X3,X0)
& occurrence_of(X3,tptp1) )
& occurrence_of(X2,tptp2) )
| sP0(X1,X0,X2)
| ~ leaf_occ(X2,X0) )
& occurrence_of(X0,tptp0) )
=> ( ! [X2,X1] :
( ( ? [X3] :
( min_precedes(X1,X3,tptp0)
& subactivity_occurrence(X3,sK3)
& occurrence_of(X3,tptp1) )
& occurrence_of(X2,tptp2) )
| sP0(X1,sK3,X2)
| ~ leaf_occ(X2,sK3) )
& occurrence_of(sK3,tptp0) ) ),
introduced(choice_axiom,[]) ).
fof(f140,plain,
! [X1] :
( ? [X3] :
( min_precedes(X1,X3,tptp0)
& subactivity_occurrence(X3,sK3)
& occurrence_of(X3,tptp1) )
=> ( min_precedes(X1,sK4(X1),tptp0)
& subactivity_occurrence(sK4(X1),sK3)
& occurrence_of(sK4(X1),tptp1) ) ),
introduced(choice_axiom,[]) ).
fof(f132,plain,
? [X0] :
( ! [X1,X2] :
( ( ? [X3] :
( min_precedes(X1,X3,tptp0)
& subactivity_occurrence(X3,X0)
& occurrence_of(X3,tptp1) )
& occurrence_of(X2,tptp2) )
| sP0(X1,X0,X2)
| ~ leaf_occ(X2,X0) )
& occurrence_of(X0,tptp0) ),
inference(definition_folding,[],[f87,f131]) ).
fof(f131,plain,
! [X1,X0,X2] :
( ( ? [X4] :
( min_precedes(X1,X4,tptp0)
& subactivity_occurrence(X4,X0)
& occurrence_of(X4,tptp2) )
& occurrence_of(X2,tptp1) )
| ~ sP0(X1,X0,X2) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f87,plain,
? [X0] :
( ! [X1,X2] :
( ( ? [X3] :
( min_precedes(X1,X3,tptp0)
& subactivity_occurrence(X3,X0)
& occurrence_of(X3,tptp1) )
& occurrence_of(X2,tptp2) )
| ( ? [X4] :
( min_precedes(X1,X4,tptp0)
& subactivity_occurrence(X4,X0)
& occurrence_of(X4,tptp2) )
& occurrence_of(X2,tptp1) )
| ~ leaf_occ(X2,X0) )
& occurrence_of(X0,tptp0) ),
inference(ennf_transformation,[],[f48]) ).
fof(f48,plain,
~ ! [X0] :
( occurrence_of(X0,tptp0)
=> ? [X1,X2] :
( ( occurrence_of(X2,tptp2)
=> ~ ? [X3] :
( min_precedes(X1,X3,tptp0)
& subactivity_occurrence(X3,X0)
& occurrence_of(X3,tptp1) ) )
& ( occurrence_of(X2,tptp1)
=> ~ ? [X4] :
( min_precedes(X1,X4,tptp0)
& subactivity_occurrence(X4,X0)
& occurrence_of(X4,tptp2) ) )
& leaf_occ(X2,X0) ) ),
inference(rectify,[],[f47]) ).
fof(f47,negated_conjecture,
~ ! [X105] :
( occurrence_of(X105,tptp0)
=> ? [X106,X107] :
( ( occurrence_of(X107,tptp2)
=> ~ ? [X109] :
( min_precedes(X106,X109,tptp0)
& subactivity_occurrence(X109,X105)
& occurrence_of(X109,tptp1) ) )
& ( occurrence_of(X107,tptp1)
=> ~ ? [X108] :
( min_precedes(X106,X108,tptp0)
& subactivity_occurrence(X108,X105)
& occurrence_of(X108,tptp2) ) )
& leaf_occ(X107,X105) ) ),
inference(negated_conjecture,[],[f46]) ).
fof(f46,conjecture,
! [X105] :
( occurrence_of(X105,tptp0)
=> ? [X106,X107] :
( ( occurrence_of(X107,tptp2)
=> ~ ? [X109] :
( min_precedes(X106,X109,tptp0)
& subactivity_occurrence(X109,X105)
& occurrence_of(X109,tptp1) ) )
& ( occurrence_of(X107,tptp1)
=> ~ ? [X108] :
( min_precedes(X106,X108,tptp0)
& subactivity_occurrence(X108,X105)
& occurrence_of(X108,tptp2) ) )
& leaf_occ(X107,X105) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f429,plain,
~ occurrence_of(sK3,tptp0),
inference(duplicate_literal_removal,[],[f428]) ).
fof(f428,plain,
( ~ occurrence_of(sK3,tptp0)
| ~ occurrence_of(sK3,tptp0) ),
inference(resolution,[],[f427,f210]) ).
fof(f210,plain,
! [X0] :
( sP1(X0)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f134]) ).
fof(f134,plain,
! [X0] :
( sP1(X0)
| ~ occurrence_of(X0,tptp0) ),
inference(definition_folding,[],[f90,f133]) ).
fof(f133,plain,
! [X0] :
( ? [X1,X2,X3] :
( leaf_occ(X3,X0)
& next_subocc(X2,X3,tptp0)
& ( occurrence_of(X3,tptp2)
| occurrence_of(X3,tptp1) )
& next_subocc(X1,X2,tptp0)
& occurrence_of(X2,tptp4)
& root_occ(X1,X0)
& occurrence_of(X1,tptp3) )
| ~ sP1(X0) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP1])]) ).
fof(f90,plain,
! [X0] :
( ? [X1,X2,X3] :
( leaf_occ(X3,X0)
& next_subocc(X2,X3,tptp0)
& ( occurrence_of(X3,tptp2)
| occurrence_of(X3,tptp1) )
& next_subocc(X1,X2,tptp0)
& occurrence_of(X2,tptp4)
& root_occ(X1,X0)
& occurrence_of(X1,tptp3) )
| ~ occurrence_of(X0,tptp0) ),
inference(ennf_transformation,[],[f51]) ).
fof(f51,plain,
! [X0] :
( occurrence_of(X0,tptp0)
=> ? [X1,X2,X3] :
( leaf_occ(X3,X0)
& next_subocc(X2,X3,tptp0)
& ( occurrence_of(X3,tptp2)
| occurrence_of(X3,tptp1) )
& next_subocc(X1,X2,tptp0)
& occurrence_of(X2,tptp4)
& root_occ(X1,X0)
& occurrence_of(X1,tptp3) ) ),
inference(rectify,[],[f33]) ).
fof(f33,axiom,
! [X101] :
( occurrence_of(X101,tptp0)
=> ? [X102,X103,X104] :
( leaf_occ(X104,X101)
& next_subocc(X103,X104,tptp0)
& ( occurrence_of(X104,tptp2)
| occurrence_of(X104,tptp1) )
& next_subocc(X102,X103,tptp0)
& occurrence_of(X103,tptp4)
& root_occ(X102,X101)
& occurrence_of(X102,tptp3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_32) ).
fof(f427,plain,
( ~ sP1(sK3)
| ~ occurrence_of(sK3,tptp0) ),
inference(resolution,[],[f426,f209]) ).
fof(f209,plain,
! [X0] :
( leaf_occ(sK8(X0),X0)
| ~ sP1(X0) ),
inference(cnf_transformation,[],[f146]) ).
fof(f146,plain,
! [X0] :
( ( leaf_occ(sK8(X0),X0)
& next_subocc(sK7(X0),sK8(X0),tptp0)
& ( occurrence_of(sK8(X0),tptp2)
| occurrence_of(sK8(X0),tptp1) )
& next_subocc(sK6(X0),sK7(X0),tptp0)
& occurrence_of(sK7(X0),tptp4)
& root_occ(sK6(X0),X0)
& occurrence_of(sK6(X0),tptp3) )
| ~ sP1(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK6,sK7,sK8])],[f144,f145]) ).
fof(f145,plain,
! [X0] :
( ? [X1,X2,X3] :
( leaf_occ(X3,X0)
& next_subocc(X2,X3,tptp0)
& ( occurrence_of(X3,tptp2)
| occurrence_of(X3,tptp1) )
& next_subocc(X1,X2,tptp0)
& occurrence_of(X2,tptp4)
& root_occ(X1,X0)
& occurrence_of(X1,tptp3) )
=> ( leaf_occ(sK8(X0),X0)
& next_subocc(sK7(X0),sK8(X0),tptp0)
& ( occurrence_of(sK8(X0),tptp2)
| occurrence_of(sK8(X0),tptp1) )
& next_subocc(sK6(X0),sK7(X0),tptp0)
& occurrence_of(sK7(X0),tptp4)
& root_occ(sK6(X0),X0)
& occurrence_of(sK6(X0),tptp3) ) ),
introduced(choice_axiom,[]) ).
fof(f144,plain,
! [X0] :
( ? [X1,X2,X3] :
( leaf_occ(X3,X0)
& next_subocc(X2,X3,tptp0)
& ( occurrence_of(X3,tptp2)
| occurrence_of(X3,tptp1) )
& next_subocc(X1,X2,tptp0)
& occurrence_of(X2,tptp4)
& root_occ(X1,X0)
& occurrence_of(X1,tptp3) )
| ~ sP1(X0) ),
inference(nnf_transformation,[],[f133]) ).
fof(f426,plain,
! [X0] :
( ~ leaf_occ(X0,sK3)
| ~ occurrence_of(sK3,tptp0) ),
inference(duplicate_literal_removal,[],[f424]) ).
fof(f424,plain,
! [X0] :
( ~ occurrence_of(sK3,tptp0)
| ~ leaf_occ(X0,sK3)
| ~ occurrence_of(sK3,tptp0) ),
inference(resolution,[],[f413,f415]) ).
fof(f415,plain,
! [X0,X1] :
( ~ sP0(sK8(sK3),X0,X1)
| ~ occurrence_of(sK3,tptp0) ),
inference(resolution,[],[f412,f184]) ).
fof(f184,plain,
! [X2,X0,X1] :
( min_precedes(X0,sK2(X0,X1),tptp0)
| ~ sP0(X0,X1,X2) ),
inference(cnf_transformation,[],[f138]) ).
fof(f138,plain,
! [X0,X1,X2] :
( ( min_precedes(X0,sK2(X0,X1),tptp0)
& subactivity_occurrence(sK2(X0,X1),X1)
& occurrence_of(sK2(X0,X1),tptp2)
& occurrence_of(X2,tptp1) )
| ~ sP0(X0,X1,X2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK2])],[f136,f137]) ).
fof(f137,plain,
! [X0,X1] :
( ? [X3] :
( min_precedes(X0,X3,tptp0)
& subactivity_occurrence(X3,X1)
& occurrence_of(X3,tptp2) )
=> ( min_precedes(X0,sK2(X0,X1),tptp0)
& subactivity_occurrence(sK2(X0,X1),X1)
& occurrence_of(sK2(X0,X1),tptp2) ) ),
introduced(choice_axiom,[]) ).
fof(f136,plain,
! [X0,X1,X2] :
( ( ? [X3] :
( min_precedes(X0,X3,tptp0)
& subactivity_occurrence(X3,X1)
& occurrence_of(X3,tptp2) )
& occurrence_of(X2,tptp1) )
| ~ sP0(X0,X1,X2) ),
inference(rectify,[],[f135]) ).
fof(f135,plain,
! [X1,X0,X2] :
( ( ? [X4] :
( min_precedes(X1,X4,tptp0)
& subactivity_occurrence(X4,X0)
& occurrence_of(X4,tptp2) )
& occurrence_of(X2,tptp1) )
| ~ sP0(X1,X0,X2) ),
inference(nnf_transformation,[],[f131]) ).
fof(f412,plain,
! [X0] :
( ~ min_precedes(sK8(sK3),X0,tptp0)
| ~ occurrence_of(sK3,tptp0) ),
inference(resolution,[],[f411,f210]) ).
fof(f411,plain,
! [X0] :
( ~ sP1(sK3)
| ~ min_precedes(sK8(sK3),X0,tptp0) ),
inference(resolution,[],[f401,f209]) ).
fof(f401,plain,
! [X0] :
( ~ leaf_occ(sK8(sK3),sK3)
| ~ min_precedes(sK8(sK3),X0,tptp0) ),
inference(resolution,[],[f399,f224]) ).
fof(f224,plain,
! [X0,X1,X4] :
( ~ leaf(X0,X1)
| ~ min_precedes(X0,X4,X1) ),
inference(cnf_transformation,[],[f159]) ).
fof(f159,plain,
! [X0,X1] :
( ( leaf(X0,X1)
| min_precedes(X0,sK12(X0,X1),X1)
| ( ! [X3] : ~ min_precedes(X3,X0,X1)
& ~ root(X0,X1) ) )
& ( ( ! [X4] : ~ min_precedes(X0,X4,X1)
& ( min_precedes(sK13(X0,X1),X0,X1)
| root(X0,X1) ) )
| ~ leaf(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK12,sK13])],[f156,f158,f157]) ).
fof(f157,plain,
! [X0,X1] :
( ? [X2] : min_precedes(X0,X2,X1)
=> min_precedes(X0,sK12(X0,X1),X1) ),
introduced(choice_axiom,[]) ).
fof(f158,plain,
! [X0,X1] :
( ? [X5] : min_precedes(X5,X0,X1)
=> min_precedes(sK13(X0,X1),X0,X1) ),
introduced(choice_axiom,[]) ).
fof(f156,plain,
! [X0,X1] :
( ( leaf(X0,X1)
| ? [X2] : min_precedes(X0,X2,X1)
| ( ! [X3] : ~ min_precedes(X3,X0,X1)
& ~ root(X0,X1) ) )
& ( ( ! [X4] : ~ min_precedes(X0,X4,X1)
& ( ? [X5] : min_precedes(X5,X0,X1)
| root(X0,X1) ) )
| ~ leaf(X0,X1) ) ),
inference(rectify,[],[f155]) ).
fof(f155,plain,
! [X0,X1] :
( ( leaf(X0,X1)
| ? [X2] : min_precedes(X0,X2,X1)
| ( ! [X3] : ~ min_precedes(X3,X0,X1)
& ~ root(X0,X1) ) )
& ( ( ! [X2] : ~ min_precedes(X0,X2,X1)
& ( ? [X3] : min_precedes(X3,X0,X1)
| root(X0,X1) ) )
| ~ leaf(X0,X1) ) ),
inference(flattening,[],[f154]) ).
fof(f154,plain,
! [X0,X1] :
( ( leaf(X0,X1)
| ? [X2] : min_precedes(X0,X2,X1)
| ( ! [X3] : ~ min_precedes(X3,X0,X1)
& ~ root(X0,X1) ) )
& ( ( ! [X2] : ~ min_precedes(X0,X2,X1)
& ( ? [X3] : min_precedes(X3,X0,X1)
| root(X0,X1) ) )
| ~ leaf(X0,X1) ) ),
inference(nnf_transformation,[],[f101]) ).
fof(f101,plain,
! [X0,X1] :
( leaf(X0,X1)
<=> ( ! [X2] : ~ min_precedes(X0,X2,X1)
& ( ? [X3] : min_precedes(X3,X0,X1)
| root(X0,X1) ) ) ),
inference(ennf_transformation,[],[f59]) ).
fof(f59,plain,
! [X0,X1] :
( leaf(X0,X1)
<=> ( ~ ? [X2] : min_precedes(X0,X2,X1)
& ( ? [X3] : min_precedes(X3,X0,X1)
| root(X0,X1) ) ) ),
inference(rectify,[],[f16]) ).
fof(f16,axiom,
! [X47,X48] :
( leaf(X47,X48)
<=> ( ~ ? [X50] : min_precedes(X47,X50,X48)
& ( ? [X49] : min_precedes(X49,X47,X48)
| root(X47,X48) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_15) ).
fof(f399,plain,
( leaf(sK8(sK3),tptp0)
| ~ leaf_occ(sK8(sK3),sK3) ),
inference(superposition,[],[f238,f398]) ).
fof(f398,plain,
tptp0 = sK16(sK8(sK3),sK3),
inference(resolution,[],[f385,f185]) ).
fof(f385,plain,
( ~ occurrence_of(sK3,tptp0)
| tptp0 = sK16(sK8(sK3),sK3) ),
inference(resolution,[],[f383,f210]) ).
fof(f383,plain,
( ~ sP1(sK3)
| tptp0 = sK16(sK8(sK3),sK3) ),
inference(resolution,[],[f365,f209]) ).
fof(f365,plain,
! [X0] :
( ~ leaf_occ(X0,sK3)
| tptp0 = sK16(X0,sK3) ),
inference(resolution,[],[f343,f236]) ).
fof(f236,plain,
! [X0,X1] :
( occurrence_of(X1,sK16(X0,X1))
| ~ leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f171]) ).
fof(f171,plain,
! [X0,X1] :
( ( leaf_occ(X0,X1)
| ! [X2] :
( ~ leaf(X0,X2)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,X2) ) )
& ( ( leaf(X0,sK16(X0,X1))
& subactivity_occurrence(X0,X1)
& occurrence_of(X1,sK16(X0,X1)) )
| ~ leaf_occ(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK16])],[f169,f170]) ).
fof(f170,plain,
! [X0,X1] :
( ? [X3] :
( leaf(X0,X3)
& subactivity_occurrence(X0,X1)
& occurrence_of(X1,X3) )
=> ( leaf(X0,sK16(X0,X1))
& subactivity_occurrence(X0,X1)
& occurrence_of(X1,sK16(X0,X1)) ) ),
introduced(choice_axiom,[]) ).
fof(f169,plain,
! [X0,X1] :
( ( leaf_occ(X0,X1)
| ! [X2] :
( ~ leaf(X0,X2)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,X2) ) )
& ( ? [X3] :
( leaf(X0,X3)
& subactivity_occurrence(X0,X1)
& occurrence_of(X1,X3) )
| ~ leaf_occ(X0,X1) ) ),
inference(rectify,[],[f168]) ).
fof(f168,plain,
! [X0,X1] :
( ( leaf_occ(X0,X1)
| ! [X2] :
( ~ leaf(X0,X2)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,X2) ) )
& ( ? [X2] :
( leaf(X0,X2)
& subactivity_occurrence(X0,X1)
& occurrence_of(X1,X2) )
| ~ leaf_occ(X0,X1) ) ),
inference(nnf_transformation,[],[f63]) ).
fof(f63,plain,
! [X0,X1] :
( leaf_occ(X0,X1)
<=> ? [X2] :
( leaf(X0,X2)
& subactivity_occurrence(X0,X1)
& occurrence_of(X1,X2) ) ),
inference(rectify,[],[f19]) ).
fof(f19,axiom,
! [X55,X56] :
( leaf_occ(X55,X56)
<=> ? [X57] :
( leaf(X55,X57)
& subactivity_occurrence(X55,X56)
& occurrence_of(X56,X57) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_18) ).
fof(f343,plain,
! [X0] :
( ~ occurrence_of(sK3,X0)
| tptp0 = X0 ),
inference(resolution,[],[f252,f185]) ).
fof(f252,plain,
! [X2,X0,X1] :
( ~ occurrence_of(X0,X2)
| ~ occurrence_of(X0,X1)
| X1 = X2 ),
inference(cnf_transformation,[],[f115]) ).
fof(f115,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ occurrence_of(X0,X2)
| ~ occurrence_of(X0,X1) ),
inference(flattening,[],[f114]) ).
fof(f114,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ occurrence_of(X0,X2)
| ~ occurrence_of(X0,X1) ),
inference(ennf_transformation,[],[f72]) ).
fof(f72,plain,
! [X0,X1,X2] :
( ( occurrence_of(X0,X2)
& occurrence_of(X0,X1) )
=> X1 = X2 ),
inference(rectify,[],[f9]) ).
fof(f9,axiom,
! [X28,X29,X30] :
( ( occurrence_of(X28,X30)
& occurrence_of(X28,X29) )
=> X29 = X30 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_08) ).
fof(f238,plain,
! [X0,X1] :
( leaf(X0,sK16(X0,X1))
| ~ leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f171]) ).
fof(f413,plain,
! [X0] :
( sP0(sK8(sK3),sK3,X0)
| ~ occurrence_of(sK3,tptp0)
| ~ leaf_occ(X0,sK3) ),
inference(resolution,[],[f412,f189]) ).
fof(f189,plain,
! [X2,X1] :
( min_precedes(X1,sK4(X1),tptp0)
| sP0(X1,sK3,X2)
| ~ leaf_occ(X2,sK3) ),
inference(cnf_transformation,[],[f141]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : PRO011+4 : TPTP v8.1.2. Released v4.0.0.
% 0.07/0.15 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.16/0.36 % Computer : n008.cluster.edu
% 0.16/0.36 % Model : x86_64 x86_64
% 0.16/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.36 % Memory : 8042.1875MB
% 0.16/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.36 % CPULimit : 300
% 0.16/0.36 % WCLimit : 300
% 0.16/0.36 % DateTime : Fri May 3 20:36:53 EDT 2024
% 0.16/0.36 % CPUTime :
% 0.16/0.37 % (14471)Running in auto input_syntax mode. Trying TPTP
% 0.16/0.39 % (14472)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.16/0.40 % (14474)WARNING: value z3 for option sas not known
% 0.16/0.40 % (14475)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.16/0.40 % (14473)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.16/0.40 % (14476)ott+10_10:1_add=off:afr=on:amm=off:anc=all:bd=off:bs=on:fsr=off:irw=on:lma=on:msp=off:nm=4:nwc=4.0:sac=on:sp=reverse_frequency_531 on theBenchmark for (531ds/0Mi)
% 0.16/0.40 % (14474)dis+2_11_add=large:afr=on:amm=off:bd=off:bce=on:fsd=off:fde=none:gs=on:gsaa=full_model:gsem=off:irw=on:msp=off:nm=4:nwc=1.3:sas=z3:sims=off:sac=on:sp=reverse_arity_569 on theBenchmark for (569ds/0Mi)
% 0.16/0.40 % (14478)ott+1_64_av=off:bd=off:bce=on:fsd=off:fde=unused:gsp=on:irw=on:lcm=predicate:lma=on:nm=2:nwc=1.1:sims=off:urr=on_497 on theBenchmark for (497ds/0Mi)
% 0.16/0.40 % (14477)ott-10_8_av=off:bd=preordered:bs=on:fsd=off:fsr=off:fde=unused:irw=on:lcm=predicate:lma=on:nm=4:nwc=1.7:sp=frequency_522 on theBenchmark for (522ds/0Mi)
% 0.22/0.41 Detected minimum model sizes of [4]
% 0.22/0.41 Detected maximum model sizes of [max]
% 0.22/0.41 Detected minimum model sizes of [4]
% 0.22/0.41 Detected maximum model sizes of [max]
% 0.22/0.41 TRYING [4]
% 0.22/0.41 TRYING [4]
% 0.22/0.42 % (14477)First to succeed.
% 0.22/0.42 % (14477)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-14471"
% 0.22/0.42 % (14477)Refutation found. Thanks to Tanya!
% 0.22/0.42 % SZS status Theorem for theBenchmark
% 0.22/0.42 % SZS output start Proof for theBenchmark
% See solution above
% 0.22/0.42 % (14477)------------------------------
% 0.22/0.42 % (14477)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.22/0.42 % (14477)Termination reason: Refutation
% 0.22/0.42
% 0.22/0.42 % (14477)Memory used [KB]: 1009
% 0.22/0.42 % (14477)Time elapsed: 0.021 s
% 0.22/0.42 % (14477)Instructions burned: 18 (million)
% 0.22/0.42 % (14471)Success in time 0.051 s
%------------------------------------------------------------------------------