TSTP Solution File: PHI015+1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : PHI015+1 : TPTP v8.2.0. Released v7.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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:09 EDT 2024
% Result : Theorem 0.13s 0.38s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 34 ( 8 unt; 0 def)
% Number of atoms : 206 ( 24 equ)
% Maximal formula atoms : 74 ( 6 avg)
% Number of connectives : 294 ( 122 ~; 126 |; 34 &)
% ( 2 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 23 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 7 ( 5 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-4 aty)
% Number of variables : 54 ( 3 sgn 23 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(premise_2,axiom,
! [X1] :
( object(X1)
=> ( ( is_the(X1,none_greater)
& ~ exemplifies_property(existence,X1) )
=> ? [X4] :
( object(X4)
& exemplifies_relation(greater_than,X4,X1)
& exemplifies_property(conceivable,X4) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',premise_2) ).
fof(definition_none_greater,axiom,
! [X1] :
( object(X1)
=> ( exemplifies_property(none_greater,X1)
<=> ( exemplifies_property(conceivable,X1)
& ~ ? [X4] :
( object(X4)
& exemplifies_relation(greater_than,X4,X1)
& exemplifies_property(conceivable,X4) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',definition_none_greater) ).
fof(exemplifier_is_object_and_exemplified_is_property,axiom,
! [X1,X2] :
( exemplifies_property(X2,X1)
=> ( property(X2)
& object(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',exemplifier_is_object_and_exemplified_is_property) ).
fof(description_is_property_and_described_is_object,axiom,
! [X1,X2] :
( is_the(X1,X2)
=> ( property(X2)
& object(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',description_is_property_and_described_is_object) ).
fof(description_axiom_identity_instance,axiom,
! [X2,X1,X6] :
( ( property(X2)
& object(X1)
& object(X6) )
=> ( ( is_the(X1,X2)
& X1 = X6 )
<=> ? [X4] :
( object(X4)
& exemplifies_property(X2,X4)
& ! [X5] :
( object(X5)
=> ( exemplifies_property(X2,X5)
=> X5 = X4 ) )
& X4 = X6 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',description_axiom_identity_instance) ).
fof(god_exists,conjecture,
exemplifies_property(existence,god),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',god_exists) ).
fof(definition_god,axiom,
is_the(god,none_greater),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',definition_god) ).
fof(c_0_7,plain,
! [X1] :
( object(X1)
=> ( ( is_the(X1,none_greater)
& ~ exemplifies_property(existence,X1) )
=> ? [X4] :
( object(X4)
& exemplifies_relation(greater_than,X4,X1)
& exemplifies_property(conceivable,X4) ) ) ),
inference(fof_simplification,[status(thm)],[premise_2]) ).
fof(c_0_8,plain,
! [X29,X30] :
( ( exemplifies_property(conceivable,X29)
| ~ exemplifies_property(none_greater,X29)
| ~ object(X29) )
& ( ~ object(X30)
| ~ exemplifies_relation(greater_than,X30,X29)
| ~ exemplifies_property(conceivable,X30)
| ~ exemplifies_property(none_greater,X29)
| ~ object(X29) )
& ( object(esk7_1(X29))
| ~ exemplifies_property(conceivable,X29)
| exemplifies_property(none_greater,X29)
| ~ object(X29) )
& ( exemplifies_relation(greater_than,esk7_1(X29),X29)
| ~ exemplifies_property(conceivable,X29)
| exemplifies_property(none_greater,X29)
| ~ object(X29) )
& ( exemplifies_property(conceivable,esk7_1(X29))
| ~ exemplifies_property(conceivable,X29)
| exemplifies_property(none_greater,X29)
| ~ object(X29) ) ),
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])])])])])]) ).
fof(c_0_9,plain,
! [X7,X8] :
( ( property(X8)
| ~ exemplifies_property(X8,X7) )
& ( object(X7)
| ~ exemplifies_property(X8,X7) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[exemplifier_is_object_and_exemplified_is_property])])])]) ).
fof(c_0_10,plain,
! [X23] :
( ( object(esk5_1(X23))
| ~ is_the(X23,none_greater)
| exemplifies_property(existence,X23)
| ~ object(X23) )
& ( exemplifies_relation(greater_than,esk5_1(X23),X23)
| ~ is_the(X23,none_greater)
| exemplifies_property(existence,X23)
| ~ object(X23) )
& ( exemplifies_property(conceivable,esk5_1(X23))
| ~ is_the(X23,none_greater)
| exemplifies_property(existence,X23)
| ~ object(X23) ) ),
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_7])])])])]) ).
fof(c_0_11,plain,
! [X26,X27] :
( ( property(X27)
| ~ is_the(X26,X27) )
& ( object(X26)
| ~ is_the(X26,X27) ) ),
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_12,plain,
! [X16,X17,X18,X20,X21] :
( ( object(esk3_3(X16,X17,X18))
| ~ is_the(X17,X16)
| X17 != X18
| ~ property(X16)
| ~ object(X17)
| ~ object(X18) )
& ( exemplifies_property(X16,esk3_3(X16,X17,X18))
| ~ is_the(X17,X16)
| X17 != X18
| ~ property(X16)
| ~ object(X17)
| ~ object(X18) )
& ( ~ object(X20)
| ~ exemplifies_property(X16,X20)
| X20 = esk3_3(X16,X17,X18)
| ~ is_the(X17,X16)
| X17 != X18
| ~ property(X16)
| ~ object(X17)
| ~ object(X18) )
& ( esk3_3(X16,X17,X18) = X18
| ~ is_the(X17,X16)
| X17 != X18
| ~ property(X16)
| ~ object(X17)
| ~ object(X18) )
& ( is_the(X17,X16)
| object(esk4_4(X16,X17,X18,X21))
| ~ object(X21)
| ~ exemplifies_property(X16,X21)
| X21 != X18
| ~ property(X16)
| ~ object(X17)
| ~ object(X18) )
& ( X17 = X18
| object(esk4_4(X16,X17,X18,X21))
| ~ object(X21)
| ~ exemplifies_property(X16,X21)
| X21 != X18
| ~ property(X16)
| ~ object(X17)
| ~ object(X18) )
& ( is_the(X17,X16)
| exemplifies_property(X16,esk4_4(X16,X17,X18,X21))
| ~ object(X21)
| ~ exemplifies_property(X16,X21)
| X21 != X18
| ~ property(X16)
| ~ object(X17)
| ~ object(X18) )
& ( X17 = X18
| exemplifies_property(X16,esk4_4(X16,X17,X18,X21))
| ~ object(X21)
| ~ exemplifies_property(X16,X21)
| X21 != X18
| ~ property(X16)
| ~ object(X17)
| ~ object(X18) )
& ( is_the(X17,X16)
| esk4_4(X16,X17,X18,X21) != X21
| ~ object(X21)
| ~ exemplifies_property(X16,X21)
| X21 != X18
| ~ property(X16)
| ~ object(X17)
| ~ object(X18) )
& ( X17 = X18
| esk4_4(X16,X17,X18,X21) != X21
| ~ object(X21)
| ~ exemplifies_property(X16,X21)
| X21 != X18
| ~ property(X16)
| ~ object(X17)
| ~ object(X18) ) ),
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_identity_instance])])])])])]) ).
cnf(c_0_13,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_8]) ).
cnf(c_0_14,plain,
( object(X1)
| ~ exemplifies_property(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_15,plain,
( exemplifies_relation(greater_than,esk5_1(X1),X1)
| exemplifies_property(existence,X1)
| ~ is_the(X1,none_greater)
| ~ object(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_16,plain,
( object(X1)
| ~ is_the(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( exemplifies_property(conceivable,esk5_1(X1))
| exemplifies_property(existence,X1)
| ~ is_the(X1,none_greater)
| ~ object(X1) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
fof(c_0_18,negated_conjecture,
~ exemplifies_property(existence,god),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[god_exists])]) ).
cnf(c_0_19,plain,
( exemplifies_property(X1,esk3_3(X1,X2,X3))
| ~ is_the(X2,X1)
| X2 != X3
| ~ property(X1)
| ~ object(X2)
| ~ object(X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_20,plain,
( property(X1)
| ~ is_the(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_21,plain,
( esk3_3(X1,X2,X3) = X3
| ~ is_the(X2,X1)
| X2 != X3
| ~ property(X1)
| ~ object(X2)
| ~ object(X3) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_22,plain,
( ~ exemplifies_relation(greater_than,X1,X2)
| ~ exemplifies_property(none_greater,X2)
| ~ exemplifies_property(conceivable,X1) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_13,c_0_14]),c_0_14]) ).
cnf(c_0_23,plain,
( exemplifies_relation(greater_than,esk5_1(X1),X1)
| exemplifies_property(existence,X1)
| ~ is_the(X1,none_greater) ),
inference(csr,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_24,plain,
( exemplifies_property(conceivable,esk5_1(X1))
| exemplifies_property(existence,X1)
| ~ is_the(X1,none_greater) ),
inference(csr,[status(thm)],[c_0_17,c_0_16]) ).
fof(c_0_25,negated_conjecture,
~ exemplifies_property(existence,god),
inference(fof_nnf,[status(thm)],[c_0_18]) ).
cnf(c_0_26,plain,
( exemplifies_property(X1,esk3_3(X1,X2,X2))
| ~ is_the(X2,X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_19,c_0_16]),c_0_20])]),c_0_16]) ).
cnf(c_0_27,plain,
( esk3_3(X1,X2,X2) = X2
| ~ is_the(X2,X1) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_21,c_0_16]),c_0_20])]),c_0_16]) ).
cnf(c_0_28,plain,
( exemplifies_property(existence,X1)
| ~ is_the(X1,none_greater)
| ~ exemplifies_property(none_greater,X1) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).
cnf(c_0_29,plain,
is_the(god,none_greater),
inference(split_conjunct,[status(thm)],[definition_god]) ).
cnf(c_0_30,negated_conjecture,
~ exemplifies_property(existence,god),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_31,plain,
( exemplifies_property(X1,X2)
| ~ is_the(X2,X1) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_32,plain,
~ exemplifies_property(none_greater,god),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]) ).
cnf(c_0_33,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_29]),c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.09 % Problem : PHI015+1 : TPTP v8.2.0. Released v7.2.0.
% 0.03/0.09 % Command : run_E %s %d THM
% 0.08/0.28 % Computer : n032.cluster.edu
% 0.08/0.28 % Model : x86_64 x86_64
% 0.08/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.28 % Memory : 8042.1875MB
% 0.08/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.28 % CPULimit : 300
% 0.08/0.28 % WCLimit : 300
% 0.08/0.28 % DateTime : Sat May 18 14:44:22 EDT 2024
% 0.08/0.28 % CPUTime :
% 0.13/0.37 Running first-order theorem proving
% 0.13/0.37 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.13/0.38 # Version: 3.1.0
% 0.13/0.38 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.38 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.38 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.38 # Starting new_bool_3 with 300s (1) cores
% 0.13/0.38 # Starting new_bool_1 with 300s (1) cores
% 0.13/0.38 # Starting sh5l with 300s (1) cores
% 0.13/0.38 # new_bool_3 with pid 24953 completed with status 0
% 0.13/0.38 # Result found by new_bool_3
% 0.13/0.38 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.38 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.38 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.38 # Starting new_bool_3 with 300s (1) cores
% 0.13/0.38 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.38 # Search class: FGHSF-FFMS32-SFFFFFNN
% 0.13/0.38 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.38 # Starting G-E--_301_C18_F1_URBAN_S0Y with 181s (1) cores
% 0.13/0.38 # G-E--_301_C18_F1_URBAN_S0Y with pid 24958 completed with status 0
% 0.13/0.38 # Result found by G-E--_301_C18_F1_URBAN_S0Y
% 0.13/0.38 # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.13/0.38 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.38 # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.13/0.38 # Starting new_bool_3 with 300s (1) cores
% 0.13/0.38 # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.38 # Search class: FGHSF-FFMS32-SFFFFFNN
% 0.13/0.38 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.38 # Starting G-E--_301_C18_F1_URBAN_S0Y with 181s (1) cores
% 0.13/0.38 # Preprocessing time : 0.001 s
% 0.13/0.38
% 0.13/0.38 # Proof found!
% 0.13/0.38 # SZS status Theorem
% 0.13/0.38 # SZS output start CNFRefutation
% See solution above
% 0.13/0.38 # Parsed axioms : 11
% 0.13/0.38 # Removed by relevancy pruning/SinE : 0
% 0.13/0.38 # Initial clauses : 38
% 0.13/0.38 # Removed in clause preprocessing : 0
% 0.13/0.38 # Initial clauses in saturation : 38
% 0.13/0.38 # Processed clauses : 70
% 0.13/0.38 # ...of these trivial : 3
% 0.13/0.38 # ...subsumed : 10
% 0.13/0.38 # ...remaining for further processing : 57
% 0.13/0.38 # Other redundant clauses eliminated : 10
% 0.13/0.38 # Clauses deleted for lack of memory : 0
% 0.13/0.38 # Backward-subsumed : 0
% 0.13/0.38 # Backward-rewritten : 1
% 0.13/0.38 # Generated clauses : 86
% 0.13/0.38 # ...of the previous two non-redundant : 82
% 0.13/0.38 # ...aggressively subsumed : 0
% 0.13/0.38 # Contextual simplify-reflections : 67
% 0.13/0.38 # Paramodulations : 76
% 0.13/0.38 # Factorizations : 0
% 0.13/0.38 # NegExts : 0
% 0.13/0.38 # Equation resolutions : 10
% 0.13/0.38 # Disequality decompositions : 0
% 0.13/0.38 # Total rewrite steps : 6
% 0.13/0.38 # ...of those cached : 2
% 0.13/0.38 # Propositional unsat checks : 0
% 0.13/0.38 # Propositional check models : 0
% 0.13/0.38 # Propositional check unsatisfiable : 0
% 0.13/0.38 # Propositional clauses : 0
% 0.13/0.38 # Propositional clauses after purity: 0
% 0.13/0.38 # Propositional unsat core size : 0
% 0.13/0.38 # Propositional preprocessing time : 0.000
% 0.13/0.38 # Propositional encoding time : 0.000
% 0.13/0.38 # Propositional solver time : 0.000
% 0.13/0.38 # Success case prop preproc time : 0.000
% 0.13/0.38 # Success case prop encoding time : 0.000
% 0.13/0.38 # Success case prop solver time : 0.000
% 0.13/0.38 # Current number of processed clauses : 46
% 0.13/0.38 # Positive orientable unit clauses : 6
% 0.13/0.38 # Positive unorientable unit clauses: 0
% 0.13/0.38 # Negative unit clauses : 4
% 0.13/0.38 # Non-unit-clauses : 36
% 0.13/0.38 # Current number of unprocessed clauses: 47
% 0.13/0.38 # ...number of literals in the above : 246
% 0.13/0.38 # Current number of archived formulas : 0
% 0.13/0.38 # Current number of archived clauses : 1
% 0.13/0.38 # Clause-clause subsumption calls (NU) : 474
% 0.13/0.38 # Rec. Clause-clause subsumption calls : 284
% 0.13/0.38 # Non-unit clause-clause subsumptions : 76
% 0.13/0.38 # Unit Clause-clause subsumption calls : 45
% 0.13/0.38 # Rewrite failures with RHS unbound : 0
% 0.13/0.38 # BW rewrite match attempts : 1
% 0.13/0.38 # BW rewrite match successes : 1
% 0.13/0.38 # Condensation attempts : 0
% 0.13/0.38 # Condensation successes : 0
% 0.13/0.38 # Termbank termtop insertions : 3744
% 0.13/0.38 # Search garbage collected termcells : 651
% 0.13/0.38
% 0.13/0.38 # -------------------------------------------------
% 0.13/0.38 # User time : 0.008 s
% 0.13/0.38 # System time : 0.000 s
% 0.13/0.38 # Total time : 0.008 s
% 0.13/0.38 # Maximum resident set size: 1840 pages
% 0.13/0.38
% 0.13/0.38 # -------------------------------------------------
% 0.13/0.38 # User time : 0.010 s
% 0.13/0.38 # System time : 0.000 s
% 0.13/0.38 # Total time : 0.010 s
% 0.13/0.38 # Maximum resident set size: 1700 pages
% 0.13/0.38 % E---3.1 exiting
% 0.13/0.38 % E exiting
%------------------------------------------------------------------------------