TSTP Solution File: PRO014+2 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : PRO014+2 : 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 : n025.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:38 EDT 2024
% Result : Theorem 0.16s 0.36s
% Output : Refutation 0.16s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 9
% Syntax : Number of formulae : 61 ( 18 unt; 0 def)
% Number of atoms : 305 ( 0 equ)
% Maximal formula atoms : 20 ( 5 avg)
% Number of connectives : 352 ( 108 ~; 96 |; 134 &)
% ( 5 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 10 ( 9 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 7 con; 0-3 aty)
% Number of variables : 146 ( 104 !; 42 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1773,plain,
$false,
inference(unit_resulting_resolution,[],[f664,f669,f1451,f1180,f665,f190]) ).
fof(f190,plain,
! [X2,X3] :
( ~ next_subocc(sK5,X2,tptp0)
| ~ min_precedes(X2,X3,tptp0)
| ~ occurrence_of(X3,tptp1)
| ~ leaf(X3,tptp0)
| ~ occurrence_of(X2,tptp3) ),
inference(cnf_transformation,[],[f140]) ).
fof(f140,plain,
( ! [X2,X3] :
( ~ leaf(X3,tptp0)
| ~ min_precedes(X2,X3,tptp0)
| ( ~ occurrence_of(X3,tptp1)
& ~ occurrence_of(X3,tptp2) )
| ~ next_subocc(sK5,X2,tptp0)
| ~ occurrence_of(X2,tptp3) )
& ~ leaf_occ(sK5,sK6)
& arboreal(sK5)
& subactivity_occurrence(sK5,sK6)
& occurrence_of(sK6,tptp0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK5,sK6])],[f84,f139]) ).
fof(f139,plain,
( ? [X0,X1] :
( ! [X2,X3] :
( ~ leaf(X3,tptp0)
| ~ min_precedes(X2,X3,tptp0)
| ( ~ occurrence_of(X3,tptp1)
& ~ occurrence_of(X3,tptp2) )
| ~ next_subocc(X0,X2,tptp0)
| ~ occurrence_of(X2,tptp3) )
& ~ leaf_occ(X0,X1)
& arboreal(X0)
& subactivity_occurrence(X0,X1)
& occurrence_of(X1,tptp0) )
=> ( ! [X3,X2] :
( ~ leaf(X3,tptp0)
| ~ min_precedes(X2,X3,tptp0)
| ( ~ occurrence_of(X3,tptp1)
& ~ occurrence_of(X3,tptp2) )
| ~ next_subocc(sK5,X2,tptp0)
| ~ occurrence_of(X2,tptp3) )
& ~ leaf_occ(sK5,sK6)
& arboreal(sK5)
& subactivity_occurrence(sK5,sK6)
& occurrence_of(sK6,tptp0) ) ),
introduced(choice_axiom,[]) ).
fof(f84,plain,
? [X0,X1] :
( ! [X2,X3] :
( ~ leaf(X3,tptp0)
| ~ min_precedes(X2,X3,tptp0)
| ( ~ occurrence_of(X3,tptp1)
& ~ occurrence_of(X3,tptp2) )
| ~ next_subocc(X0,X2,tptp0)
| ~ occurrence_of(X2,tptp3) )
& ~ leaf_occ(X0,X1)
& arboreal(X0)
& subactivity_occurrence(X0,X1)
& occurrence_of(X1,tptp0) ),
inference(flattening,[],[f83]) ).
fof(f83,plain,
? [X0,X1] :
( ! [X2,X3] :
( ~ leaf(X3,tptp0)
| ~ min_precedes(X2,X3,tptp0)
| ( ~ occurrence_of(X3,tptp1)
& ~ occurrence_of(X3,tptp2) )
| ~ next_subocc(X0,X2,tptp0)
| ~ occurrence_of(X2,tptp3) )
& ~ leaf_occ(X0,X1)
& arboreal(X0)
& subactivity_occurrence(X0,X1)
& occurrence_of(X1,tptp0) ),
inference(ennf_transformation,[],[f48]) ).
fof(f48,plain,
~ ! [X0,X1] :
( ( ~ leaf_occ(X0,X1)
& arboreal(X0)
& subactivity_occurrence(X0,X1)
& occurrence_of(X1,tptp0) )
=> ? [X2,X3] :
( leaf(X3,tptp0)
& min_precedes(X2,X3,tptp0)
& ( occurrence_of(X3,tptp1)
| occurrence_of(X3,tptp2) )
& next_subocc(X0,X2,tptp0)
& occurrence_of(X2,tptp3) ) ),
inference(rectify,[],[f47]) ).
fof(f47,negated_conjecture,
~ ! [X100,X101] :
( ( ~ leaf_occ(X100,X101)
& arboreal(X100)
& subactivity_occurrence(X100,X101)
& occurrence_of(X101,tptp0) )
=> ? [X102,X103] :
( leaf(X103,tptp0)
& min_precedes(X102,X103,tptp0)
& ( occurrence_of(X103,tptp1)
| occurrence_of(X103,tptp2) )
& next_subocc(X100,X102,tptp0)
& occurrence_of(X102,tptp3) ) ),
inference(negated_conjecture,[],[f46]) ).
fof(f46,conjecture,
! [X100,X101] :
( ( ~ leaf_occ(X100,X101)
& arboreal(X100)
& subactivity_occurrence(X100,X101)
& occurrence_of(X101,tptp0) )
=> ? [X102,X103] :
( leaf(X103,tptp0)
& min_precedes(X102,X103,tptp0)
& ( occurrence_of(X103,tptp1)
| occurrence_of(X103,tptp2) )
& next_subocc(X100,X102,tptp0)
& occurrence_of(X102,tptp3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goals) ).
fof(f665,plain,
next_subocc(sK5,sK12(sK5),tptp0),
inference(unit_resulting_resolution,[],[f659,f225]) ).
fof(f225,plain,
! [X0] :
( ~ sP0(X0)
| next_subocc(X0,sK12(X0),tptp0) ),
inference(cnf_transformation,[],[f155]) ).
fof(f155,plain,
! [X0] :
( ( leaf(sK14(X0),tptp0)
& next_subocc(sK13(X0),sK14(X0),tptp0)
& ( occurrence_of(sK14(X0),tptp1)
| occurrence_of(sK14(X0),tptp2) )
& next_subocc(sK12(X0),sK13(X0),tptp0)
& occurrence_of(sK13(X0),tptp4)
& next_subocc(X0,sK12(X0),tptp0)
& occurrence_of(sK12(X0),tptp3) )
| ~ sP0(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK12,sK13,sK14])],[f153,f154]) ).
fof(f154,plain,
! [X0] :
( ? [X1,X2,X3] :
( leaf(X3,tptp0)
& next_subocc(X2,X3,tptp0)
& ( occurrence_of(X3,tptp1)
| occurrence_of(X3,tptp2) )
& next_subocc(X1,X2,tptp0)
& occurrence_of(X2,tptp4)
& next_subocc(X0,X1,tptp0)
& occurrence_of(X1,tptp3) )
=> ( leaf(sK14(X0),tptp0)
& next_subocc(sK13(X0),sK14(X0),tptp0)
& ( occurrence_of(sK14(X0),tptp1)
| occurrence_of(sK14(X0),tptp2) )
& next_subocc(sK12(X0),sK13(X0),tptp0)
& occurrence_of(sK13(X0),tptp4)
& next_subocc(X0,sK12(X0),tptp0)
& occurrence_of(sK12(X0),tptp3) ) ),
introduced(choice_axiom,[]) ).
fof(f153,plain,
! [X0] :
( ? [X1,X2,X3] :
( leaf(X3,tptp0)
& next_subocc(X2,X3,tptp0)
& ( occurrence_of(X3,tptp1)
| occurrence_of(X3,tptp2) )
& next_subocc(X1,X2,tptp0)
& occurrence_of(X2,tptp4)
& next_subocc(X0,X1,tptp0)
& occurrence_of(X1,tptp3) )
| ~ sP0(X0) ),
inference(rectify,[],[f152]) ).
fof(f152,plain,
! [X0] :
( ? [X2,X3,X4] :
( leaf(X4,tptp0)
& next_subocc(X3,X4,tptp0)
& ( occurrence_of(X4,tptp1)
| occurrence_of(X4,tptp2) )
& next_subocc(X2,X3,tptp0)
& occurrence_of(X3,tptp4)
& next_subocc(X0,X2,tptp0)
& occurrence_of(X2,tptp3) )
| ~ sP0(X0) ),
inference(nnf_transformation,[],[f129]) ).
fof(f129,plain,
! [X0] :
( ? [X2,X3,X4] :
( leaf(X4,tptp0)
& next_subocc(X3,X4,tptp0)
& ( occurrence_of(X4,tptp1)
| occurrence_of(X4,tptp2) )
& next_subocc(X2,X3,tptp0)
& occurrence_of(X3,tptp4)
& next_subocc(X0,X2,tptp0)
& occurrence_of(X2,tptp3) )
| ~ sP0(X0) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP0])]) ).
fof(f659,plain,
sP0(sK5),
inference(unit_resulting_resolution,[],[f187,f186,f188,f185,f231]) ).
fof(f231,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| leaf_occ(X0,X1)
| ~ arboreal(X0)
| sP0(X0)
| ~ occurrence_of(X1,tptp0) ),
inference(cnf_transformation,[],[f130]) ).
fof(f130,plain,
! [X0,X1] :
( sP0(X0)
| leaf_occ(X0,X1)
| ~ arboreal(X0)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0) ),
inference(definition_folding,[],[f103,f129]) ).
fof(f103,plain,
! [X0,X1] :
( ? [X2,X3,X4] :
( leaf(X4,tptp0)
& next_subocc(X3,X4,tptp0)
& ( occurrence_of(X4,tptp1)
| occurrence_of(X4,tptp2) )
& next_subocc(X2,X3,tptp0)
& occurrence_of(X3,tptp4)
& next_subocc(X0,X2,tptp0)
& occurrence_of(X2,tptp3) )
| leaf_occ(X0,X1)
| ~ arboreal(X0)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0) ),
inference(flattening,[],[f102]) ).
fof(f102,plain,
! [X0,X1] :
( ? [X2,X3,X4] :
( leaf(X4,tptp0)
& next_subocc(X3,X4,tptp0)
& ( occurrence_of(X4,tptp1)
| occurrence_of(X4,tptp2) )
& next_subocc(X2,X3,tptp0)
& occurrence_of(X3,tptp4)
& next_subocc(X0,X2,tptp0)
& occurrence_of(X2,tptp3) )
| leaf_occ(X0,X1)
| ~ arboreal(X0)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0) ),
inference(ennf_transformation,[],[f62]) ).
fof(f62,plain,
! [X0,X1] :
( ( ~ leaf_occ(X0,X1)
& arboreal(X0)
& subactivity_occurrence(X0,X1)
& occurrence_of(X1,tptp0) )
=> ? [X2,X3,X4] :
( leaf(X4,tptp0)
& next_subocc(X3,X4,tptp0)
& ( occurrence_of(X4,tptp1)
| occurrence_of(X4,tptp2) )
& next_subocc(X2,X3,tptp0)
& occurrence_of(X3,tptp4)
& next_subocc(X0,X2,tptp0)
& occurrence_of(X2,tptp3) ) ),
inference(rectify,[],[f33]) ).
fof(f33,axiom,
! [X95,X96] :
( ( ~ leaf_occ(X95,X96)
& arboreal(X95)
& subactivity_occurrence(X95,X96)
& occurrence_of(X96,tptp0) )
=> ? [X97,X98,X99] :
( leaf(X99,tptp0)
& next_subocc(X98,X99,tptp0)
& ( occurrence_of(X99,tptp1)
| occurrence_of(X99,tptp2) )
& next_subocc(X97,X98,tptp0)
& occurrence_of(X98,tptp4)
& next_subocc(X95,X97,tptp0)
& occurrence_of(X97,tptp3) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_32) ).
fof(f185,plain,
occurrence_of(sK6,tptp0),
inference(cnf_transformation,[],[f140]) ).
fof(f188,plain,
~ leaf_occ(sK5,sK6),
inference(cnf_transformation,[],[f140]) ).
fof(f186,plain,
subactivity_occurrence(sK5,sK6),
inference(cnf_transformation,[],[f140]) ).
fof(f187,plain,
arboreal(sK5),
inference(cnf_transformation,[],[f140]) ).
fof(f1180,plain,
min_precedes(sK12(sK5),sK14(sK5),tptp0),
inference(unit_resulting_resolution,[],[f982,f987,f275]) ).
fof(f275,plain,
! [X2,X3,X0,X1] :
( ~ min_precedes(X1,X2,X3)
| min_precedes(X0,X2,X3)
| ~ min_precedes(X0,X1,X3) ),
inference(cnf_transformation,[],[f128]) ).
fof(f128,plain,
! [X0,X1,X2,X3] :
( min_precedes(X0,X2,X3)
| ~ min_precedes(X1,X2,X3)
| ~ min_precedes(X0,X1,X3) ),
inference(flattening,[],[f127]) ).
fof(f127,plain,
! [X0,X1,X2,X3] :
( min_precedes(X0,X2,X3)
| ~ min_precedes(X1,X2,X3)
| ~ min_precedes(X0,X1,X3) ),
inference(ennf_transformation,[],[f1]) ).
fof(f1,axiom,
! [X0,X1,X2,X3] :
( ( min_precedes(X1,X2,X3)
& min_precedes(X0,X1,X3) )
=> min_precedes(X0,X2,X3) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos) ).
fof(f987,plain,
min_precedes(sK13(sK5),sK14(sK5),tptp0),
inference(unit_resulting_resolution,[],[f876,f266]) ).
fof(f266,plain,
! [X2,X0,X1] :
( ~ sP4(X0,X1,X2)
| min_precedes(X2,X1,X0) ),
inference(cnf_transformation,[],[f183]) ).
fof(f183,plain,
! [X0,X1,X2] :
( ( sP4(X0,X1,X2)
| ( min_precedes(sK22(X0,X1,X2),X1,X0)
& min_precedes(X2,sK22(X0,X1,X2),X0) )
| ~ min_precedes(X2,X1,X0) )
& ( ( ! [X4] :
( ~ min_precedes(X4,X1,X0)
| ~ min_precedes(X2,X4,X0) )
& min_precedes(X2,X1,X0) )
| ~ sP4(X0,X1,X2) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK22])],[f181,f182]) ).
fof(f182,plain,
! [X0,X1,X2] :
( ? [X3] :
( min_precedes(X3,X1,X0)
& min_precedes(X2,X3,X0) )
=> ( min_precedes(sK22(X0,X1,X2),X1,X0)
& min_precedes(X2,sK22(X0,X1,X2),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f181,plain,
! [X0,X1,X2] :
( ( sP4(X0,X1,X2)
| ? [X3] :
( min_precedes(X3,X1,X0)
& min_precedes(X2,X3,X0) )
| ~ min_precedes(X2,X1,X0) )
& ( ( ! [X4] :
( ~ min_precedes(X4,X1,X0)
| ~ min_precedes(X2,X4,X0) )
& min_precedes(X2,X1,X0) )
| ~ sP4(X0,X1,X2) ) ),
inference(rectify,[],[f180]) ).
fof(f180,plain,
! [X2,X1,X0] :
( ( sP4(X2,X1,X0)
| ? [X3] :
( min_precedes(X3,X1,X2)
& min_precedes(X0,X3,X2) )
| ~ min_precedes(X0,X1,X2) )
& ( ( ! [X3] :
( ~ min_precedes(X3,X1,X2)
| ~ min_precedes(X0,X3,X2) )
& min_precedes(X0,X1,X2) )
| ~ sP4(X2,X1,X0) ) ),
inference(flattening,[],[f179]) ).
fof(f179,plain,
! [X2,X1,X0] :
( ( sP4(X2,X1,X0)
| ? [X3] :
( min_precedes(X3,X1,X2)
& min_precedes(X0,X3,X2) )
| ~ min_precedes(X0,X1,X2) )
& ( ( ! [X3] :
( ~ min_precedes(X3,X1,X2)
| ~ min_precedes(X0,X3,X2) )
& min_precedes(X0,X1,X2) )
| ~ sP4(X2,X1,X0) ) ),
inference(nnf_transformation,[],[f137]) ).
fof(f137,plain,
! [X2,X1,X0] :
( sP4(X2,X1,X0)
<=> ( ! [X3] :
( ~ min_precedes(X3,X1,X2)
| ~ min_precedes(X0,X3,X2) )
& min_precedes(X0,X1,X2) ) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP4])]) ).
fof(f876,plain,
sP4(tptp0,sK14(sK5),sK13(sK5)),
inference(unit_resulting_resolution,[],[f668,f270]) ).
fof(f270,plain,
! [X2,X0,X1] :
( ~ next_subocc(X0,X1,X2)
| sP4(X2,X1,X0) ),
inference(cnf_transformation,[],[f184]) ).
fof(f184,plain,
! [X0,X1,X2] :
( ( next_subocc(X0,X1,X2)
| ~ sP4(X2,X1,X0) )
& ( sP4(X2,X1,X0)
| ~ next_subocc(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f138]) ).
fof(f138,plain,
! [X0,X1,X2] :
( next_subocc(X0,X1,X2)
<=> sP4(X2,X1,X0) ),
inference(definition_folding,[],[f120,f137]) ).
fof(f120,plain,
! [X0,X1,X2] :
( next_subocc(X0,X1,X2)
<=> ( ! [X3] :
( ~ min_precedes(X3,X1,X2)
| ~ min_precedes(X0,X3,X2) )
& min_precedes(X0,X1,X2) ) ),
inference(ennf_transformation,[],[f77]) ).
fof(f77,plain,
! [X0,X1,X2] :
( next_subocc(X0,X1,X2)
<=> ( ~ ? [X3] :
( min_precedes(X3,X1,X2)
& min_precedes(X0,X3,X2) )
& min_precedes(X0,X1,X2) ) ),
inference(rectify,[],[f5]) ).
fof(f5,axiom,
! [X15,X16,X17] :
( next_subocc(X15,X16,X17)
<=> ( ~ ? [X18] :
( min_precedes(X18,X16,X17)
& min_precedes(X15,X18,X17) )
& min_precedes(X15,X16,X17) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sos_04) ).
fof(f668,plain,
next_subocc(sK13(sK5),sK14(sK5),tptp0),
inference(unit_resulting_resolution,[],[f659,f229]) ).
fof(f229,plain,
! [X0] :
( ~ sP0(X0)
| next_subocc(sK13(X0),sK14(X0),tptp0) ),
inference(cnf_transformation,[],[f155]) ).
fof(f982,plain,
min_precedes(sK12(sK5),sK13(sK5),tptp0),
inference(unit_resulting_resolution,[],[f870,f266]) ).
fof(f870,plain,
sP4(tptp0,sK13(sK5),sK12(sK5)),
inference(unit_resulting_resolution,[],[f667,f270]) ).
fof(f667,plain,
next_subocc(sK12(sK5),sK13(sK5),tptp0),
inference(unit_resulting_resolution,[],[f659,f227]) ).
fof(f227,plain,
! [X0] :
( ~ sP0(X0)
| next_subocc(sK12(X0),sK13(X0),tptp0) ),
inference(cnf_transformation,[],[f155]) ).
fof(f1451,plain,
occurrence_of(sK14(sK5),tptp1),
inference(unit_resulting_resolution,[],[f659,f1448,f228]) ).
fof(f228,plain,
! [X0] :
( ~ sP0(X0)
| occurrence_of(sK14(X0),tptp2)
| occurrence_of(sK14(X0),tptp1) ),
inference(cnf_transformation,[],[f155]) ).
fof(f1448,plain,
~ occurrence_of(sK14(sK5),tptp2),
inference(unit_resulting_resolution,[],[f664,f669,f1180,f665,f189]) ).
fof(f189,plain,
! [X2,X3] :
( ~ next_subocc(sK5,X2,tptp0)
| ~ min_precedes(X2,X3,tptp0)
| ~ occurrence_of(X3,tptp2)
| ~ leaf(X3,tptp0)
| ~ occurrence_of(X2,tptp3) ),
inference(cnf_transformation,[],[f140]) ).
fof(f669,plain,
leaf(sK14(sK5),tptp0),
inference(unit_resulting_resolution,[],[f659,f230]) ).
fof(f230,plain,
! [X0] :
( ~ sP0(X0)
| leaf(sK14(X0),tptp0) ),
inference(cnf_transformation,[],[f155]) ).
fof(f664,plain,
occurrence_of(sK12(sK5),tptp3),
inference(unit_resulting_resolution,[],[f659,f224]) ).
fof(f224,plain,
! [X0] :
( ~ sP0(X0)
| occurrence_of(sK12(X0),tptp3) ),
inference(cnf_transformation,[],[f155]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10 % Problem : PRO014+2 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.11 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.10/0.31 % Computer : n025.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 300
% 0.10/0.31 % DateTime : Fri May 3 20:36:38 EDT 2024
% 0.10/0.31 % CPUTime :
% 0.16/0.31 % (22217)Running in auto input_syntax mode. Trying TPTP
% 0.16/0.33 % (22220)WARNING: value z3 for option sas not known
% 0.16/0.33 % (22223)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.16/0.33 % (22221)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.16/0.33 % (22219)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.16/0.33 % (22222)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.33 % (22224)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.33 % (22220)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.33 % (22218)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.16/0.34 Detected minimum model sizes of [4]
% 0.16/0.34 Detected maximum model sizes of [max]
% 0.16/0.34 TRYING [4]
% 0.16/0.34 Detected minimum model sizes of [4]
% 0.16/0.34 Detected maximum model sizes of [max]
% 0.16/0.34 TRYING [4]
% 0.16/0.35 TRYING [5]
% 0.16/0.35 TRYING [5]
% 0.16/0.36 % (22224)First to succeed.
% 0.16/0.36 % (22224)Solution written to "/export/starexec/sandbox2/tmp/vampire-proof-22217"
% 0.16/0.36 % (22224)Refutation found. Thanks to Tanya!
% 0.16/0.36 % SZS status Theorem for theBenchmark
% 0.16/0.36 % SZS output start Proof for theBenchmark
% See solution above
% 0.16/0.36 % (22224)------------------------------
% 0.16/0.36 % (22224)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 0.16/0.36 % (22224)Termination reason: Refutation
% 0.16/0.36
% 0.16/0.36 % (22224)Memory used [KB]: 1381
% 0.16/0.36 % (22224)Time elapsed: 0.033 s
% 0.16/0.36 % (22224)Instructions burned: 55 (million)
% 0.16/0.36 % (22217)Success in time 0.048 s
%------------------------------------------------------------------------------