TSTP Solution File: SYO053^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : SYO053^2 : TPTP v8.2.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n011.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:44:26 EDT 2024
% Result : Theorem 0.13s 0.39s
% Output : CNFRefutation 0.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 12
% Syntax : Number of formulae : 22 ( 14 unt; 6 typ; 0 def)
% Number of atoms : 33 ( 11 equ; 0 cnn)
% Maximal formula atoms : 3 ( 2 avg)
% Number of connectives : 55 ( 16 ~; 5 |; 1 &; 33 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 3 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 49 ( 49 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 6 usr; 2 con; 0-3 aty)
% Number of variables : 36 ( 22 ^ 12 !; 2 ?; 36 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_24,type,
mnot: ( $i > $o ) > $i > $o ).
thf(decl_35,type,
mtrue: $i > $o ).
thf(decl_37,type,
mbox: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_38,type,
mdia: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_49,type,
mvalid: ( $i > $o ) > $o ).
thf(decl_53,type,
esk1_2: ( $i > $i > $o ) > $i > $i ).
thf(mdia,axiom,
( mdia
= ( ^ [X13: $i > $i > $o,X6: $i > $o] : ( mnot @ ( mbox @ X13 @ ( mnot @ X6 ) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax',mdia) ).
thf(mnot,axiom,
( mnot
= ( ^ [X6: $i > $o,X3: $i] :
~ ( X6 @ X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax',mnot) ).
thf(mbox,axiom,
( mbox
= ( ^ [X13: $i > $i > $o,X6: $i > $o,X3: $i] :
! [X14: $i] :
( ~ ( X13 @ X3 @ X14 )
| ( X6 @ X14 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax',mbox) ).
thf(mtrue,axiom,
( mtrue
= ( ^ [X3: $i] : $true ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax',mtrue) ).
thf(mvalid,axiom,
( mvalid
= ( ^ [X6: $i > $o] :
! [X3: $i] : ( X6 @ X3 ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/LCL013^0.ax',mvalid) ).
thf(conj,conjecture,
? [X13: $i > $i > $o] :
~ ( mvalid @ ( mdia @ X13 @ mtrue ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj) ).
thf(c_0_6,plain,
( mdia
= ( ^ [Z0: $i > $i > $o,Z1: $i > $o,Z2: $i] :
~ ! [X21: $i] :
( ~ ( Z0 @ Z2 @ X21 )
| ~ ( Z1 @ X21 ) ) ) ),
inference(fof_simplification,[status(thm)],[mdia]) ).
thf(c_0_7,plain,
( mnot
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ( Z0 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mnot]) ).
thf(c_0_8,plain,
( mbox
= ( ^ [Z0: $i > $i > $o,Z1: $i > $o,Z2: $i] :
! [X14: $i] :
( ~ ( Z0 @ Z2 @ X14 )
| ( Z1 @ X14 ) ) ) ),
inference(fof_simplification,[status(thm)],[mbox]) ).
thf(c_0_9,plain,
( mtrue
= ( ^ [Z0: $i] : $true ) ),
inference(fof_simplification,[status(thm)],[mtrue]) ).
thf(c_0_10,plain,
( mdia
= ( ^ [Z0: $i > $i > $o,Z1: $i > $o,Z2: $i] :
~ ! [X21: $i] :
( ~ ( Z0 @ Z2 @ X21 )
| ~ ( Z1 @ X21 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_6,c_0_7]),c_0_8]) ).
thf(c_0_11,plain,
( mvalid
= ( ^ [Z0: $i > $o] :
! [X3: $i] : ( Z0 @ X3 ) ) ),
inference(fof_simplification,[status(thm)],[mvalid]) ).
thf(c_0_12,negated_conjecture,
~ ? [X13: $i > $i > $o] :
~ ! [X23: $i] :
~ ! [X22: $i] :
( ~ ( X13 @ X23 @ X22 )
| ~ $true ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[conj]),c_0_9]),c_0_10]),c_0_11]) ).
thf(c_0_13,negated_conjecture,
! [X24: $i > $i > $o,X25: $i] :
( ( X24 @ X25 @ ( esk1_2 @ X24 @ X25 ) )
& $true ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])])])]) ).
thf(c_0_14,negated_conjecture,
! [X13: $i > $i > $o,X3: $i] : ( X13 @ X3 @ ( esk1_2 @ X13 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_15,negated_conjecture,
$false,
inference(flex_resolve,[status(thm)],[c_0_14]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : SYO053^2 : TPTP v8.2.0. Released v4.0.0.
% 0.00/0.09 % Command : run_E %s %d THM
% 0.09/0.28 % Computer : n011.cluster.edu
% 0.09/0.28 % Model : x86_64 x86_64
% 0.09/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.28 % Memory : 8042.1875MB
% 0.09/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28 % CPULimit : 300
% 0.09/0.28 % WCLimit : 300
% 0.09/0.28 % DateTime : Mon May 20 10:03:22 EDT 2024
% 0.09/0.28 % 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 21865 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: HUUNF-FFSF22-SHSSMMBN
% 0.13/0.39 # partial match(1): HGUNF-FFSF22-SHSSMMBN
% 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 21869 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: HUUNF-FFSF22-SHSSMMBN
% 0.13/0.39 # partial match(1): HGUNF-FFSF22-SHSSMMBN
% 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 : 64
% 0.13/0.39 # Removed by relevancy pruning/SinE : 0
% 0.13/0.39 # Initial clauses : 34
% 0.13/0.39 # Removed in clause preprocessing : 33
% 0.13/0.39 # Initial clauses in saturation : 1
% 0.13/0.39 # Processed clauses : 1
% 0.13/0.39 # ...of these trivial : 0
% 0.13/0.39 # ...subsumed : 0
% 0.13/0.39 # ...remaining for further processing : 0
% 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 : 0
% 0.13/0.39 # ...of the previous two non-redundant : 0
% 0.13/0.39 # ...aggressively subsumed : 0
% 0.13/0.39 # Contextual simplify-reflections : 0
% 0.13/0.39 # Paramodulations : 0
% 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 : 0
% 0.13/0.39 # ...of those cached : 0
% 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 : 0
% 0.13/0.39 # Positive orientable unit clauses : 0
% 0.13/0.39 # Positive unorientable unit clauses: 0
% 0.13/0.39 # Negative unit clauses : 0
% 0.13/0.39 # Non-unit-clauses : 0
% 0.13/0.39 # Current number of unprocessed clauses: 0
% 0.13/0.39 # ...number of literals in the above : 0
% 0.13/0.39 # Current number of archived formulas : 0
% 0.13/0.39 # Current number of archived clauses : 0
% 0.13/0.39 # Clause-clause subsumption calls (NU) : 0
% 0.13/0.39 # Rec. Clause-clause subsumption calls : 0
% 0.13/0.39 # Non-unit clause-clause subsumptions : 0
% 0.13/0.39 # Unit Clause-clause subsumption calls : 0
% 0.13/0.39 # Rewrite failures with RHS unbound : 0
% 0.13/0.39 # BW rewrite match attempts : 0
% 0.13/0.39 # BW rewrite match successes : 0
% 0.13/0.39 # Condensation attempts : 1
% 0.13/0.39 # Condensation successes : 0
% 0.13/0.39 # Termbank termtop insertions : 1829
% 0.13/0.39 # Search garbage collected termcells : 313
% 0.13/0.39
% 0.13/0.39 # -------------------------------------------------
% 0.13/0.39 # User time : 0.003 s
% 0.13/0.39 # System time : 0.001 s
% 0.13/0.39 # Total time : 0.004 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.006 s
% 0.13/0.39 # System time : 0.002 s
% 0.13/0.39 # Total time : 0.007 s
% 0.13/0.39 # Maximum resident set size: 1792 pages
% 0.13/0.39 % E---3.1 exiting
% 0.13/0.40 % E exiting
%------------------------------------------------------------------------------