TSTP Solution File: LCL716^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : LCL716^1 : TPTP v8.2.0. Bugfixed v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n026.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:53:13 EDT 2024
% Result : Theorem 0.19s 0.48s
% Output : CNFRefutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 20
% Syntax : Number of formulae : 42 ( 21 unt; 12 typ; 0 def)
% Number of atoms : 67 ( 21 equ; 0 cnn)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 212 ( 29 ~; 27 |; 7 &; 144 @)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 81 ( 81 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 12 usr; 3 con; 0-3 aty)
% Number of variables : 80 ( 37 ^ 40 !; 3 ?; 80 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_24,type,
mnot: ( $i > $o ) > $i > $o ).
thf(decl_25,type,
mor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_27,type,
mimplies: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_32,type,
mforall_prop: ( ( $i > $o ) > $i > $o ) > $i > $o ).
thf(decl_37,type,
mbox: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_46,type,
mweakly_dense: ( $i > $i > $o ) > $o ).
thf(decl_49,type,
mvalid: ( $i > $o ) > $o ).
thf(decl_53,type,
epred1_0: $i > $i > $o ).
thf(decl_54,type,
esk1_2: $i > ( $i > $o ) > $i ).
thf(decl_55,type,
esk2_2: $i > ( $i > $o ) > $i ).
thf(decl_56,type,
esk3_0: $i ).
thf(decl_57,type,
esk4_0: $i ).
thf(mimplies,axiom,
( mimplies
= ( ^ [X6: $i > $o,X7: $i > $o] : ( mor @ ( mnot @ X6 ) @ X7 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax',mimplies) ).
thf(mnot,axiom,
( mnot
= ( ^ [X6: $i > $o,X3: $i] :
~ ( X6 @ X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax',mnot) ).
thf(mor,axiom,
( mor
= ( ^ [X6: $i > $o,X7: $i > $o,X3: $i] :
( ( X6 @ X3 )
| ( X7 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax',mor) ).
thf(mforall_prop,axiom,
( mforall_prop
= ( ^ [X9: ( $i > $o ) > $i > $o,X3: $i] :
! [X10: $i > $o] : ( X9 @ X10 @ X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax',mforall_prop) ).
thf(mbox,axiom,
( mbox
= ( ^ [X13: $i > $i > $o,X6: $i > $o,X3: $i] :
! [X14: $i] :
( ~ ( X13 @ X3 @ X14 )
| ( X6 @ X14 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax',mbox) ).
thf(mweakly_dense,axiom,
( mweakly_dense
= ( ^ [X13: $i > $i > $o] :
! [X15: $i,X16: $i,X17: $i] :
( ( X13 @ X15 @ X16 )
=> ? [X17: $i] :
( ( X13 @ X15 @ X17 )
& ( X13 @ X17 @ X16 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax',mweakly_dense) ).
thf(mvalid,axiom,
( mvalid
= ( ^ [X6: $i > $o] :
! [X3: $i] : ( X6 @ X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax',mvalid) ).
thf(conj,conjecture,
! [X13: $i > $i > $o] :
( ( mvalid
@ ( mforall_prop
@ ^ [X18: $i > $o] : ( mimplies @ ( mbox @ X13 @ ( mbox @ X13 @ X18 ) ) @ ( mbox @ X13 @ X18 ) ) ) )
=> ( mweakly_dense @ X13 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).
thf(c_0_8,plain,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimplies]) ).
thf(c_0_9,plain,
( mnot
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ( Z0 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mnot]) ).
thf(c_0_10,plain,
( mor
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mor]) ).
thf(c_0_11,plain,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_8,c_0_9]),c_0_10]) ).
thf(c_0_12,plain,
( mforall_prop
= ( ^ [Z0: ( $i > $o ) > $i > $o,Z1: $i] :
! [X10: $i > $o] : ( Z0 @ X10 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mforall_prop]) ).
thf(c_0_13,plain,
( mbox
= ( ^ [Z0: $i > $i > $o,Z1: $i > $o,Z2: $i] :
! [X14: $i] :
( ~ ( Z0 @ Z2 @ X14 )
| ( Z1 @ X14 ) ) ) ),
inference(fof_simplification,[status(thm)],[mbox]) ).
thf(c_0_14,plain,
( mweakly_dense
= ( ^ [Z0: $i > $i > $o] :
! [X15: $i,X16: $i,X17: $i] :
( ( Z0 @ X15 @ X16 )
=> ? [X17: $i] :
( ( Z0 @ X15 @ X17 )
& ( Z0 @ X17 @ X16 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[mweakly_dense]) ).
thf(c_0_15,plain,
( mvalid
= ( ^ [Z0: $i > $o] :
! [X3: $i] : ( Z0 @ X3 ) ) ),
inference(fof_simplification,[status(thm)],[mvalid]) ).
thf(c_0_16,negated_conjecture,
~ ! [X13: $i > $i > $o] :
( ! [X27: $i,X26: $i > $o] :
( ~ ! [X24: $i] :
( ~ ( X13 @ X27 @ X24 )
| ! [X23: $i] :
( ~ ( X13 @ X24 @ X23 )
| ( X26 @ X23 ) ) )
| ! [X25: $i] :
( ~ ( X13 @ X27 @ X25 )
| ( X26 @ X25 ) ) )
=> ! [X28: $i,X29: $i,X30: $i] :
( ( X13 @ X28 @ X29 )
=> ? [X31: $i] :
( ( X13 @ X28 @ X31 )
& ( X13 @ X31 @ X29 ) ) ) ),
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)],[conj])]),c_0_11]),c_0_12]),c_0_13]),c_0_14]),c_0_15]) ).
thf(c_0_17,negated_conjecture,
! [X33: $i,X34: $i > $o,X37: $i,X40: $i] :
( ( ( epred1_0 @ X33 @ ( esk1_2 @ X33 @ X34 ) )
| ~ ( epred1_0 @ X33 @ X37 )
| ( X34 @ X37 ) )
& ( ( epred1_0 @ ( esk1_2 @ X33 @ X34 ) @ ( esk2_2 @ X33 @ X34 ) )
| ~ ( epred1_0 @ X33 @ X37 )
| ( X34 @ X37 ) )
& ( ~ ( X34 @ ( esk2_2 @ X33 @ X34 ) )
| ~ ( epred1_0 @ X33 @ X37 )
| ( X34 @ X37 ) )
& ( epred1_0 @ esk3_0 @ esk4_0 )
& ( ~ ( epred1_0 @ esk3_0 @ X40 )
| ~ ( epred1_0 @ X40 @ esk4_0 ) ) ),
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)],[inference(fof_simplification,[status(thm)],[c_0_16])])])])])])]) ).
thf(c_0_18,negated_conjecture,
! [X4: $i > $o,X3: $i,X14: $i] :
( ( X4 @ X14 )
| ~ ( X4 @ ( esk2_2 @ X3 @ X4 ) )
| ~ ( epred1_0 @ X3 @ X14 ) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_19,negated_conjecture,
! [X4: $i > $o,X3: $i,X14: $i] :
( ( epred1_0 @ ( esk1_2 @ X3 @ X4 ) @ ( esk2_2 @ X3 @ X4 ) )
| ( X4 @ X14 )
| ~ ( epred1_0 @ X3 @ X14 ) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_20,negated_conjecture,
epred1_0 @ esk3_0 @ esk4_0,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_21,negated_conjecture,
! [X3: $i,X14: $i] :
( ( ( esk2_2 @ X3
@ ^ [Z0: $i] : ( Z0 != X14 ) )
= X14 )
| ~ ( epred1_0 @ X3 @ X14 ) ),
inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]),c_0_18]) ).
thf(c_0_22,negated_conjecture,
! [X4: $i > $o] :
( ( epred1_0 @ ( esk1_2 @ esk3_0 @ X4 ) @ ( esk2_2 @ esk3_0 @ X4 ) )
| ( X4 @ esk4_0 ) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
thf(c_0_23,negated_conjecture,
( ( esk2_2 @ esk3_0
@ ^ [Z0: $i] : ( Z0 != esk4_0 ) )
= esk4_0 ),
inference(spm,[status(thm)],[c_0_21,c_0_20]) ).
thf(c_0_24,negated_conjecture,
! [X3: $i] :
( ~ ( epred1_0 @ esk3_0 @ X3 )
| ~ ( epred1_0 @ X3 @ esk4_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_25,negated_conjecture,
( epred1_0
@ ( esk1_2 @ esk3_0
@ ^ [Z0: $i] : ( Z0 != esk4_0 ) )
@ esk4_0 ),
inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23])])]) ).
thf(c_0_26,negated_conjecture,
! [X4: $i > $o,X3: $i,X14: $i] :
( ( epred1_0 @ X3 @ ( esk1_2 @ X3 @ X4 ) )
| ( X4 @ X14 )
| ~ ( epred1_0 @ X3 @ X14 ) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_27,negated_conjecture,
~ ( epred1_0 @ esk3_0
@ ( esk1_2 @ esk3_0
@ ^ [Z0: $i] : ( Z0 != esk4_0 ) ) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
thf(c_0_28,negated_conjecture,
! [X4: $i > $o] :
( ( epred1_0 @ esk3_0 @ ( esk1_2 @ esk3_0 @ X4 ) )
| ( X4 @ esk4_0 ) ),
inference(spm,[status(thm)],[c_0_26,c_0_20]) ).
thf(c_0_29,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28])])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : LCL716^1 : TPTP v8.2.0. Bugfixed v5.0.0.
% 0.03/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n026.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon May 20 01:42:53 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.19/0.46 Running higher-order theorem proving
% 0.19/0.46 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.19/0.48 # Version: 3.1.0-ho
% 0.19/0.48 # Preprocessing class: HSMSSMSSMLMNHHN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting ehoh_best2_full_lfho with 1500s (5) cores
% 0.19/0.48 # Starting lpo9_lambda_fix with 300s (1) cores
% 0.19/0.48 # Starting sh5l with 300s (1) cores
% 0.19/0.48 # Starting ho_unfolding_6 with 300s (1) cores
% 0.19/0.48 # ehoh_best2_full_lfho with pid 10463 completed with status 0
% 0.19/0.48 # Result found by ehoh_best2_full_lfho
% 0.19/0.48 # Preprocessing class: HSMSSMSSMLMNHHN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting ehoh_best2_full_lfho with 1500s (5) cores
% 0.19/0.48 # No SInE strategy applied
% 0.19/0.48 # Search class: HGHNF-FFSF22-SHHSMMBN
% 0.19/0.48 # partial match(1): HGUNF-FFSF22-SHHSMMBN
% 0.19/0.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.48 # Starting new_ho_10 with 811s (1) cores
% 0.19/0.48 # Starting ehoh_best2_full_lfho with 151s (1) cores
% 0.19/0.48 # Starting new_bool_1 with 136s (1) cores
% 0.19/0.48 # Starting new_bool_2 with 136s (1) cores
% 0.19/0.48 # Starting new_bool_9 with 136s (1) cores
% 0.19/0.48 # ehoh_best2_full_lfho with pid 10470 completed with status 0
% 0.19/0.48 # Result found by ehoh_best2_full_lfho
% 0.19/0.48 # Preprocessing class: HSMSSMSSMLMNHHN.
% 0.19/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.19/0.48 # Starting ehoh_best2_full_lfho with 1500s (5) cores
% 0.19/0.48 # No SInE strategy applied
% 0.19/0.48 # Search class: HGHNF-FFSF22-SHHSMMBN
% 0.19/0.48 # partial match(1): HGUNF-FFSF22-SHHSMMBN
% 0.19/0.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.19/0.48 # Starting new_ho_10 with 811s (1) cores
% 0.19/0.48 # Starting ehoh_best2_full_lfho with 151s (1) cores
% 0.19/0.48 # Preprocessing time : 0.001 s
% 0.19/0.48
% 0.19/0.48 # Proof found!
% 0.19/0.48 # SZS status Theorem
% 0.19/0.48 # SZS output start CNFRefutation
% See solution above
% 0.19/0.48 # Parsed axioms : 64
% 0.19/0.48 # Removed by relevancy pruning/SinE : 0
% 0.19/0.48 # Initial clauses : 37
% 0.19/0.48 # Removed in clause preprocessing : 32
% 0.19/0.48 # Initial clauses in saturation : 5
% 0.19/0.48 # Processed clauses : 19
% 0.19/0.48 # ...of these trivial : 0
% 0.19/0.48 # ...subsumed : 1
% 0.19/0.48 # ...remaining for further processing : 18
% 0.19/0.48 # Other redundant clauses eliminated : 2
% 0.19/0.48 # Clauses deleted for lack of memory : 0
% 0.19/0.48 # Backward-subsumed : 0
% 0.19/0.48 # Backward-rewritten : 0
% 0.19/0.48 # Generated clauses : 101
% 0.19/0.48 # ...of the previous two non-redundant : 81
% 0.19/0.48 # ...aggressively subsumed : 0
% 0.19/0.48 # Contextual simplify-reflections : 0
% 0.19/0.48 # Paramodulations : 51
% 0.19/0.48 # Factorizations : 2
% 0.19/0.48 # NegExts : 0
% 0.19/0.48 # Equation resolutions : 2
% 0.19/0.48 # Disequality decompositions : 0
% 0.19/0.48 # Total rewrite steps : 6
% 0.19/0.48 # ...of those cached : 4
% 0.19/0.48 # Propositional unsat checks : 0
% 0.19/0.48 # Propositional check models : 0
% 0.19/0.48 # Propositional check unsatisfiable : 0
% 0.19/0.48 # Propositional clauses : 0
% 0.19/0.48 # Propositional clauses after purity: 0
% 0.19/0.48 # Propositional unsat core size : 0
% 0.19/0.48 # Propositional preprocessing time : 0.000
% 0.19/0.48 # Propositional encoding time : 0.000
% 0.19/0.48 # Propositional solver time : 0.000
% 0.19/0.48 # Success case prop preproc time : 0.000
% 0.19/0.48 # Success case prop encoding time : 0.000
% 0.19/0.48 # Success case prop solver time : 0.000
% 0.19/0.48 # Current number of processed clauses : 18
% 0.19/0.48 # Positive orientable unit clauses : 4
% 0.19/0.48 # Positive unorientable unit clauses: 0
% 0.19/0.48 # Negative unit clauses : 2
% 0.19/0.48 # Non-unit-clauses : 12
% 0.19/0.48 # Current number of unprocessed clauses: 66
% 0.19/0.48 # ...number of literals in the above : 174
% 0.19/0.48 # Current number of archived formulas : 0
% 0.19/0.48 # Current number of archived clauses : 0
% 0.19/0.48 # Clause-clause subsumption calls (NU) : 8
% 0.19/0.48 # Rec. Clause-clause subsumption calls : 8
% 0.19/0.48 # Non-unit clause-clause subsumptions : 1
% 0.19/0.48 # Unit Clause-clause subsumption calls : 0
% 0.19/0.48 # Rewrite failures with RHS unbound : 0
% 0.19/0.48 # BW rewrite match attempts : 0
% 0.19/0.48 # BW rewrite match successes : 0
% 0.19/0.48 # Condensation attempts : 0
% 0.19/0.48 # Condensation successes : 0
% 0.19/0.48 # Termbank termtop insertions : 4379
% 0.19/0.48 # Search garbage collected termcells : 605
% 0.19/0.48
% 0.19/0.48 # -------------------------------------------------
% 0.19/0.48 # User time : 0.006 s
% 0.19/0.48 # System time : 0.004 s
% 0.19/0.48 # Total time : 0.010 s
% 0.19/0.48 # Maximum resident set size: 1952 pages
% 0.19/0.48
% 0.19/0.48 # -------------------------------------------------
% 0.19/0.48 # User time : 0.027 s
% 0.19/0.48 # System time : 0.009 s
% 0.19/0.48 # Total time : 0.036 s
% 0.19/0.48 # Maximum resident set size: 1796 pages
% 0.19/0.48 % E---3.1 exiting
% 0.19/0.48 % E exiting
%------------------------------------------------------------------------------