TSTP Solution File: SYO438^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO438^1 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n032.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:00 EDT 2024
% Result : Theorem 0.13s 0.39s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 25
% Syntax : Number of formulae : 52 ( 23 unt; 14 typ; 0 def)
% Number of atoms : 111 ( 18 equ; 0 cnn)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 271 ( 52 ~; 37 |; 7 &; 172 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 19 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 60 ( 60 >; 0 *; 0 +; 0 <<)
% Number of symbols : 16 ( 14 usr; 3 con; 0-3 aty)
% Number of variables : 81 ( 33 ^ 48 !; 0 ?; 81 :)
% 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_39,type,
mreflexive: ( $i > $i > $o ) > $o ).
thf(decl_42,type,
mtransitive: ( $i > $i > $o ) > $o ).
thf(decl_49,type,
mvalid: ( $i > $o ) > $o ).
thf(decl_53,type,
rel_s4: $i > $i > $o ).
thf(decl_54,type,
mbox_s4: ( $i > $o ) > $i > $o ).
thf(decl_55,type,
mdia_s4: ( $i > $o ) > $i > $o ).
thf(decl_56,type,
p: $i > $o ).
thf(decl_57,type,
esk1_0: $i ).
thf(decl_58,type,
esk2_1: $i > $i ).
thf(decl_59,type,
esk3_2: $i > $i > $i ).
thf(decl_60,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(mdia_s4,axiom,
( mdia_s4
= ( ^ [X6: $i > $o] : ( mnot @ ( mbox_s4 @ ( mnot @ X6 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^5.ax',mdia_s4) ).
thf(mbox_s4,axiom,
( mbox_s4
= ( ^ [X6: $i > $o,X3: $i] :
! [X14: $i] :
( ~ ( rel_s4 @ X3 @ X14 )
| ( X6 @ X14 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^5.ax',mbox_s4) ).
thf(mtransitive,axiom,
( mtransitive
= ( ^ [X13: $i > $i > $o] :
! [X15: $i,X16: $i,X17: $i] :
( ( ( X13 @ X15 @ X16 )
& ( X13 @ X16 @ X17 ) )
=> ( X13 @ X15 @ X17 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax',mtransitive) ).
thf(mvalid,axiom,
( mvalid
= ( ^ [X6: $i > $o] :
! [X3: $i] : ( X6 @ X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax',mvalid) ).
thf(a2,axiom,
mtransitive @ rel_s4,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^5.ax',a2) ).
thf(prove,conjecture,
mvalid @ ( mimplies @ ( mbox_s4 @ ( mdia_s4 @ ( mbox_s4 @ ( mdia_s4 @ p ) ) ) ) @ ( mbox_s4 @ ( mdia_s4 @ p ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove) ).
thf(mreflexive,axiom,
( mreflexive
= ( ^ [X13: $i > $i > $o] :
! [X15: $i] : ( X13 @ X15 @ X15 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax',mreflexive) ).
thf(a1,axiom,
mreflexive @ rel_s4,
file('/export/starexec/sandbox2/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] :
~ ! [X21: $i] :
( ~ ( rel_s4 @ Z1 @ X21 )
| ~ ( Z0 @ X21 ) ) ) ),
inference(fof_simplification,[status(thm)],[mdia_s4]) ).
thf(c_0_15,plain,
( mbox_s4
= ( ^ [Z0: $i > $o,Z1: $i] :
! [X14: $i] :
( ~ ( rel_s4 @ Z1 @ X14 )
| ( Z0 @ X14 ) ) ) ),
inference(fof_simplification,[status(thm)],[mbox_s4]) ).
thf(c_0_16,plain,
( mtransitive
= ( ^ [Z0: $i > $i > $o] :
! [X15: $i,X16: $i,X17: $i] :
( ( ( Z0 @ X15 @ X16 )
& ( Z0 @ X16 @ X17 ) )
=> ( Z0 @ X15 @ X17 ) ) ) ),
inference(fof_simplification,[status(thm)],[mtransitive]) ).
thf(c_0_17,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_18,plain,
( mvalid
= ( ^ [Z0: $i > $o] :
! [X3: $i] : ( Z0 @ X3 ) ) ),
inference(fof_simplification,[status(thm)],[mvalid]) ).
thf(c_0_19,plain,
( mdia_s4
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ! [X21: $i] :
( ~ ( rel_s4 @ Z1 @ X21 )
| ~ ( Z0 @ X21 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_14,c_0_12]),c_0_15]) ).
thf(c_0_20,plain,
! [X23: $i,X24: $i,X25: $i] :
( ( ( rel_s4 @ X23 @ X24 )
& ( rel_s4 @ X24 @ X25 ) )
=> ( rel_s4 @ X23 @ X25 ) ),
inference(apply_def,[status(thm)],[a2,c_0_16]) ).
thf(c_0_21,negated_conjecture,
~ ! [X32: $i] :
( ~ ! [X29: $i] :
( ~ ( rel_s4 @ X32 @ X29 )
| ~ ! [X28: $i] :
( ~ ( rel_s4 @ X29 @ X28 )
| ~ ! [X27: $i] :
( ~ ( rel_s4 @ X28 @ X27 )
| ~ ! [X26: $i] :
( ~ ( rel_s4 @ X27 @ X26 )
| ~ ( p @ X26 ) ) ) ) )
| ! [X31: $i] :
( ~ ( rel_s4 @ X32 @ X31 )
| ~ ! [X30: $i] :
( ~ ( rel_s4 @ X31 @ X30 )
| ~ ( p @ 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(assume_negation,[status(cth)],[prove]),c_0_17]),c_0_18]),c_0_15]),c_0_19])]) ).
thf(c_0_22,plain,
! [X34: $i,X35: $i,X36: $i] :
( ~ ( rel_s4 @ X34 @ X35 )
| ~ ( rel_s4 @ X35 @ X36 )
| ( rel_s4 @ X34 @ X36 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])]) ).
thf(c_0_23,negated_conjecture,
! [X38: $i,X40: $i,X43: $i] :
( ( ( rel_s4 @ X38 @ ( esk2_1 @ X38 ) )
| ~ ( rel_s4 @ esk1_0 @ X38 ) )
& ( ( rel_s4 @ X40 @ ( esk3_2 @ X38 @ X40 ) )
| ~ ( rel_s4 @ ( esk2_1 @ X38 ) @ X40 )
| ~ ( rel_s4 @ esk1_0 @ X38 ) )
& ( ( p @ ( esk3_2 @ X38 @ X40 ) )
| ~ ( rel_s4 @ ( esk2_1 @ X38 ) @ X40 )
| ~ ( rel_s4 @ esk1_0 @ X38 ) )
& ( rel_s4 @ esk1_0 @ esk4_0 )
& ( ~ ( rel_s4 @ esk4_0 @ X43 )
| ~ ( p @ X43 ) ) ),
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_21])])])])])]) ).
thf(c_0_24,plain,
( mreflexive
= ( ^ [Z0: $i > $i > $o] :
! [X15: $i] : ( Z0 @ X15 @ X15 ) ) ),
inference(fof_simplification,[status(thm)],[mreflexive]) ).
thf(c_0_25,plain,
! [X14: $i,X3: $i,X15: $i] :
( ( rel_s4 @ X3 @ X15 )
| ~ ( rel_s4 @ X3 @ X14 )
| ~ ( rel_s4 @ X14 @ X15 ) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
thf(c_0_26,negated_conjecture,
! [X3: $i,X14: $i] :
( ( rel_s4 @ X3 @ ( esk3_2 @ X14 @ X3 ) )
| ~ ( rel_s4 @ ( esk2_1 @ X14 ) @ X3 )
| ~ ( rel_s4 @ esk1_0 @ X14 ) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
thf(c_0_27,plain,
! [X22: $i] : ( rel_s4 @ X22 @ X22 ),
inference(apply_def,[status(thm)],[a1,c_0_24]) ).
thf(c_0_28,negated_conjecture,
! [X3: $i] :
( ~ ( rel_s4 @ esk4_0 @ X3 )
| ~ ( p @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
thf(c_0_29,negated_conjecture,
! [X14: $i,X3: $i,X15: $i] :
( ( rel_s4 @ X3 @ ( esk3_2 @ X14 @ X15 ) )
| ~ ( rel_s4 @ ( esk2_1 @ X14 ) @ X15 )
| ~ ( rel_s4 @ esk1_0 @ X14 )
| ~ ( rel_s4 @ X3 @ X15 ) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
thf(c_0_30,negated_conjecture,
! [X14: $i,X3: $i] :
( ( p @ ( esk3_2 @ X3 @ X14 ) )
| ~ ( rel_s4 @ ( esk2_1 @ X3 ) @ X14 )
| ~ ( rel_s4 @ esk1_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
thf(c_0_31,plain,
! [X33: $i] : ( rel_s4 @ X33 @ X33 ),
inference(variable_rename,[status(thm)],[c_0_27]) ).
thf(c_0_32,negated_conjecture,
! [X3: $i,X14: $i] :
( ~ ( rel_s4 @ ( esk2_1 @ X3 ) @ X14 )
| ~ ( rel_s4 @ esk1_0 @ X3 )
| ~ ( rel_s4 @ esk4_0 @ X14 ) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]) ).
thf(c_0_33,plain,
! [X3: $i] : ( rel_s4 @ X3 @ X3 ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
thf(c_0_34,negated_conjecture,
! [X3: $i] :
( ~ ( rel_s4 @ esk4_0 @ ( esk2_1 @ X3 ) )
| ~ ( rel_s4 @ esk1_0 @ X3 ) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
thf(c_0_35,negated_conjecture,
! [X3: $i] :
( ( rel_s4 @ X3 @ ( esk2_1 @ X3 ) )
| ~ ( rel_s4 @ esk1_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
thf(c_0_36,negated_conjecture,
rel_s4 @ esk1_0 @ esk4_0,
inference(split_conjunct,[status(thm)],[c_0_23]) ).
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.03/0.09 % Problem : SYO438^1 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.10 % Command : run_E %s %d THM
% 0.10/0.29 % Computer : n032.cluster.edu
% 0.10/0.29 % Model : x86_64 x86_64
% 0.10/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.29 % Memory : 8042.1875MB
% 0.10/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.29 % CPULimit : 300
% 0.10/0.29 % WCLimit : 300
% 0.10/0.29 % DateTime : Mon May 20 10:02:07 EDT 2024
% 0.10/0.29 % CPUTime :
% 0.13/0.38 Running higher-order theorem proving
% 0.13/0.38 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.13/0.39 # Version: 3.1.0-ho
% 0.13/0.39 # Preprocessing class: HSMSSMSSMLMNHSN.
% 0.13/0.39 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.39 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.13/0.39 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.13/0.39 # Starting almost_fo_3_lam with 300s (1) cores
% 0.13/0.39 # Starting post_as_ho1 with 300s (1) cores
% 0.13/0.39 # ehoh_best2_full_lfho with pid 26447 completed with status 0
% 0.13/0.39 # Result found by ehoh_best2_full_lfho
% 0.13/0.39 # Preprocessing class: HSMSSMSSMLMNHSN.
% 0.13/0.39 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.39 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.13/0.39 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.13/0.39 # No SInE strategy applied
% 0.13/0.39 # Search class: HHHNF-FFSF21-SHSSMFNN
% 0.13/0.39 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.39 # Starting new_ho_10 with 163s (1) cores
% 0.13/0.39 # new_ho_10 with pid 26450 completed with status 0
% 0.13/0.39 # Result found by new_ho_10
% 0.13/0.39 # Preprocessing class: HSMSSMSSMLMNHSN.
% 0.13/0.39 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.39 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.13/0.39 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.13/0.39 # No SInE strategy applied
% 0.13/0.39 # Search class: HHHNF-FFSF21-SHSSMFNN
% 0.13/0.39 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.39 # Starting new_ho_10 with 163s (1) cores
% 0.13/0.39 # Preprocessing time : 0.001 s
% 0.13/0.39 # Presaturation interreduction done
% 0.13/0.39
% 0.13/0.39 # Proof found!
% 0.13/0.39 # SZS status Theorem
% 0.13/0.39 # SZS output start CNFRefutation
% See solution above
% 0.13/0.39 # Parsed axioms : 72
% 0.13/0.39 # Removed by relevancy pruning/SinE : 0
% 0.13/0.39 # Initial clauses : 43
% 0.13/0.39 # Removed in clause preprocessing : 36
% 0.13/0.39 # Initial clauses in saturation : 7
% 0.13/0.39 # Processed clauses : 30
% 0.13/0.39 # ...of these trivial : 0
% 0.13/0.39 # ...subsumed : 3
% 0.13/0.39 # ...remaining for further processing : 27
% 0.13/0.39 # Other redundant clauses eliminated : 0
% 0.13/0.39 # Clauses deleted for lack of memory : 0
% 0.13/0.39 # Backward-subsumed : 0
% 0.13/0.39 # Backward-rewritten : 0
% 0.13/0.39 # Generated clauses : 37
% 0.13/0.39 # ...of the previous two non-redundant : 35
% 0.13/0.39 # ...aggressively subsumed : 0
% 0.13/0.39 # Contextual simplify-reflections : 2
% 0.13/0.39 # Paramodulations : 37
% 0.13/0.39 # Factorizations : 0
% 0.13/0.39 # NegExts : 0
% 0.13/0.39 # Equation resolutions : 0
% 0.13/0.39 # Disequality decompositions : 0
% 0.13/0.39 # Total rewrite steps : 3
% 0.13/0.39 # ...of those cached : 1
% 0.13/0.39 # Propositional unsat checks : 0
% 0.13/0.39 # Propositional check models : 0
% 0.13/0.39 # Propositional check unsatisfiable : 0
% 0.13/0.39 # Propositional clauses : 0
% 0.13/0.39 # Propositional clauses after purity: 0
% 0.13/0.39 # Propositional unsat core size : 0
% 0.13/0.39 # Propositional preprocessing time : 0.000
% 0.13/0.39 # Propositional encoding time : 0.000
% 0.13/0.39 # Propositional solver time : 0.000
% 0.13/0.39 # Success case prop preproc time : 0.000
% 0.13/0.39 # Success case prop encoding time : 0.000
% 0.13/0.39 # Success case prop solver time : 0.000
% 0.13/0.39 # Current number of processed clauses : 20
% 0.13/0.39 # Positive orientable unit clauses : 2
% 0.13/0.39 # Positive unorientable unit clauses: 0
% 0.13/0.39 # Negative unit clauses : 2
% 0.13/0.39 # Non-unit-clauses : 16
% 0.13/0.39 # Current number of unprocessed clauses: 18
% 0.13/0.39 # ...number of literals in the above : 83
% 0.13/0.39 # Current number of archived formulas : 0
% 0.13/0.39 # Current number of archived clauses : 7
% 0.13/0.39 # Clause-clause subsumption calls (NU) : 90
% 0.13/0.39 # Rec. Clause-clause subsumption calls : 62
% 0.13/0.39 # Non-unit clause-clause subsumptions : 4
% 0.13/0.39 # Unit Clause-clause subsumption calls : 1
% 0.13/0.39 # Rewrite failures with RHS unbound : 0
% 0.13/0.39 # BW rewrite match attempts : 2
% 0.13/0.39 # BW rewrite match successes : 0
% 0.13/0.39 # Condensation attempts : 30
% 0.13/0.39 # Condensation successes : 0
% 0.13/0.39 # Termbank termtop insertions : 3356
% 0.13/0.39 # Search garbage collected termcells : 602
% 0.13/0.39
% 0.13/0.39 # -------------------------------------------------
% 0.13/0.39 # User time : 0.004 s
% 0.13/0.39 # System time : 0.002 s
% 0.13/0.39 # Total time : 0.006 s
% 0.13/0.39 # Maximum resident set size: 1896 pages
% 0.13/0.39
% 0.13/0.39 # -------------------------------------------------
% 0.13/0.39 # User time : 0.005 s
% 0.13/0.39 # System time : 0.004 s
% 0.13/0.39 # Total time : 0.008 s
% 0.13/0.39 # Maximum resident set size: 1804 pages
% 0.13/0.39 % E---3.1 exiting
% 0.13/0.39 % E exiting
%------------------------------------------------------------------------------