TSTP Solution File: SYO481^6 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO481^6 : TPTP v8.2.0. Released v4.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 : Tue May 21 08:46:23 EDT 2024
% Result : Theorem 0.23s 0.49s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 21
% Syntax : Number of formulae : 34 ( 18 unt; 13 typ; 0 def)
% Number of atoms : 53 ( 22 equ; 0 cnn)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 62 ( 11 ~; 8 |; 2 &; 41 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 2 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 47 ( 47 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 12 usr; 5 con; 0-3 aty)
% Number of variables : 46 ( 36 ^ 10 !; 0 ?; 46 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
mu: $tType ).
thf(decl_22,type,
meq_ind: mu > mu > $i > $o ).
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_31,type,
mforall_ind: ( mu > $i > $o ) > $i > $o ).
thf(decl_49,type,
mvalid: ( $i > $o ) > $o ).
thf(decl_53,type,
rel_s5: $i > $i > $o ).
thf(decl_54,type,
mbox_s5: ( $i > $o ) > $i > $o ).
thf(decl_56,type,
esk1_0: $i ).
thf(decl_57,type,
esk2_0: mu ).
thf(decl_58,type,
esk3_0: mu ).
thf(decl_59,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(meq_ind,axiom,
( meq_ind
= ( ^ [X1: mu,X2: mu,X3: $i] : ( X1 = X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax',meq_ind) ).
thf(mforall_ind,axiom,
( mforall_ind
= ( ^ [X8: mu > $i > $o,X3: $i] :
! [X1: mu] : ( X8 @ X1 @ X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax',mforall_ind) ).
thf(mvalid,axiom,
( mvalid
= ( ^ [X6: $i > $o] :
! [X3: $i] : ( X6 @ X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax',mvalid) ).
thf(mbox_s5,axiom,
( mbox_s5
= ( ^ [X6: $i > $o,X3: $i] :
! [X14: $i] :
( ~ ( rel_s5 @ X3 @ X14 )
| ( X6 @ X14 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^6.ax',mbox_s5) ).
thf(prove,conjecture,
( mvalid
@ ( mforall_ind
@ ^ [X1: mu] :
( mforall_ind
@ ^ [X2: mu] : ( mimplies @ ( mnot @ ( meq_ind @ X1 @ X2 ) ) @ ( mbox_s5 @ ( mnot @ ( meq_ind @ X1 @ X2 ) ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove) ).
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,
( meq_ind
= ( ^ [Z0: mu,Z1: mu,Z2: $i] : Z0 ) ),
inference(fof_simplification,[status(thm)],[meq_ind]) ).
thf(c_0_12,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_13,plain,
( mforall_ind
= ( ^ [Z0: mu > $i > $o,Z1: $i] :
! [X1: mu] : ( Z0 @ X1 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mforall_ind]) ).
thf(c_0_14,plain,
( mvalid
= ( ^ [Z0: $i > $o] :
! [X3: $i] : ( Z0 @ X3 ) ) ),
inference(fof_simplification,[status(thm)],[mvalid]) ).
thf(c_0_15,plain,
( mbox_s5
= ( ^ [Z0: $i > $o,Z1: $i] :
! [X14: $i] :
( ~ ( rel_s5 @ Z1 @ X14 )
| ( Z0 @ X14 ) ) ) ),
inference(fof_simplification,[status(thm)],[mbox_s5]) ).
thf(c_0_16,negated_conjecture,
~ ! [X31: $i,X30: mu,X29: mu] :
( ( X30 = X29 )
| ! [X28: $i] :
( ~ ( rel_s5 @ X31 @ X28 )
| ( X30 != X29 ) ) ),
inference(fof_simplification,[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(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[prove])]),c_0_11]),c_0_9]),c_0_12]),c_0_13]),c_0_14]),c_0_15])]) ).
thf(c_0_17,negated_conjecture,
( ( esk2_0 != esk3_0 )
& ( rel_s5 @ esk1_0 @ esk4_0 )
& ( esk2_0 = esk3_0 ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])])]) ).
thf(c_0_18,negated_conjecture,
esk2_0 != esk3_0,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_19,negated_conjecture,
esk2_0 = esk3_0,
inference(split_conjunct,[status(thm)],[c_0_17]) ).
thf(c_0_20,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SYO481^6 : TPTP v8.2.0. Released v4.0.0.
% 0.11/0.14 % Command : run_E %s %d THM
% 0.15/0.37 % Computer : n026.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Mon May 20 10:17:08 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.23/0.48 Running higher-order theorem proving
% 0.23/0.48 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.23/0.49 # Version: 3.1.0-ho
% 0.23/0.49 # Preprocessing class: HSMSSMSSMLMNHSN.
% 0.23/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.49 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.23/0.49 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.23/0.49 # Starting almost_fo_3_lam with 300s (1) cores
% 0.23/0.49 # Starting post_as_ho1 with 300s (1) cores
% 0.23/0.49 # ehoh_best2_full_lfho with pid 1955 completed with status 0
% 0.23/0.49 # Result found by ehoh_best2_full_lfho
% 0.23/0.49 # Preprocessing class: HSMSSMSSMLMNHSN.
% 0.23/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.49 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.23/0.49 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.23/0.49 # No SInE strategy applied
% 0.23/0.49 # Search class: HHUSF-FFSF00-SHSSMFNN
% 0.23/0.49 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.49 # Starting new_ho_10 with 163s (1) cores
% 0.23/0.49 # new_ho_10 with pid 1959 completed with status 0
% 0.23/0.49 # Result found by new_ho_10
% 0.23/0.49 # Preprocessing class: HSMSSMSSMLMNHSN.
% 0.23/0.49 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.49 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.23/0.49 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.23/0.49 # No SInE strategy applied
% 0.23/0.49 # Search class: HHUSF-FFSF00-SHSSMFNN
% 0.23/0.49 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.49 # Starting new_ho_10 with 163s (1) cores
% 0.23/0.49 # Preprocessing time : 0.001 s
% 0.23/0.49 # Presaturation interreduction done
% 0.23/0.49
% 0.23/0.49 # Proof found!
% 0.23/0.49 # SZS status Theorem
% 0.23/0.49 # SZS output start CNFRefutation
% See solution above
% 0.23/0.49 # Parsed axioms : 72
% 0.23/0.49 # Removed by relevancy pruning/SinE : 0
% 0.23/0.49 # Initial clauses : 41
% 0.23/0.49 # Removed in clause preprocessing : 35
% 0.23/0.49 # Initial clauses in saturation : 6
% 0.23/0.49 # Processed clauses : 2
% 0.23/0.49 # ...of these trivial : 0
% 0.23/0.49 # ...subsumed : 0
% 0.23/0.49 # ...remaining for further processing : 1
% 0.23/0.49 # Other redundant clauses eliminated : 0
% 0.23/0.49 # Clauses deleted for lack of memory : 0
% 0.23/0.49 # Backward-subsumed : 0
% 0.23/0.49 # Backward-rewritten : 0
% 0.23/0.49 # Generated clauses : 0
% 0.23/0.49 # ...of the previous two non-redundant : 0
% 0.23/0.49 # ...aggressively subsumed : 0
% 0.23/0.49 # Contextual simplify-reflections : 0
% 0.23/0.49 # Paramodulations : 0
% 0.23/0.49 # Factorizations : 0
% 0.23/0.49 # NegExts : 0
% 0.23/0.49 # Equation resolutions : 0
% 0.23/0.49 # Disequality decompositions : 0
% 0.23/0.49 # Total rewrite steps : 1
% 0.23/0.49 # ...of those cached : 0
% 0.23/0.49 # Propositional unsat checks : 0
% 0.23/0.49 # Propositional check models : 0
% 0.23/0.49 # Propositional check unsatisfiable : 0
% 0.23/0.49 # Propositional clauses : 0
% 0.23/0.49 # Propositional clauses after purity: 0
% 0.23/0.49 # Propositional unsat core size : 0
% 0.23/0.49 # Propositional preprocessing time : 0.000
% 0.23/0.49 # Propositional encoding time : 0.000
% 0.23/0.49 # Propositional solver time : 0.000
% 0.23/0.49 # Success case prop preproc time : 0.000
% 0.23/0.49 # Success case prop encoding time : 0.000
% 0.23/0.49 # Success case prop solver time : 0.000
% 0.23/0.49 # Current number of processed clauses : 1
% 0.23/0.49 # Positive orientable unit clauses : 1
% 0.23/0.49 # Positive unorientable unit clauses: 0
% 0.23/0.49 # Negative unit clauses : 0
% 0.23/0.49 # Non-unit-clauses : 0
% 0.23/0.49 # Current number of unprocessed clauses: 4
% 0.23/0.49 # ...number of literals in the above : 7
% 0.23/0.49 # Current number of archived formulas : 0
% 0.23/0.49 # Current number of archived clauses : 0
% 0.23/0.49 # Clause-clause subsumption calls (NU) : 0
% 0.23/0.49 # Rec. Clause-clause subsumption calls : 0
% 0.23/0.49 # Non-unit clause-clause subsumptions : 0
% 0.23/0.49 # Unit Clause-clause subsumption calls : 0
% 0.23/0.49 # Rewrite failures with RHS unbound : 0
% 0.23/0.49 # BW rewrite match attempts : 0
% 0.23/0.49 # BW rewrite match successes : 0
% 0.23/0.49 # Condensation attempts : 2
% 0.23/0.49 # Condensation successes : 0
% 0.23/0.49 # Termbank termtop insertions : 2350
% 0.23/0.49 # Search garbage collected termcells : 496
% 0.23/0.49
% 0.23/0.49 # -------------------------------------------------
% 0.23/0.49 # User time : 0.005 s
% 0.23/0.49 # System time : 0.001 s
% 0.23/0.49 # Total time : 0.005 s
% 0.23/0.49 # Maximum resident set size: 1912 pages
% 0.23/0.49
% 0.23/0.49 # -------------------------------------------------
% 0.23/0.49 # User time : 0.006 s
% 0.23/0.49 # System time : 0.003 s
% 0.23/0.49 # Total time : 0.010 s
% 0.23/0.49 # Maximum resident set size: 1804 pages
% 0.23/0.49 % E---3.1 exiting
% 0.23/0.49 % E exiting
%------------------------------------------------------------------------------