TSTP Solution File: LCL714^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : LCL714^1 : TPTP v8.2.0. Bugfixed v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.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.17s 0.45s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 21
% Syntax : Number of formulae : 40 ( 23 unt; 12 typ; 0 def)
% Number of atoms : 66 ( 25 equ; 0 cnn)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 148 ( 29 ~; 20 |; 6 &; 88 @)
% ( 0 <=>; 5 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 86 ( 86 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 12 usr; 4 con; 0-3 aty)
% Number of variables : 76 ( 41 ^ 35 !; 0 ?; 76 :)
% 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_44,type,
mpartially_functional: ( $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_0: $i ).
thf(decl_55,type,
esk2_0: $i ).
thf(decl_56,type,
esk3_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(mpartially_functional,axiom,
( mpartially_functional
= ( ^ [X13: $i > $i > $o] :
! [X15: $i,X16: $i,X17: $i] :
( ( ( X13 @ X15 @ X16 )
& ( X13 @ X15 @ X17 ) )
=> ( X16 = X17 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax',mpartially_functional) ).
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 @ X18 ) ) ) )
=> ( mpartially_functional @ 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,
( mpartially_functional
= ( ^ [Z0: $i > $i > $o] :
! [X15: $i,X16: $i,X17: $i] :
( ( ( Z0 @ X15 @ X16 )
& ( Z0 @ X15 @ X17 ) )
=> ( X16 = X17 ) ) ) ),
inference(fof_simplification,[status(thm)],[mpartially_functional]) ).
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] :
( ! [X26: $i,X25: $i > $o] :
( ~ ~ ! [X23: $i] :
( ~ ( X13 @ X26 @ X23 )
| ~ ( X25 @ X23 ) )
| ! [X24: $i] :
( ~ ( X13 @ X26 @ X24 )
| ( X25 @ X24 ) ) )
=> ! [X27: $i,X28: $i,X29: $i] :
( ( ( X13 @ X27 @ X28 )
& ( X13 @ X27 @ X29 ) )
=> ( X28 = 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(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,
! [X31: $i,X32: $i > $o,X33: $i,X34: $i] :
( ( ~ ( epred1_0 @ X31 @ X33 )
| ~ ( X32 @ X33 )
| ~ ( epred1_0 @ X31 @ X34 )
| ( X32 @ X34 ) )
& ( epred1_0 @ esk1_0 @ esk2_0 )
& ( epred1_0 @ esk1_0 @ esk3_0 )
& ( esk2_0 != esk3_0 ) ),
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] :
( ( X4 @ X15 )
| ~ ( epred1_0 @ X3 @ X14 )
| ~ ( X4 @ X14 )
| ~ ( epred1_0 @ X3 @ X15 ) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
thf(c_0_22,negated_conjecture,
! [X14: $i,X15: $i,X3: $i] :
( ( X3 = X14 )
| ~ ( epred1_0 @ X15 @ X14 )
| ~ ( epred1_0 @ X15 @ X3 ) ),
inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]),c_0_21]) ).
thf(c_0_23,negated_conjecture,
epred1_0 @ esk1_0 @ esk3_0,
inference(split_conjunct,[status(thm)],[c_0_20]) ).
thf(c_0_24,negated_conjecture,
! [X3: $i] :
( ( X3 = esk3_0 )
| ~ ( epred1_0 @ esk1_0 @ X3 ) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
thf(c_0_25,negated_conjecture,
epred1_0 @ esk1_0 @ esk2_0,
inference(split_conjunct,[status(thm)],[c_0_20]) ).
thf(c_0_26,negated_conjecture,
esk2_0 != esk3_0,
inference(split_conjunct,[status(thm)],[c_0_20]) ).
thf(c_0_27,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.11 % Problem : LCL714^1 : TPTP v8.2.0. Bugfixed v5.0.0.
% 0.08/0.11 % Command : run_E %s %d THM
% 0.11/0.32 % Computer : n018.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 300
% 0.11/0.32 % DateTime : Mon May 20 01:18:38 EDT 2024
% 0.11/0.32 % CPUTime :
% 0.17/0.43 Running higher-order theorem proving
% 0.17/0.43 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.17/0.45 # Version: 3.1.0-ho
% 0.17/0.45 # Preprocessing class: HSMSSMSSMLMNHHN.
% 0.17/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45 # Starting ehoh_best2_full_lfho with 1500s (5) cores
% 0.17/0.45 # Starting lpo9_lambda_fix with 300s (1) cores
% 0.17/0.45 # Starting sh5l with 300s (1) cores
% 0.17/0.45 # Starting ho_unfolding_6 with 300s (1) cores
% 0.17/0.45 # ehoh_best2_full_lfho with pid 23725 completed with status 0
% 0.17/0.45 # Result found by ehoh_best2_full_lfho
% 0.17/0.45 # Preprocessing class: HSMSSMSSMLMNHHN.
% 0.17/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45 # Starting ehoh_best2_full_lfho with 1500s (5) cores
% 0.17/0.45 # No SInE strategy applied
% 0.17/0.45 # Search class: HHUSF-FFSF00-SHHSMSBN
% 0.17/0.45 # partial match(3): HHUNF-FFSF00-SHHSMFNN
% 0.17/0.45 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.45 # Starting new_ho_10 with 811s (1) cores
% 0.17/0.45 # Starting ehoh_best2_full_lfho with 151s (1) cores
% 0.17/0.45 # Starting new_bool_1 with 136s (1) cores
% 0.17/0.45 # Starting new_bool_2 with 136s (1) cores
% 0.17/0.45 # Starting new_bool_9 with 136s (1) cores
% 0.17/0.45 # new_ho_10 with pid 23731 completed with status 9
% 0.17/0.45 # Starting sh5l with 130s (1) cores
% 0.17/0.45 # ehoh_best2_full_lfho with pid 23732 completed with status 0
% 0.17/0.45 # Result found by ehoh_best2_full_lfho
% 0.17/0.45 # Preprocessing class: HSMSSMSSMLMNHHN.
% 0.17/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45 # Starting ehoh_best2_full_lfho with 1500s (5) cores
% 0.17/0.45 # No SInE strategy applied
% 0.17/0.45 # Search class: HHUSF-FFSF00-SHHSMSBN
% 0.17/0.45 # partial match(3): HHUNF-FFSF00-SHHSMFNN
% 0.17/0.45 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.45 # Starting new_ho_10 with 811s (1) cores
% 0.17/0.45 # Starting ehoh_best2_full_lfho with 151s (1) cores
% 0.17/0.45 # Preprocessing time : 0.001 s
% 0.17/0.45
% 0.17/0.45 # Proof found!
% 0.17/0.45 # SZS status Theorem
% 0.17/0.45 # SZS output start CNFRefutation
% See solution above
% 0.17/0.45 # Parsed axioms : 64
% 0.17/0.45 # Removed by relevancy pruning/SinE : 0
% 0.17/0.45 # Initial clauses : 36
% 0.17/0.45 # Removed in clause preprocessing : 32
% 0.17/0.45 # Initial clauses in saturation : 4
% 0.17/0.45 # Processed clauses : 9
% 0.17/0.45 # ...of these trivial : 0
% 0.17/0.45 # ...subsumed : 1
% 0.17/0.45 # ...remaining for further processing : 8
% 0.17/0.45 # Other redundant clauses eliminated : 0
% 0.17/0.45 # Clauses deleted for lack of memory : 0
% 0.17/0.45 # Backward-subsumed : 0
% 0.17/0.45 # Backward-rewritten : 0
% 0.17/0.45 # Generated clauses : 17
% 0.17/0.45 # ...of the previous two non-redundant : 10
% 0.17/0.45 # ...aggressively subsumed : 0
% 0.17/0.45 # Contextual simplify-reflections : 0
% 0.17/0.45 # Paramodulations : 9
% 0.17/0.45 # Factorizations : 0
% 0.17/0.45 # NegExts : 0
% 0.17/0.45 # Equation resolutions : 0
% 0.17/0.45 # Disequality decompositions : 0
% 0.17/0.45 # Total rewrite steps : 8
% 0.17/0.45 # ...of those cached : 6
% 0.17/0.45 # Propositional unsat checks : 0
% 0.17/0.45 # Propositional check models : 0
% 0.17/0.45 # Propositional check unsatisfiable : 0
% 0.17/0.45 # Propositional clauses : 0
% 0.17/0.45 # Propositional clauses after purity: 0
% 0.17/0.45 # Propositional unsat core size : 0
% 0.17/0.45 # Propositional preprocessing time : 0.000
% 0.17/0.45 # Propositional encoding time : 0.000
% 0.17/0.45 # Propositional solver time : 0.000
% 0.17/0.45 # Success case prop preproc time : 0.000
% 0.17/0.45 # Success case prop encoding time : 0.000
% 0.17/0.45 # Success case prop solver time : 0.000
% 0.17/0.45 # Current number of processed clauses : 8
% 0.17/0.45 # Positive orientable unit clauses : 2
% 0.17/0.45 # Positive unorientable unit clauses: 0
% 0.17/0.45 # Negative unit clauses : 1
% 0.17/0.45 # Non-unit-clauses : 5
% 0.17/0.45 # Current number of unprocessed clauses: 5
% 0.17/0.45 # ...number of literals in the above : 18
% 0.17/0.45 # Current number of archived formulas : 0
% 0.17/0.45 # Current number of archived clauses : 0
% 0.17/0.45 # Clause-clause subsumption calls (NU) : 4
% 0.17/0.45 # Rec. Clause-clause subsumption calls : 3
% 0.17/0.45 # Non-unit clause-clause subsumptions : 1
% 0.17/0.45 # Unit Clause-clause subsumption calls : 0
% 0.17/0.45 # Rewrite failures with RHS unbound : 0
% 0.17/0.45 # BW rewrite match attempts : 0
% 0.17/0.45 # BW rewrite match successes : 0
% 0.17/0.45 # Condensation attempts : 0
% 0.17/0.45 # Condensation successes : 0
% 0.17/0.45 # Termbank termtop insertions : 2462
% 0.17/0.45 # Search garbage collected termcells : 547
% 0.17/0.45
% 0.17/0.45 # -------------------------------------------------
% 0.17/0.45 # User time : 0.006 s
% 0.17/0.45 # System time : 0.002 s
% 0.17/0.45 # Total time : 0.008 s
% 0.17/0.45 # Maximum resident set size: 1944 pages
% 0.17/0.45
% 0.17/0.45 # -------------------------------------------------
% 0.17/0.45 # User time : 0.011 s
% 0.17/0.45 # System time : 0.008 s
% 0.17/0.45 # Total time : 0.018 s
% 0.17/0.45 # Maximum resident set size: 1796 pages
% 0.17/0.45 % E---3.1 exiting
% 0.17/0.45 % E exiting
%------------------------------------------------------------------------------