TSTP Solution File: NUM812^5 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM812^5 : TPTP v8.2.0. Bugfixed v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n018.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 01:17:24 EDT 2024
% Result : Theorem 0.14s 0.42s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of formulae : 14 ( 4 unt; 5 typ; 0 def)
% Number of atoms : 14 ( 11 equ; 0 cnn)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 62 ( 11 ~; 9 |; 5 &; 30 @)
% ( 1 <=>; 6 =>; 0 <=; 0 <~>)
% Maximal formula depth : 11 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 7 ( 7 >; 0 *; 0 +; 0 <<)
% Number of symbols : 7 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 18 ( 1 ^ 15 !; 2 ?; 18 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_22,type,
c0: $i ).
thf(decl_23,type,
cS: $i > $i ).
thf(decl_24,type,
cIND: $o ).
thf(decl_25,type,
esk1_1: ( $i > $o ) > $i ).
thf(decl_26,type,
esk2_0: $i ).
thf(cTHM578,conjecture,
( cIND
=> ! [X3: $i] :
( ( X3 = c0 )
| ? [X4: $i] :
( X3
= ( cS @ X4 ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cTHM578) ).
thf(cIND_def,axiom,
( cIND
<=> ! [X1: $i > $o] :
( ( ( X1 @ c0 )
& ! [X2: $i] :
( ( X1 @ X2 )
=> ( X1 @ ( cS @ X2 ) ) ) )
=> ! [X2: $i] : ( X1 @ X2 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cIND_def) ).
thf(c_0_2,negated_conjecture,
~ ( ! [X10: $i > $o] :
( ( ( X10 @ c0 )
& ! [X11: $i] :
( ( X10 @ X11 )
=> ( X10 @ ( cS @ X11 ) ) ) )
=> ! [X12: $i] : ( X10 @ X12 ) )
=> ! [X3: $i] :
( ( X3 = c0 )
| ? [X4: $i] :
( X3
= ( cS @ X4 ) ) ) ),
inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[cTHM578]),cIND_def]) ).
thf(c_0_3,negated_conjecture,
! [X13: $i > $o,X15: $i,X17: $i] :
( ( ( X13 @ ( esk1_1 @ X13 ) )
| ~ ( X13 @ c0 )
| ( X13 @ X15 ) )
& ( ~ ( X13 @ ( cS @ ( esk1_1 @ X13 ) ) )
| ~ ( X13 @ c0 )
| ( X13 @ X15 ) )
& ( esk2_0 != c0 )
& ( esk2_0
!= ( cS @ X17 ) ) ),
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_2])])])])])]) ).
thf(c_0_4,negated_conjecture,
! [X2: $i,X1: $i > $o] :
( ( X1 @ X2 )
| ~ ( X1 @ ( cS @ ( esk1_1 @ X1 ) ) )
| ~ ( X1 @ c0 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_5,negated_conjecture,
! [X2: $i] :
( esk2_0
!= ( cS @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_6,negated_conjecture,
! [X2: $i] :
( ( ( cS
@ ( esk1_1
@ ^ [Z0: $i] : ( Z0 != X2 ) ) )
= X2 )
| ( c0 = X2 ) ),
inference(eliminate_leibniz_eq,[status(thm)],[inference(cn,[status(thm)],[]),c_0_4]) ).
thf(c_0_7,negated_conjecture,
esk2_0 != c0,
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_8,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6])]),c_0_7]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : NUM812^5 : TPTP v8.2.0. Bugfixed v5.2.0.
% 0.00/0.09 % Command : run_E %s %d THM
% 0.09/0.29 % Computer : n018.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Mon May 20 07:34:37 EDT 2024
% 0.09/0.29 % CPUTime :
% 0.14/0.41 Running higher-order theorem proving
% 0.14/0.41 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.14/0.42 # Version: 3.1.0-ho
% 0.14/0.42 # Preprocessing class: HSSSSMSSSLSNSFA.
% 0.14/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.42 # Starting post_as_ho4 with 1200s (4) cores
% 0.14/0.42 # Starting post_as_ho5 with 600s (2) cores
% 0.14/0.42 # Starting new_ho_8 with 300s (1) cores
% 0.14/0.42 # Starting new_ho_4 with 300s (1) cores
% 0.14/0.42 # post_as_ho4 with pid 5703 completed with status 0
% 0.14/0.42 # Result found by post_as_ho4
% 0.14/0.42 # Preprocessing class: HSSSSMSSSLSNSFA.
% 0.14/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.42 # Starting post_as_ho4 with 1200s (4) cores
% 0.14/0.42 # No SInE strategy applied
% 0.14/0.42 # Search class: HGUSF-FFSF11-SSFFMMBN
% 0.14/0.42 # partial match(2): HGUNF-FFSF11-SSFFMSBN
% 0.14/0.42 # Scheduled 5 strats onto 4 cores with 1200 seconds (1200 total)
% 0.14/0.42 # Starting post_as_ho12 with 481s (1) cores
% 0.14/0.42 # Starting new_ho_8 with 181s (1) cores
% 0.14/0.42 # Starting new_ho_4 with 181s (1) cores
% 0.14/0.42 # Starting post_as_ho5 with 181s (1) cores
% 0.14/0.42 # new_ho_8 with pid 5712 completed with status 9
% 0.14/0.42 # Starting post_as_ho4 with 176s (1) cores
% 0.14/0.42 # new_ho_4 with pid 5713 completed with status 9
% 0.14/0.42 # post_as_ho5 with pid 5714 completed with status 0
% 0.14/0.42 # Result found by post_as_ho5
% 0.14/0.42 # Preprocessing class: HSSSSMSSSLSNSFA.
% 0.14/0.42 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.14/0.42 # Starting post_as_ho4 with 1200s (4) cores
% 0.14/0.42 # No SInE strategy applied
% 0.14/0.42 # Search class: HGUSF-FFSF11-SSFFMMBN
% 0.14/0.42 # partial match(2): HGUNF-FFSF11-SSFFMSBN
% 0.14/0.42 # Scheduled 5 strats onto 4 cores with 1200 seconds (1200 total)
% 0.14/0.42 # Starting post_as_ho12 with 481s (1) cores
% 0.14/0.42 # Starting new_ho_8 with 181s (1) cores
% 0.14/0.42 # Starting new_ho_4 with 181s (1) cores
% 0.14/0.42 # Starting post_as_ho5 with 181s (1) cores
% 0.14/0.42 # Preprocessing time : 0.001 s
% 0.14/0.42 # Presaturation interreduction done
% 0.14/0.42
% 0.14/0.42 # Proof found!
% 0.14/0.42 # SZS status Theorem
% 0.14/0.42 # SZS output start CNFRefutation
% See solution above
% 0.14/0.42 # Parsed axioms : 5
% 0.14/0.42 # Removed by relevancy pruning/SinE : 0
% 0.14/0.42 # Initial clauses : 7
% 0.14/0.42 # Removed in clause preprocessing : 3
% 0.14/0.42 # Initial clauses in saturation : 4
% 0.14/0.42 # Processed clauses : 15
% 0.14/0.42 # ...of these trivial : 0
% 0.14/0.42 # ...subsumed : 1
% 0.14/0.42 # ...remaining for further processing : 14
% 0.14/0.42 # Other redundant clauses eliminated : 3
% 0.14/0.42 # Clauses deleted for lack of memory : 0
% 0.14/0.42 # Backward-subsumed : 1
% 0.14/0.42 # Backward-rewritten : 1
% 0.14/0.42 # Generated clauses : 34
% 0.14/0.42 # ...of the previous two non-redundant : 26
% 0.14/0.42 # ...aggressively subsumed : 0
% 0.14/0.42 # Contextual simplify-reflections : 0
% 0.14/0.42 # Paramodulations : 19
% 0.14/0.42 # Factorizations : 4
% 0.14/0.42 # NegExts : 0
% 0.14/0.42 # Equation resolutions : 5
% 0.14/0.42 # Disequality decompositions : 0
% 0.14/0.42 # Total rewrite steps : 1
% 0.14/0.42 # ...of those cached : 0
% 0.14/0.42 # Propositional unsat checks : 0
% 0.14/0.42 # Propositional check models : 0
% 0.14/0.42 # Propositional check unsatisfiable : 0
% 0.14/0.42 # Propositional clauses : 0
% 0.14/0.42 # Propositional clauses after purity: 0
% 0.14/0.42 # Propositional unsat core size : 0
% 0.14/0.42 # Propositional preprocessing time : 0.000
% 0.14/0.42 # Propositional encoding time : 0.000
% 0.14/0.42 # Propositional solver time : 0.000
% 0.14/0.42 # Success case prop preproc time : 0.000
% 0.14/0.42 # Success case prop encoding time : 0.000
% 0.14/0.42 # Success case prop solver time : 0.000
% 0.14/0.42 # Current number of processed clauses : 8
% 0.14/0.42 # Positive orientable unit clauses : 1
% 0.14/0.42 # Positive unorientable unit clauses: 0
% 0.14/0.42 # Negative unit clauses : 2
% 0.14/0.42 # Non-unit-clauses : 5
% 0.14/0.42 # Current number of unprocessed clauses: 4
% 0.14/0.42 # ...number of literals in the above : 14
% 0.14/0.42 # Current number of archived formulas : 0
% 0.14/0.42 # Current number of archived clauses : 6
% 0.14/0.42 # Clause-clause subsumption calls (NU) : 5
% 0.14/0.42 # Rec. Clause-clause subsumption calls : 5
% 0.14/0.42 # Non-unit clause-clause subsumptions : 1
% 0.14/0.42 # Unit Clause-clause subsumption calls : 1
% 0.14/0.42 # Rewrite failures with RHS unbound : 0
% 0.14/0.42 # BW rewrite match attempts : 1
% 0.14/0.42 # BW rewrite match successes : 1
% 0.14/0.42 # Condensation attempts : 0
% 0.14/0.42 # Condensation successes : 0
% 0.14/0.42 # Termbank termtop insertions : 1344
% 0.14/0.42 # Search garbage collected termcells : 169
% 0.14/0.42
% 0.14/0.42 # -------------------------------------------------
% 0.14/0.42 # User time : 0.006 s
% 0.14/0.42 # System time : 0.004 s
% 0.14/0.42 # Total time : 0.010 s
% 0.14/0.42 # Maximum resident set size: 1788 pages
% 0.14/0.42
% 0.14/0.42 # -------------------------------------------------
% 0.14/0.42 # User time : 0.011 s
% 0.14/0.42 # System time : 0.007 s
% 0.14/0.42 # Total time : 0.018 s
% 0.14/0.42 # Maximum resident set size: 1704 pages
% 0.14/0.42 % E---3.1 exiting
% 0.14/0.43 % E exiting
%------------------------------------------------------------------------------