TSTP Solution File: SYO462^4 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO462^4 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n005.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:14 EDT 2024
% Result : Theorem 0.21s 0.51s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 21
% Syntax : Number of formulae : 52 ( 22 unt; 13 typ; 0 def)
% Number of atoms : 139 ( 17 equ; 0 cnn)
% Maximal formula atoms : 30 ( 3 avg)
% Number of connectives : 322 ( 76 ~; 66 |; 10 &; 170 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 17 ( 4 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 60 ( 60 >; 0 *; 0 +; 0 <<)
% Number of symbols : 15 ( 13 usr; 4 con; 0-3 aty)
% Number of variables : 61 ( 40 ^ 21 !; 0 ?; 61 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_24,type,
mnot: ( $i > $o ) > $i > $o ).
thf(decl_25,type,
mor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_26,type,
mand: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_27,type,
mimplies: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_29,type,
mequiv: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_49,type,
mvalid: ( $i > $o ) > $o ).
thf(decl_53,type,
rel_b: $i > $i > $o ).
thf(decl_54,type,
mbox_b: ( $i > $o ) > $i > $o ).
thf(decl_56,type,
p: $i > $o ).
thf(decl_57,type,
q: $i > $o ).
thf(decl_58,type,
esk1_0: $i ).
thf(decl_59,type,
esk2_0: $i ).
thf(decl_60,type,
esk3_0: $i ).
thf(mand,axiom,
( mand
= ( ^ [X6: $i > $o,X7: $i > $o] : ( mnot @ ( mor @ ( mnot @ X6 ) @ ( mnot @ X7 ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mand) ).
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(mimplies,axiom,
( mimplies
= ( ^ [X6: $i > $o,X7: $i > $o] : ( mor @ ( mnot @ X6 ) @ X7 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mimplies) ).
thf(mequiv,axiom,
( mequiv
= ( ^ [X6: $i > $o,X7: $i > $o] : ( mand @ ( mimplies @ X6 @ X7 ) @ ( mimplies @ X7 @ X6 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mequiv) ).
thf(mvalid,axiom,
( mvalid
= ( ^ [X6: $i > $o] :
! [X3: $i] : ( X6 @ X3 ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^0.ax',mvalid) ).
thf(mbox_b,axiom,
( mbox_b
= ( ^ [X6: $i > $o,X3: $i] :
! [X14: $i] :
( ~ ( rel_b @ X3 @ X14 )
| ( X6 @ X14 ) ) ) ),
file('/export/starexec/sandbox/benchmark/Axioms/LCL013^4.ax',mbox_b) ).
thf(prove,conjecture,
mvalid @ ( mimplies @ ( mbox_b @ ( mequiv @ p @ q ) ) @ ( mequiv @ ( mbox_b @ p ) @ ( mbox_b @ q ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove) ).
thf(c_0_8,plain,
( mand
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
~ ( ~ ( Z0 @ Z2 )
| ~ ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mand]) ).
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,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimplies]) ).
thf(c_0_12,plain,
( mequiv
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
~ ( ~ ( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) )
| ~ ( ~ ( Z1 @ Z2 )
| ( Z0 @ Z2 ) ) ) ) ),
inference(fof_simplification,[status(thm)],[mequiv]) ).
thf(c_0_13,plain,
( mand
= ( ^ [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_14,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_9]),c_0_10]) ).
thf(c_0_15,plain,
( mequiv
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
~ ( ~ ( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) )
| ~ ( ~ ( Z1 @ Z2 )
| ( Z0 @ Z2 ) ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
thf(c_0_16,plain,
( mvalid
= ( ^ [Z0: $i > $o] :
! [X3: $i] : ( Z0 @ X3 ) ) ),
inference(fof_simplification,[status(thm)],[mvalid]) ).
thf(c_0_17,plain,
( mbox_b
= ( ^ [Z0: $i > $o,Z1: $i] :
! [X14: $i] :
( ~ ( rel_b @ Z1 @ X14 )
| ( Z0 @ X14 ) ) ) ),
inference(fof_simplification,[status(thm)],[mbox_b]) ).
thf(c_0_18,negated_conjecture,
~ ! [X28: $i] :
( ~ ! [X25: $i] :
( ~ ( rel_b @ X28 @ X25 )
| ~ ( ~ ( ~ ( p @ X25 )
| ( q @ X25 ) )
| ~ ( ~ ( q @ X25 )
| ( p @ X25 ) ) ) )
| ~ ( ~ ( ~ ! [X26: $i] :
( ~ ( rel_b @ X28 @ X26 )
| ( p @ X26 ) )
| ! [X27: $i] :
( ~ ( rel_b @ X28 @ X27 )
| ( q @ X27 ) ) )
| ~ ( ~ ! [X27: $i] :
( ~ ( rel_b @ X28 @ X27 )
| ( q @ X27 ) )
| ! [X26: $i] :
( ~ ( rel_b @ X28 @ X26 )
| ( p @ X26 ) ) ) ) ),
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_14]),c_0_15]),c_0_16]),c_0_17])]) ).
thf(c_0_19,negated_conjecture,
! [X33: $i,X34: $i,X36: $i] :
( ( ~ ( p @ X33 )
| ( q @ X33 )
| ~ ( rel_b @ esk1_0 @ X33 ) )
& ( ~ ( q @ X33 )
| ( p @ X33 )
| ~ ( rel_b @ esk1_0 @ X33 ) )
& ( ~ ( rel_b @ esk1_0 @ X36 )
| ( q @ X36 )
| ~ ( rel_b @ esk1_0 @ X34 )
| ( p @ X34 ) )
& ( ( rel_b @ esk1_0 @ esk3_0 )
| ~ ( rel_b @ esk1_0 @ X34 )
| ( p @ X34 ) )
& ( ~ ( p @ esk3_0 )
| ~ ( rel_b @ esk1_0 @ X34 )
| ( p @ X34 ) )
& ( ~ ( rel_b @ esk1_0 @ X36 )
| ( q @ X36 )
| ( rel_b @ esk1_0 @ esk2_0 ) )
& ( ( rel_b @ esk1_0 @ esk3_0 )
| ( rel_b @ esk1_0 @ esk2_0 ) )
& ( ~ ( p @ esk3_0 )
| ( rel_b @ esk1_0 @ esk2_0 ) )
& ( ~ ( rel_b @ esk1_0 @ X36 )
| ( q @ X36 )
| ~ ( q @ esk2_0 ) )
& ( ( rel_b @ esk1_0 @ esk3_0 )
| ~ ( q @ esk2_0 ) )
& ( ~ ( p @ esk3_0 )
| ~ ( q @ esk2_0 ) ) ),
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_18])])])])])]) ).
thf(c_0_20,negated_conjecture,
! [X3: $i] :
( ( q @ X3 )
| ~ ( rel_b @ esk1_0 @ X3 )
| ~ ( q @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
thf(c_0_21,negated_conjecture,
( ( rel_b @ esk1_0 @ esk3_0 )
| ~ ( q @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
thf(c_0_22,negated_conjecture,
! [X3: $i] :
( ( p @ X3 )
| ~ ( q @ X3 )
| ~ ( rel_b @ esk1_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
thf(c_0_23,negated_conjecture,
( ( q @ esk3_0 )
| ~ ( q @ esk2_0 ) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
thf(c_0_24,negated_conjecture,
( ~ ( p @ esk3_0 )
| ~ ( q @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
thf(c_0_25,negated_conjecture,
! [X3: $i] :
( ( p @ X3 )
| ~ ( p @ esk3_0 )
| ~ ( rel_b @ esk1_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
thf(c_0_26,negated_conjecture,
( ( rel_b @ esk1_0 @ esk2_0 )
| ~ ( p @ esk3_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
thf(c_0_27,negated_conjecture,
! [X3: $i] :
( ( q @ X3 )
| ~ ( p @ X3 )
| ~ ( rel_b @ esk1_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
thf(c_0_28,negated_conjecture,
~ ( q @ esk2_0 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_21]),c_0_23]),c_0_24]) ).
thf(c_0_29,negated_conjecture,
( ( p @ esk2_0 )
| ~ ( p @ esk3_0 ) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
thf(c_0_30,negated_conjecture,
! [X3: $i] :
( ( q @ X3 )
| ( rel_b @ esk1_0 @ esk2_0 )
| ~ ( rel_b @ esk1_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
thf(c_0_31,negated_conjecture,
( ( rel_b @ esk1_0 @ esk3_0 )
| ( rel_b @ esk1_0 @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
thf(c_0_32,negated_conjecture,
~ ( p @ esk3_0 ),
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_26]),c_0_28]),c_0_29]) ).
thf(c_0_33,negated_conjecture,
( ( rel_b @ esk1_0 @ esk2_0 )
| ( q @ esk3_0 ) ),
inference(spm,[status(thm)],[c_0_30,c_0_31]) ).
thf(c_0_34,negated_conjecture,
rel_b @ esk1_0 @ esk2_0,
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_31]),c_0_32]),c_0_33]) ).
thf(c_0_35,negated_conjecture,
! [X3: $i,X14: $i] :
( ( q @ X3 )
| ( p @ X14 )
| ~ ( rel_b @ esk1_0 @ X3 )
| ~ ( rel_b @ esk1_0 @ X14 ) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
thf(c_0_36,negated_conjecture,
~ ( p @ esk2_0 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_34]),c_0_28]) ).
thf(c_0_37,negated_conjecture,
! [X3: $i] :
( ( q @ X3 )
| ~ ( rel_b @ esk1_0 @ X3 ) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_34]),c_0_36]) ).
thf(c_0_38,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_34]),c_0_28]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SYO462^4 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.14 % Command : run_E %s %d THM
% 0.14/0.35 % Computer : n005.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Mon May 20 09:05:53 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.21/0.50 Running higher-order theorem proving
% 0.21/0.50 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.21/0.51 # Version: 3.1.0-ho
% 0.21/0.51 # Preprocessing class: HSMSSMSSMLMNHSN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.21/0.51 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.21/0.51 # Starting almost_fo_3_lam with 300s (1) cores
% 0.21/0.51 # Starting post_as_ho1 with 300s (1) cores
% 0.21/0.51 # post_as_ho1 with pid 30056 completed with status 0
% 0.21/0.51 # Result found by post_as_ho1
% 0.21/0.51 # Preprocessing class: HSMSSMSSMLMNHSN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.21/0.51 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.21/0.51 # Starting almost_fo_3_lam with 300s (1) cores
% 0.21/0.51 # Starting post_as_ho1 with 300s (1) cores
% 0.21/0.51 # No SInE strategy applied
% 0.21/0.51 # Search class: HGHNF-FFSF00-SHSSMFNN
% 0.21/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.51 # Starting new_ho_10 with 163s (1) cores
% 0.21/0.51 # new_ho_10 with pid 30061 completed with status 0
% 0.21/0.51 # Result found by new_ho_10
% 0.21/0.51 # Preprocessing class: HSMSSMSSMLMNHSN.
% 0.21/0.51 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.51 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.21/0.51 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.21/0.51 # Starting almost_fo_3_lam with 300s (1) cores
% 0.21/0.51 # Starting post_as_ho1 with 300s (1) cores
% 0.21/0.51 # No SInE strategy applied
% 0.21/0.51 # Search class: HGHNF-FFSF00-SHSSMFNN
% 0.21/0.51 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.51 # Starting new_ho_10 with 163s (1) cores
% 0.21/0.51 # Preprocessing time : 0.001 s
% 0.21/0.51 # Presaturation interreduction done
% 0.21/0.51
% 0.21/0.51 # Proof found!
% 0.21/0.51 # SZS status Theorem
% 0.21/0.51 # SZS output start CNFRefutation
% See solution above
% 0.21/0.52 # Parsed axioms : 73
% 0.21/0.52 # Removed by relevancy pruning/SinE : 0
% 0.21/0.52 # Initial clauses : 50
% 0.21/0.52 # Removed in clause preprocessing : 37
% 0.21/0.52 # Initial clauses in saturation : 13
% 0.21/0.52 # Processed clauses : 52
% 0.21/0.52 # ...of these trivial : 0
% 0.21/0.52 # ...subsumed : 4
% 0.21/0.52 # ...remaining for further processing : 48
% 0.21/0.52 # Other redundant clauses eliminated : 0
% 0.21/0.52 # Clauses deleted for lack of memory : 0
% 0.21/0.52 # Backward-subsumed : 15
% 0.21/0.52 # Backward-rewritten : 8
% 0.21/0.52 # Generated clauses : 73
% 0.21/0.52 # ...of the previous two non-redundant : 65
% 0.21/0.52 # ...aggressively subsumed : 0
% 0.21/0.52 # Contextual simplify-reflections : 4
% 0.21/0.52 # Paramodulations : 73
% 0.21/0.52 # Factorizations : 0
% 0.21/0.52 # NegExts : 0
% 0.21/0.52 # Equation resolutions : 0
% 0.21/0.52 # Disequality decompositions : 0
% 0.21/0.52 # Total rewrite steps : 11
% 0.21/0.52 # ...of those cached : 6
% 0.21/0.52 # Propositional unsat checks : 0
% 0.21/0.52 # Propositional check models : 0
% 0.21/0.52 # Propositional check unsatisfiable : 0
% 0.21/0.52 # Propositional clauses : 0
% 0.21/0.52 # Propositional clauses after purity: 0
% 0.21/0.52 # Propositional unsat core size : 0
% 0.21/0.52 # Propositional preprocessing time : 0.000
% 0.21/0.52 # Propositional encoding time : 0.000
% 0.21/0.52 # Propositional solver time : 0.000
% 0.21/0.52 # Success case prop preproc time : 0.000
% 0.21/0.52 # Success case prop encoding time : 0.000
% 0.21/0.52 # Success case prop solver time : 0.000
% 0.21/0.52 # Current number of processed clauses : 12
% 0.21/0.52 # Positive orientable unit clauses : 6
% 0.21/0.52 # Positive unorientable unit clauses: 0
% 0.21/0.52 # Negative unit clauses : 3
% 0.21/0.52 # Non-unit-clauses : 3
% 0.21/0.52 # Current number of unprocessed clauses: 7
% 0.21/0.52 # ...number of literals in the above : 18
% 0.21/0.52 # Current number of archived formulas : 0
% 0.21/0.52 # Current number of archived clauses : 36
% 0.21/0.52 # Clause-clause subsumption calls (NU) : 31
% 0.21/0.52 # Rec. Clause-clause subsumption calls : 31
% 0.21/0.52 # Non-unit clause-clause subsumptions : 8
% 0.21/0.52 # Unit Clause-clause subsumption calls : 23
% 0.21/0.52 # Rewrite failures with RHS unbound : 0
% 0.21/0.52 # BW rewrite match attempts : 9
% 0.21/0.52 # BW rewrite match successes : 3
% 0.21/0.52 # Condensation attempts : 52
% 0.21/0.52 # Condensation successes : 0
% 0.21/0.52 # Termbank termtop insertions : 3562
% 0.21/0.52 # Search garbage collected termcells : 596
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.008 s
% 0.21/0.52 # System time : 0.002 s
% 0.21/0.52 # Total time : 0.010 s
% 0.21/0.52 # Maximum resident set size: 1908 pages
% 0.21/0.52
% 0.21/0.52 # -------------------------------------------------
% 0.21/0.52 # User time : 0.010 s
% 0.21/0.52 # System time : 0.005 s
% 0.21/0.52 # Total time : 0.015 s
% 0.21/0.52 # Maximum resident set size: 1796 pages
% 0.21/0.52 % E---3.1 exiting
% 0.21/0.52 % E exiting
%------------------------------------------------------------------------------