TSTP Solution File: SYO576^7 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO576^7 : TPTP v8.2.0. Released v5.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n025.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:48:06 EDT 2024
% Result : Theorem 0.20s 0.48s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 25
% Syntax : Number of formulae : 52 ( 23 unt; 14 typ; 0 def)
% Number of atoms : 107 ( 18 equ; 0 cnn)
% Maximal formula atoms : 10 ( 2 avg)
% Number of connectives : 246 ( 48 ~; 33 |; 7 &; 155 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 20 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 59 ( 59 >; 0 *; 0 +; 0 <<)
% Number of symbols : 16 ( 14 usr; 3 con; 0-3 aty)
% Number of variables : 78 ( 33 ^ 45 !; 0 ?; 78 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_24,type,
mnot: ( $i > $o ) > $i > $o ).
thf(decl_25,type,
mor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_31,type,
mimplies: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_40,type,
mreflexive: ( $i > $i > $o ) > $o ).
thf(decl_43,type,
mtransitive: ( $i > $i > $o ) > $o ).
thf(decl_50,type,
mvalid: ( $i > $o ) > $o ).
thf(decl_54,type,
rel_s4: $i > $i > $o ).
thf(decl_55,type,
mbox_s4: ( $i > $o ) > $i > $o ).
thf(decl_56,type,
mdia_s4: ( $i > $o ) > $i > $o ).
thf(decl_57,type,
p: $i > $o ).
thf(decl_59,type,
esk2_0: $i ).
thf(decl_60,type,
esk3_0: $i ).
thf(decl_61,type,
esk4_1: $i > $i ).
thf(decl_62,type,
esk5_1: $i > $i ).
thf(mimplies,axiom,
( mimplies
= ( ^ [X4: $i > $o,X5: $i > $o] : ( mor @ ( mnot @ X4 ) @ X5 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL015^0.ax',mimplies) ).
thf(mnot,axiom,
( mnot
= ( ^ [X4: $i > $o,X3: $i] :
~ ( X4 @ X3 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL015^0.ax',mnot) ).
thf(mor,axiom,
( mor
= ( ^ [X4: $i > $o,X5: $i > $o,X3: $i] :
( ( X4 @ X3 )
| ( X5 @ X3 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL015^0.ax',mor) ).
thf(mdia_s4,axiom,
( mdia_s4
= ( ^ [X4: $i > $o] : ( mnot @ ( mbox_s4 @ ( mnot @ X4 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^5.ax',mdia_s4) ).
thf(mbox_s4,axiom,
( mbox_s4
= ( ^ [X4: $i > $o,X3: $i] :
! [X7: $i] :
( ~ ( rel_s4 @ X3 @ X7 )
| ( X4 @ X7 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^5.ax',mbox_s4) ).
thf(mvalid,axiom,
( mvalid
= ( ^ [X4: $i > $o] :
! [X3: $i] : ( X4 @ X3 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL015^0.ax',mvalid) ).
thf(mtransitive,axiom,
( mtransitive
= ( ^ [X6: $i > $i > $o] :
! [X16: $i,X17: $i,X18: $i] :
( ( ( X6 @ X16 @ X17 )
& ( X6 @ X17 @ X18 ) )
=> ( X6 @ X16 @ X18 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL015^0.ax',mtransitive) ).
thf(con,conjecture,
mvalid @ ( mimplies @ ( mdia_s4 @ ( mbox_s4 @ ( mdia_s4 @ ( mbox_s4 @ p ) ) ) ) @ ( mdia_s4 @ ( mbox_s4 @ p ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
thf(a2,axiom,
mtransitive @ rel_s4,
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^5.ax',a2) ).
thf(mreflexive,axiom,
( mreflexive
= ( ^ [X6: $i > $i > $o] :
! [X16: $i] : ( X6 @ X16 @ X16 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL015^0.ax',mreflexive) ).
thf(a1,axiom,
mreflexive @ rel_s4,
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^5.ax',a1) ).
thf(c_0_11,plain,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimplies]) ).
thf(c_0_12,plain,
( mnot
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ( Z0 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mnot]) ).
thf(c_0_13,plain,
( mor
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mor]) ).
thf(c_0_14,plain,
( mdia_s4
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ! [X28: $i] :
( ~ ( rel_s4 @ Z1 @ X28 )
| ~ ( Z0 @ X28 ) ) ) ),
inference(fof_simplification,[status(thm)],[mdia_s4]) ).
thf(c_0_15,plain,
( mbox_s4
= ( ^ [Z0: $i > $o,Z1: $i] :
! [X7: $i] :
( ~ ( rel_s4 @ Z1 @ X7 )
| ( Z0 @ X7 ) ) ) ),
inference(fof_simplification,[status(thm)],[mbox_s4]) ).
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_11,c_0_12]),c_0_13]) ).
thf(c_0_17,plain,
( mvalid
= ( ^ [Z0: $i > $o] :
! [X3: $i] : ( Z0 @ X3 ) ) ),
inference(fof_simplification,[status(thm)],[mvalid]) ).
thf(c_0_18,plain,
( mdia_s4
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ! [X28: $i] :
( ~ ( rel_s4 @ Z1 @ X28 )
| ~ ( Z0 @ X28 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_14,c_0_12]),c_0_15]) ).
thf(c_0_19,plain,
( mtransitive
= ( ^ [Z0: $i > $i > $o] :
! [X16: $i,X17: $i,X18: $i] :
( ( ( Z0 @ X16 @ X17 )
& ( Z0 @ X17 @ X18 ) )
=> ( Z0 @ X16 @ X18 ) ) ) ),
inference(fof_simplification,[status(thm)],[mtransitive]) ).
thf(c_0_20,negated_conjecture,
~ ! [X39: $i] :
( ~ ~ ! [X36: $i] :
( ~ ( rel_s4 @ X39 @ X36 )
| ~ ! [X35: $i] :
( ~ ( rel_s4 @ X36 @ X35 )
| ~ ! [X34: $i] :
( ~ ( rel_s4 @ X35 @ X34 )
| ~ ! [X33: $i] :
( ~ ( rel_s4 @ X34 @ X33 )
| ( p @ X33 ) ) ) ) )
| ~ ! [X38: $i] :
( ~ ( rel_s4 @ X39 @ X38 )
| ~ ! [X37: $i] :
( ~ ( rel_s4 @ X38 @ X37 )
| ( p @ X37 ) ) ) ),
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(assume_negation,[status(cth)],[con]),c_0_16]),c_0_17]),c_0_15]),c_0_18])]) ).
thf(c_0_21,plain,
! [X30: $i,X31: $i,X32: $i] :
( ( ( rel_s4 @ X30 @ X31 )
& ( rel_s4 @ X31 @ X32 ) )
=> ( rel_s4 @ X30 @ X32 ) ),
inference(apply_def,[status(thm)],[a2,c_0_19]) ).
thf(c_0_22,negated_conjecture,
! [X51: $i,X53: $i,X54: $i] :
( ( rel_s4 @ esk2_0 @ esk3_0 )
& ( ( rel_s4 @ X51 @ ( esk4_1 @ X51 ) )
| ~ ( rel_s4 @ esk3_0 @ X51 ) )
& ( ~ ( rel_s4 @ ( esk4_1 @ X51 ) @ X53 )
| ( p @ X53 )
| ~ ( rel_s4 @ esk3_0 @ X51 ) )
& ( ( rel_s4 @ X54 @ ( esk5_1 @ X54 ) )
| ~ ( rel_s4 @ esk2_0 @ X54 ) )
& ( ~ ( p @ ( esk5_1 @ X54 ) )
| ~ ( rel_s4 @ esk2_0 @ X54 ) ) ),
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_20])])])])])]) ).
thf(c_0_23,plain,
! [X43: $i,X44: $i,X45: $i] :
( ~ ( rel_s4 @ X43 @ X44 )
| ~ ( rel_s4 @ X44 @ X45 )
| ( rel_s4 @ X43 @ X45 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_21])])]) ).
thf(c_0_24,plain,
( mreflexive
= ( ^ [Z0: $i > $i > $o] :
! [X16: $i] : ( Z0 @ X16 @ X16 ) ) ),
inference(fof_simplification,[status(thm)],[mreflexive]) ).
thf(c_0_25,negated_conjecture,
! [X7: $i,X3: $i] :
( ( p @ X7 )
| ~ ( rel_s4 @ ( esk4_1 @ X3 ) @ X7 )
| ~ ( rel_s4 @ esk3_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
thf(c_0_26,negated_conjecture,
! [X3: $i] :
( ( rel_s4 @ X3 @ ( esk5_1 @ X3 ) )
| ~ ( rel_s4 @ esk2_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
thf(c_0_27,negated_conjecture,
! [X3: $i] :
( ~ ( p @ ( esk5_1 @ X3 ) )
| ~ ( rel_s4 @ esk2_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
thf(c_0_28,plain,
! [X7: $i,X3: $i,X16: $i] :
( ( rel_s4 @ X3 @ X16 )
| ~ ( rel_s4 @ X3 @ X7 )
| ~ ( rel_s4 @ X7 @ X16 ) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
thf(c_0_29,negated_conjecture,
! [X3: $i] :
( ( rel_s4 @ X3 @ ( esk4_1 @ X3 ) )
| ~ ( rel_s4 @ esk3_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
thf(c_0_30,plain,
! [X29: $i] : ( rel_s4 @ X29 @ X29 ),
inference(apply_def,[status(thm)],[a1,c_0_24]) ).
thf(c_0_31,negated_conjecture,
! [X3: $i] :
( ~ ( rel_s4 @ esk2_0 @ ( esk4_1 @ X3 ) )
| ~ ( rel_s4 @ esk3_0 @ X3 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]) ).
thf(c_0_32,negated_conjecture,
! [X3: $i,X7: $i] :
( ( rel_s4 @ X3 @ ( esk4_1 @ X7 ) )
| ~ ( rel_s4 @ esk3_0 @ X7 )
| ~ ( rel_s4 @ X3 @ X7 ) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
thf(c_0_33,plain,
! [X42: $i] : ( rel_s4 @ X42 @ X42 ),
inference(variable_rename,[status(thm)],[c_0_30]) ).
thf(c_0_34,negated_conjecture,
! [X3: $i] :
( ~ ( rel_s4 @ esk3_0 @ X3 )
| ~ ( rel_s4 @ esk2_0 @ X3 ) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
thf(c_0_35,plain,
! [X3: $i] : ( rel_s4 @ X3 @ X3 ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
thf(c_0_36,negated_conjecture,
rel_s4 @ esk2_0 @ esk3_0,
inference(split_conjunct,[status(thm)],[c_0_22]) ).
thf(c_0_37,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SYO576^7 : TPTP v8.2.0. Released v5.5.0.
% 0.07/0.13 % Command : run_E %s %d THM
% 0.14/0.34 % Computer : n025.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Mon May 20 09:04:08 EDT 2024
% 0.14/0.34 % CPUTime :
% 0.20/0.46 Running higher-order theorem proving
% 0.20/0.46 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.20/0.48 # Version: 3.1.0-ho
% 0.20/0.48 # Preprocessing class: HSMSSMSSMLMNHSN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.20/0.48 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.20/0.48 # Starting almost_fo_3_lam with 300s (1) cores
% 0.20/0.48 # Starting post_as_ho1 with 300s (1) cores
% 0.20/0.48 # ho_unfolding_3 with pid 20188 completed with status 0
% 0.20/0.48 # Result found by ho_unfolding_3
% 0.20/0.48 # Preprocessing class: HSMSSMSSMLMNHSN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.20/0.48 # No SInE strategy applied
% 0.20/0.48 # Search class: HHHNS-FFSF11-SHSSMFNN
% 0.20/0.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.48 # Starting new_ho_10 with 811s (1) cores
% 0.20/0.48 # Starting ho_unfolding_3 with 151s (1) cores
% 0.20/0.48 # Starting ehoh_best_sine_rwall with 136s (1) cores
% 0.20/0.48 # Starting lpo1_def_fix with 136s (1) cores
% 0.20/0.48 # Starting ehoh_best8_lambda with 136s (1) cores
% 0.20/0.48 # new_ho_10 with pid 20192 completed with status 0
% 0.20/0.48 # Result found by new_ho_10
% 0.20/0.48 # Preprocessing class: HSMSSMSSMLMNHSN.
% 0.20/0.48 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.48 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.20/0.48 # No SInE strategy applied
% 0.20/0.48 # Search class: HHHNS-FFSF11-SHSSMFNN
% 0.20/0.48 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.20/0.48 # Starting new_ho_10 with 811s (1) cores
% 0.20/0.48 # Preprocessing time : 0.001 s
% 0.20/0.48 # Presaturation interreduction done
% 0.20/0.48
% 0.20/0.48 # Proof found!
% 0.20/0.48 # SZS status Theorem
% 0.20/0.48 # SZS output start CNFRefutation
% See solution above
% 0.20/0.48 # Parsed axioms : 74
% 0.20/0.48 # Removed by relevancy pruning/SinE : 0
% 0.20/0.48 # Initial clauses : 46
% 0.20/0.48 # Removed in clause preprocessing : 37
% 0.20/0.48 # Initial clauses in saturation : 9
% 0.20/0.48 # Processed clauses : 32
% 0.20/0.49 # ...of these trivial : 0
% 0.20/0.49 # ...subsumed : 1
% 0.20/0.49 # ...remaining for further processing : 31
% 0.20/0.49 # Other redundant clauses eliminated : 0
% 0.20/0.49 # Clauses deleted for lack of memory : 0
% 0.20/0.49 # Backward-subsumed : 0
% 0.20/0.49 # Backward-rewritten : 0
% 0.20/0.49 # Generated clauses : 33
% 0.20/0.49 # ...of the previous two non-redundant : 30
% 0.20/0.49 # ...aggressively subsumed : 0
% 0.20/0.49 # Contextual simplify-reflections : 1
% 0.20/0.49 # Paramodulations : 33
% 0.20/0.49 # Factorizations : 0
% 0.20/0.49 # NegExts : 0
% 0.20/0.49 # Equation resolutions : 0
% 0.20/0.49 # Disequality decompositions : 0
% 0.20/0.49 # Total rewrite steps : 4
% 0.20/0.49 # ...of those cached : 2
% 0.20/0.49 # Propositional unsat checks : 0
% 0.20/0.49 # Propositional check models : 0
% 0.20/0.49 # Propositional check unsatisfiable : 0
% 0.20/0.49 # Propositional clauses : 0
% 0.20/0.49 # Propositional clauses after purity: 0
% 0.20/0.49 # Propositional unsat core size : 0
% 0.20/0.49 # Propositional preprocessing time : 0.000
% 0.20/0.49 # Propositional encoding time : 0.000
% 0.20/0.49 # Propositional solver time : 0.000
% 0.20/0.49 # Success case prop preproc time : 0.000
% 0.20/0.49 # Success case prop encoding time : 0.000
% 0.20/0.49 # Success case prop solver time : 0.000
% 0.20/0.49 # Current number of processed clauses : 22
% 0.20/0.49 # Positive orientable unit clauses : 3
% 0.20/0.49 # Positive unorientable unit clauses: 0
% 0.20/0.49 # Negative unit clauses : 1
% 0.20/0.49 # Non-unit-clauses : 18
% 0.20/0.49 # Current number of unprocessed clauses: 11
% 0.20/0.49 # ...number of literals in the above : 41
% 0.20/0.49 # Current number of archived formulas : 0
% 0.20/0.49 # Current number of archived clauses : 9
% 0.20/0.49 # Clause-clause subsumption calls (NU) : 36
% 0.20/0.49 # Rec. Clause-clause subsumption calls : 33
% 0.20/0.49 # Non-unit clause-clause subsumptions : 2
% 0.20/0.49 # Unit Clause-clause subsumption calls : 1
% 0.20/0.49 # Rewrite failures with RHS unbound : 0
% 0.20/0.49 # BW rewrite match attempts : 3
% 0.20/0.49 # BW rewrite match successes : 0
% 0.20/0.49 # Condensation attempts : 32
% 0.20/0.49 # Condensation successes : 0
% 0.20/0.49 # Termbank termtop insertions : 3267
% 0.20/0.49 # Search garbage collected termcells : 647
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.006 s
% 0.20/0.49 # System time : 0.003 s
% 0.20/0.49 # Total time : 0.009 s
% 0.20/0.49 # Maximum resident set size: 1976 pages
% 0.20/0.49
% 0.20/0.49 # -------------------------------------------------
% 0.20/0.49 # User time : 0.018 s
% 0.20/0.49 # System time : 0.015 s
% 0.20/0.49 # Total time : 0.032 s
% 0.20/0.49 # Maximum resident set size: 1800 pages
% 0.20/0.49 % E---3.1 exiting
% 0.20/0.49 % E exiting
%------------------------------------------------------------------------------