TSTP Solution File: PHI013+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : PHI013+1 : TPTP v8.2.0. Released v7.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% 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 May 21 02:18:08 EDT 2024
% Result : Theorem 0.22s 0.50s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 33 ( 12 unt; 0 def)
% Number of atoms : 122 ( 0 equ)
% Maximal formula atoms : 20 ( 3 avg)
% Number of connectives : 146 ( 57 ~; 60 |; 18 &)
% ( 1 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 4 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 6 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-1 aty)
% Number of variables : 38 ( 3 sgn 15 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(premise_2,axiom,
! [X5] :
( object(X5)
=> ( ( is_the(X5,none_greater)
& ~ exemplifies_property(existence,X5) )
=> ? [X2] :
( object(X2)
& exemplifies_relation(greater_than,X2,X5)
& exemplifies_property(conceivable,X2) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',premise_2) ).
fof(god_exists,conjecture,
exemplifies_property(existence,god),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',god_exists) ).
fof(description_is_property_and_described_is_object,axiom,
! [X5,X1] :
( is_the(X5,X1)
=> ( property(X1)
& object(X5) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',description_is_property_and_described_is_object) ).
fof(description_theorem_2,axiom,
! [X1] :
( property(X1)
=> ( ? [X2] :
( object(X2)
& is_the(X2,X1) )
=> ! [X3] :
( object(X3)
=> ( is_the(X3,X1)
=> exemplifies_property(X1,X3) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',description_theorem_2) ).
fof(definition_none_greater,axiom,
! [X5] :
( object(X5)
=> ( exemplifies_property(none_greater,X5)
<=> ( exemplifies_property(conceivable,X5)
& ~ ? [X2] :
( object(X2)
& exemplifies_relation(greater_than,X2,X5)
& exemplifies_property(conceivable,X2) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',definition_none_greater) ).
fof(definition_god,axiom,
is_the(god,none_greater),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',definition_god) ).
fof(c_0_6,plain,
! [X5] :
( object(X5)
=> ( ( is_the(X5,none_greater)
& ~ exemplifies_property(existence,X5) )
=> ? [X2] :
( object(X2)
& exemplifies_relation(greater_than,X2,X5)
& exemplifies_property(conceivable,X2) ) ) ),
inference(fof_simplification,[status(thm)],[premise_2]) ).
fof(c_0_7,negated_conjecture,
~ exemplifies_property(existence,god),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[god_exists])]) ).
fof(c_0_8,plain,
! [X20] :
( ( object(esk6_1(X20))
| ~ is_the(X20,none_greater)
| exemplifies_property(existence,X20)
| ~ object(X20) )
& ( exemplifies_relation(greater_than,esk6_1(X20),X20)
| ~ is_the(X20,none_greater)
| exemplifies_property(existence,X20)
| ~ object(X20) )
& ( exemplifies_property(conceivable,esk6_1(X20))
| ~ is_the(X20,none_greater)
| exemplifies_property(existence,X20)
| ~ object(X20) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])])]) ).
fof(c_0_9,plain,
! [X22,X23] :
( ( property(X23)
| ~ is_the(X22,X23) )
& ( object(X22)
| ~ is_the(X22,X23) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[description_is_property_and_described_is_object])])])]) ).
fof(c_0_10,negated_conjecture,
~ exemplifies_property(existence,god),
inference(fof_nnf,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( exemplifies_relation(greater_than,esk6_1(X1),X1)
| exemplifies_property(existence,X1)
| ~ is_the(X1,none_greater)
| ~ object(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( object(X1)
| ~ is_the(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_13,plain,
( exemplifies_property(conceivable,esk6_1(X1))
| exemplifies_property(existence,X1)
| ~ is_the(X1,none_greater)
| ~ object(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_14,plain,
( object(esk6_1(X1))
| exemplifies_property(existence,X1)
| ~ is_the(X1,none_greater)
| ~ object(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_15,plain,
! [X10,X11,X12] :
( ~ property(X10)
| ~ object(X11)
| ~ is_the(X11,X10)
| ~ object(X12)
| ~ is_the(X12,X10)
| exemplifies_property(X10,X12) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[description_theorem_2])])])]) ).
fof(c_0_16,plain,
! [X13,X14] :
( ( exemplifies_property(conceivable,X13)
| ~ exemplifies_property(none_greater,X13)
| ~ object(X13) )
& ( ~ object(X14)
| ~ exemplifies_relation(greater_than,X14,X13)
| ~ exemplifies_property(conceivable,X14)
| ~ exemplifies_property(none_greater,X13)
| ~ object(X13) )
& ( object(esk3_1(X13))
| ~ exemplifies_property(conceivable,X13)
| exemplifies_property(none_greater,X13)
| ~ object(X13) )
& ( exemplifies_relation(greater_than,esk3_1(X13),X13)
| ~ exemplifies_property(conceivable,X13)
| exemplifies_property(none_greater,X13)
| ~ object(X13) )
& ( exemplifies_property(conceivable,esk3_1(X13))
| ~ exemplifies_property(conceivable,X13)
| exemplifies_property(none_greater,X13)
| ~ 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)],[definition_none_greater])])])])])]) ).
cnf(c_0_17,negated_conjecture,
~ exemplifies_property(existence,god),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_18,plain,
( exemplifies_relation(greater_than,esk6_1(X1),X1)
| exemplifies_property(existence,X1)
| ~ is_the(X1,none_greater) ),
inference(csr,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_19,plain,
is_the(god,none_greater),
inference(split_conjunct,[status(thm)],[definition_god]) ).
cnf(c_0_20,plain,
( exemplifies_property(conceivable,esk6_1(X1))
| exemplifies_property(existence,X1)
| ~ is_the(X1,none_greater) ),
inference(csr,[status(thm)],[c_0_13,c_0_12]) ).
cnf(c_0_21,plain,
( exemplifies_property(existence,X1)
| object(esk6_1(X1))
| ~ is_the(X1,none_greater) ),
inference(csr,[status(thm)],[c_0_14,c_0_12]) ).
cnf(c_0_22,plain,
( exemplifies_property(X1,X3)
| ~ property(X1)
| ~ object(X2)
| ~ is_the(X2,X1)
| ~ object(X3)
| ~ is_the(X3,X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23,plain,
( property(X1)
| ~ is_the(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_24,plain,
( ~ object(X1)
| ~ exemplifies_relation(greater_than,X1,X2)
| ~ exemplifies_property(conceivable,X1)
| ~ exemplifies_property(none_greater,X2)
| ~ object(X2) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_25,negated_conjecture,
exemplifies_relation(greater_than,esk6_1(god),god),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).
cnf(c_0_26,negated_conjecture,
exemplifies_property(conceivable,esk6_1(god)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_20]),c_0_19])]) ).
cnf(c_0_27,plain,
object(god),
inference(spm,[status(thm)],[c_0_12,c_0_19]) ).
cnf(c_0_28,negated_conjecture,
object(esk6_1(god)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_21]),c_0_19])]) ).
cnf(c_0_29,plain,
( exemplifies_property(X1,X2)
| ~ is_the(X2,X1)
| ~ is_the(X3,X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_22,c_0_23]),c_0_12]),c_0_12]) ).
cnf(c_0_30,negated_conjecture,
~ exemplifies_property(none_greater,god),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),c_0_27]),c_0_28])]) ).
cnf(c_0_31,plain,
( exemplifies_property(none_greater,X1)
| ~ is_the(X1,none_greater) ),
inference(spm,[status(thm)],[c_0_29,c_0_19]) ).
cnf(c_0_32,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : PHI013+1 : TPTP v8.2.0. Released v7.2.0.
% 0.14/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n022.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Sat May 18 14:43:22 EDT 2024
% 0.22/0.35 % CPUTime :
% 0.22/0.48 Running first-order theorem proving
% 0.22/0.48 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.22/0.50 # Version: 3.1.0
% 0.22/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.50 # Starting sh5l with 300s (1) cores
% 0.22/0.50 # sh5l with pid 16275 completed with status 0
% 0.22/0.50 # Result found by sh5l
% 0.22/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.50 # Starting sh5l with 300s (1) cores
% 0.22/0.50 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.22/0.50 # Search class: FGHSF-FFMS21-SFFFFFNN
% 0.22/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.50 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with 163s (1) cores
% 0.22/0.50 # G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with pid 16279 completed with status 0
% 0.22/0.50 # Result found by G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y
% 0.22/0.50 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.22/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.50 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.22/0.50 # Starting new_bool_3 with 300s (1) cores
% 0.22/0.50 # Starting new_bool_1 with 300s (1) cores
% 0.22/0.50 # Starting sh5l with 300s (1) cores
% 0.22/0.50 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.22/0.50 # Search class: FGHSF-FFMS21-SFFFFFNN
% 0.22/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.50 # Starting G-E--_107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y with 163s (1) cores
% 0.22/0.50 # Preprocessing time : 0.001 s
% 0.22/0.50 # Presaturation interreduction done
% 0.22/0.50
% 0.22/0.50 # Proof found!
% 0.22/0.50 # SZS status Theorem
% 0.22/0.50 # SZS output start CNFRefutation
% See solution above
% 0.22/0.50 # Parsed axioms : 9
% 0.22/0.50 # Removed by relevancy pruning/SinE : 0
% 0.22/0.50 # Initial clauses : 24
% 0.22/0.50 # Removed in clause preprocessing : 0
% 0.22/0.50 # Initial clauses in saturation : 24
% 0.22/0.50 # Processed clauses : 59
% 0.22/0.50 # ...of these trivial : 0
% 0.22/0.50 # ...subsumed : 0
% 0.22/0.50 # ...remaining for further processing : 59
% 0.22/0.50 # Other redundant clauses eliminated : 0
% 0.22/0.50 # Clauses deleted for lack of memory : 0
% 0.22/0.50 # Backward-subsumed : 0
% 0.22/0.50 # Backward-rewritten : 2
% 0.22/0.50 # Generated clauses : 84
% 0.22/0.50 # ...of the previous two non-redundant : 78
% 0.22/0.50 # ...aggressively subsumed : 0
% 0.22/0.50 # Contextual simplify-reflections : 6
% 0.22/0.50 # Paramodulations : 84
% 0.22/0.50 # Factorizations : 0
% 0.22/0.50 # NegExts : 0
% 0.22/0.50 # Equation resolutions : 0
% 0.22/0.50 # Disequality decompositions : 0
% 0.22/0.50 # Total rewrite steps : 39
% 0.22/0.50 # ...of those cached : 31
% 0.22/0.50 # Propositional unsat checks : 0
% 0.22/0.50 # Propositional check models : 0
% 0.22/0.50 # Propositional check unsatisfiable : 0
% 0.22/0.50 # Propositional clauses : 0
% 0.22/0.50 # Propositional clauses after purity: 0
% 0.22/0.50 # Propositional unsat core size : 0
% 0.22/0.50 # Propositional preprocessing time : 0.000
% 0.22/0.50 # Propositional encoding time : 0.000
% 0.22/0.50 # Propositional solver time : 0.000
% 0.22/0.50 # Success case prop preproc time : 0.000
% 0.22/0.50 # Success case prop encoding time : 0.000
% 0.22/0.50 # Success case prop solver time : 0.000
% 0.22/0.50 # Current number of processed clauses : 33
% 0.22/0.50 # Positive orientable unit clauses : 10
% 0.22/0.50 # Positive unorientable unit clauses: 0
% 0.22/0.50 # Negative unit clauses : 2
% 0.22/0.50 # Non-unit-clauses : 21
% 0.22/0.50 # Current number of unprocessed clauses: 63
% 0.22/0.50 # ...number of literals in the above : 329
% 0.22/0.50 # Current number of archived formulas : 0
% 0.22/0.50 # Current number of archived clauses : 26
% 0.22/0.50 # Clause-clause subsumption calls (NU) : 89
% 0.22/0.50 # Rec. Clause-clause subsumption calls : 46
% 0.22/0.50 # Non-unit clause-clause subsumptions : 6
% 0.22/0.50 # Unit Clause-clause subsumption calls : 58
% 0.22/0.50 # Rewrite failures with RHS unbound : 0
% 0.22/0.50 # BW rewrite match attempts : 2
% 0.22/0.50 # BW rewrite match successes : 2
% 0.22/0.50 # Condensation attempts : 0
% 0.22/0.50 # Condensation successes : 0
% 0.22/0.50 # Termbank termtop insertions : 3415
% 0.22/0.50 # Search garbage collected termcells : 389
% 0.22/0.50
% 0.22/0.50 # -------------------------------------------------
% 0.22/0.50 # User time : 0.008 s
% 0.22/0.50 # System time : 0.003 s
% 0.22/0.50 # Total time : 0.011 s
% 0.22/0.50 # Maximum resident set size: 1740 pages
% 0.22/0.50
% 0.22/0.50 # -------------------------------------------------
% 0.22/0.50 # User time : 0.010 s
% 0.22/0.50 # System time : 0.004 s
% 0.22/0.50 # Total time : 0.014 s
% 0.22/0.50 # Maximum resident set size: 1700 pages
% 0.22/0.50 % E---3.1 exiting
% 0.22/0.50 % E exiting
%------------------------------------------------------------------------------