TSTP Solution File: PHI009+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : PHI009+1 : TPTP v8.1.0. Released v7.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n018.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 : 600s
% DateTime : Mon Jul 18 16:45:30 EDT 2022
% Result : Theorem 0.25s 1.44s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 2
% Syntax : Number of formulae : 18 ( 5 unt; 0 def)
% Number of atoms : 163 ( 11 equ)
% Maximal formula atoms : 74 ( 9 avg)
% Number of connectives : 251 ( 106 ~; 108 |; 25 &)
% ( 1 <=>; 11 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 7 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-4 aty)
% Number of variables : 45 ( 2 sgn 15 !; 5 ?)
% Comments :
%------------------------------------------------------------------------------
fof(description_theorem_1,conjecture,
! [X1] :
( property(X1)
=> ( ? [X4] :
( object(X4)
& exemplifies_property(X1,X4)
& ! [X5] :
( object(X5)
=> ( exemplifies_property(X1,X5)
=> X5 = X4 ) ) )
=> ? [X6] :
( object(X6)
& is_the(X6,X1) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',description_theorem_1) ).
fof(description_axiom_schema_instance,axiom,
! [X1,X2,X3] :
( ( property(X1)
& property(X2)
& object(X3) )
=> ( ( is_the(X3,X1)
& exemplifies_property(X2,X3) )
<=> ? [X4] :
( object(X4)
& exemplifies_property(X1,X4)
& ! [X5] :
( object(X5)
=> ( exemplifies_property(X1,X5)
=> X5 = X4 ) )
& exemplifies_property(X2,X4) ) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',description_axiom_schema_instance) ).
fof(c_0_2,negated_conjecture,
~ ! [X1] :
( property(X1)
=> ( ? [X4] :
( object(X4)
& exemplifies_property(X1,X4)
& ! [X5] :
( object(X5)
=> ( exemplifies_property(X1,X5)
=> X5 = X4 ) ) )
=> ? [X6] :
( object(X6)
& is_the(X6,X1) ) ) ),
inference(assume_negation,[status(cth)],[description_theorem_1]) ).
fof(c_0_3,negated_conjecture,
! [X9,X10] :
( property(esk1_0)
& object(esk2_0)
& exemplifies_property(esk1_0,esk2_0)
& ( ~ object(X9)
| ~ exemplifies_property(esk1_0,X9)
| X9 = esk2_0 )
& ( ~ object(X10)
| ~ is_the(X10,esk1_0) ) ),
inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])])])]) ).
fof(c_0_4,plain,
! [X6,X7,X8,X10,X11] :
( ( object(esk3_3(X6,X7,X8))
| ~ is_the(X8,X6)
| ~ exemplifies_property(X7,X8)
| ~ property(X6)
| ~ property(X7)
| ~ object(X8) )
& ( exemplifies_property(X6,esk3_3(X6,X7,X8))
| ~ is_the(X8,X6)
| ~ exemplifies_property(X7,X8)
| ~ property(X6)
| ~ property(X7)
| ~ object(X8) )
& ( ~ object(X10)
| ~ exemplifies_property(X6,X10)
| X10 = esk3_3(X6,X7,X8)
| ~ is_the(X8,X6)
| ~ exemplifies_property(X7,X8)
| ~ property(X6)
| ~ property(X7)
| ~ object(X8) )
& ( exemplifies_property(X7,esk3_3(X6,X7,X8))
| ~ is_the(X8,X6)
| ~ exemplifies_property(X7,X8)
| ~ property(X6)
| ~ property(X7)
| ~ object(X8) )
& ( is_the(X8,X6)
| object(esk4_4(X6,X7,X8,X11))
| ~ object(X11)
| ~ exemplifies_property(X6,X11)
| ~ exemplifies_property(X7,X11)
| ~ property(X6)
| ~ property(X7)
| ~ object(X8) )
& ( exemplifies_property(X7,X8)
| object(esk4_4(X6,X7,X8,X11))
| ~ object(X11)
| ~ exemplifies_property(X6,X11)
| ~ exemplifies_property(X7,X11)
| ~ property(X6)
| ~ property(X7)
| ~ object(X8) )
& ( is_the(X8,X6)
| exemplifies_property(X6,esk4_4(X6,X7,X8,X11))
| ~ object(X11)
| ~ exemplifies_property(X6,X11)
| ~ exemplifies_property(X7,X11)
| ~ property(X6)
| ~ property(X7)
| ~ object(X8) )
& ( exemplifies_property(X7,X8)
| exemplifies_property(X6,esk4_4(X6,X7,X8,X11))
| ~ object(X11)
| ~ exemplifies_property(X6,X11)
| ~ exemplifies_property(X7,X11)
| ~ property(X6)
| ~ property(X7)
| ~ object(X8) )
& ( is_the(X8,X6)
| esk4_4(X6,X7,X8,X11) != X11
| ~ object(X11)
| ~ exemplifies_property(X6,X11)
| ~ exemplifies_property(X7,X11)
| ~ property(X6)
| ~ property(X7)
| ~ object(X8) )
& ( exemplifies_property(X7,X8)
| esk4_4(X6,X7,X8,X11) != X11
| ~ object(X11)
| ~ exemplifies_property(X6,X11)
| ~ exemplifies_property(X7,X11)
| ~ property(X6)
| ~ property(X7)
| ~ object(X8) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[description_axiom_schema_instance])])])])])])]) ).
cnf(c_0_5,negated_conjecture,
( X1 = esk2_0
| ~ exemplifies_property(esk1_0,X1)
| ~ object(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,plain,
( object(esk4_4(X3,X2,X1,X4))
| is_the(X1,X3)
| ~ object(X1)
| ~ property(X2)
| ~ property(X3)
| ~ exemplifies_property(X2,X4)
| ~ exemplifies_property(X3,X4)
| ~ object(X4) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,negated_conjecture,
( esk4_4(X1,X2,X3,X4) = esk2_0
| is_the(X3,X1)
| ~ exemplifies_property(esk1_0,esk4_4(X1,X2,X3,X4))
| ~ exemplifies_property(X1,X4)
| ~ exemplifies_property(X2,X4)
| ~ object(X4)
| ~ object(X3)
| ~ property(X1)
| ~ property(X2) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,plain,
( exemplifies_property(X3,esk4_4(X3,X2,X1,X4))
| is_the(X1,X3)
| ~ object(X1)
| ~ property(X2)
| ~ property(X3)
| ~ exemplifies_property(X2,X4)
| ~ exemplifies_property(X3,X4)
| ~ object(X4) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_9,negated_conjecture,
property(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_10,negated_conjecture,
( ~ is_the(X1,esk1_0)
| ~ object(X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_11,plain,
( is_the(X1,X3)
| ~ object(X1)
| ~ property(X2)
| ~ property(X3)
| ~ exemplifies_property(X2,X4)
| ~ exemplifies_property(X3,X4)
| ~ object(X4)
| esk4_4(X3,X2,X1,X4) != X4 ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_12,negated_conjecture,
( esk4_4(esk1_0,X1,X2,X3) = esk2_0
| ~ exemplifies_property(esk1_0,X3)
| ~ exemplifies_property(X1,X3)
| ~ object(X3)
| ~ object(X2)
| ~ property(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_9])]),c_0_10]) ).
cnf(c_0_13,negated_conjecture,
( ~ exemplifies_property(esk1_0,X1)
| ~ exemplifies_property(X2,X1)
| ~ object(X1)
| ~ object(X3)
| ~ property(X2) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_9])]),c_0_5]),c_0_10]) ).
cnf(c_0_14,negated_conjecture,
exemplifies_property(esk1_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_15,negated_conjecture,
object(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_16,negated_conjecture,
~ object(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_14]),c_0_15]),c_0_9])]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_15,c_0_16]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : PHI009+1 : TPTP v8.1.0. Released v7.2.0.
% 0.03/0.14 % Command : run_ET %s %d
% 0.14/0.35 % Computer : n018.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 : 600
% 0.14/0.35 % DateTime : Thu Jun 2 01:25:15 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.25/1.44 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.25/1.44 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.25/1.44 # Preprocessing time : 0.014 s
% 0.25/1.44
% 0.25/1.44 # Proof found!
% 0.25/1.44 # SZS status Theorem
% 0.25/1.44 # SZS output start CNFRefutation
% See solution above
% 0.25/1.44 # Proof object total steps : 18
% 0.25/1.44 # Proof object clause steps : 13
% 0.25/1.44 # Proof object formula steps : 5
% 0.25/1.44 # Proof object conjectures : 13
% 0.25/1.44 # Proof object clause conjectures : 10
% 0.25/1.44 # Proof object formula conjectures : 3
% 0.25/1.44 # Proof object initial clauses used : 8
% 0.25/1.44 # Proof object initial formulas used : 2
% 0.25/1.44 # Proof object generating inferences : 4
% 0.25/1.44 # Proof object simplifying inferences : 12
% 0.25/1.44 # Training examples: 0 positive, 0 negative
% 0.25/1.44 # Parsed axioms : 2
% 0.25/1.44 # Removed by relevancy pruning/SinE : 0
% 0.25/1.44 # Initial clauses : 15
% 0.25/1.44 # Removed in clause preprocessing : 0
% 0.25/1.44 # Initial clauses in saturation : 15
% 0.25/1.44 # Processed clauses : 24
% 0.25/1.44 # ...of these trivial : 0
% 0.25/1.44 # ...subsumed : 2
% 0.25/1.44 # ...remaining for further processing : 22
% 0.25/1.44 # Other redundant clauses eliminated : 0
% 0.25/1.44 # Clauses deleted for lack of memory : 0
% 0.25/1.44 # Backward-subsumed : 1
% 0.25/1.44 # Backward-rewritten : 0
% 0.25/1.44 # Generated clauses : 30
% 0.25/1.44 # ...of the previous two non-trivial : 20
% 0.25/1.44 # Contextual simplify-reflections : 9
% 0.25/1.44 # Paramodulations : 29
% 0.25/1.44 # Factorizations : 0
% 0.25/1.44 # Equation resolutions : 0
% 0.25/1.44 # Current number of processed clauses : 20
% 0.25/1.44 # Positive orientable unit clauses : 2
% 0.25/1.44 # Positive unorientable unit clauses: 0
% 0.25/1.44 # Negative unit clauses : 1
% 0.25/1.44 # Non-unit-clauses : 17
% 0.25/1.44 # Current number of unprocessed clauses: 10
% 0.25/1.44 # ...number of literals in the above : 101
% 0.25/1.44 # Current number of archived formulas : 0
% 0.25/1.44 # Current number of archived clauses : 2
% 0.25/1.44 # Clause-clause subsumption calls (NU) : 70
% 0.25/1.44 # Rec. Clause-clause subsumption calls : 35
% 0.25/1.44 # Non-unit clause-clause subsumptions : 12
% 0.25/1.44 # Unit Clause-clause subsumption calls : 17
% 0.25/1.44 # Rewrite failures with RHS unbound : 0
% 0.25/1.44 # BW rewrite match attempts : 0
% 0.25/1.44 # BW rewrite match successes : 0
% 0.25/1.44 # Condensation attempts : 0
% 0.25/1.44 # Condensation successes : 0
% 0.25/1.44 # Termbank termtop insertions : 2023
% 0.25/1.44
% 0.25/1.44 # -------------------------------------------------
% 0.25/1.44 # User time : 0.013 s
% 0.25/1.44 # System time : 0.003 s
% 0.25/1.44 # Total time : 0.016 s
% 0.25/1.44 # Maximum resident set size: 2768 pages
%------------------------------------------------------------------------------