TSTP Solution File: PRO012+2 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : PRO012+2 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n020.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 : Tue Apr 30 20:36:45 EDT 2024
% Result : Theorem 0.21s 0.47s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 40 ( 3 unt; 0 def)
% Number of atoms : 141 ( 6 equ)
% Maximal formula atoms : 11 ( 3 avg)
% Number of connectives : 168 ( 67 ~; 64 |; 29 &)
% ( 3 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 8 ( 6 usr; 4 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-1 aty)
% Number of variables : 56 ( 45 !; 11 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1,X2,X3] :
( ( min_precedes(X0,X1,X3)
& min_precedes(X1,X2,X3) )
=> min_precedes(X0,X2,X3) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f33,axiom,
! [X95] :
( occurrence_of(X95,tptp0)
=> ? [X96,X97,X98] :
( occurrence_of(X96,tptp3)
& root_occ(X96,X95)
& occurrence_of(X97,tptp4)
& min_precedes(X96,X97,tptp0)
& ( occurrence_of(X98,tptp2)
| occurrence_of(X98,tptp1) )
& min_precedes(X97,X98,tptp0)
& ! [X99] :
( min_precedes(X96,X99,tptp0)
=> ( X99 = X97
| X99 = X98 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f46,conjecture,
! [X100] :
( occurrence_of(X100,tptp0)
=> ? [X101,X102] :
( occurrence_of(X101,tptp3)
& root_occ(X101,X100)
& ( occurrence_of(X102,tptp2)
| occurrence_of(X102,tptp1) )
& min_precedes(X101,X102,tptp0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f47,negated_conjecture,
~ ! [X100] :
( occurrence_of(X100,tptp0)
=> ? [X101,X102] :
( occurrence_of(X101,tptp3)
& root_occ(X101,X100)
& ( occurrence_of(X102,tptp2)
| occurrence_of(X102,tptp1) )
& min_precedes(X101,X102,tptp0) ) ),
inference(negated_conjecture,[status(cth)],[f46]) ).
fof(f48,plain,
! [X0,X1,X2,X3] :
( ~ min_precedes(X0,X1,X3)
| ~ min_precedes(X1,X2,X3)
| min_precedes(X0,X2,X3) ),
inference(pre_NNF_transformation,[status(esa)],[f1]) ).
fof(f49,plain,
! [X0,X2,X3] :
( ! [X1] :
( ~ min_precedes(X0,X1,X3)
| ~ min_precedes(X1,X2,X3) )
| min_precedes(X0,X2,X3) ),
inference(miniscoping,[status(esa)],[f48]) ).
fof(f50,plain,
! [X0,X1,X2,X3] :
( ~ min_precedes(X0,X1,X2)
| ~ min_precedes(X1,X3,X2)
| min_precedes(X0,X3,X2) ),
inference(cnf_transformation,[status(esa)],[f49]) ).
fof(f177,plain,
! [X95] :
( ~ occurrence_of(X95,tptp0)
| ? [X96,X97,X98] :
( occurrence_of(X96,tptp3)
& root_occ(X96,X95)
& occurrence_of(X97,tptp4)
& min_precedes(X96,X97,tptp0)
& ( occurrence_of(X98,tptp2)
| occurrence_of(X98,tptp1) )
& min_precedes(X97,X98,tptp0)
& ! [X99] :
( ~ min_precedes(X96,X99,tptp0)
| X99 = X97
| X99 = X98 ) ) ),
inference(pre_NNF_transformation,[status(esa)],[f33]) ).
fof(f178,plain,
! [X95] :
( ~ occurrence_of(X95,tptp0)
| ( occurrence_of(sk0_14(X95),tptp3)
& root_occ(sk0_14(X95),X95)
& occurrence_of(sk0_15(X95),tptp4)
& min_precedes(sk0_14(X95),sk0_15(X95),tptp0)
& ( occurrence_of(sk0_16(X95),tptp2)
| occurrence_of(sk0_16(X95),tptp1) )
& min_precedes(sk0_15(X95),sk0_16(X95),tptp0)
& ! [X99] :
( ~ min_precedes(sk0_14(X95),X99,tptp0)
| X99 = sk0_15(X95)
| X99 = sk0_16(X95) ) ) ),
inference(skolemization,[status(esa)],[f177]) ).
fof(f179,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| occurrence_of(sk0_14(X0),tptp3) ),
inference(cnf_transformation,[status(esa)],[f178]) ).
fof(f180,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| root_occ(sk0_14(X0),X0) ),
inference(cnf_transformation,[status(esa)],[f178]) ).
fof(f182,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| min_precedes(sk0_14(X0),sk0_15(X0),tptp0) ),
inference(cnf_transformation,[status(esa)],[f178]) ).
fof(f183,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| occurrence_of(sk0_16(X0),tptp2)
| occurrence_of(sk0_16(X0),tptp1) ),
inference(cnf_transformation,[status(esa)],[f178]) ).
fof(f184,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| min_precedes(sk0_15(X0),sk0_16(X0),tptp0) ),
inference(cnf_transformation,[status(esa)],[f178]) ).
fof(f198,plain,
? [X100] :
( occurrence_of(X100,tptp0)
& ! [X101,X102] :
( ~ occurrence_of(X101,tptp3)
| ~ root_occ(X101,X100)
| ( ~ occurrence_of(X102,tptp2)
& ~ occurrence_of(X102,tptp1) )
| ~ min_precedes(X101,X102,tptp0) ) ),
inference(pre_NNF_transformation,[status(esa)],[f47]) ).
fof(f199,plain,
( occurrence_of(sk0_17,tptp0)
& ! [X101,X102] :
( ~ occurrence_of(X101,tptp3)
| ~ root_occ(X101,sk0_17)
| ( ~ occurrence_of(X102,tptp2)
& ~ occurrence_of(X102,tptp1) )
| ~ min_precedes(X101,X102,tptp0) ) ),
inference(skolemization,[status(esa)],[f198]) ).
fof(f200,plain,
occurrence_of(sk0_17,tptp0),
inference(cnf_transformation,[status(esa)],[f199]) ).
fof(f201,plain,
! [X0,X1] :
( ~ occurrence_of(X0,tptp3)
| ~ root_occ(X0,sk0_17)
| ~ occurrence_of(X1,tptp2)
| ~ min_precedes(X0,X1,tptp0) ),
inference(cnf_transformation,[status(esa)],[f199]) ).
fof(f202,plain,
! [X0,X1] :
( ~ occurrence_of(X0,tptp3)
| ~ root_occ(X0,sk0_17)
| ~ occurrence_of(X1,tptp1)
| ~ min_precedes(X0,X1,tptp0) ),
inference(cnf_transformation,[status(esa)],[f199]) ).
fof(f257,plain,
( spl0_3
<=> occurrence_of(sk0_17,tptp0) ),
introduced(split_symbol_definition) ).
fof(f259,plain,
( ~ occurrence_of(sk0_17,tptp0)
| spl0_3 ),
inference(component_clause,[status(thm)],[f257]) ).
fof(f265,plain,
( $false
| spl0_3 ),
inference(forward_subsumption_resolution,[status(thm)],[f259,f200]) ).
fof(f266,plain,
spl0_3,
inference(contradiction_clause,[status(thm)],[f265]) ).
fof(f319,plain,
! [X0,X1] :
( ~ occurrence_of(X0,tptp0)
| ~ min_precedes(X1,sk0_15(X0),tptp0)
| min_precedes(X1,sk0_16(X0),tptp0) ),
inference(resolution,[status(thm)],[f184,f50]) ).
fof(f339,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| min_precedes(sk0_14(X0),sk0_16(X0),tptp0)
| ~ occurrence_of(X0,tptp0) ),
inference(resolution,[status(thm)],[f319,f182]) ).
fof(f340,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| min_precedes(sk0_14(X0),sk0_16(X0),tptp0) ),
inference(duplicate_literals_removal,[status(esa)],[f339]) ).
fof(f341,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| ~ occurrence_of(sk0_14(X0),tptp3)
| ~ root_occ(sk0_14(X0),sk0_17)
| ~ occurrence_of(sk0_16(X0),tptp1) ),
inference(resolution,[status(thm)],[f340,f202]) ).
fof(f342,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| ~ root_occ(sk0_14(X0),sk0_17)
| ~ occurrence_of(sk0_16(X0),tptp1) ),
inference(forward_subsumption_resolution,[status(thm)],[f341,f179]) ).
fof(f343,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| ~ occurrence_of(sk0_14(X0),tptp3)
| ~ root_occ(sk0_14(X0),sk0_17)
| ~ occurrence_of(sk0_16(X0),tptp2) ),
inference(resolution,[status(thm)],[f340,f201]) ).
fof(f344,plain,
! [X0] :
( ~ occurrence_of(X0,tptp0)
| ~ root_occ(sk0_14(X0),sk0_17)
| ~ occurrence_of(sk0_16(X0),tptp2) ),
inference(forward_subsumption_resolution,[status(thm)],[f343,f179]) ).
fof(f361,plain,
( spl0_6
<=> occurrence_of(sk0_16(sk0_17),tptp1) ),
introduced(split_symbol_definition) ).
fof(f363,plain,
( ~ occurrence_of(sk0_16(sk0_17),tptp1)
| spl0_6 ),
inference(component_clause,[status(thm)],[f361]) ).
fof(f364,plain,
( ~ occurrence_of(sk0_17,tptp0)
| ~ occurrence_of(sk0_16(sk0_17),tptp1)
| ~ occurrence_of(sk0_17,tptp0) ),
inference(resolution,[status(thm)],[f342,f180]) ).
fof(f365,plain,
( ~ spl0_3
| ~ spl0_6 ),
inference(split_clause,[status(thm)],[f364,f257,f361]) ).
fof(f366,plain,
( spl0_7
<=> occurrence_of(sk0_16(sk0_17),tptp2) ),
introduced(split_symbol_definition) ).
fof(f369,plain,
( ~ occurrence_of(sk0_17,tptp0)
| occurrence_of(sk0_16(sk0_17),tptp2)
| spl0_6 ),
inference(resolution,[status(thm)],[f363,f183]) ).
fof(f370,plain,
( ~ spl0_3
| spl0_7
| spl0_6 ),
inference(split_clause,[status(thm)],[f369,f257,f366,f361]) ).
fof(f380,plain,
( ~ occurrence_of(sk0_17,tptp0)
| ~ occurrence_of(sk0_16(sk0_17),tptp2)
| ~ occurrence_of(sk0_17,tptp0) ),
inference(resolution,[status(thm)],[f344,f180]) ).
fof(f381,plain,
( ~ spl0_3
| ~ spl0_7 ),
inference(split_clause,[status(thm)],[f380,f257,f366]) ).
fof(f382,plain,
$false,
inference(sat_refutation,[status(thm)],[f266,f365,f370,f381]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : PRO012+2 : TPTP v8.1.2. Released v4.0.0.
% 0.04/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.34 % Computer : n020.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 : Tue Apr 30 00:12:17 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.13/0.36 % Drodi V3.6.0
% 0.21/0.47 % Refutation found
% 0.21/0.47 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.21/0.47 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.21/0.48 % Elapsed time: 0.129579 seconds
% 0.21/0.48 % CPU time: 0.915143 seconds
% 0.21/0.48 % Total memory used: 59.094 MB
% 0.21/0.48 % Net memory used: 58.521 MB
%------------------------------------------------------------------------------