TSTP Solution File: PRO011+1 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : PRO011+1 : 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 : n005.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.18s 0.38s
% Output : Refutation 0.18s
% 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(f455,plain,
$false,
inference(resolution,[],[f454,f190]) ).
fof(f190,plain,
occurrence_of(sK3,tptp0),
inference(cnf_transformation,[],[f147]) ).
fof(f147,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])],[f138,f146,f145]) ).
fof(f145,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(f146,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(f138,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,[],[f89,f137]) ).
fof(f137,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(f89,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,[],[f51]) ).
fof(f51,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,[],[f50]) ).
fof(f50,negated_conjecture,
~ ! [X109] :
( occurrence_of(X109,tptp0)
=> ? [X110,X111] :
( ( occurrence_of(X111,tptp2)
=> ~ ? [X113] :
( min_precedes(X110,X113,tptp0)
& subactivity_occurrence(X113,X109)
& occurrence_of(X113,tptp1) ) )
& ( occurrence_of(X111,tptp1)
=> ~ ? [X112] :
( min_precedes(X110,X112,tptp0)
& subactivity_occurrence(X112,X109)
& occurrence_of(X112,tptp2) ) )
& leaf_occ(X111,X109) ) ),
inference(negated_conjecture,[],[f49]) ).
fof(f49,conjecture,
! [X109] :
( occurrence_of(X109,tptp0)
=> ? [X110,X111] :
( ( occurrence_of(X111,tptp2)
=> ~ ? [X113] :
( min_precedes(X110,X113,tptp0)
& subactivity_occurrence(X113,X109)
& occurrence_of(X113,tptp1) ) )
& ( occurrence_of(X111,tptp1)
=> ~ ? [X112] :
( min_precedes(X110,X112,tptp0)
& subactivity_occurrence(X112,X109)
& occurrence_of(X112,tptp2) ) )
& leaf_occ(X111,X109) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f454,plain,
~ occurrence_of(sK3,tptp0),
inference(duplicate_literal_removal,[],[f453]) ).
fof(f453,plain,
( ~ occurrence_of(sK3,tptp0)
| ~ occurrence_of(sK3,tptp0) ),
inference(resolution,[],[f452,f218]) ).
fof(f218,plain,
! [X0] :
( sP1(X0)
| ~ occurrence_of(X0,tptp0) ),
inference(cnf_transformation,[],[f140]) ).
fof(f140,plain,
! [X0] :
( sP1(X0)
| ~ occurrence_of(X0,tptp0) ),
inference(definition_folding,[],[f93,f139]) ).
fof(f139,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(f93,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,[],[f55]) ).
fof(f55,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,[],[f36]) ).
fof(f36,axiom,
! [X105] :
( occurrence_of(X105,tptp0)
=> ? [X106,X107,X108] :
( leaf_occ(X108,X105)
& next_subocc(X107,X108,tptp0)
& ( occurrence_of(X108,tptp2)
| occurrence_of(X108,tptp1) )
& next_subocc(X106,X107,tptp0)
& occurrence_of(X107,tptp4)
& root_occ(X106,X105)
& occurrence_of(X106,tptp3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_35) ).
fof(f452,plain,
( ~ sP1(sK3)
| ~ occurrence_of(sK3,tptp0) ),
inference(resolution,[],[f451,f217]) ).
fof(f217,plain,
! [X0] :
( leaf_occ(sK8(X0),X0)
| ~ sP1(X0) ),
inference(cnf_transformation,[],[f152]) ).
fof(f152,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])],[f150,f151]) ).
fof(f151,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(f150,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,[],[f139]) ).
fof(f451,plain,
! [X0] :
( ~ leaf_occ(X0,sK3)
| ~ occurrence_of(sK3,tptp0) ),
inference(duplicate_literal_removal,[],[f449]) ).
fof(f449,plain,
! [X0] :
( ~ occurrence_of(sK3,tptp0)
| ~ leaf_occ(X0,sK3)
| ~ occurrence_of(sK3,tptp0) ),
inference(resolution,[],[f430,f432]) ).
fof(f432,plain,
! [X0,X1] :
( ~ sP0(sK8(sK3),X0,X1)
| ~ occurrence_of(sK3,tptp0) ),
inference(resolution,[],[f429,f189]) ).
fof(f189,plain,
! [X2,X0,X1] :
( min_precedes(X0,sK2(X0,X1),tptp0)
| ~ sP0(X0,X1,X2) ),
inference(cnf_transformation,[],[f144]) ).
fof(f144,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])],[f142,f143]) ).
fof(f143,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(f142,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,[],[f141]) ).
fof(f141,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,[],[f137]) ).
fof(f429,plain,
! [X0] :
( ~ min_precedes(sK8(sK3),X0,tptp0)
| ~ occurrence_of(sK3,tptp0) ),
inference(resolution,[],[f428,f218]) ).
fof(f428,plain,
! [X0] :
( ~ sP1(sK3)
| ~ min_precedes(sK8(sK3),X0,tptp0) ),
inference(resolution,[],[f424,f217]) ).
fof(f424,plain,
! [X0] :
( ~ leaf_occ(sK8(sK3),sK3)
| ~ min_precedes(sK8(sK3),X0,tptp0) ),
inference(resolution,[],[f419,f236]) ).
fof(f236,plain,
! [X0,X1,X4] :
( ~ leaf(X0,X1)
| ~ min_precedes(X0,X4,X1) ),
inference(cnf_transformation,[],[f165]) ).
fof(f165,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])],[f162,f164,f163]) ).
fof(f163,plain,
! [X0,X1] :
( ? [X2] : min_precedes(X0,X2,X1)
=> min_precedes(X0,sK12(X0,X1),X1) ),
introduced(choice_axiom,[]) ).
fof(f164,plain,
! [X0,X1] :
( ? [X5] : min_precedes(X5,X0,X1)
=> min_precedes(sK13(X0,X1),X0,X1) ),
introduced(choice_axiom,[]) ).
fof(f162,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,[],[f161]) ).
fof(f161,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,[],[f160]) ).
fof(f160,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,[],[f108]) ).
fof(f108,plain,
! [X0,X1] :
( leaf(X0,X1)
<=> ( ! [X2] : ~ min_precedes(X0,X2,X1)
& ( ? [X3] : min_precedes(X3,X0,X1)
| root(X0,X1) ) ) ),
inference(ennf_transformation,[],[f65]) ).
fof(f65,plain,
! [X0,X1] :
( leaf(X0,X1)
<=> ( ~ ? [X2] : min_precedes(X0,X2,X1)
& ( ? [X3] : min_precedes(X3,X0,X1)
| root(X0,X1) ) ) ),
inference(rectify,[],[f22]) ).
fof(f22,axiom,
! [X56,X57] :
( leaf(X56,X57)
<=> ( ~ ? [X59] : min_precedes(X56,X59,X57)
& ( ? [X58] : min_precedes(X58,X56,X57)
| root(X56,X57) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_21) ).
fof(f419,plain,
( leaf(sK8(sK3),tptp0)
| ~ leaf_occ(sK8(sK3),sK3) ),
inference(superposition,[],[f244,f418]) ).
fof(f418,plain,
tptp0 = sK15(sK8(sK3),sK3),
inference(resolution,[],[f408,f190]) ).
fof(f408,plain,
( ~ occurrence_of(sK3,tptp0)
| tptp0 = sK15(sK8(sK3),sK3) ),
inference(resolution,[],[f402,f218]) ).
fof(f402,plain,
( ~ sP1(sK3)
| tptp0 = sK15(sK8(sK3),sK3) ),
inference(resolution,[],[f387,f217]) ).
fof(f387,plain,
! [X0] :
( ~ leaf_occ(X0,sK3)
| tptp0 = sK15(X0,sK3) ),
inference(resolution,[],[f366,f242]) ).
fof(f242,plain,
! [X0,X1] :
( occurrence_of(X1,sK15(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,sK15(X0,X1))
& subactivity_occurrence(X0,X1)
& occurrence_of(X1,sK15(X0,X1)) )
| ~ leaf_occ(X0,X1) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK15])],[f169,f170]) ).
fof(f170,plain,
! [X0,X1] :
( ? [X3] :
( leaf(X0,X3)
& subactivity_occurrence(X0,X1)
& occurrence_of(X1,X3) )
=> ( leaf(X0,sK15(X0,X1))
& subactivity_occurrence(X0,X1)
& occurrence_of(X1,sK15(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,[],[f67]) ).
fof(f67,plain,
! [X0,X1] :
( leaf_occ(X0,X1)
<=> ? [X2] :
( leaf(X0,X2)
& subactivity_occurrence(X0,X1)
& occurrence_of(X1,X2) ) ),
inference(rectify,[],[f35]) ).
fof(f35,axiom,
! [X102,X103] :
( leaf_occ(X102,X103)
<=> ? [X104] :
( leaf(X102,X104)
& subactivity_occurrence(X102,X103)
& occurrence_of(X103,X104) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_34) ).
fof(f366,plain,
! [X0] :
( ~ occurrence_of(sK3,X0)
| tptp0 = X0 ),
inference(resolution,[],[f268,f190]) ).
fof(f268,plain,
! [X2,X0,X1] :
( ~ occurrence_of(X0,X2)
| ~ occurrence_of(X0,X1)
| X1 = X2 ),
inference(cnf_transformation,[],[f123]) ).
fof(f123,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ occurrence_of(X0,X2)
| ~ occurrence_of(X0,X1) ),
inference(flattening,[],[f122]) ).
fof(f122,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ occurrence_of(X0,X2)
| ~ occurrence_of(X0,X1) ),
inference(ennf_transformation,[],[f79]) ).
fof(f79,plain,
! [X0,X1,X2] :
( ( occurrence_of(X0,X2)
& occurrence_of(X0,X1) )
=> X1 = X2 ),
inference(rectify,[],[f3]) ).
fof(f3,axiom,
! [X4,X5,X6] :
( ( occurrence_of(X4,X6)
& occurrence_of(X4,X5) )
=> X5 = X6 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_02) ).
fof(f244,plain,
! [X0,X1] :
( leaf(X0,sK15(X0,X1))
| ~ leaf_occ(X0,X1) ),
inference(cnf_transformation,[],[f171]) ).
fof(f430,plain,
! [X0] :
( sP0(sK8(sK3),sK3,X0)
| ~ occurrence_of(sK3,tptp0)
| ~ leaf_occ(X0,sK3) ),
inference(resolution,[],[f429,f194]) ).
fof(f194,plain,
! [X2,X1] :
( min_precedes(X1,sK4(X1),tptp0)
| sP0(X1,sK3,X2)
| ~ leaf_occ(X2,sK3) ),
inference(cnf_transformation,[],[f147]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : PRO011+1 : TPTP v8.1.2. Released v4.0.0.
% 0.11/0.15 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.13/0.34 % Computer : n005.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Fri May 3 20:36:07 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.35 % (19553)Running in auto input_syntax mode. Trying TPTP
% 0.18/0.36 % (19556)WARNING: value z3 for option sas not known
% 0.18/0.36 % (19560)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.18/0.36 % (19558)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.18/0.37 % (19556)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.18/0.37 % (19557)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.18/0.37 % (19559)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.18/0.37 % (19555)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.18/0.37 % (19554)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.18/0.37 Detected minimum model sizes of [4]
% 0.18/0.37 Detected maximum model sizes of [max]
% 0.18/0.37 TRYING [4]
% 0.18/0.37 % (19559)First to succeed.
% 0.18/0.38 % (19559)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-19553"
% 0.18/0.38 % (19559)Refutation found. Thanks to Tanya!
% 0.18/0.38 % SZS status Theorem for theBenchmark
% 0.18/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.18/0.38 % (19559)------------------------------
% 0.18/0.38 % (19559)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.18/0.38 % (19559)Termination reason: Refutation
% 0.18/0.38
% 0.18/0.38 % (19559)Memory used [KB]: 1013
% 0.18/0.38 % (19559)Time elapsed: 0.012 s
% 0.18/0.38 % (19559)Instructions burned: 19 (million)
% 0.18/0.38 % (19553)Success in time 0.028 s
%------------------------------------------------------------------------------