TSTP Solution File: PHI015+1 by Drodi---3.6.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Drodi---3.6.0
% Problem : PHI015+1 : TPTP v8.1.2. Released v7.2.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% Computer : n022.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:29 EDT 2024
% Result : Theorem 0.13s 0.36s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 15
% Syntax : Number of formulae : 74 ( 9 unt; 0 def)
% Number of atoms : 275 ( 27 equ)
% Maximal formula atoms : 19 ( 3 avg)
% Number of connectives : 329 ( 128 ~; 134 |; 47 &)
% ( 12 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 18 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 15 ( 13 usr; 9 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-4 aty)
% Number of variables : 78 ( 70 !; 8 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [X,F] :
( exemplifies_property(F,X)
=> ( property(F)
& object(X) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f3,axiom,
! [X,F] :
( is_the(X,F)
=> ( property(F)
& object(X) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f5,axiom,
! [F,X,W] :
( ( property(F)
& object(X)
& object(W) )
=> ( ( is_the(X,F)
& X = W )
<=> ? [Y] :
( object(Y)
& exemplifies_property(F,Y)
& ! [Z] :
( object(Z)
=> ( exemplifies_property(F,Z)
=> Z = Y ) )
& Y = W ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f7,axiom,
! [X] :
( object(X)
=> ( exemplifies_property(none_greater,X)
<=> ( exemplifies_property(conceivable,X)
& ~ ? [Y] :
( object(Y)
& exemplifies_relation(greater_than,Y,X)
& exemplifies_property(conceivable,Y) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f9,axiom,
! [X] :
( object(X)
=> ( ( is_the(X,none_greater)
& ~ exemplifies_property(existence,X) )
=> ? [Y] :
( object(Y)
& exemplifies_relation(greater_than,Y,X)
& exemplifies_property(conceivable,Y) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f10,axiom,
is_the(god,none_greater),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f11,conjecture,
exemplifies_property(existence,god),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f12,negated_conjecture,
~ exemplifies_property(existence,god),
inference(negated_conjecture,[status(cth)],[f11]) ).
fof(f15,plain,
! [X,F] :
( ~ exemplifies_property(F,X)
| ( property(F)
& object(X) ) ),
inference(pre_NNF_transformation,[status(esa)],[f2]) ).
fof(f17,plain,
! [X0,X1] :
( ~ exemplifies_property(X0,X1)
| object(X1) ),
inference(cnf_transformation,[status(esa)],[f15]) ).
fof(f18,plain,
! [X,F] :
( ~ is_the(X,F)
| ( property(F)
& object(X) ) ),
inference(pre_NNF_transformation,[status(esa)],[f3]) ).
fof(f19,plain,
! [X0,X1] :
( ~ is_the(X0,X1)
| property(X1) ),
inference(cnf_transformation,[status(esa)],[f18]) ).
fof(f20,plain,
! [X0,X1] :
( ~ is_the(X0,X1)
| object(X0) ),
inference(cnf_transformation,[status(esa)],[f18]) ).
fof(f34,plain,
! [F,X,W] :
( ~ property(F)
| ~ object(X)
| ~ object(W)
| ( ( is_the(X,F)
& X = W )
<=> ? [Y] :
( object(Y)
& exemplifies_property(F,Y)
& ! [Z] :
( ~ object(Z)
| ~ exemplifies_property(F,Z)
| Z = Y )
& Y = W ) ) ),
inference(pre_NNF_transformation,[status(esa)],[f5]) ).
fof(f35,plain,
! [F,X,W] :
( ~ property(F)
| ~ object(X)
| ~ object(W)
| ( ( ~ is_the(X,F)
| X != W
| ? [Y] :
( object(Y)
& exemplifies_property(F,Y)
& ! [Z] :
( ~ object(Z)
| ~ exemplifies_property(F,Z)
| Z = Y )
& Y = W ) )
& ( ( is_the(X,F)
& X = W )
| ! [Y] :
( ~ object(Y)
| ~ exemplifies_property(F,Y)
| ? [Z] :
( object(Z)
& exemplifies_property(F,Z)
& Z != Y )
| Y != W ) ) ) ),
inference(NNF_transformation,[status(esa)],[f34]) ).
fof(f36,plain,
! [F,X,W] :
( ~ property(F)
| ~ object(X)
| ~ object(W)
| ( ( ~ is_the(X,F)
| X != W
| ( object(sk0_2(W,X,F))
& exemplifies_property(F,sk0_2(W,X,F))
& ! [Z] :
( ~ object(Z)
| ~ exemplifies_property(F,Z)
| Z = sk0_2(W,X,F) )
& sk0_2(W,X,F) = W ) )
& ( ( is_the(X,F)
& X = W )
| ! [Y] :
( ~ object(Y)
| ~ exemplifies_property(F,Y)
| ( object(sk0_3(Y,W,X,F))
& exemplifies_property(F,sk0_3(Y,W,X,F))
& sk0_3(Y,W,X,F) != Y )
| Y != W ) ) ) ),
inference(skolemization,[status(esa)],[f35]) ).
fof(f38,plain,
! [X0,X1,X2] :
( ~ property(X0)
| ~ object(X1)
| ~ object(X2)
| ~ is_the(X1,X0)
| X1 != X2
| exemplifies_property(X0,sk0_2(X2,X1,X0)) ),
inference(cnf_transformation,[status(esa)],[f36]) ).
fof(f40,plain,
! [X0,X1,X2] :
( ~ property(X0)
| ~ object(X1)
| ~ object(X2)
| ~ is_the(X1,X0)
| X1 != X2
| sk0_2(X2,X1,X0) = X2 ),
inference(cnf_transformation,[status(esa)],[f36]) ).
fof(f49,plain,
! [X] :
( ~ object(X)
| ( exemplifies_property(none_greater,X)
<=> ( exemplifies_property(conceivable,X)
& ! [Y] :
( ~ object(Y)
| ~ exemplifies_relation(greater_than,Y,X)
| ~ exemplifies_property(conceivable,Y) ) ) ) ),
inference(pre_NNF_transformation,[status(esa)],[f7]) ).
fof(f50,plain,
! [X] :
( ~ object(X)
| ( ( ~ exemplifies_property(none_greater,X)
| ( exemplifies_property(conceivable,X)
& ! [Y] :
( ~ object(Y)
| ~ exemplifies_relation(greater_than,Y,X)
| ~ exemplifies_property(conceivable,Y) ) ) )
& ( exemplifies_property(none_greater,X)
| ~ exemplifies_property(conceivable,X)
| ? [Y] :
( object(Y)
& exemplifies_relation(greater_than,Y,X)
& exemplifies_property(conceivable,Y) ) ) ) ),
inference(NNF_transformation,[status(esa)],[f49]) ).
fof(f51,plain,
! [X] :
( ~ object(X)
| ( ( ~ exemplifies_property(none_greater,X)
| ( exemplifies_property(conceivable,X)
& ! [Y] :
( ~ object(Y)
| ~ exemplifies_relation(greater_than,Y,X)
| ~ exemplifies_property(conceivable,Y) ) ) )
& ( exemplifies_property(none_greater,X)
| ~ exemplifies_property(conceivable,X)
| ( object(sk0_4(X))
& exemplifies_relation(greater_than,sk0_4(X),X)
& exemplifies_property(conceivable,sk0_4(X)) ) ) ) ),
inference(skolemization,[status(esa)],[f50]) ).
fof(f53,plain,
! [X0,X1] :
( ~ object(X0)
| ~ exemplifies_property(none_greater,X0)
| ~ object(X1)
| ~ exemplifies_relation(greater_than,X1,X0)
| ~ exemplifies_property(conceivable,X1) ),
inference(cnf_transformation,[status(esa)],[f51]) ).
fof(f60,plain,
! [X] :
( ~ object(X)
| ~ is_the(X,none_greater)
| exemplifies_property(existence,X)
| ? [Y] :
( object(Y)
& exemplifies_relation(greater_than,Y,X)
& exemplifies_property(conceivable,Y) ) ),
inference(pre_NNF_transformation,[status(esa)],[f9]) ).
fof(f61,plain,
! [X] :
( ~ object(X)
| ~ is_the(X,none_greater)
| exemplifies_property(existence,X)
| ( object(sk0_6(X))
& exemplifies_relation(greater_than,sk0_6(X),X)
& exemplifies_property(conceivable,sk0_6(X)) ) ),
inference(skolemization,[status(esa)],[f60]) ).
fof(f62,plain,
! [X0] :
( ~ object(X0)
| ~ is_the(X0,none_greater)
| exemplifies_property(existence,X0)
| object(sk0_6(X0)) ),
inference(cnf_transformation,[status(esa)],[f61]) ).
fof(f63,plain,
! [X0] :
( ~ object(X0)
| ~ is_the(X0,none_greater)
| exemplifies_property(existence,X0)
| exemplifies_relation(greater_than,sk0_6(X0),X0) ),
inference(cnf_transformation,[status(esa)],[f61]) ).
fof(f64,plain,
! [X0] :
( ~ object(X0)
| ~ is_the(X0,none_greater)
| exemplifies_property(existence,X0)
| exemplifies_property(conceivable,sk0_6(X0)) ),
inference(cnf_transformation,[status(esa)],[f61]) ).
fof(f65,plain,
is_the(god,none_greater),
inference(cnf_transformation,[status(esa)],[f10]) ).
fof(f66,plain,
~ exemplifies_property(existence,god),
inference(cnf_transformation,[status(esa)],[f12]) ).
fof(f69,plain,
! [X0,X2] :
( ~ property(X0)
| ~ object(X2)
| ~ object(X2)
| ~ is_the(X2,X0)
| exemplifies_property(X0,sk0_2(X2,X2,X0)) ),
inference(destructive_equality_resolution,[status(esa)],[f38]) ).
fof(f70,plain,
! [X0,X1] :
( ~ property(X0)
| ~ object(X1)
| ~ is_the(X1,X0)
| exemplifies_property(X0,sk0_2(X1,X1,X0)) ),
inference(duplicate_literals_removal,[status(esa)],[f69]) ).
fof(f73,plain,
! [X0,X2] :
( ~ property(X0)
| ~ object(X2)
| ~ object(X2)
| ~ is_the(X2,X0)
| sk0_2(X2,X2,X0) = X2 ),
inference(destructive_equality_resolution,[status(esa)],[f40]) ).
fof(f74,plain,
! [X0,X1] :
( ~ property(X0)
| ~ object(X1)
| ~ is_the(X1,X0)
| sk0_2(X1,X1,X0) = X1 ),
inference(duplicate_literals_removal,[status(esa)],[f73]) ).
fof(f89,plain,
object(god),
inference(resolution,[status(thm)],[f20,f65]) ).
fof(f90,plain,
! [X0,X1] :
( ~ object(X0)
| ~ is_the(X0,X1)
| sk0_2(X0,X0,X1) = X0 ),
inference(forward_subsumption_resolution,[status(thm)],[f74,f19]) ).
fof(f91,plain,
( spl0_0
<=> object(god) ),
introduced(split_symbol_definition) ).
fof(f93,plain,
( ~ object(god)
| spl0_0 ),
inference(component_clause,[status(thm)],[f91]) ).
fof(f94,plain,
( spl0_1
<=> sk0_2(god,god,none_greater) = god ),
introduced(split_symbol_definition) ).
fof(f95,plain,
( sk0_2(god,god,none_greater) = god
| ~ spl0_1 ),
inference(component_clause,[status(thm)],[f94]) ).
fof(f97,plain,
( ~ object(god)
| sk0_2(god,god,none_greater) = god ),
inference(resolution,[status(thm)],[f90,f65]) ).
fof(f98,plain,
( ~ spl0_0
| spl0_1 ),
inference(split_clause,[status(thm)],[f97,f91,f94]) ).
fof(f99,plain,
( $false
| spl0_0 ),
inference(forward_subsumption_resolution,[status(thm)],[f93,f89]) ).
fof(f100,plain,
spl0_0,
inference(contradiction_clause,[status(thm)],[f99]) ).
fof(f101,plain,
! [X0,X1] :
( ~ object(X0)
| ~ is_the(X0,X1)
| exemplifies_property(X1,sk0_2(X0,X0,X1)) ),
inference(forward_subsumption_resolution,[status(thm)],[f70,f19]) ).
fof(f102,plain,
( spl0_2
<=> exemplifies_property(none_greater,sk0_2(god,god,none_greater)) ),
introduced(split_symbol_definition) ).
fof(f103,plain,
( exemplifies_property(none_greater,sk0_2(god,god,none_greater))
| ~ spl0_2 ),
inference(component_clause,[status(thm)],[f102]) ).
fof(f105,plain,
( ~ object(god)
| exemplifies_property(none_greater,sk0_2(god,god,none_greater)) ),
inference(resolution,[status(thm)],[f101,f65]) ).
fof(f106,plain,
( ~ spl0_0
| spl0_2 ),
inference(split_clause,[status(thm)],[f105,f91,f102]) ).
fof(f107,plain,
( exemplifies_property(none_greater,god)
| ~ spl0_1
| ~ spl0_2 ),
inference(forward_demodulation,[status(thm)],[f95,f103]) ).
fof(f137,plain,
( spl0_5
<=> exemplifies_property(none_greater,god) ),
introduced(split_symbol_definition) ).
fof(f139,plain,
( ~ exemplifies_property(none_greater,god)
| spl0_5 ),
inference(component_clause,[status(thm)],[f137]) ).
fof(f153,plain,
! [X0] :
( ~ is_the(X0,none_greater)
| exemplifies_property(existence,X0)
| object(sk0_6(X0)) ),
inference(forward_subsumption_resolution,[status(thm)],[f62,f20]) ).
fof(f154,plain,
( spl0_9
<=> exemplifies_property(existence,god) ),
introduced(split_symbol_definition) ).
fof(f155,plain,
( exemplifies_property(existence,god)
| ~ spl0_9 ),
inference(component_clause,[status(thm)],[f154]) ).
fof(f157,plain,
( spl0_10
<=> object(sk0_6(god)) ),
introduced(split_symbol_definition) ).
fof(f160,plain,
( exemplifies_property(existence,god)
| object(sk0_6(god)) ),
inference(resolution,[status(thm)],[f153,f65]) ).
fof(f161,plain,
( spl0_9
| spl0_10 ),
inference(split_clause,[status(thm)],[f160,f154,f157]) ).
fof(f162,plain,
( $false
| ~ spl0_9 ),
inference(forward_subsumption_resolution,[status(thm)],[f155,f66]) ).
fof(f163,plain,
~ spl0_9,
inference(contradiction_clause,[status(thm)],[f162]) ).
fof(f172,plain,
( spl0_12
<=> exemplifies_relation(greater_than,sk0_6(god),god) ),
introduced(split_symbol_definition) ).
fof(f173,plain,
( exemplifies_relation(greater_than,sk0_6(god),god)
| ~ spl0_12 ),
inference(component_clause,[status(thm)],[f172]) ).
fof(f309,plain,
! [X0] :
( ~ is_the(X0,none_greater)
| exemplifies_property(existence,X0)
| exemplifies_property(conceivable,sk0_6(X0)) ),
inference(forward_subsumption_resolution,[status(thm)],[f64,f20]) ).
fof(f310,plain,
( spl0_38
<=> exemplifies_property(conceivable,sk0_6(god)) ),
introduced(split_symbol_definition) ).
fof(f313,plain,
( exemplifies_property(existence,god)
| exemplifies_property(conceivable,sk0_6(god)) ),
inference(resolution,[status(thm)],[f309,f65]) ).
fof(f314,plain,
( spl0_9
| spl0_38 ),
inference(split_clause,[status(thm)],[f313,f154,f310]) ).
fof(f321,plain,
! [X0] :
( ~ is_the(X0,none_greater)
| exemplifies_property(existence,X0)
| exemplifies_relation(greater_than,sk0_6(X0),X0) ),
inference(forward_subsumption_resolution,[status(thm)],[f63,f20]) ).
fof(f322,plain,
( exemplifies_property(existence,god)
| exemplifies_relation(greater_than,sk0_6(god),god) ),
inference(resolution,[status(thm)],[f321,f65]) ).
fof(f323,plain,
( spl0_9
| spl0_12 ),
inference(split_clause,[status(thm)],[f322,f154,f172]) ).
fof(f371,plain,
! [X0,X1] :
( ~ exemplifies_property(none_greater,X0)
| ~ object(X1)
| ~ exemplifies_relation(greater_than,X1,X0)
| ~ exemplifies_property(conceivable,X1) ),
inference(forward_subsumption_resolution,[status(thm)],[f53,f17]) ).
fof(f374,plain,
( ~ exemplifies_property(none_greater,god)
| ~ object(sk0_6(god))
| ~ exemplifies_property(conceivable,sk0_6(god))
| ~ spl0_12 ),
inference(resolution,[status(thm)],[f371,f173]) ).
fof(f375,plain,
( ~ spl0_5
| ~ spl0_10
| ~ spl0_38
| ~ spl0_12 ),
inference(split_clause,[status(thm)],[f374,f137,f157,f310,f172]) ).
fof(f387,plain,
( $false
| ~ spl0_1
| ~ spl0_2
| spl0_5 ),
inference(forward_subsumption_resolution,[status(thm)],[f139,f107]) ).
fof(f388,plain,
( ~ spl0_1
| ~ spl0_2
| spl0_5 ),
inference(contradiction_clause,[status(thm)],[f387]) ).
fof(f389,plain,
$false,
inference(sat_refutation,[status(thm)],[f98,f100,f106,f161,f163,f314,f323,f375,f388]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : PHI015+1 : TPTP v8.1.2. Released v7.2.0.
% 0.07/0.13 % Command : drodi -learnfrom(drodi.lrn) -timeout(%d) %s
% 0.13/0.34 % Computer : n022.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 : Mon Apr 29 22:32:58 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.35 % Drodi V3.6.0
% 0.13/0.36 % Refutation found
% 0.13/0.36 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.13/0.36 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.13/0.37 % Elapsed time: 0.028972 seconds
% 0.13/0.37 % CPU time: 0.100037 seconds
% 0.13/0.37 % Total memory used: 14.357 MB
% 0.13/0.37 % Net memory used: 14.291 MB
%------------------------------------------------------------------------------