TSTP Solution File: SYO434^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO434^1 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n029.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:45:59 EDT 2024
% Result : Theorem 0.18s 0.50s
% Output : CNFRefutation 0.18s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 24
% Syntax : Number of formulae : 51 ( 26 unt; 13 typ; 0 def)
% Number of atoms : 95 ( 18 equ; 0 cnn)
% Maximal formula atoms : 8 ( 2 avg)
% Number of connectives : 196 ( 33 ~; 24 |; 6 &; 130 @)
% ( 0 <=>; 3 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 58 ( 58 >; 0 *; 0 +; 0 <<)
% Number of symbols : 15 ( 13 usr; 3 con; 0-3 aty)
% Number of variables : 70 ( 33 ^ 37 !; 0 ?; 70 :)
% 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_0: $i ).
thf(decl_59,type,
esk3_1: $i > $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(mdia_s4,axiom,
( mdia_s4
= ( ^ [X6: $i > $o] : ( mnot @ ( mbox_s4 @ ( mnot @ X6 ) ) ) ) ),
file('/export/starexec/sandbox/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/sandbox/benchmark/Axioms/LCL013^5.ax',mbox_s4) ).
thf(mvalid,axiom,
( mvalid
= ( ^ [X6: $i > $o] :
! [X3: $i] : ( X6 @ X3 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mvalid) ).
thf(mreflexive,axiom,
( mreflexive
= ( ^ [X13: $i > $i > $o] :
! [X15: $i] : ( X13 @ X15 @ X15 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mreflexive) ).
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/sandbox/benchmark/Axioms/LCL013^0.ax',mtransitive) ).
thf(prove,conjecture,
mvalid @ ( mimplies @ ( mbox_s4 @ p ) @ ( mbox_s4 @ ( mdia_s4 @ ( mbox_s4 @ p ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove) ).
thf(a1,axiom,
mreflexive @ rel_s4,
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^5.ax',a1) ).
thf(a2,axiom,
mtransitive @ rel_s4,
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^5.ax',a2) ).
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,
( 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] :
~ ! [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_19,plain,
( mreflexive
= ( ^ [Z0: $i > $i > $o] :
! [X15: $i] : ( Z0 @ X15 @ X15 ) ) ),
inference(fof_simplification,[status(thm)],[mreflexive]) ).
thf(c_0_20,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_21,negated_conjecture,
~ ! [X30: $i] :
( ~ ! [X26: $i] :
( ~ ( rel_s4 @ X30 @ X26 )
| ( p @ X26 ) )
| ! [X29: $i] :
( ~ ( rel_s4 @ X30 @ X29 )
| ~ ! [X28: $i] :
( ~ ( rel_s4 @ X29 @ X28 )
| ~ ! [X27: $i] :
( ~ ( rel_s4 @ X28 @ X27 )
| ( p @ X27 ) ) ) ) ),
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_16]),c_0_17]),c_0_15]),c_0_18])]) ).
thf(c_0_22,plain,
! [X22: $i] : ( rel_s4 @ X22 @ X22 ),
inference(apply_def,[status(thm)],[a1,c_0_19]) ).
thf(c_0_23,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_20]) ).
thf(c_0_24,negated_conjecture,
! [X36: $i,X38: $i] :
( ( ~ ( rel_s4 @ esk1_0 @ X36 )
| ( p @ X36 ) )
& ( rel_s4 @ esk1_0 @ esk2_0 )
& ( ( rel_s4 @ X38 @ ( esk3_1 @ X38 ) )
| ~ ( rel_s4 @ esk2_0 @ X38 ) )
& ( ~ ( p @ ( esk3_1 @ X38 ) )
| ~ ( rel_s4 @ esk2_0 @ X38 ) ) ),
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_25,plain,
! [X31: $i] : ( rel_s4 @ X31 @ X31 ),
inference(variable_rename,[status(thm)],[c_0_22]) ).
thf(c_0_26,plain,
! [X32: $i,X33: $i,X34: $i] :
( ~ ( rel_s4 @ X32 @ X33 )
| ~ ( rel_s4 @ X33 @ X34 )
| ( rel_s4 @ X32 @ X34 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_23])])]) ).
thf(c_0_27,negated_conjecture,
! [X3: $i] :
( ( rel_s4 @ X3 @ ( esk3_1 @ X3 ) )
| ~ ( rel_s4 @ esk2_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
thf(c_0_28,plain,
! [X3: $i] : ( rel_s4 @ X3 @ X3 ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
thf(c_0_29,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_26]) ).
thf(c_0_30,negated_conjecture,
rel_s4 @ esk2_0 @ ( esk3_1 @ esk2_0 ),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
thf(c_0_31,negated_conjecture,
! [X3: $i] :
( ( rel_s4 @ X3 @ ( esk3_1 @ esk2_0 ) )
| ~ ( rel_s4 @ X3 @ esk2_0 ) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
thf(c_0_32,negated_conjecture,
rel_s4 @ esk1_0 @ esk2_0,
inference(split_conjunct,[status(thm)],[c_0_24]) ).
thf(c_0_33,negated_conjecture,
! [X3: $i] :
( ( p @ X3 )
| ~ ( rel_s4 @ esk1_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
thf(c_0_34,negated_conjecture,
rel_s4 @ esk1_0 @ ( esk3_1 @ esk2_0 ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
thf(c_0_35,negated_conjecture,
! [X3: $i] :
( ~ ( p @ ( esk3_1 @ X3 ) )
| ~ ( rel_s4 @ esk2_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
thf(c_0_36,negated_conjecture,
p @ ( esk3_1 @ esk2_0 ),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
thf(c_0_37,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_28])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.11 % Problem : SYO434^1 : TPTP v8.2.0. Released v4.0.0.
% 0.02/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n029.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon May 20 10:35:23 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.18/0.48 Running higher-order theorem proving
% 0.18/0.48 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.18/0.50 # Version: 3.1.0-ho
% 0.18/0.50 # Preprocessing class: HSMSSMSSMLMNHSN.
% 0.18/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.50 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.18/0.50 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.18/0.50 # Starting almost_fo_3_lam with 300s (1) cores
% 0.18/0.50 # Starting post_as_ho1 with 300s (1) cores
% 0.18/0.50 # almost_fo_3_lam with pid 15839 completed with status 0
% 0.18/0.50 # Result found by almost_fo_3_lam
% 0.18/0.50 # Preprocessing class: HSMSSMSSMLMNHSN.
% 0.18/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.50 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.18/0.50 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.18/0.50 # Starting almost_fo_3_lam with 300s (1) cores
% 0.18/0.50 # No SInE strategy applied
% 0.18/0.50 # Search class: HHHNF-FFSF11-SHSSMFNN
% 0.18/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.50 # Starting sh7 with 163s (1) cores
% 0.18/0.50 # sh7 with pid 15841 completed with status 0
% 0.18/0.50 # Result found by sh7
% 0.18/0.50 # Preprocessing class: HSMSSMSSMLMNHSN.
% 0.18/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.18/0.50 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.18/0.50 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.18/0.50 # Starting almost_fo_3_lam with 300s (1) cores
% 0.18/0.50 # No SInE strategy applied
% 0.18/0.50 # Search class: HHHNF-FFSF11-SHSSMFNN
% 0.18/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.18/0.50 # Starting sh7 with 163s (1) cores
% 0.18/0.50 # Preprocessing time : 0.001 s
% 0.18/0.50 # Presaturation interreduction done
% 0.18/0.50
% 0.18/0.50 # Proof found!
% 0.18/0.50 # SZS status Theorem
% 0.18/0.50 # SZS output start CNFRefutation
% See solution above
% 0.18/0.50 # Parsed axioms : 72
% 0.18/0.50 # Removed by relevancy pruning/SinE : 0
% 0.18/0.50 # Initial clauses : 42
% 0.18/0.50 # Removed in clause preprocessing : 36
% 0.18/0.50 # Initial clauses in saturation : 6
% 0.18/0.50 # Processed clauses : 20
% 0.18/0.50 # ...of these trivial : 0
% 0.18/0.50 # ...subsumed : 0
% 0.18/0.50 # ...remaining for further processing : 20
% 0.18/0.50 # Other redundant clauses eliminated : 0
% 0.18/0.50 # Clauses deleted for lack of memory : 0
% 0.18/0.50 # Backward-subsumed : 0
% 0.18/0.50 # Backward-rewritten : 0
% 0.18/0.50 # Generated clauses : 14
% 0.18/0.50 # ...of the previous two non-redundant : 10
% 0.18/0.50 # ...aggressively subsumed : 0
% 0.18/0.50 # Contextual simplify-reflections : 0
% 0.18/0.50 # Paramodulations : 14
% 0.18/0.50 # Factorizations : 0
% 0.18/0.50 # NegExts : 0
% 0.18/0.50 # Equation resolutions : 0
% 0.18/0.50 # Disequality decompositions : 0
% 0.18/0.50 # Total rewrite steps : 3
% 0.18/0.50 # ...of those cached : 0
% 0.18/0.50 # Propositional unsat checks : 0
% 0.18/0.50 # Propositional check models : 0
% 0.18/0.50 # Propositional check unsatisfiable : 0
% 0.18/0.50 # Propositional clauses : 0
% 0.18/0.50 # Propositional clauses after purity: 0
% 0.18/0.50 # Propositional unsat core size : 0
% 0.18/0.50 # Propositional preprocessing time : 0.000
% 0.18/0.50 # Propositional encoding time : 0.000
% 0.18/0.50 # Propositional solver time : 0.000
% 0.18/0.50 # Success case prop preproc time : 0.000
% 0.18/0.50 # Success case prop encoding time : 0.000
% 0.18/0.50 # Success case prop solver time : 0.000
% 0.18/0.50 # Current number of processed clauses : 14
% 0.18/0.50 # Positive orientable unit clauses : 8
% 0.18/0.50 # Positive unorientable unit clauses: 0
% 0.18/0.50 # Negative unit clauses : 0
% 0.18/0.50 # Non-unit-clauses : 6
% 0.18/0.50 # Current number of unprocessed clauses: 2
% 0.18/0.50 # ...number of literals in the above : 4
% 0.18/0.50 # Current number of archived formulas : 0
% 0.18/0.50 # Current number of archived clauses : 6
% 0.18/0.50 # Clause-clause subsumption calls (NU) : 1
% 0.18/0.50 # Rec. Clause-clause subsumption calls : 1
% 0.18/0.50 # Non-unit clause-clause subsumptions : 0
% 0.18/0.50 # Unit Clause-clause subsumption calls : 0
% 0.18/0.50 # Rewrite failures with RHS unbound : 0
% 0.18/0.50 # BW rewrite match attempts : 5
% 0.18/0.50 # BW rewrite match successes : 0
% 0.18/0.50 # Condensation attempts : 0
% 0.18/0.50 # Condensation successes : 0
% 0.18/0.50 # Termbank termtop insertions : 2557
% 0.18/0.50 # Search garbage collected termcells : 490
% 0.18/0.50
% 0.18/0.50 # -------------------------------------------------
% 0.18/0.50 # User time : 0.004 s
% 0.18/0.50 # System time : 0.003 s
% 0.18/0.50 # Total time : 0.007 s
% 0.18/0.50 # Maximum resident set size: 1904 pages
% 0.18/0.50
% 0.18/0.50 # -------------------------------------------------
% 0.18/0.50 # User time : 0.006 s
% 0.18/0.50 # System time : 0.007 s
% 0.18/0.50 # Total time : 0.013 s
% 0.18/0.50 # Maximum resident set size: 1800 pages
% 0.18/0.50 % E---3.1 exiting
% 0.18/0.50 % E exiting
%------------------------------------------------------------------------------