TSTP Solution File: LCL958^18 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : LCL958^18 : TPTP v8.2.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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 : Mon May 20 23:55:00 EDT 2024
% Result : Theorem 0.22s 0.48s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 28
% Syntax : Number of formulae : 52 ( 21 unt; 18 typ; 0 def)
% Number of atoms : 103 ( 12 equ; 0 cnn)
% Maximal formula atoms : 17 ( 3 avg)
% Number of connectives : 264 ( 27 ~; 24 |; 11 &; 188 @)
% ( 0 <=>; 14 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 5 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 57 ( 57 >; 0 *; 0 +; 0 <<)
% Number of symbols : 19 ( 17 usr; 2 con; 0-3 aty)
% Number of variables : 77 ( 28 ^ 45 !; 4 ?; 77 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
mworld: $tType ).
thf(decl_22,type,
mrel: mworld > mworld > $o ).
thf(decl_23,type,
mactual: mworld ).
thf(decl_24,type,
mlocal: ( mworld > $o ) > $o ).
thf(decl_27,type,
mor: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
thf(decl_28,type,
mimplies: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
thf(decl_30,type,
mbox: ( mworld > $o ) > mworld > $o ).
thf(decl_32,type,
eiw_di: $i > mworld > $o ).
thf(decl_33,type,
mforall_di: ( $i > mworld > $o ) > mworld > $o ).
thf(decl_34,type,
mexists_di: ( $i > mworld > $o ) > mworld > $o ).
thf(decl_35,type,
big_q: $i > mworld > $o ).
thf(decl_36,type,
big_p: $i > mworld > $o ).
thf(decl_37,type,
esk1_1: mworld > $i ).
thf(decl_38,type,
esk2_1: $i > mworld ).
thf(decl_39,type,
esk3_1: $i > $i ).
thf(decl_40,type,
esk4_1: $i > mworld ).
thf(decl_41,type,
esk5_1: $i > mworld ).
thf(decl_42,type,
esk6_1: $i > mworld ).
thf(mlocal_def,axiom,
( mlocal
= ( ^ [X1: mworld > $o] : ( X1 @ mactual ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mlocal_def) ).
thf(mor_def,axiom,
( mor
= ( ^ [X2: mworld > $o,X4: mworld > $o,X3: mworld] :
( ( X2 @ X3 )
| ( X4 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mor_def) ).
thf(mimplies_def,axiom,
( mimplies
= ( ^ [X2: mworld > $o,X4: mworld > $o,X3: mworld] :
( ( X2 @ X3 )
=> ( X4 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mimplies_def) ).
thf(mbox_def,axiom,
( mbox
= ( ^ [X1: mworld > $o,X3: mworld] :
! [X5: mworld] :
( ( mrel @ X3 @ X5 )
=> ( X1 @ X5 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mbox_def) ).
thf(mforall_di_def,axiom,
( mforall_di
= ( ^ [X7: $i > mworld > $o,X3: mworld] :
! [X6: $i] :
( ( eiw_di @ X6 @ X3 )
=> ( X7 @ X6 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mforall_di_def) ).
thf(mexists_di_def,axiom,
( mexists_di
= ( ^ [X8: $i > mworld > $o,X3: mworld] :
? [X6: $i] :
( ( eiw_di @ X6 @ X3 )
& ( X8 @ X6 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mexists_di_def) ).
thf(x2137,conjecture,
( mlocal
@ ( mexists_di
@ ^ [X6: $i] :
( mbox
@ ( mforall_di
@ ^ [X9: $i] : ( mbox @ ( mimplies @ ( mbox @ ( big_p @ X6 ) ) @ ( mor @ ( mbox @ ( big_q @ X6 ) ) @ ( mbox @ ( big_p @ X9 ) ) ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x2137) ).
thf(mrel_universal,axiom,
! [X3: mworld,X5: mworld] : ( mrel @ X3 @ X5 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mrel_universal) ).
thf(eiw_di_cumul,axiom,
! [X3: mworld,X5: mworld,X6: $i] :
( ( ( eiw_di @ X6 @ X3 )
& ( mrel @ X3 @ X5 ) )
=> ( eiw_di @ X6 @ X5 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',eiw_di_cumul) ).
thf(eiw_di_nonempty,axiom,
! [X3: mworld] :
? [X6: $i] : ( eiw_di @ X6 @ X3 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',eiw_di_nonempty) ).
thf(c_0_10,plain,
( mlocal
= ( ^ [Z0: mworld > $o] : ( Z0 @ mactual ) ) ),
inference(fof_simplification,[status(thm)],[mlocal_def]) ).
thf(c_0_11,plain,
( mor
= ( ^ [Z0: mworld > $o,Z1: mworld > $o,Z2: mworld] :
( ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mor_def]) ).
thf(c_0_12,plain,
( mimplies
= ( ^ [Z0: mworld > $o,Z1: mworld > $o,Z2: mworld] :
( ( Z0 @ Z2 )
=> ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimplies_def]) ).
thf(c_0_13,plain,
( mbox
= ( ^ [Z0: mworld > $o,Z1: mworld] :
! [X5: mworld] :
( ( mrel @ Z1 @ X5 )
=> ( Z0 @ X5 ) ) ) ),
inference(fof_simplification,[status(thm)],[mbox_def]) ).
thf(c_0_14,plain,
( mforall_di
= ( ^ [Z0: $i > mworld > $o,Z1: mworld] :
! [X6: $i] :
( ( eiw_di @ X6 @ Z1 )
=> ( Z0 @ X6 @ Z1 ) ) ) ),
inference(fof_simplification,[status(thm)],[mforall_di_def]) ).
thf(c_0_15,plain,
( mexists_di
= ( ^ [Z0: $i > mworld > $o,Z1: mworld] :
? [X6: $i] :
( ( eiw_di @ X6 @ Z1 )
& ( Z0 @ X6 @ Z1 ) ) ) ),
inference(fof_simplification,[status(thm)],[mexists_di_def]) ).
thf(c_0_16,negated_conjecture,
~ ? [X23: $i] :
( ( eiw_di @ X23 @ mactual )
& ! [X22: mworld] :
( ( mrel @ mactual @ X22 )
=> ! [X21: $i] :
( ( eiw_di @ X21 @ X22 )
=> ! [X20: mworld] :
( ( mrel @ X22 @ X20 )
=> ( ! [X17: mworld] :
( ( mrel @ X20 @ X17 )
=> ( big_p @ X23 @ X17 ) )
=> ( ! [X18: mworld] :
( ( mrel @ X20 @ X18 )
=> ( big_q @ X23 @ X18 ) )
| ! [X19: mworld] :
( ( mrel @ X20 @ X19 )
=> ( big_p @ X21 @ X19 ) ) ) ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[x2137])]),c_0_10]),c_0_11]),c_0_12]),c_0_13]),c_0_14]),c_0_15]) ).
thf(c_0_17,negated_conjecture,
! [X31: $i,X35: mworld] :
( ( ( mrel @ mactual @ ( esk2_1 @ X31 ) )
| ~ ( eiw_di @ X31 @ mactual ) )
& ( ( eiw_di @ ( esk3_1 @ X31 ) @ ( esk2_1 @ X31 ) )
| ~ ( eiw_di @ X31 @ mactual ) )
& ( ( mrel @ ( esk2_1 @ X31 ) @ ( esk4_1 @ X31 ) )
| ~ ( eiw_di @ X31 @ mactual ) )
& ( ~ ( mrel @ ( esk4_1 @ X31 ) @ X35 )
| ( big_p @ X31 @ X35 )
| ~ ( eiw_di @ X31 @ mactual ) )
& ( ( mrel @ ( esk4_1 @ X31 ) @ ( esk5_1 @ X31 ) )
| ~ ( eiw_di @ X31 @ mactual ) )
& ( ~ ( big_q @ X31 @ ( esk5_1 @ X31 ) )
| ~ ( eiw_di @ X31 @ mactual ) )
& ( ( mrel @ ( esk4_1 @ X31 ) @ ( esk6_1 @ X31 ) )
| ~ ( eiw_di @ X31 @ mactual ) )
& ( ~ ( big_p @ ( esk3_1 @ X31 ) @ ( esk6_1 @ X31 ) )
| ~ ( eiw_di @ X31 @ mactual ) ) ),
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)],[c_0_16])])])])])]) ).
thf(c_0_18,plain,
! [X24: mworld,X25: mworld] : ( mrel @ X24 @ X25 ),
inference(variable_rename,[status(thm)],[mrel_universal]) ).
thf(c_0_19,plain,
! [X28: mworld,X29: mworld,X30: $i] :
( ~ ( eiw_di @ X30 @ X28 )
| ~ ( mrel @ X28 @ X29 )
| ( eiw_di @ X30 @ X29 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[eiw_di_cumul])])]) ).
thf(c_0_20,negated_conjecture,
! [X3: mworld,X6: $i] :
( ( big_p @ X6 @ X3 )
| ~ ( mrel @ ( esk4_1 @ X6 ) @ X3 )
| ~ ( eiw_di @ X6 @ mactual ) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_21,plain,
! [X3: mworld,X5: mworld] : ( mrel @ X3 @ X5 ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
thf(c_0_22,plain,
! [X3: mworld,X6: $i,X5: mworld] :
( ( eiw_di @ X6 @ X5 )
| ~ ( eiw_di @ X6 @ X3 )
| ~ ( mrel @ X3 @ X5 ) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
thf(c_0_23,negated_conjecture,
! [X6: $i] :
( ~ ( big_p @ ( esk3_1 @ X6 ) @ ( esk6_1 @ X6 ) )
| ~ ( eiw_di @ X6 @ mactual ) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_24,negated_conjecture,
! [X3: mworld,X6: $i] :
( ( big_p @ X6 @ X3 )
| ~ ( eiw_di @ X6 @ mactual ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21])]) ).
thf(c_0_25,plain,
! [X3: mworld,X6: $i,X5: mworld] :
( ( eiw_di @ X6 @ X3 )
| ~ ( eiw_di @ X6 @ X5 ) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_21])]) ).
thf(c_0_26,negated_conjecture,
! [X6: $i] :
( ( eiw_di @ ( esk3_1 @ X6 ) @ ( esk2_1 @ X6 ) )
| ~ ( eiw_di @ X6 @ mactual ) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_27,plain,
! [X26: mworld] : ( eiw_di @ ( esk1_1 @ X26 ) @ X26 ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[eiw_di_nonempty])]) ).
thf(c_0_28,negated_conjecture,
! [X6: $i] :
( ~ ( eiw_di @ ( esk3_1 @ X6 ) @ mactual )
| ~ ( eiw_di @ X6 @ mactual ) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
thf(c_0_29,negated_conjecture,
! [X3: mworld,X6: $i] :
( ( eiw_di @ ( esk3_1 @ X6 ) @ X3 )
| ~ ( eiw_di @ X6 @ mactual ) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
thf(c_0_30,plain,
! [X3: mworld] : ( eiw_di @ ( esk1_1 @ X3 ) @ X3 ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
thf(c_0_31,negated_conjecture,
! [X6: $i] :
~ ( eiw_di @ X6 @ mactual ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
thf(c_0_32,plain,
! [X3: mworld,X5: mworld] : ( eiw_di @ ( esk1_1 @ X3 ) @ X5 ),
inference(spm,[status(thm)],[c_0_25,c_0_30]) ).
thf(c_0_33,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_31,c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : LCL958^18 : TPTP v8.2.0. Released v8.1.0.
% 0.08/0.14 % Command : run_E %s %d THM
% 0.13/0.36 % Computer : n015.cluster.edu
% 0.13/0.36 % Model : x86_64 x86_64
% 0.13/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.36 % Memory : 8042.1875MB
% 0.13/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.36 % CPULimit : 300
% 0.13/0.36 % WCLimit : 300
% 0.13/0.36 % DateTime : Mon May 20 03:30:38 EDT 2024
% 0.13/0.36 % CPUTime :
% 0.22/0.47 Running higher-order theorem proving
% 0.22/0.47 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.22/0.48 # Version: 3.1.0-ho
% 0.22/0.48 # Preprocessing class: HSMSSMSSMLMNHSN.
% 0.22/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.48 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.22/0.48 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.22/0.48 # Starting almost_fo_3_lam with 300s (1) cores
% 0.22/0.48 # Starting post_as_ho1 with 300s (1) cores
% 0.22/0.48 # ehoh_best2_full_lfho with pid 28586 completed with status 0
% 0.22/0.48 # Result found by ehoh_best2_full_lfho
% 0.22/0.48 # Preprocessing class: HSMSSMSSMLMNHSN.
% 0.22/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.48 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.22/0.48 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.22/0.48 # No SInE strategy applied
% 0.22/0.48 # Search class: HHHNS-FFSF11-SHSSMFNN
% 0.22/0.48 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.48 # Starting new_ho_10 with 163s (1) cores
% 0.22/0.48 # new_ho_10 with pid 28590 completed with status 0
% 0.22/0.48 # Result found by new_ho_10
% 0.22/0.48 # Preprocessing class: HSMSSMSSMLMNHSN.
% 0.22/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.48 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.22/0.48 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.22/0.48 # No SInE strategy applied
% 0.22/0.48 # Search class: HHHNS-FFSF11-SHSSMFNN
% 0.22/0.48 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.22/0.48 # Starting new_ho_10 with 163s (1) cores
% 0.22/0.48 # Preprocessing time : 0.001 s
% 0.22/0.48 # Presaturation interreduction done
% 0.22/0.48
% 0.22/0.48 # Proof found!
% 0.22/0.48 # SZS status Theorem
% 0.22/0.48 # SZS output start CNFRefutation
% See solution above
% 0.22/0.48 # Parsed axioms : 30
% 0.22/0.48 # Removed by relevancy pruning/SinE : 0
% 0.22/0.48 # Initial clauses : 27
% 0.22/0.48 # Removed in clause preprocessing : 16
% 0.22/0.48 # Initial clauses in saturation : 11
% 0.22/0.48 # Processed clauses : 23
% 0.22/0.48 # ...of these trivial : 4
% 0.22/0.48 # ...subsumed : 1
% 0.22/0.48 # ...remaining for further processing : 18
% 0.22/0.48 # Other redundant clauses eliminated : 0
% 0.22/0.48 # Clauses deleted for lack of memory : 0
% 0.22/0.48 # Backward-subsumed : 6
% 0.22/0.48 # Backward-rewritten : 1
% 0.22/0.48 # Generated clauses : 7
% 0.22/0.48 # ...of the previous two non-redundant : 5
% 0.22/0.48 # ...aggressively subsumed : 0
% 0.22/0.48 # Contextual simplify-reflections : 0
% 0.22/0.48 # Paramodulations : 7
% 0.22/0.48 # Factorizations : 0
% 0.22/0.48 # NegExts : 0
% 0.22/0.48 # Equation resolutions : 0
% 0.22/0.48 # Disequality decompositions : 0
% 0.22/0.48 # Total rewrite steps : 8
% 0.22/0.48 # ...of those cached : 0
% 0.22/0.48 # Propositional unsat checks : 0
% 0.22/0.48 # Propositional check models : 0
% 0.22/0.48 # Propositional check unsatisfiable : 0
% 0.22/0.48 # Propositional clauses : 0
% 0.22/0.48 # Propositional clauses after purity: 0
% 0.22/0.48 # Propositional unsat core size : 0
% 0.22/0.48 # Propositional preprocessing time : 0.000
% 0.22/0.48 # Propositional encoding time : 0.000
% 0.22/0.48 # Propositional solver time : 0.000
% 0.22/0.48 # Success case prop preproc time : 0.000
% 0.22/0.48 # Success case prop encoding time : 0.000
% 0.22/0.48 # Success case prop solver time : 0.000
% 0.22/0.48 # Current number of processed clauses : 4
% 0.22/0.48 # Positive orientable unit clauses : 2
% 0.22/0.48 # Positive unorientable unit clauses: 0
% 0.22/0.48 # Negative unit clauses : 1
% 0.22/0.48 # Non-unit-clauses : 1
% 0.22/0.48 # Current number of unprocessed clauses: 0
% 0.22/0.48 # ...number of literals in the above : 0
% 0.22/0.48 # Current number of archived formulas : 0
% 0.22/0.48 # Current number of archived clauses : 14
% 0.22/0.48 # Clause-clause subsumption calls (NU) : 8
% 0.22/0.48 # Rec. Clause-clause subsumption calls : 8
% 0.22/0.48 # Non-unit clause-clause subsumptions : 2
% 0.22/0.48 # Unit Clause-clause subsumption calls : 5
% 0.22/0.48 # Rewrite failures with RHS unbound : 0
% 0.22/0.48 # BW rewrite match attempts : 1
% 0.22/0.48 # BW rewrite match successes : 1
% 0.22/0.48 # Condensation attempts : 23
% 0.22/0.48 # Condensation successes : 0
% 0.22/0.48 # Termbank termtop insertions : 1736
% 0.22/0.48 # Search garbage collected termcells : 497
% 0.22/0.48
% 0.22/0.48 # -------------------------------------------------
% 0.22/0.48 # User time : 0.004 s
% 0.22/0.48 # System time : 0.002 s
% 0.22/0.48 # Total time : 0.006 s
% 0.22/0.48 # Maximum resident set size: 1864 pages
% 0.22/0.48
% 0.22/0.48 # -------------------------------------------------
% 0.22/0.48 # User time : 0.005 s
% 0.22/0.48 # System time : 0.003 s
% 0.22/0.48 # Total time : 0.009 s
% 0.22/0.48 # Maximum resident set size: 1752 pages
% 0.22/0.48 % E---3.1 exiting
% 0.22/0.48 % E exiting
%------------------------------------------------------------------------------