TSTP Solution File: SYO487^6 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO487^6 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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.52s
% Output : CNFRefutation 0.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 22
% Syntax : Number of formulae : 39 ( 22 unt; 13 typ; 0 def)
% Number of atoms : 71 ( 19 equ; 0 cnn)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 120 ( 30 ~; 13 |; 2 &; 75 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 3 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 62 ( 62 >; 0 *; 0 +; 0 <<)
% Number of symbols : 14 ( 12 usr; 3 con; 0-3 aty)
% Number of variables : 62 ( 41 ^ 21 !; 0 ?; 62 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
mu: $tType ).
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_33,type,
mexists_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_55,type,
mdia_s5: ( $i > $o ) > $i > $o ).
thf(decl_56,type,
f: mu > $i > $o ).
thf(decl_57,type,
esk1_0: $i ).
thf(decl_58,type,
esk2_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(mexists_ind,axiom,
( mexists_ind
= ( ^ [X11: mu > $i > $o] :
( mnot
@ ( mforall_ind
@ ^ [X1: mu] : ( mnot @ ( X11 @ X1 ) ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax',mexists_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(mdia_s5,axiom,
( mdia_s5
= ( ^ [X6: $i > $o] : ( mnot @ ( mbox_s5 @ ( mnot @ X6 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^6.ax',mdia_s5) ).
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(mvalid,axiom,
( mvalid
= ( ^ [X6: $i > $o] :
! [X3: $i] : ( X6 @ X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax',mvalid) ).
thf(prove,conjecture,
( mvalid
@ ( mimplies
@ ( mdia_s5
@ ( mforall_ind
@ ^ [X1: mu] : ( f @ X1 ) ) )
@ ( mexists_ind
@ ^ [X1: mu] : ( mdia_s5 @ ( f @ X1 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove) ).
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,
( mexists_ind
= ( ^ [Z0: mu > $i > $o,Z1: $i] :
~ ! [X18: mu] :
~ ( Z0 @ X18 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mexists_ind]) ).
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,
( mdia_s5
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ! [X21: $i] :
( ~ ( rel_s5 @ Z1 @ X21 )
| ~ ( Z0 @ X21 ) ) ) ),
inference(fof_simplification,[status(thm)],[mdia_s5]) ).
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,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_17,plain,
( mexists_ind
= ( ^ [Z0: mu > $i > $o,Z1: $i] :
~ ! [X18: mu] :
~ ( Z0 @ X18 @ Z1 ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_12,c_0_10]),c_0_13]) ).
thf(c_0_18,plain,
( mvalid
= ( ^ [Z0: $i > $o] :
! [X3: $i] : ( Z0 @ X3 ) ) ),
inference(fof_simplification,[status(thm)],[mvalid]) ).
thf(c_0_19,plain,
( mdia_s5
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ! [X21: $i] :
( ~ ( rel_s5 @ Z1 @ X21 )
| ~ ( Z0 @ X21 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_14,c_0_10]),c_0_15]) ).
thf(c_0_20,negated_conjecture,
~ ! [X32: $i] :
( ~ ~ ! [X29: $i] :
( ~ ( rel_s5 @ X32 @ X29 )
| ~ ! [X28: mu] : ( f @ X28 @ X29 ) )
| ~ ! [X31: mu] :
~ ~ ! [X30: $i] :
( ~ ( rel_s5 @ X32 @ X30 )
| ~ ( f @ X31 @ X30 ) ) ),
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(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[prove])]),c_0_16]),c_0_13]),c_0_17]),c_0_18]),c_0_19])]) ).
thf(c_0_21,negated_conjecture,
! [X41: mu,X42: mu,X43: $i] :
( ( rel_s5 @ esk1_0 @ esk2_0 )
& ( f @ X41 @ esk2_0 )
& ( ~ ( rel_s5 @ esk1_0 @ X43 )
| ~ ( f @ X42 @ X43 ) ) ),
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_20])])])])]) ).
thf(c_0_22,negated_conjecture,
! [X1: mu,X3: $i] :
( ~ ( rel_s5 @ esk1_0 @ X3 )
| ~ ( f @ X1 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
thf(c_0_23,negated_conjecture,
! [X1: mu] : ( f @ X1 @ esk2_0 ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
thf(c_0_24,negated_conjecture,
rel_s5 @ esk1_0 @ esk2_0,
inference(split_conjunct,[status(thm)],[c_0_21]) ).
thf(c_0_25,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SYO487^6 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.15 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n002.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Mon May 20 09:05:08 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.23/0.51 Running higher-order theorem proving
% 0.23/0.51 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.52 # Version: 3.1.0-ho
% 0.23/0.52 # Preprocessing class: HSMSSMSSMLMNHSN.
% 0.23/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.52 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.23/0.52 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.23/0.52 # Starting almost_fo_3_lam with 300s (1) cores
% 0.23/0.52 # Starting post_as_ho1 with 300s (1) cores
% 0.23/0.52 # ehoh_best2_full_lfho with pid 5383 completed with status 0
% 0.23/0.52 # Result found by ehoh_best2_full_lfho
% 0.23/0.52 # Preprocessing class: HSMSSMSSMLMNHSN.
% 0.23/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.52 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.23/0.52 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.23/0.52 # No SInE strategy applied
% 0.23/0.52 # Search class: HHHNS-FFSF00-SHSSMFNN
% 0.23/0.52 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.52 # Starting new_ho_10 with 163s (1) cores
% 0.23/0.52 # new_ho_10 with pid 5388 completed with status 0
% 0.23/0.52 # Result found by new_ho_10
% 0.23/0.52 # Preprocessing class: HSMSSMSSMLMNHSN.
% 0.23/0.52 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.23/0.52 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.23/0.52 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.23/0.52 # No SInE strategy applied
% 0.23/0.52 # Search class: HHHNS-FFSF00-SHSSMFNN
% 0.23/0.52 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.23/0.52 # Starting new_ho_10 with 163s (1) cores
% 0.23/0.52 # Preprocessing time : 0.001 s
% 0.23/0.52 # Presaturation interreduction done
% 0.23/0.52
% 0.23/0.52 # Proof found!
% 0.23/0.52 # SZS status Theorem
% 0.23/0.52 # SZS output start CNFRefutation
% See solution above
% 0.23/0.52 # Parsed axioms : 73
% 0.23/0.52 # Removed by relevancy pruning/SinE : 0
% 0.23/0.52 # Initial clauses : 42
% 0.23/0.52 # Removed in clause preprocessing : 36
% 0.23/0.52 # Initial clauses in saturation : 6
% 0.23/0.52 # Processed clauses : 11
% 0.23/0.52 # ...of these trivial : 0
% 0.23/0.52 # ...subsumed : 0
% 0.23/0.52 # ...remaining for further processing : 11
% 0.23/0.52 # Other redundant clauses eliminated : 0
% 0.23/0.52 # Clauses deleted for lack of memory : 0
% 0.23/0.52 # Backward-subsumed : 0
% 0.23/0.52 # Backward-rewritten : 0
% 0.23/0.52 # Generated clauses : 3
% 0.23/0.52 # ...of the previous two non-redundant : 1
% 0.23/0.52 # ...aggressively subsumed : 0
% 0.23/0.52 # Contextual simplify-reflections : 0
% 0.23/0.52 # Paramodulations : 3
% 0.23/0.52 # Factorizations : 0
% 0.23/0.52 # NegExts : 0
% 0.23/0.52 # Equation resolutions : 0
% 0.23/0.52 # Disequality decompositions : 0
% 0.23/0.52 # Total rewrite steps : 2
% 0.23/0.52 # ...of those cached : 0
% 0.23/0.52 # Propositional unsat checks : 0
% 0.23/0.52 # Propositional check models : 0
% 0.23/0.52 # Propositional check unsatisfiable : 0
% 0.23/0.52 # Propositional clauses : 0
% 0.23/0.52 # Propositional clauses after purity: 0
% 0.23/0.52 # Propositional unsat core size : 0
% 0.23/0.52 # Propositional preprocessing time : 0.000
% 0.23/0.52 # Propositional encoding time : 0.000
% 0.23/0.52 # Propositional solver time : 0.000
% 0.23/0.52 # Success case prop preproc time : 0.000
% 0.23/0.52 # Success case prop encoding time : 0.000
% 0.23/0.52 # Success case prop solver time : 0.000
% 0.23/0.52 # Current number of processed clauses : 5
% 0.23/0.52 # Positive orientable unit clauses : 3
% 0.23/0.52 # Positive unorientable unit clauses: 0
% 0.23/0.52 # Negative unit clauses : 0
% 0.23/0.52 # Non-unit-clauses : 2
% 0.23/0.52 # Current number of unprocessed clauses: 2
% 0.23/0.52 # ...number of literals in the above : 4
% 0.23/0.52 # Current number of archived formulas : 0
% 0.23/0.52 # Current number of archived clauses : 6
% 0.23/0.52 # Clause-clause subsumption calls (NU) : 4
% 0.23/0.52 # Rec. Clause-clause subsumption calls : 4
% 0.23/0.52 # Non-unit clause-clause subsumptions : 0
% 0.23/0.52 # Unit Clause-clause subsumption calls : 0
% 0.23/0.52 # Rewrite failures with RHS unbound : 0
% 0.23/0.52 # BW rewrite match attempts : 3
% 0.23/0.52 # BW rewrite match successes : 0
% 0.23/0.52 # Condensation attempts : 11
% 0.23/0.52 # Condensation successes : 0
% 0.23/0.52 # Termbank termtop insertions : 2464
% 0.23/0.52 # Search garbage collected termcells : 528
% 0.23/0.52
% 0.23/0.52 # -------------------------------------------------
% 0.23/0.52 # User time : 0.005 s
% 0.23/0.52 # System time : 0.002 s
% 0.23/0.52 # Total time : 0.007 s
% 0.23/0.52 # Maximum resident set size: 1912 pages
% 0.23/0.52
% 0.23/0.52 # -------------------------------------------------
% 0.23/0.52 # User time : 0.009 s
% 0.23/0.52 # System time : 0.004 s
% 0.23/0.52 # Total time : 0.012 s
% 0.23/0.52 # Maximum resident set size: 1804 pages
% 0.23/0.52 % E---3.1 exiting
% 0.23/0.53 % E exiting
%------------------------------------------------------------------------------