TSTP Solution File: LCL713^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : LCL713^1 : TPTP v8.2.0. Bugfixed v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n028.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:12 EDT 2024
% Result : Theorem 1.10s 0.59s
% Output : CNFRefutation 1.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 22
% Syntax : Number of formulae : 45 ( 23 unt; 13 typ; 0 def)
% Number of atoms : 75 ( 18 equ; 0 cnn)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 255 ( 46 ~; 34 |; 7 &; 163 @)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 95 ( 95 >; 0 *; 0 +; 0 <<)
% Number of symbols : 15 ( 13 usr; 4 con; 0-3 aty)
% Number of variables : 93 ( 45 ^ 48 !; 0 ?; 93 :)
% 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_38,type,
mdia: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_43,type,
meuclidean: ( $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_3: $i > ( $i > $o ) > $i > $i ).
thf(decl_55,type,
esk2_0: $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(mdia,axiom,
( mdia
= ( ^ [X13: $i > $i > $o,X6: $i > $o] : ( mnot @ ( mbox @ X13 @ ( mnot @ X6 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax',mdia) ).
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(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(meuclidean,axiom,
( meuclidean
= ( ^ [X13: $i > $i > $o] :
! [X15: $i,X16: $i,X17: $i] :
( ( ( X13 @ X15 @ X16 )
& ( X13 @ X15 @ X17 ) )
=> ( X13 @ X16 @ X17 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax',meuclidean) ).
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 @ ( mdia @ X13 @ X18 ) @ ( mbox @ X13 @ ( mdia @ X13 @ X18 ) ) ) ) )
=> ( meuclidean @ X13 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).
thf(c_0_9,plain,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimplies]) ).
thf(c_0_10,plain,
( mnot
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ( Z0 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mnot]) ).
thf(c_0_11,plain,
( mor
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mor]) ).
thf(c_0_12,plain,
( mdia
= ( ^ [Z0: $i > $i > $o,Z1: $i > $o,Z2: $i] :
~ ! [X22: $i] :
( ~ ( Z0 @ Z2 @ X22 )
| ~ ( Z1 @ X22 ) ) ) ),
inference(fof_simplification,[status(thm)],[mdia]) ).
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,
( 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_9,c_0_10]),c_0_11]) ).
thf(c_0_15,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_16,plain,
( mdia
= ( ^ [Z0: $i > $i > $o,Z1: $i > $o,Z2: $i] :
~ ! [X22: $i] :
( ~ ( Z0 @ Z2 @ X22 )
| ~ ( Z1 @ X22 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_12,c_0_10]),c_0_13]) ).
thf(c_0_17,plain,
( meuclidean
= ( ^ [Z0: $i > $i > $o] :
! [X15: $i,X16: $i,X17: $i] :
( ( ( Z0 @ X15 @ X16 )
& ( Z0 @ X15 @ X17 ) )
=> ( Z0 @ X16 @ X17 ) ) ) ),
inference(fof_simplification,[status(thm)],[meuclidean]) ).
thf(c_0_18,plain,
( mvalid
= ( ^ [Z0: $i > $o] :
! [X3: $i] : ( Z0 @ X3 ) ) ),
inference(fof_simplification,[status(thm)],[mvalid]) ).
thf(c_0_19,negated_conjecture,
~ ! [X13: $i > $i > $o] :
( ! [X27: $i,X26: $i > $o] :
( ~ ~ ! [X23: $i] :
( ~ ( X13 @ X27 @ X23 )
| ~ ( X26 @ X23 ) )
| ! [X25: $i] :
( ~ ( X13 @ X27 @ X25 )
| ~ ! [X24: $i] :
( ~ ( X13 @ X25 @ X24 )
| ~ ( X26 @ X24 ) ) ) )
=> ! [X28: $i,X29: $i,X30: $i] :
( ( ( X13 @ X28 @ X29 )
& ( X13 @ X28 @ X30 ) )
=> ( X13 @ X29 @ X30 ) ) ),
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)],[conj])]),c_0_14]),c_0_15]),c_0_13]),c_0_16]),c_0_17]),c_0_18]) ).
thf(c_0_20,negated_conjecture,
! [X32: $i,X33: $i > $o,X34: $i,X35: $i] :
( ( ( epred1_0 @ X35 @ ( esk1_3 @ X32 @ X33 @ X35 ) )
| ~ ( epred1_0 @ X32 @ X35 )
| ~ ( epred1_0 @ X32 @ X34 )
| ~ ( X33 @ X34 ) )
& ( ( X33 @ ( esk1_3 @ X32 @ X33 @ X35 ) )
| ~ ( epred1_0 @ X32 @ X35 )
| ~ ( epred1_0 @ X32 @ X34 )
| ~ ( X33 @ X34 ) )
& ( epred1_0 @ esk2_0 @ esk3_0 )
& ( epred1_0 @ esk2_0 @ esk4_0 )
& ~ ( epred1_0 @ esk3_0 @ 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)],[c_0_19])])])])])]) ).
thf(c_0_21,negated_conjecture,
! [X14: $i,X3: $i,X4: $i > $o,X15: $i] :
( ( epred1_0 @ X3 @ ( esk1_3 @ X14 @ X4 @ X3 ) )
| ~ ( epred1_0 @ X14 @ X3 )
| ~ ( epred1_0 @ X14 @ X15 )
| ~ ( X4 @ X15 ) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
thf(c_0_22,negated_conjecture,
! [X14: $i,X15: $i,X4: $i > $o,X3: $i] :
( ( epred1_0 @ X3
@ ( esk1_3 @ X14
@ ^ [Z0: $i] :
~ ( X4 @ Z0 )
@ X3 ) )
| ( X4 @ X15 )
| ~ ( epred1_0 @ X14 @ X15 )
| ~ ( epred1_0 @ X14 @ X3 ) ),
inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[]),c_0_21]) ).
thf(c_0_23,negated_conjecture,
epred1_0 @ esk2_0 @ esk4_0,
inference(split_conjunct,[status(thm)],[c_0_20]) ).
thf(c_0_24,negated_conjecture,
! [X14: $i,X3: $i,X4: $i > $o,X15: $i] :
( ( X4 @ ( esk1_3 @ X3 @ X4 @ X14 ) )
| ~ ( epred1_0 @ X3 @ X14 )
| ~ ( epred1_0 @ X3 @ X15 )
| ~ ( X4 @ X15 ) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
thf(c_0_25,negated_conjecture,
! [X4: $i > $o,X3: $i] :
( ( epred1_0 @ X3
@ ( esk1_3 @ esk2_0
@ ^ [Z0: $i] :
~ ( X4 @ Z0 )
@ X3 ) )
| ( X4 @ esk4_0 )
| ~ ( epred1_0 @ esk2_0 @ X3 ) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
thf(c_0_26,negated_conjecture,
epred1_0 @ esk2_0 @ esk3_0,
inference(split_conjunct,[status(thm)],[c_0_20]) ).
thf(c_0_27,negated_conjecture,
! [X14: $i,X4: $i > $o,X3: $i,X15: $i] :
( ( X4 @ X3 )
| ~ ( X4
@ ( esk1_3 @ X14
@ ^ [Z0: $i] :
~ ( X4 @ Z0 )
@ X15 ) )
| ~ ( epred1_0 @ X14 @ X3 )
| ~ ( epred1_0 @ X14 @ X15 ) ),
inference(primitive_enumeration,[status(thm)],[inference(cn,[status(thm)],[]),c_0_24]) ).
thf(c_0_28,negated_conjecture,
! [X4: $i > $o] :
( ( epred1_0 @ esk3_0
@ ( esk1_3 @ esk2_0
@ ^ [Z0: $i] :
~ ( X4 @ Z0 )
@ esk3_0 ) )
| ( X4 @ esk4_0 ) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
thf(c_0_29,negated_conjecture,
~ ( epred1_0 @ esk3_0 @ esk4_0 ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
thf(c_0_30,negated_conjecture,
! [X3: $i] :
( ( epred1_0 @ esk3_0 @ X3 )
| ~ ( epred1_0 @ esk2_0 @ X3 ) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_26])]),c_0_29]) ).
thf(c_0_31,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_23]),c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL713^1 : TPTP v8.2.0. Bugfixed v5.0.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.15/0.34 % Computer : n028.cluster.edu
% 0.15/0.34 % Model : x86_64 x86_64
% 0.15/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.34 % Memory : 8042.1875MB
% 0.15/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.34 % CPULimit : 300
% 0.15/0.34 % WCLimit : 300
% 0.15/0.34 % DateTime : Mon May 20 02:08:08 EDT 2024
% 0.15/0.34 % CPUTime :
% 0.21/0.47 Running higher-order theorem proving
% 0.21/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
% 1.10/0.59 # Version: 3.1.0-ho
% 1.10/0.59 # Preprocessing class: HSMSSMSSMLMNHHN.
% 1.10/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.10/0.59 # Starting ehoh_best2_full_lfho with 1500s (5) cores
% 1.10/0.59 # Starting lpo9_lambda_fix with 300s (1) cores
% 1.10/0.59 # Starting sh5l with 300s (1) cores
% 1.10/0.59 # Starting ho_unfolding_6 with 300s (1) cores
% 1.10/0.59 # ehoh_best2_full_lfho with pid 8700 completed with status 0
% 1.10/0.59 # Result found by ehoh_best2_full_lfho
% 1.10/0.59 # Preprocessing class: HSMSSMSSMLMNHHN.
% 1.10/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.10/0.59 # Starting ehoh_best2_full_lfho with 1500s (5) cores
% 1.10/0.59 # No SInE strategy applied
% 1.10/0.59 # Search class: HHUNF-FFSF33-SHHSMSBN
% 1.10/0.59 # partial match(2): HGHNF-FFSF33-SHHSMSBN
% 1.10/0.59 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.10/0.59 # Starting new_ho_10 with 811s (1) cores
% 1.10/0.59 # Starting ehoh_best2_full_lfho with 151s (1) cores
% 1.10/0.59 # Starting new_bool_1 with 136s (1) cores
% 1.10/0.59 # Starting new_bool_2 with 136s (1) cores
% 1.10/0.59 # Starting ehoh_best_sine_rwall with 136s (1) cores
% 1.10/0.59 # ehoh_best2_full_lfho with pid 8707 completed with status 0
% 1.10/0.59 # Result found by ehoh_best2_full_lfho
% 1.10/0.59 # Preprocessing class: HSMSSMSSMLMNHHN.
% 1.10/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.10/0.59 # Starting ehoh_best2_full_lfho with 1500s (5) cores
% 1.10/0.59 # No SInE strategy applied
% 1.10/0.59 # Search class: HHUNF-FFSF33-SHHSMSBN
% 1.10/0.59 # partial match(2): HGHNF-FFSF33-SHHSMSBN
% 1.10/0.59 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.10/0.59 # Starting new_ho_10 with 811s (1) cores
% 1.10/0.59 # Starting ehoh_best2_full_lfho with 151s (1) cores
% 1.10/0.59 # Preprocessing time : 0.001 s
% 1.10/0.59
% 1.10/0.59 # Proof found!
% 1.10/0.59 # SZS status Theorem
% 1.10/0.59 # SZS output start CNFRefutation
% See solution above
% 1.10/0.59 # Parsed axioms : 64
% 1.10/0.59 # Removed by relevancy pruning/SinE : 0
% 1.10/0.59 # Initial clauses : 37
% 1.10/0.59 # Removed in clause preprocessing : 32
% 1.10/0.59 # Initial clauses in saturation : 5
% 1.10/0.59 # Processed clauses : 453
% 1.10/0.59 # ...of these trivial : 43
% 1.10/0.59 # ...subsumed : 123
% 1.10/0.59 # ...remaining for further processing : 287
% 1.10/0.59 # Other redundant clauses eliminated : 22
% 1.10/0.59 # Clauses deleted for lack of memory : 0
% 1.10/0.59 # Backward-subsumed : 2
% 1.10/0.59 # Backward-rewritten : 58
% 1.10/0.59 # Generated clauses : 3667
% 1.10/0.59 # ...of the previous two non-redundant : 3389
% 1.10/0.59 # ...aggressively subsumed : 0
% 1.10/0.59 # Contextual simplify-reflections : 0
% 1.10/0.59 # Paramodulations : 3541
% 1.10/0.59 # Factorizations : 0
% 1.10/0.59 # NegExts : 7
% 1.10/0.59 # Equation resolutions : 25
% 1.10/0.59 # Disequality decompositions : 0
% 1.10/0.59 # Total rewrite steps : 1322
% 1.10/0.59 # ...of those cached : 1237
% 1.10/0.59 # Propositional unsat checks : 0
% 1.10/0.59 # Propositional check models : 0
% 1.10/0.59 # Propositional check unsatisfiable : 0
% 1.10/0.59 # Propositional clauses : 0
% 1.10/0.59 # Propositional clauses after purity: 0
% 1.10/0.59 # Propositional unsat core size : 0
% 1.10/0.59 # Propositional preprocessing time : 0.000
% 1.10/0.59 # Propositional encoding time : 0.000
% 1.10/0.59 # Propositional solver time : 0.000
% 1.10/0.59 # Success case prop preproc time : 0.000
% 1.10/0.59 # Success case prop encoding time : 0.000
% 1.10/0.59 # Success case prop solver time : 0.000
% 1.10/0.59 # Current number of processed clauses : 217
% 1.10/0.59 # Positive orientable unit clauses : 103
% 1.10/0.59 # Positive unorientable unit clauses: 0
% 1.10/0.59 # Negative unit clauses : 1
% 1.10/0.59 # Non-unit-clauses : 113
% 1.10/0.59 # Current number of unprocessed clauses: 2935
% 1.10/0.59 # ...number of literals in the above : 6415
% 1.10/0.59 # Current number of archived formulas : 0
% 1.10/0.59 # Current number of archived clauses : 70
% 1.10/0.59 # Clause-clause subsumption calls (NU) : 861
% 1.10/0.59 # Rec. Clause-clause subsumption calls : 674
% 1.10/0.59 # Non-unit clause-clause subsumptions : 112
% 1.10/0.59 # Unit Clause-clause subsumption calls : 508
% 1.10/0.59 # Rewrite failures with RHS unbound : 0
% 1.10/0.59 # BW rewrite match attempts : 731
% 1.10/0.59 # BW rewrite match successes : 30
% 1.10/0.59 # Condensation attempts : 0
% 1.10/0.59 # Condensation successes : 0
% 1.10/0.59 # Termbank termtop insertions : 157723
% 1.10/0.59 # Search garbage collected termcells : 643
% 1.10/0.59
% 1.10/0.59 # -------------------------------------------------
% 1.10/0.59 # User time : 0.099 s
% 1.10/0.59 # System time : 0.007 s
% 1.10/0.59 # Total time : 0.106 s
% 1.10/0.59 # Maximum resident set size: 1964 pages
% 1.10/0.59
% 1.10/0.59 # -------------------------------------------------
% 1.10/0.59 # User time : 0.489 s
% 1.10/0.59 # System time : 0.025 s
% 1.10/0.59 # Total time : 0.515 s
% 1.10/0.59 # Maximum resident set size: 1804 pages
% 1.10/0.59 % E---3.1 exiting
% 1.10/0.59 % E exiting
%------------------------------------------------------------------------------