TSTP Solution File: PRO017+4 by Vampire-SAT---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire-SAT---4.8
% Problem : PRO017+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 : n012.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:48:03 EDT 2024
% Result : Theorem 8.28s 1.58s
% Output : Refutation 8.28s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 17
% Syntax : Number of formulae : 107 ( 33 unt; 0 def)
% Number of atoms : 434 ( 35 equ)
% Maximal formula atoms : 20 ( 4 avg)
% Number of connectives : 480 ( 153 ~; 143 |; 156 &)
% ( 9 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 6 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 14 ( 12 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 7 con; 0-3 aty)
% Number of variables : 238 ( 187 !; 51 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f29865,plain,
$false,
inference(subsumption_resolution,[],[f28964,f484]) ).
fof(f484,plain,
~ occurrence_of(sK11(sK4),tptp3),
inference(unit_resulting_resolution,[],[f198,f468,f253]) ).
fof(f253,plain,
! [X2,X0,X1] :
( ~ occurrence_of(X0,X2)
| X1 = X2
| ~ occurrence_of(X0,X1) ),
inference(cnf_transformation,[],[f119]) ).
fof(f119,plain,
! [X0,X1,X2] :
( X1 = X2
| ~ occurrence_of(X0,X2)
| ~ occurrence_of(X0,X1) ),
inference(flattening,[],[f118]) ).
fof(f118,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/sandbox/benchmark/theBenchmark.p',sos_08) ).
fof(f468,plain,
occurrence_of(sK11(sK4),tptp4),
inference(unit_resulting_resolution,[],[f460,f218]) ).
fof(f218,plain,
! [X0] :
( ~ sP0(X0)
| occurrence_of(sK11(X0),tptp4) ),
inference(cnf_transformation,[],[f157]) ).
fof(f157,plain,
! [X0] :
( ( ! [X4] :
( sK12(X0) = X4
| sK11(X0) = X4
| ~ min_precedes(sK10(X0),X4,tptp0) )
& min_precedes(sK11(X0),sK12(X0),tptp0)
& ( occurrence_of(sK12(X0),tptp1)
| occurrence_of(sK12(X0),tptp2) )
& min_precedes(sK10(X0),sK11(X0),tptp0)
& occurrence_of(sK11(X0),tptp4)
& next_subocc(X0,sK10(X0),tptp0)
& occurrence_of(sK10(X0),tptp3) )
| ~ sP0(X0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK10,sK11,sK12])],[f155,f156]) ).
fof(f156,plain,
! [X0] :
( ? [X1,X2,X3] :
( ! [X4] :
( X3 = X4
| X2 = X4
| ~ min_precedes(X1,X4,tptp0) )
& min_precedes(X2,X3,tptp0)
& ( occurrence_of(X3,tptp1)
| occurrence_of(X3,tptp2) )
& min_precedes(X1,X2,tptp0)
& occurrence_of(X2,tptp4)
& next_subocc(X0,X1,tptp0)
& occurrence_of(X1,tptp3) )
=> ( ! [X4] :
( sK12(X0) = X4
| sK11(X0) = X4
| ~ min_precedes(sK10(X0),X4,tptp0) )
& min_precedes(sK11(X0),sK12(X0),tptp0)
& ( occurrence_of(sK12(X0),tptp1)
| occurrence_of(sK12(X0),tptp2) )
& min_precedes(sK10(X0),sK11(X0),tptp0)
& occurrence_of(sK11(X0),tptp4)
& next_subocc(X0,sK10(X0),tptp0)
& occurrence_of(sK10(X0),tptp3) ) ),
introduced(choice_axiom,[]) ).
fof(f155,plain,
! [X0] :
( ? [X1,X2,X3] :
( ! [X4] :
( X3 = X4
| X2 = X4
| ~ min_precedes(X1,X4,tptp0) )
& min_precedes(X2,X3,tptp0)
& ( occurrence_of(X3,tptp1)
| occurrence_of(X3,tptp2) )
& min_precedes(X1,X2,tptp0)
& occurrence_of(X2,tptp4)
& next_subocc(X0,X1,tptp0)
& occurrence_of(X1,tptp3) )
| ~ sP0(X0) ),
inference(rectify,[],[f154]) ).
fof(f154,plain,
! [X0] :
( ? [X2,X3,X4] :
( ! [X5] :
( X4 = X5
| X3 = X5
| ~ min_precedes(X2,X5,tptp0) )
& min_precedes(X3,X4,tptp0)
& ( occurrence_of(X4,tptp1)
| occurrence_of(X4,tptp2) )
& min_precedes(X2,X3,tptp0)
& occurrence_of(X3,tptp4)
& next_subocc(X0,X2,tptp0)
& occurrence_of(X2,tptp3) )
| ~ sP0(X0) ),
inference(nnf_transformation,[],[f135]) ).
fof(f135,plain,
! [X0] :
( ? [X2,X3,X4] :
( ! [X5] :
( X4 = X5
| X3 = X5
| ~ min_precedes(X2,X5,tptp0) )
& min_precedes(X3,X4,tptp0)
& ( occurrence_of(X4,tptp1)
| occurrence_of(X4,tptp2) )
& min_precedes(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(f460,plain,
sP0(sK4),
inference(unit_resulting_resolution,[],[f187,f186,f188,f185,f223]) ).
fof(f223,plain,
! [X0,X1] :
( ~ subactivity_occurrence(X0,X1)
| leaf_occ(X0,X1)
| ~ arboreal(X0)
| sP0(X0)
| ~ occurrence_of(X1,tptp0) ),
inference(cnf_transformation,[],[f136]) ).
fof(f136,plain,
! [X0,X1] :
( sP0(X0)
| leaf_occ(X0,X1)
| ~ arboreal(X0)
| ~ subactivity_occurrence(X0,X1)
| ~ occurrence_of(X1,tptp0) ),
inference(definition_folding,[],[f103,f135]) ).
fof(f103,plain,
! [X0,X1] :
( ? [X2,X3,X4] :
( ! [X5] :
( X4 = X5
| X3 = X5
| ~ min_precedes(X2,X5,tptp0) )
& min_precedes(X3,X4,tptp0)
& ( occurrence_of(X4,tptp1)
| occurrence_of(X4,tptp2) )
& min_precedes(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] :
( ! [X5] :
( X4 = X5
| X3 = X5
| ~ min_precedes(X2,X5,tptp0) )
& min_precedes(X3,X4,tptp0)
& ( occurrence_of(X4,tptp1)
| occurrence_of(X4,tptp2) )
& min_precedes(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,[],[f58]) ).
fof(f58,plain,
! [X0,X1] :
( ( ~ leaf_occ(X0,X1)
& arboreal(X0)
& subactivity_occurrence(X0,X1)
& occurrence_of(X1,tptp0) )
=> ? [X2,X3,X4] :
( ! [X5] :
( min_precedes(X2,X5,tptp0)
=> ( X4 = X5
| X3 = X5 ) )
& min_precedes(X3,X4,tptp0)
& ( occurrence_of(X4,tptp1)
| occurrence_of(X4,tptp2) )
& min_precedes(X2,X3,tptp0)
& occurrence_of(X3,tptp4)
& next_subocc(X0,X2,tptp0)
& occurrence_of(X2,tptp3) ) ),
inference(rectify,[],[f33]) ).
fof(f33,axiom,
! [X101,X102] :
( ( ~ leaf_occ(X101,X102)
& arboreal(X101)
& subactivity_occurrence(X101,X102)
& occurrence_of(X102,tptp0) )
=> ? [X103,X104,X105] :
( ! [X106] :
( min_precedes(X103,X106,tptp0)
=> ( X105 = X106
| X104 = X106 ) )
& min_precedes(X104,X105,tptp0)
& ( occurrence_of(X105,tptp1)
| occurrence_of(X105,tptp2) )
& min_precedes(X103,X104,tptp0)
& occurrence_of(X104,tptp4)
& next_subocc(X101,X103,tptp0)
& occurrence_of(X103,tptp3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_32) ).
fof(f185,plain,
occurrence_of(sK5,tptp0),
inference(cnf_transformation,[],[f144]) ).
fof(f144,plain,
( ! [X2,X3] :
( ~ leaf(X3,tptp0)
| ~ min_precedes(X2,X3,tptp0)
| ( ~ occurrence_of(X3,tptp1)
& ~ occurrence_of(X3,tptp2) )
| ~ next_subocc(sK4,X2,tptp0)
| ~ occurrence_of(X2,tptp3) )
& ~ leaf_occ(sK4,sK5)
& arboreal(sK4)
& subactivity_occurrence(sK4,sK5)
& occurrence_of(sK5,tptp0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK4,sK5])],[f89,f143]) ).
fof(f143,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(sK4,X2,tptp0)
| ~ occurrence_of(X2,tptp3) )
& ~ leaf_occ(sK4,sK5)
& arboreal(sK4)
& subactivity_occurrence(sK4,sK5)
& occurrence_of(sK5,tptp0) ) ),
introduced(choice_axiom,[]) ).
fof(f89,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,[],[f88]) ).
fof(f88,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,
~ ! [X107,X108] :
( ( ~ leaf_occ(X107,X108)
& arboreal(X107)
& subactivity_occurrence(X107,X108)
& occurrence_of(X108,tptp0) )
=> ? [X109,X110] :
( leaf(X110,tptp0)
& min_precedes(X109,X110,tptp0)
& ( occurrence_of(X110,tptp1)
| occurrence_of(X110,tptp2) )
& next_subocc(X107,X109,tptp0)
& occurrence_of(X109,tptp3) ) ),
inference(negated_conjecture,[],[f46]) ).
fof(f46,conjecture,
! [X107,X108] :
( ( ~ leaf_occ(X107,X108)
& arboreal(X107)
& subactivity_occurrence(X107,X108)
& occurrence_of(X108,tptp0) )
=> ? [X109,X110] :
( leaf(X110,tptp0)
& min_precedes(X109,X110,tptp0)
& ( occurrence_of(X110,tptp1)
| occurrence_of(X110,tptp2) )
& next_subocc(X107,X109,tptp0)
& occurrence_of(X109,tptp3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
fof(f188,plain,
~ leaf_occ(sK4,sK5),
inference(cnf_transformation,[],[f144]) ).
fof(f186,plain,
subactivity_occurrence(sK4,sK5),
inference(cnf_transformation,[],[f144]) ).
fof(f187,plain,
arboreal(sK4),
inference(cnf_transformation,[],[f144]) ).
fof(f198,plain,
tptp3 != tptp4,
inference(cnf_transformation,[],[f40]) ).
fof(f40,axiom,
tptp3 != tptp4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_39) ).
fof(f28964,plain,
occurrence_of(sK11(sK4),tptp3),
inference(superposition,[],[f1448,f28962]) ).
fof(f28962,plain,
sK11(sK4) = sK10(sK10(sK4)),
inference(subsumption_resolution,[],[f28062,f763]) ).
fof(f763,plain,
~ next_subocc(sK10(sK4),sK12(sK4),tptp0),
inference(unit_resulting_resolution,[],[f633,f258]) ).
fof(f258,plain,
! [X2,X0,X1] :
( ~ next_subocc(X0,X1,X2)
| sP3(X2,X1,X0) ),
inference(cnf_transformation,[],[f184]) ).
fof(f184,plain,
! [X0,X1,X2] :
( ( next_subocc(X0,X1,X2)
| ~ sP3(X2,X1,X0) )
& ( sP3(X2,X1,X0)
| ~ next_subocc(X0,X1,X2) ) ),
inference(nnf_transformation,[],[f142]) ).
fof(f142,plain,
! [X0,X1,X2] :
( next_subocc(X0,X1,X2)
<=> sP3(X2,X1,X0) ),
inference(definition_folding,[],[f120,f141]) ).
fof(f141,plain,
! [X2,X1,X0] :
( sP3(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,[sP3])]) ).
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,[],[f73]) ).
fof(f73,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,[],[f27]) ).
fof(f27,axiom,
! [X78,X79,X80] :
( next_subocc(X78,X79,X80)
<=> ( ~ ? [X81] :
( min_precedes(X81,X79,X80)
& min_precedes(X78,X81,X80) )
& min_precedes(X78,X79,X80) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_26) ).
fof(f633,plain,
~ sP3(tptp0,sK12(sK4),sK10(sK4)),
inference(unit_resulting_resolution,[],[f465,f466,f255]) ).
fof(f255,plain,
! [X2,X0,X1,X4] :
( ~ sP3(X0,X1,X2)
| ~ min_precedes(X2,X4,X0)
| ~ min_precedes(X4,X1,X0) ),
inference(cnf_transformation,[],[f183]) ).
fof(f183,plain,
! [X0,X1,X2] :
( ( sP3(X0,X1,X2)
| ( min_precedes(sK19(X0,X1,X2),X1,X0)
& min_precedes(X2,sK19(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) )
| ~ sP3(X0,X1,X2) ) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK19])],[f181,f182]) ).
fof(f182,plain,
! [X0,X1,X2] :
( ? [X3] :
( min_precedes(X3,X1,X0)
& min_precedes(X2,X3,X0) )
=> ( min_precedes(sK19(X0,X1,X2),X1,X0)
& min_precedes(X2,sK19(X0,X1,X2),X0) ) ),
introduced(choice_axiom,[]) ).
fof(f181,plain,
! [X0,X1,X2] :
( ( sP3(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) )
| ~ sP3(X0,X1,X2) ) ),
inference(rectify,[],[f180]) ).
fof(f180,plain,
! [X2,X1,X0] :
( ( sP3(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) )
| ~ sP3(X2,X1,X0) ) ),
inference(flattening,[],[f179]) ).
fof(f179,plain,
! [X2,X1,X0] :
( ( sP3(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) )
| ~ sP3(X2,X1,X0) ) ),
inference(nnf_transformation,[],[f141]) ).
fof(f466,plain,
min_precedes(sK10(sK4),sK11(sK4),tptp0),
inference(unit_resulting_resolution,[],[f460,f219]) ).
fof(f219,plain,
! [X0] :
( ~ sP0(X0)
| min_precedes(sK10(X0),sK11(X0),tptp0) ),
inference(cnf_transformation,[],[f157]) ).
fof(f465,plain,
min_precedes(sK11(sK4),sK12(sK4),tptp0),
inference(unit_resulting_resolution,[],[f460,f221]) ).
fof(f221,plain,
! [X0] :
( ~ sP0(X0)
| min_precedes(sK11(X0),sK12(X0),tptp0) ),
inference(cnf_transformation,[],[f157]) ).
fof(f28062,plain,
( next_subocc(sK10(sK4),sK12(sK4),tptp0)
| sK11(sK4) = sK10(sK10(sK4)) ),
inference(superposition,[],[f1449,f1548]) ).
fof(f1548,plain,
( sK12(sK4) = sK10(sK10(sK4))
| sK11(sK4) = sK10(sK10(sK4)) ),
inference(subsumption_resolution,[],[f1535,f460]) ).
fof(f1535,plain,
( sK11(sK4) = sK10(sK10(sK4))
| sK12(sK4) = sK10(sK10(sK4))
| ~ sP0(sK4) ),
inference(resolution,[],[f1518,f222]) ).
fof(f222,plain,
! [X0,X4] :
( ~ min_precedes(sK10(X0),X4,tptp0)
| sK11(X0) = X4
| sK12(X0) = X4
| ~ sP0(X0) ),
inference(cnf_transformation,[],[f157]) ).
fof(f1518,plain,
min_precedes(sK10(sK4),sK10(sK10(sK4)),tptp0),
inference(unit_resulting_resolution,[],[f1509,f254]) ).
fof(f254,plain,
! [X2,X0,X1] :
( ~ sP3(X0,X1,X2)
| min_precedes(X2,X1,X0) ),
inference(cnf_transformation,[],[f183]) ).
fof(f1509,plain,
sP3(tptp0,sK10(sK10(sK4)),sK10(sK4)),
inference(unit_resulting_resolution,[],[f1449,f258]) ).
fof(f1449,plain,
next_subocc(sK10(sK4),sK10(sK10(sK4)),tptp0),
inference(unit_resulting_resolution,[],[f1446,f217]) ).
fof(f217,plain,
! [X0] :
( ~ sP0(X0)
| next_subocc(X0,sK10(X0),tptp0) ),
inference(cnf_transformation,[],[f157]) ).
fof(f1446,plain,
sP0(sK10(sK4)),
inference(subsumption_resolution,[],[f1445,f579]) ).
fof(f579,plain,
occurrence_of(sK18(sK10(sK4),sK4,tptp0),tptp0),
inference(unit_resulting_resolution,[],[f542,f246]) ).
fof(f246,plain,
! [X2,X0,X1] :
( ~ sP2(X0,X1,X2)
| occurrence_of(sK18(X0,X1,X2),X2) ),
inference(cnf_transformation,[],[f178]) ).
fof(f178,plain,
! [X0,X1,X2] :
( ( subactivity_occurrence(X0,sK18(X0,X1,X2))
& subactivity_occurrence(X1,sK18(X0,X1,X2))
& occurrence_of(sK18(X0,X1,X2),X2) )
| ~ sP2(X0,X1,X2) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK18])],[f176,f177]) ).
fof(f177,plain,
! [X0,X1,X2] :
( ? [X3] :
( subactivity_occurrence(X0,X3)
& subactivity_occurrence(X1,X3)
& occurrence_of(X3,X2) )
=> ( subactivity_occurrence(X0,sK18(X0,X1,X2))
& subactivity_occurrence(X1,sK18(X0,X1,X2))
& occurrence_of(sK18(X0,X1,X2),X2) ) ),
introduced(choice_axiom,[]) ).
fof(f176,plain,
! [X0,X1,X2] :
( ? [X3] :
( subactivity_occurrence(X0,X3)
& subactivity_occurrence(X1,X3)
& occurrence_of(X3,X2) )
| ~ sP2(X0,X1,X2) ),
inference(rectify,[],[f175]) ).
fof(f175,plain,
! [X2,X1,X0] :
( ? [X3] :
( subactivity_occurrence(X2,X3)
& subactivity_occurrence(X1,X3)
& occurrence_of(X3,X0) )
| ~ sP2(X2,X1,X0) ),
inference(nnf_transformation,[],[f139]) ).
fof(f139,plain,
! [X2,X1,X0] :
( ? [X3] :
( subactivity_occurrence(X2,X3)
& subactivity_occurrence(X1,X3)
& occurrence_of(X3,X0) )
| ~ sP2(X2,X1,X0) ),
introduced(predicate_definition_introduction,[new_symbols(naming,[sP2])]) ).
fof(f542,plain,
sP2(sK10(sK4),sK4,tptp0),
inference(unit_resulting_resolution,[],[f533,f249]) ).
fof(f249,plain,
! [X2,X0,X1] :
( ~ min_precedes(X1,X2,X0)
| sP2(X2,X1,X0) ),
inference(cnf_transformation,[],[f140]) ).
fof(f140,plain,
! [X0,X1,X2] :
( sP2(X2,X1,X0)
| ~ min_precedes(X1,X2,X0) ),
inference(definition_folding,[],[f111,f139]) ).
fof(f111,plain,
! [X0,X1,X2] :
( ? [X3] :
( subactivity_occurrence(X2,X3)
& subactivity_occurrence(X1,X3)
& occurrence_of(X3,X0) )
| ~ min_precedes(X1,X2,X0) ),
inference(ennf_transformation,[],[f68]) ).
fof(f68,plain,
! [X0,X1,X2] :
( min_precedes(X1,X2,X0)
=> ? [X3] :
( subactivity_occurrence(X2,X3)
& subactivity_occurrence(X1,X3)
& occurrence_of(X3,X0) ) ),
inference(rectify,[],[f7]) ).
fof(f7,axiom,
! [X21,X22,X23] :
( min_precedes(X22,X23,X21)
=> ? [X24] :
( subactivity_occurrence(X23,X24)
& subactivity_occurrence(X22,X24)
& occurrence_of(X24,X21) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_06) ).
fof(f533,plain,
min_precedes(sK4,sK10(sK4),tptp0),
inference(unit_resulting_resolution,[],[f526,f254]) ).
fof(f526,plain,
sP3(tptp0,sK10(sK4),sK4),
inference(unit_resulting_resolution,[],[f467,f258]) ).
fof(f467,plain,
next_subocc(sK4,sK10(sK4),tptp0),
inference(unit_resulting_resolution,[],[f460,f217]) ).
fof(f1445,plain,
( sP0(sK10(sK4))
| ~ occurrence_of(sK18(sK10(sK4),sK4,tptp0),tptp0) ),
inference(subsumption_resolution,[],[f1444,f502]) ).
fof(f502,plain,
arboreal(sK10(sK4)),
inference(unit_resulting_resolution,[],[f194,f469,f211]) ).
fof(f211,plain,
! [X0,X1] :
( ~ occurrence_of(X0,X1)
| ~ atomic(X1)
| arboreal(X0) ),
inference(cnf_transformation,[],[f149]) ).
fof(f149,plain,
! [X0,X1] :
( ( ( arboreal(X0)
| ~ atomic(X1) )
& ( atomic(X1)
| ~ arboreal(X0) ) )
| ~ occurrence_of(X0,X1) ),
inference(nnf_transformation,[],[f97]) ).
fof(f97,plain,
! [X0,X1] :
( ( arboreal(X0)
<=> atomic(X1) )
| ~ occurrence_of(X0,X1) ),
inference(ennf_transformation,[],[f56]) ).
fof(f56,plain,
! [X0,X1] :
( occurrence_of(X0,X1)
=> ( arboreal(X0)
<=> atomic(X1) ) ),
inference(rectify,[],[f17]) ).
fof(f17,axiom,
! [X51,X52] :
( occurrence_of(X51,X52)
=> ( arboreal(X51)
<=> atomic(X52) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_16) ).
fof(f469,plain,
occurrence_of(sK10(sK4),tptp3),
inference(unit_resulting_resolution,[],[f460,f216]) ).
fof(f216,plain,
! [X0] :
( ~ sP0(X0)
| occurrence_of(sK10(X0),tptp3) ),
inference(cnf_transformation,[],[f157]) ).
fof(f194,plain,
atomic(tptp3),
inference(cnf_transformation,[],[f39]) ).
fof(f39,axiom,
atomic(tptp3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_38) ).
fof(f1444,plain,
( ~ arboreal(sK10(sK4))
| sP0(sK10(sK4))
| ~ occurrence_of(sK18(sK10(sK4),sK4,tptp0),tptp0) ),
inference(subsumption_resolution,[],[f1440,f888]) ).
fof(f888,plain,
~ leaf_occ(sK10(sK4),sK18(sK10(sK4),sK4,tptp0)),
inference(unit_resulting_resolution,[],[f635,f579,f270]) ).
fof(f270,plain,
! [X2,X0,X1] :
( ~ sP21(X2,X1)
| ~ occurrence_of(X0,X2)
| ~ leaf_occ(X1,X0) ),
inference(general_splitting,[],[f252,f269_D]) ).
fof(f269,plain,
! [X2,X3,X1] :
( ~ min_precedes(X1,X3,X2)
| sP21(X2,X1) ),
inference(cnf_transformation,[],[f269_D]) ).
fof(f269_D,plain,
! [X1,X2] :
( ! [X3] : ~ min_precedes(X1,X3,X2)
<=> ~ sP21(X2,X1) ),
introduced(general_splitting_component_introduction,[new_symbols(naming,[sP21])]) ).
fof(f252,plain,
! [X2,X3,X0,X1] :
( ~ min_precedes(X1,X3,X2)
| ~ leaf_occ(X1,X0)
| ~ occurrence_of(X0,X2) ),
inference(cnf_transformation,[],[f117]) ).
fof(f117,plain,
! [X0,X1,X2] :
( ! [X3] : ~ min_precedes(X1,X3,X2)
| ~ leaf_occ(X1,X0)
| ~ occurrence_of(X0,X2) ),
inference(flattening,[],[f116]) ).
fof(f116,plain,
! [X0,X1,X2] :
( ! [X3] : ~ min_precedes(X1,X3,X2)
| ~ leaf_occ(X1,X0)
| ~ occurrence_of(X0,X2) ),
inference(ennf_transformation,[],[f71]) ).
fof(f71,plain,
! [X0,X1,X2] :
( ( leaf_occ(X1,X0)
& occurrence_of(X0,X2) )
=> ~ ? [X3] : min_precedes(X1,X3,X2) ),
inference(rectify,[],[f10]) ).
fof(f10,axiom,
! [X31,X32,X33] :
( ( leaf_occ(X32,X31)
& occurrence_of(X31,X33) )
=> ~ ? [X34] : min_precedes(X32,X34,X33) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos_09) ).
fof(f635,plain,
sP21(tptp0,sK10(sK4)),
inference(unit_resulting_resolution,[],[f466,f269]) ).
fof(f1440,plain,
( leaf_occ(sK10(sK4),sK18(sK10(sK4),sK4,tptp0))
| ~ arboreal(sK10(sK4))
| sP0(sK10(sK4))
| ~ occurrence_of(sK18(sK10(sK4),sK4,tptp0),tptp0) ),
inference(resolution,[],[f577,f223]) ).
fof(f577,plain,
subactivity_occurrence(sK10(sK4),sK18(sK10(sK4),sK4,tptp0)),
inference(unit_resulting_resolution,[],[f542,f248]) ).
fof(f248,plain,
! [X2,X0,X1] :
( ~ sP2(X0,X1,X2)
| subactivity_occurrence(X0,sK18(X0,X1,X2)) ),
inference(cnf_transformation,[],[f178]) ).
fof(f1448,plain,
occurrence_of(sK10(sK10(sK4)),tptp3),
inference(unit_resulting_resolution,[],[f1446,f216]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : PRO017+4 : TPTP v8.1.2. Released v4.0.0.
% 0.12/0.14 % Command : vampire --mode casc_sat -m 16384 --cores 7 -t %d %s
% 0.14/0.35 % Computer : n012.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Fri May 3 20:37:38 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.14/0.36 % (18832)Running in auto input_syntax mode. Trying TPTP
% 0.14/0.37 % (18835)WARNING: value z3 for option sas not known
% 0.14/0.38 % (18836)fmb+10_1_bce=on:fmbsr=1.5:nm=32_533 on theBenchmark for (533ds/0Mi)
% 0.14/0.38 % (18833)fmb+10_1_bce=on:fmbas=function:fmbsr=1.2:fde=unused:nm=0_846 on theBenchmark for (846ds/0Mi)
% 0.14/0.38 % (18837)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.14/0.38 % (18838)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.14/0.38 % (18835)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.14/0.38 % (18839)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.14/0.38 % (18834)fmb+10_1_bce=on:fmbdsb=on:fmbes=contour:fmbswr=3:fde=none:nm=0_793 on theBenchmark for (793ds/0Mi)
% 0.14/0.38 Detected minimum model sizes of [4]
% 0.14/0.38 Detected maximum model sizes of [max]
% 0.14/0.38 Detected minimum model sizes of [4]
% 0.14/0.38 Detected maximum model sizes of [max]
% 0.14/0.38 TRYING [4]
% 0.14/0.38 TRYING [4]
% 0.14/0.39 TRYING [5]
% 0.14/0.40 TRYING [5]
% 0.21/0.43 TRYING [6]
% 0.21/0.44 TRYING [6]
% 0.21/0.53 TRYING [7]
% 1.56/0.57 TRYING [7]
% 2.46/0.73 TRYING [8]
% 2.84/0.79 TRYING [8]
% 5.71/1.18 TRYING [9]
% 6.16/1.28 TRYING [9]
% 7.80/1.49 Detected minimum model sizes of [4]
% 7.80/1.49 Detected maximum model sizes of [max]
% 7.80/1.49 TRYING [4]
% 7.80/1.49 TRYING [5]
% 8.07/1.52 TRYING [6]
% 8.28/1.56 TRYING [7]
% 8.28/1.57 % (18839)First to succeed.
% 8.28/1.58 % (18839)Solution written to "/export/starexec/sandbox/tmp/vampire-proof-18832"
% 8.28/1.58 % (18839)Refutation found. Thanks to Tanya!
% 8.28/1.58 % SZS status Theorem for theBenchmark
% 8.28/1.58 % SZS output start Proof for theBenchmark
% See solution above
% 8.28/1.58 % (18839)------------------------------
% 8.28/1.58 % (18839)Version: Vampire 4.8 (commit 3a798227e on 2024-05-03 07:42:47 +0200)
% 8.28/1.58 % (18839)Termination reason: Refutation
% 8.28/1.58
% 8.28/1.58 % (18839)Memory used [KB]: 10664
% 8.28/1.58 % (18839)Time elapsed: 1.201 s
% 8.28/1.58 % (18839)Instructions burned: 2756 (million)
% 8.28/1.58 % (18832)Success in time 1.216 s
%------------------------------------------------------------------------------