TSTP Solution File: PHI009+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : PHI009+1 : TPTP v8.2.0. Released v7.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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 May 21 02:18:07 EDT 2024
% Result : Theorem 0.21s 0.52s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 2
% Syntax : Number of formulae : 18 ( 4 unt; 0 def)
% Number of atoms : 162 ( 11 equ)
% Maximal formula atoms : 74 ( 9 avg)
% Number of connectives : 249 ( 105 ~; 107 |; 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 : 44 ( 1 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/sandbox/benchmark/theBenchmark.p',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/sandbox/benchmark/theBenchmark.p',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(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])])]) ).
fof(c_0_4,plain,
! [X11,X12,X13,X15,X16] :
( ( object(esk3_3(X11,X12,X13))
| ~ is_the(X13,X11)
| ~ exemplifies_property(X12,X13)
| ~ property(X11)
| ~ property(X12)
| ~ object(X13) )
& ( exemplifies_property(X11,esk3_3(X11,X12,X13))
| ~ is_the(X13,X11)
| ~ exemplifies_property(X12,X13)
| ~ property(X11)
| ~ property(X12)
| ~ object(X13) )
& ( ~ object(X15)
| ~ exemplifies_property(X11,X15)
| X15 = esk3_3(X11,X12,X13)
| ~ is_the(X13,X11)
| ~ exemplifies_property(X12,X13)
| ~ property(X11)
| ~ property(X12)
| ~ object(X13) )
& ( exemplifies_property(X12,esk3_3(X11,X12,X13))
| ~ is_the(X13,X11)
| ~ exemplifies_property(X12,X13)
| ~ property(X11)
| ~ property(X12)
| ~ object(X13) )
& ( is_the(X13,X11)
| object(esk4_4(X11,X12,X13,X16))
| ~ object(X16)
| ~ exemplifies_property(X11,X16)
| ~ exemplifies_property(X12,X16)
| ~ property(X11)
| ~ property(X12)
| ~ object(X13) )
& ( exemplifies_property(X12,X13)
| object(esk4_4(X11,X12,X13,X16))
| ~ object(X16)
| ~ exemplifies_property(X11,X16)
| ~ exemplifies_property(X12,X16)
| ~ property(X11)
| ~ property(X12)
| ~ object(X13) )
& ( is_the(X13,X11)
| exemplifies_property(X11,esk4_4(X11,X12,X13,X16))
| ~ object(X16)
| ~ exemplifies_property(X11,X16)
| ~ exemplifies_property(X12,X16)
| ~ property(X11)
| ~ property(X12)
| ~ object(X13) )
& ( exemplifies_property(X12,X13)
| exemplifies_property(X11,esk4_4(X11,X12,X13,X16))
| ~ object(X16)
| ~ exemplifies_property(X11,X16)
| ~ exemplifies_property(X12,X16)
| ~ property(X11)
| ~ property(X12)
| ~ object(X13) )
& ( is_the(X13,X11)
| esk4_4(X11,X12,X13,X16) != X16
| ~ object(X16)
| ~ exemplifies_property(X11,X16)
| ~ exemplifies_property(X12,X16)
| ~ property(X11)
| ~ property(X12)
| ~ object(X13) )
& ( exemplifies_property(X12,X13)
| esk4_4(X11,X12,X13,X16) != X16
| ~ object(X16)
| ~ exemplifies_property(X11,X16)
| ~ exemplifies_property(X12,X16)
| ~ property(X11)
| ~ property(X12)
| ~ object(X13) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[description_axiom_schema_instance])])])])])]) ).
cnf(c_0_5,negated_conjecture,
( X1 = esk2_0
| ~ object(X1)
| ~ exemplifies_property(esk1_0,X1) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_6,plain,
( is_the(X1,X2)
| object(esk4_4(X2,X3,X1,X4))
| ~ object(X4)
| ~ exemplifies_property(X2,X4)
| ~ exemplifies_property(X3,X4)
| ~ property(X2)
| ~ property(X3)
| ~ object(X1) ),
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(X2,X4)
| ~ exemplifies_property(X1,X4)
| ~ object(X4)
| ~ object(X3)
| ~ property(X2)
| ~ property(X1) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,plain,
( is_the(X1,X2)
| exemplifies_property(X2,esk4_4(X2,X3,X1,X4))
| ~ object(X4)
| ~ exemplifies_property(X2,X4)
| ~ exemplifies_property(X3,X4)
| ~ property(X2)
| ~ property(X3)
| ~ object(X1) ),
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,
( ~ object(X1)
| ~ is_the(X1,esk1_0) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_11,plain,
( is_the(X1,X2)
| esk4_4(X2,X3,X1,X4) != X4
| ~ object(X4)
| ~ exemplifies_property(X2,X4)
| ~ exemplifies_property(X3,X4)
| ~ property(X2)
| ~ property(X3)
| ~ object(X1) ),
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,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_14,negated_conjecture,
object(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
cnf(c_0_15,negated_conjecture,
( ~ exemplifies_property(X1,esk2_0)
| ~ object(X2)
| ~ property(X1) ),
inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[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_13]),c_0_14])]),c_0_10]) ).
cnf(c_0_16,negated_conjecture,
( ~ exemplifies_property(X1,esk2_0)
| ~ property(X1) ),
inference(spm,[status(thm)],[c_0_15,c_0_14]) ).
cnf(c_0_17,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_9]),c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : PHI009+1 : TPTP v8.2.0. Released v7.2.0.
% 0.08/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n017.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 : Sat May 18 14:44:52 EDT 2024
% 0.14/0.35 % CPUTime :
% 0.21/0.50 Running first-order theorem proving
% 0.21/0.50 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.52 # Version: 3.1.0
% 0.21/0.52 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.52 # Starting sh5l with 300s (1) cores
% 0.21/0.52 # new_bool_3 with pid 447 completed with status 0
% 0.21/0.52 # Result found by new_bool_3
% 0.21/0.52 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.52 # Search class: FGHSF-FFMS33-SFFFFFNN
% 0.21/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.52 # SAT001_MinMin_p005000_rr_RG with pid 452 completed with status 0
% 0.21/0.52 # Result found by SAT001_MinMin_p005000_rr_RG
% 0.21/0.52 # Preprocessing class: FSSSSMSSSSSNFFN.
% 0.21/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.52 # Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.21/0.52 # Starting new_bool_3 with 300s (1) cores
% 0.21/0.52 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.21/0.52 # Search class: FGHSF-FFMS33-SFFFFFNN
% 0.21/0.52 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.52 # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.21/0.52 # Preprocessing time : 0.001 s
% 0.21/0.52 # Presaturation interreduction done
% 0.21/0.52
% 0.21/0.52 # Proof found!
% 0.21/0.52 # SZS status Theorem
% 0.21/0.52 # SZS output start CNFRefutation
% See solution above
% 0.21/0.52 # Parsed axioms : 2
% 0.21/0.52 # Removed by relevancy pruning/SinE : 0
% 0.21/0.52 # Initial clauses : 15
% 0.21/0.52 # Removed in clause preprocessing : 0
% 0.21/0.52 # Initial clauses in saturation : 15
% 0.21/0.52 # Processed clauses : 41
% 0.21/0.52 # ...of these trivial : 0
% 0.21/0.52 # ...subsumed : 3
% 0.21/0.52 # ...remaining for further processing : 38
% 0.21/0.52 # Other redundant clauses eliminated : 2
% 0.21/0.52 # Clauses deleted for lack of memory : 0
% 0.21/0.52 # Backward-subsumed : 1
% 0.21/0.52 # Backward-rewritten : 0
% 0.21/0.52 # Generated clauses : 42
% 0.21/0.52 # ...of the previous two non-redundant : 33
% 0.21/0.52 # ...aggressively subsumed : 0
% 0.21/0.52 # Contextual simplify-reflections : 3
% 0.21/0.52 # Paramodulations : 40
% 0.21/0.52 # Factorizations : 0
% 0.21/0.52 # NegExts : 0
% 0.21/0.52 # Equation resolutions : 2
% 0.21/0.52 # Disequality decompositions : 0
% 0.21/0.52 # Total rewrite steps : 28
% 0.21/0.52 # ...of those cached : 25
% 0.21/0.52 # Propositional unsat checks : 0
% 0.21/0.52 # Propositional check models : 0
% 0.21/0.52 # Propositional check unsatisfiable : 0
% 0.21/0.52 # Propositional clauses : 0
% 0.21/0.52 # Propositional clauses after purity: 0
% 0.21/0.52 # Propositional unsat core size : 0
% 0.21/0.52 # Propositional preprocessing time : 0.000
% 0.21/0.52 # Propositional encoding time : 0.000
% 0.21/0.52 # Propositional solver time : 0.000
% 0.21/0.52 # Success case prop preproc time : 0.000
% 0.21/0.52 # Success case prop encoding time : 0.000
% 0.21/0.52 # Success case prop solver time : 0.000
% 0.21/0.52 # Current number of processed clauses : 22
% 0.21/0.52 # Positive orientable unit clauses : 3
% 0.21/0.52 # Positive unorientable unit clauses: 0
% 0.21/0.52 # Negative unit clauses : 0
% 0.21/0.52 # Non-unit-clauses : 19
% 0.21/0.52 # Current number of unprocessed clauses: 22
% 0.21/0.52 # ...number of literals in the above : 235
% 0.21/0.52 # Current number of archived formulas : 0
% 0.21/0.52 # Current number of archived clauses : 16
% 0.21/0.52 # Clause-clause subsumption calls (NU) : 128
% 0.21/0.52 # Rec. Clause-clause subsumption calls : 37
% 0.21/0.52 # Non-unit clause-clause subsumptions : 7
% 0.21/0.52 # Unit Clause-clause subsumption calls : 0
% 0.21/0.52 # Rewrite failures with RHS unbound : 0
% 0.21/0.52 # BW rewrite match attempts : 0
% 0.21/0.52 # BW rewrite match successes : 0
% 0.21/0.52 # Condensation attempts : 0
% 0.21/0.52 # Condensation successes : 0
% 0.21/0.52 # Termbank termtop insertions : 2634
% 0.21/0.52 # Search garbage collected termcells : 342
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.006 s
% 0.21/0.52 # System time : 0.002 s
% 0.21/0.52 # Total time : 0.009 s
% 0.21/0.52 # Maximum resident set size: 1772 pages
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.007 s
% 0.21/0.52 # System time : 0.005 s
% 0.21/0.52 # Total time : 0.012 s
% 0.21/0.52 # Maximum resident set size: 1692 pages
% 0.21/0.52 % E---3.1 exiting
% 0.21/0.52 % E exiting
%------------------------------------------------------------------------------