TSTP Solution File: LCL720^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : LCL720^1 : TPTP v8.2.0. Bugfixed v5.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n012.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:14 EDT 2024
% Result : Theorem 0.14s 0.40s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 16
% Syntax : Number of formulae : 30 ( 14 unt; 10 typ; 0 def)
% Number of atoms : 61 ( 11 equ; 0 cnn)
% Maximal formula atoms : 11 ( 3 avg)
% Number of connectives : 108 ( 22 ~; 19 |; 3 &; 64 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 38 ( 38 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 10 usr; 3 con; 0-3 aty)
% Number of variables : 37 ( 24 ^ 13 !; 0 ?; 37 :)
% 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_49,type,
mvalid: ( $i > $o ) > $o ).
thf(decl_53,type,
rel_k: $i > $i > $o ).
thf(decl_54,type,
mbox_k: ( $i > $o ) > $i > $o ).
thf(decl_56,type,
phi: $i > $o ).
thf(decl_57,type,
psi: $i > $o ).
thf(decl_58,type,
esk1_0: $i ).
thf(decl_59,type,
esk2_0: $i ).
thf(mimplies,axiom,
( mimplies
= ( ^ [X6: $i > $o,X7: $i > $o] : ( mor @ ( mnot @ X6 ) @ X7 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mimplies) ).
thf(mnot,axiom,
( mnot
= ( ^ [X6: $i > $o,X3: $i] :
~ ( X6 @ X3 ) ) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/LCL013^0.ax',mor) ).
thf(mvalid,axiom,
( mvalid
= ( ^ [X6: $i > $o] :
! [X3: $i] : ( X6 @ X3 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mvalid) ).
thf(mbox_k,axiom,
( mbox_k
= ( ^ [X6: $i > $o,X3: $i] :
! [X14: $i] :
( ~ ( rel_k @ X3 @ X14 )
| ( X6 @ X14 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^1.ax',mbox_k) ).
thf(conj,conjecture,
mvalid @ ( mimplies @ ( mbox_k @ ( mimplies @ phi @ psi ) ) @ ( mimplies @ ( mbox_k @ phi ) @ ( mbox_k @ psi ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj) ).
thf(c_0_6,plain,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimplies]) ).
thf(c_0_7,plain,
( mnot
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ( Z0 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mnot]) ).
thf(c_0_8,plain,
( mor
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mor]) ).
thf(c_0_9,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_6,c_0_7]),c_0_8]) ).
thf(c_0_10,plain,
( mvalid
= ( ^ [Z0: $i > $o] :
! [X3: $i] : ( Z0 @ X3 ) ) ),
inference(fof_simplification,[status(thm)],[mvalid]) ).
thf(c_0_11,plain,
( mbox_k
= ( ^ [Z0: $i > $o,Z1: $i] :
! [X14: $i] :
( ~ ( rel_k @ Z1 @ X14 )
| ( Z0 @ X14 ) ) ) ),
inference(fof_simplification,[status(thm)],[mbox_k]) ).
thf(c_0_12,negated_conjecture,
~ ! [X25: $i] :
( ~ ! [X22: $i] :
( ~ ( rel_k @ X25 @ X22 )
| ~ ( phi @ X22 )
| ( psi @ X22 ) )
| ~ ! [X23: $i] :
( ~ ( rel_k @ X25 @ X23 )
| ( phi @ X23 ) )
| ! [X24: $i] :
( ~ ( rel_k @ X25 @ X24 )
| ( psi @ X24 ) ) ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[conj]),c_0_9]),c_0_10]),c_0_11])]) ).
thf(c_0_13,negated_conjecture,
! [X27: $i,X28: $i] :
( ( ~ ( rel_k @ esk1_0 @ X27 )
| ~ ( phi @ X27 )
| ( psi @ X27 ) )
& ( ~ ( rel_k @ esk1_0 @ X28 )
| ( phi @ X28 ) )
& ( rel_k @ esk1_0 @ esk2_0 )
& ~ ( psi @ esk2_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_12])])])])]) ).
thf(c_0_14,negated_conjecture,
! [X3: $i] :
( ( psi @ X3 )
| ~ ( rel_k @ esk1_0 @ X3 )
| ~ ( phi @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_15,negated_conjecture,
! [X3: $i] :
( ( phi @ X3 )
| ~ ( rel_k @ esk1_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_16,negated_conjecture,
! [X3: $i] :
( ( psi @ X3 )
| ~ ( rel_k @ esk1_0 @ X3 ) ),
inference(csr,[status(thm)],[c_0_14,c_0_15]) ).
thf(c_0_17,negated_conjecture,
rel_k @ esk1_0 @ esk2_0,
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_18,negated_conjecture,
~ ( psi @ esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_19,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.09 % Problem : LCL720^1 : TPTP v8.2.0. Bugfixed v5.0.0.
% 0.02/0.10 % Command : run_E %s %d THM
% 0.09/0.29 % Computer : n012.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Mon May 20 03:22:07 EDT 2024
% 0.09/0.29 % CPUTime :
% 0.14/0.39 Running higher-order theorem proving
% 0.14/0.39 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.14/0.40 # Version: 3.1.0-ho
% 0.14/0.40 # Preprocessing class: HSMSSMSSMLMNHSN.
% 0.14/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.40 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.14/0.40 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.14/0.40 # Starting almost_fo_3_lam with 300s (1) cores
% 0.14/0.40 # Starting post_as_ho1 with 300s (1) cores
% 0.14/0.40 # ehoh_best2_full_lfho with pid 4219 completed with status 0
% 0.14/0.40 # Result found by ehoh_best2_full_lfho
% 0.14/0.40 # Preprocessing class: HSMSSMSSMLMNHSN.
% 0.14/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.40 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.14/0.40 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.14/0.40 # No SInE strategy applied
% 0.14/0.40 # Search class: HHUNF-FFSF00-SHSSMFNN
% 0.14/0.40 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.40 # Starting new_ho_10 with 163s (1) cores
% 0.14/0.40 # new_ho_10 with pid 4223 completed with status 0
% 0.14/0.40 # Result found by new_ho_10
% 0.14/0.40 # Preprocessing class: HSMSSMSSMLMNHSN.
% 0.14/0.40 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.40 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.14/0.40 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.14/0.40 # No SInE strategy applied
% 0.14/0.40 # Search class: HHUNF-FFSF00-SHSSMFNN
% 0.14/0.40 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.14/0.40 # Starting new_ho_10 with 163s (1) cores
% 0.14/0.40 # Preprocessing time : 0.001 s
% 0.14/0.40 # Presaturation interreduction done
% 0.14/0.40
% 0.14/0.40 # Proof found!
% 0.14/0.40 # SZS status Theorem
% 0.14/0.40 # SZS output start CNFRefutation
% See solution above
% 0.14/0.40 # Parsed axioms : 71
% 0.14/0.40 # Removed by relevancy pruning/SinE : 0
% 0.14/0.40 # Initial clauses : 41
% 0.14/0.40 # Removed in clause preprocessing : 37
% 0.14/0.40 # Initial clauses in saturation : 4
% 0.14/0.40 # Processed clauses : 8
% 0.14/0.40 # ...of these trivial : 0
% 0.14/0.40 # ...subsumed : 0
% 0.14/0.40 # ...remaining for further processing : 8
% 0.14/0.40 # Other redundant clauses eliminated : 0
% 0.14/0.40 # Clauses deleted for lack of memory : 0
% 0.14/0.40 # Backward-subsumed : 0
% 0.14/0.40 # Backward-rewritten : 0
% 0.14/0.40 # Generated clauses : 2
% 0.14/0.40 # ...of the previous two non-redundant : 1
% 0.14/0.40 # ...aggressively subsumed : 0
% 0.14/0.40 # Contextual simplify-reflections : 1
% 0.14/0.40 # Paramodulations : 2
% 0.14/0.40 # Factorizations : 0
% 0.14/0.40 # NegExts : 0
% 0.14/0.40 # Equation resolutions : 0
% 0.14/0.40 # Disequality decompositions : 0
% 0.14/0.40 # Total rewrite steps : 0
% 0.14/0.40 # ...of those cached : 0
% 0.14/0.40 # Propositional unsat checks : 0
% 0.14/0.40 # Propositional check models : 0
% 0.14/0.40 # Propositional check unsatisfiable : 0
% 0.14/0.40 # Propositional clauses : 0
% 0.14/0.40 # Propositional clauses after purity: 0
% 0.14/0.40 # Propositional unsat core size : 0
% 0.14/0.40 # Propositional preprocessing time : 0.000
% 0.14/0.40 # Propositional encoding time : 0.000
% 0.14/0.40 # Propositional solver time : 0.000
% 0.14/0.40 # Success case prop preproc time : 0.000
% 0.14/0.40 # Success case prop encoding time : 0.000
% 0.14/0.40 # Success case prop solver time : 0.000
% 0.14/0.40 # Current number of processed clauses : 4
% 0.14/0.40 # Positive orientable unit clauses : 1
% 0.14/0.40 # Positive unorientable unit clauses: 0
% 0.14/0.40 # Negative unit clauses : 1
% 0.14/0.40 # Non-unit-clauses : 2
% 0.14/0.40 # Current number of unprocessed clauses: 1
% 0.14/0.40 # ...number of literals in the above : 1
% 0.14/0.40 # Current number of archived formulas : 0
% 0.14/0.40 # Current number of archived clauses : 4
% 0.14/0.40 # Clause-clause subsumption calls (NU) : 1
% 0.14/0.40 # Rec. Clause-clause subsumption calls : 1
% 0.14/0.40 # Non-unit clause-clause subsumptions : 1
% 0.14/0.40 # Unit Clause-clause subsumption calls : 0
% 0.14/0.40 # Rewrite failures with RHS unbound : 0
% 0.14/0.40 # BW rewrite match attempts : 0
% 0.14/0.40 # BW rewrite match successes : 0
% 0.14/0.40 # Condensation attempts : 8
% 0.14/0.40 # Condensation successes : 0
% 0.14/0.40 # Termbank termtop insertions : 2254
% 0.14/0.40 # Search garbage collected termcells : 433
% 0.14/0.40
% 0.14/0.40 # -------------------------------------------------
% 0.14/0.40 # User time : 0.005 s
% 0.14/0.40 # System time : 0.000 s
% 0.14/0.40 # Total time : 0.005 s
% 0.14/0.40 # Maximum resident set size: 1916 pages
% 0.14/0.40
% 0.14/0.40 # -------------------------------------------------
% 0.14/0.40 # User time : 0.007 s
% 0.14/0.40 # System time : 0.001 s
% 0.14/0.40 # Total time : 0.008 s
% 0.14/0.40 # Maximum resident set size: 1800 pages
% 0.14/0.40 % E---3.1 exiting
% 0.14/0.40 % E exiting
%------------------------------------------------------------------------------