TSTP Solution File: SYO420^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO420^1 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n017.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:56 EDT 2024
% Result : Theorem 0.20s 0.50s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 23
% Syntax : Number of formulae : 44 ( 24 unt; 13 typ; 0 def)
% Number of atoms : 90 ( 19 equ; 0 cnn)
% Maximal formula atoms : 11 ( 2 avg)
% Number of connectives : 160 ( 40 ~; 24 |; 2 &; 94 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 63 ( 63 >; 0 *; 0 +; 0 <<)
% Number of symbols : 15 ( 13 usr; 2 con; 0-3 aty)
% Number of variables : 64 ( 39 ^ 22 !; 3 ?; 64 :)
% 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_41,type,
mserial: ( $i > $i > $o ) > $o ).
thf(decl_49,type,
mvalid: ( $i > $o ) > $o ).
thf(decl_53,type,
rel_d: $i > $i > $o ).
thf(decl_54,type,
mbox_d: ( $i > $o ) > $i > $o ).
thf(decl_55,type,
mdia_d: ( $i > $o ) > $i > $o ).
thf(decl_56,type,
p: $i > $o ).
thf(decl_57,type,
q: $i > $o ).
thf(decl_58,type,
esk1_1: $i > $i ).
thf(decl_59,type,
esk2_0: $i ).
thf(mand,axiom,
( mand
= ( ^ [X6: $i > $o,X7: $i > $o] : ( mnot @ ( mor @ ( mnot @ X6 ) @ ( mnot @ X7 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax',mand) ).
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(mimplies,axiom,
( mimplies
= ( ^ [X6: $i > $o,X7: $i > $o] : ( mor @ ( mnot @ X6 ) @ X7 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax',mimplies) ).
thf(mdia_d,axiom,
( mdia_d
= ( ^ [X6: $i > $o] : ( mnot @ ( mbox_d @ ( mnot @ X6 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^2.ax',mdia_d) ).
thf(mbox_d,axiom,
( mbox_d
= ( ^ [X6: $i > $o,X3: $i] :
! [X14: $i] :
( ~ ( rel_d @ X3 @ X14 )
| ( X6 @ X14 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^2.ax',mbox_d) ).
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 @ ( mand @ ( mbox_d @ p ) @ ( mbox_d @ ( mimplies @ p @ q ) ) ) @ ( mdia_d @ q ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove) ).
thf(mserial,axiom,
( mserial
= ( ^ [X13: $i > $i > $o] :
! [X15: $i] :
? [X16: $i] : ( X13 @ X15 @ X16 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax',mserial) ).
thf(a1,axiom,
mserial @ rel_d,
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^2.ax',a1) ).
thf(c_0_10,plain,
( mand
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
~ ( ~ ( Z0 @ Z2 )
| ~ ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mand]) ).
thf(c_0_11,plain,
( mnot
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ( Z0 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mnot]) ).
thf(c_0_12,plain,
( mor
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mor]) ).
thf(c_0_13,plain,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimplies]) ).
thf(c_0_14,plain,
( mdia_d
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ! [X21: $i] :
( ~ ( rel_d @ Z1 @ X21 )
| ~ ( Z0 @ X21 ) ) ) ),
inference(fof_simplification,[status(thm)],[mdia_d]) ).
thf(c_0_15,plain,
( mbox_d
= ( ^ [Z0: $i > $o,Z1: $i] :
! [X14: $i] :
( ~ ( rel_d @ Z1 @ X14 )
| ( Z0 @ X14 ) ) ) ),
inference(fof_simplification,[status(thm)],[mbox_d]) ).
thf(c_0_16,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_10,c_0_11]),c_0_12]) ).
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_13,c_0_11]),c_0_12]) ).
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_d
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ! [X21: $i] :
( ~ ( rel_d @ Z1 @ X21 )
| ~ ( Z0 @ X21 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_14,c_0_11]),c_0_15]) ).
thf(c_0_20,negated_conjecture,
~ ! [X27: $i] :
( ~ ~ ( ~ ! [X24: $i] :
( ~ ( rel_d @ X27 @ X24 )
| ( p @ X24 ) )
| ~ ! [X25: $i] :
( ~ ( rel_d @ X27 @ X25 )
| ~ ( p @ X25 )
| ( q @ X25 ) ) )
| ~ ! [X26: $i] :
( ~ ( rel_d @ X27 @ X26 )
| ~ ( q @ 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(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[prove]),c_0_16]),c_0_17]),c_0_18]),c_0_15]),c_0_19])]) ).
thf(c_0_21,plain,
( mserial
= ( ^ [Z0: $i > $i > $o] :
! [X15: $i] :
? [X16: $i] : ( Z0 @ X15 @ X16 ) ) ),
inference(fof_simplification,[status(thm)],[mserial]) ).
thf(c_0_22,negated_conjecture,
! [X31: $i,X32: $i,X33: $i] :
( ( ~ ( rel_d @ esk2_0 @ X31 )
| ( p @ X31 ) )
& ( ~ ( rel_d @ esk2_0 @ X32 )
| ~ ( p @ X32 )
| ( q @ X32 ) )
& ( ~ ( rel_d @ esk2_0 @ X33 )
| ~ ( q @ X33 ) ) ),
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,
! [X22: $i] :
? [X23: $i] : ( rel_d @ X22 @ X23 ),
inference(apply_def,[status(thm)],[a1,c_0_21]) ).
thf(c_0_24,negated_conjecture,
! [X3: $i] :
( ( q @ X3 )
| ~ ( rel_d @ esk2_0 @ X3 )
| ~ ( p @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
thf(c_0_25,negated_conjecture,
! [X3: $i] :
( ( p @ X3 )
| ~ ( rel_d @ esk2_0 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
thf(c_0_26,negated_conjecture,
! [X3: $i] :
( ~ ( rel_d @ esk2_0 @ X3 )
| ~ ( q @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
thf(c_0_27,plain,
! [X28: $i] : ( rel_d @ X28 @ ( esk1_1 @ X28 ) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_23])]) ).
thf(c_0_28,negated_conjecture,
! [X3: $i] :
~ ( rel_d @ esk2_0 @ X3 ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).
thf(c_0_29,plain,
! [X3: $i] : ( rel_d @ X3 @ ( esk1_1 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
thf(c_0_30,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_28,c_0_29]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SYO420^1 : TPTP v8.2.0. Released v4.0.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n017.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Mon May 20 10:17:23 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.48 Running higher-order theorem proving
% 0.20/0.48 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.20/0.50 # Version: 3.1.0-ho
% 0.20/0.50 # Preprocessing class: HSMSSMSSMLMNHSN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.20/0.50 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.20/0.50 # Starting almost_fo_3_lam with 300s (1) cores
% 0.20/0.50 # Starting post_as_ho1 with 300s (1) cores
% 0.20/0.50 # ehoh_best2_full_lfho with pid 6148 completed with status 0
% 0.20/0.50 # Result found by ehoh_best2_full_lfho
% 0.20/0.50 # Preprocessing class: HSMSSMSSMLMNHSN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.20/0.50 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.20/0.50 # No SInE strategy applied
% 0.20/0.50 # Search class: HHHNF-FFSF11-SHSSMFNN
% 0.20/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting sh7 with 163s (1) cores
% 0.20/0.50 # sh7 with pid 6152 completed with status 0
% 0.20/0.50 # Result found by sh7
% 0.20/0.50 # Preprocessing class: HSMSSMSSMLMNHSN.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting ho_unfolding_3 with 1500s (5) cores
% 0.20/0.50 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.20/0.50 # No SInE strategy applied
% 0.20/0.50 # Search class: HHHNF-FFSF11-SHSSMFNN
% 0.20/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting sh7 with 163s (1) cores
% 0.20/0.50 # Preprocessing time : 0.001 s
% 0.20/0.50 # Presaturation interreduction done
% 0.20/0.50
% 0.20/0.50 # Proof found!
% 0.20/0.50 # SZS status Theorem
% 0.20/0.50 # SZS output start CNFRefutation
% See solution above
% 0.20/0.50 # Parsed axioms : 72
% 0.20/0.50 # Removed by relevancy pruning/SinE : 0
% 0.20/0.50 # Initial clauses : 41
% 0.20/0.50 # Removed in clause preprocessing : 37
% 0.20/0.50 # Initial clauses in saturation : 4
% 0.20/0.50 # Processed clauses : 6
% 0.20/0.50 # ...of these trivial : 0
% 0.20/0.50 # ...subsumed : 0
% 0.20/0.50 # ...remaining for further processing : 6
% 0.20/0.50 # Other redundant clauses eliminated : 0
% 0.20/0.50 # Clauses deleted for lack of memory : 0
% 0.20/0.50 # Backward-subsumed : 2
% 0.20/0.50 # Backward-rewritten : 0
% 0.20/0.50 # Generated clauses : 1
% 0.20/0.50 # ...of the previous two non-redundant : 0
% 0.20/0.50 # ...aggressively subsumed : 0
% 0.20/0.50 # Contextual simplify-reflections : 2
% 0.20/0.50 # Paramodulations : 1
% 0.20/0.50 # Factorizations : 0
% 0.20/0.50 # NegExts : 0
% 0.20/0.50 # Equation resolutions : 0
% 0.20/0.50 # Disequality decompositions : 0
% 0.20/0.50 # Total rewrite steps : 0
% 0.20/0.50 # ...of those cached : 0
% 0.20/0.50 # Propositional unsat checks : 0
% 0.20/0.50 # Propositional check models : 0
% 0.20/0.50 # Propositional check unsatisfiable : 0
% 0.20/0.50 # Propositional clauses : 0
% 0.20/0.50 # Propositional clauses after purity: 0
% 0.20/0.50 # Propositional unsat core size : 0
% 0.20/0.50 # Propositional preprocessing time : 0.000
% 0.20/0.50 # Propositional encoding time : 0.000
% 0.20/0.50 # Propositional solver time : 0.000
% 0.20/0.50 # Success case prop preproc time : 0.000
% 0.20/0.50 # Success case prop encoding time : 0.000
% 0.20/0.50 # Success case prop solver time : 0.000
% 0.20/0.50 # Current number of processed clauses : 2
% 0.20/0.50 # Positive orientable unit clauses : 1
% 0.20/0.50 # Positive unorientable unit clauses: 0
% 0.20/0.50 # Negative unit clauses : 1
% 0.20/0.50 # Non-unit-clauses : 0
% 0.20/0.50 # Current number of unprocessed clauses: 0
% 0.20/0.50 # ...number of literals in the above : 0
% 0.20/0.50 # Current number of archived formulas : 0
% 0.20/0.50 # Current number of archived clauses : 4
% 0.20/0.50 # Clause-clause subsumption calls (NU) : 2
% 0.20/0.50 # Rec. Clause-clause subsumption calls : 2
% 0.20/0.50 # Non-unit clause-clause subsumptions : 2
% 0.20/0.50 # Unit Clause-clause subsumption calls : 2
% 0.20/0.50 # Rewrite failures with RHS unbound : 0
% 0.20/0.50 # BW rewrite match attempts : 0
% 0.20/0.50 # BW rewrite match successes : 0
% 0.20/0.50 # Condensation attempts : 0
% 0.20/0.50 # Condensation successes : 0
% 0.20/0.50 # Termbank termtop insertions : 2317
% 0.20/0.50 # Search garbage collected termcells : 464
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.006 s
% 0.20/0.50 # System time : 0.001 s
% 0.20/0.50 # Total time : 0.007 s
% 0.20/0.50 # Maximum resident set size: 1916 pages
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.009 s
% 0.20/0.50 # System time : 0.003 s
% 0.20/0.50 # Total time : 0.012 s
% 0.20/0.50 # Maximum resident set size: 1800 pages
% 0.20/0.50 % E---3.1 exiting
% 0.20/0.50 % E exiting
%------------------------------------------------------------------------------