TSTP Solution File: NUM417^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM417^1 : TPTP v8.1.2. Released v3.6.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 : Sat May 4 08:54:30 EDT 2024
% Result : Theorem 0.21s 0.53s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 6
% Syntax : Number of formulae : 16 ( 12 unt; 4 typ; 0 def)
% Number of atoms : 12 ( 11 equ; 0 cnn)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 108 ( 6 ~; 0 |; 0 &; 102 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 43 ( 43 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 4 usr; 2 con; 0-4 aty)
% Number of variables : 16 ( 4 ^ 12 !; 0 ?; 16 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_32,type,
ten: ( $i > $i ) > $i > $i ).
thf(decl_35,type,
mult: ( ( $i > $i ) > $i > $i ) > ( ( $i > $i ) > $i > $i ) > ( $i > $i ) > $i > $i ).
thf(decl_36,type,
esk1_1: $i > $i ).
thf(decl_41,type,
esk6_0: $i ).
thf(thm,conjecture,
( ( mult @ ( mult @ ten @ ten ) @ ( mult @ ten @ ten ) )
= ( mult @ ( mult @ ( mult @ ten @ ten ) @ ten ) @ ten ) ),
file('/export/starexec/sandbox2/tmp/tmp.igoD2VKNux/E---3.1_16998.p',thm) ).
thf(mult_ax,axiom,
( mult
= ( ^ [X4: ( $i > $i ) > $i > $i,X3: ( $i > $i ) > $i > $i,X1: $i > $i,X2: $i] : ( X4 @ ( X3 @ X1 ) @ X2 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.igoD2VKNux/E---3.1_16998.p',mult_ax) ).
thf(c_0_2,negated_conjecture,
( ( mult @ ( mult @ ten @ ten ) @ ( mult @ ten @ ten ) )
!= ( mult @ ( mult @ ( mult @ ten @ ten ) @ ten ) @ ten ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[thm])]) ).
thf(c_0_3,negated_conjecture,
( ( mult @ ( mult @ ten @ ten ) @ ( mult @ ten @ ten ) )
!= ( mult @ ( mult @ ( mult @ ten @ ten ) @ ten ) @ ten ) ),
inference(fof_nnf,[status(thm)],[c_0_2]) ).
thf(c_0_4,plain,
! [X34: ( $i > $i ) > $i > $i,X35: ( $i > $i ) > $i > $i,X36: $i > $i,X37: $i] :
( ( mult @ X34 @ X35 @ X36 @ X37 )
= ( X34 @ ( X35 @ X36 ) @ X37 ) ),
inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[mult_ax])]) ).
thf(c_0_5,negated_conjecture,
( ( mult @ ( mult @ ten @ ten ) @ ( mult @ ten @ ten ) )
!= ( mult @ ( mult @ ( mult @ ten @ ten ) @ ten ) @ ten ) ),
inference(split_conjunct,[status(thm)],[c_0_3]) ).
thf(c_0_6,plain,
! [X67: ( $i > $i ) > $i > $i,X68: ( $i > $i ) > $i > $i,X69: $i > $i,X70: $i] :
( ( mult @ X67 @ X68 @ X69 @ X70 )
= ( X67 @ ( X68 @ X69 ) @ X70 ) ),
inference(variable_rename,[status(thm)],[c_0_4]) ).
thf(c_0_7,negated_conjecture,
( ( mult @ ( mult @ ( mult @ ten @ ten ) @ ten ) @ ten @ esk1_1 )
!= ( mult @ ( mult @ ten @ ten ) @ ( mult @ ten @ ten ) @ esk1_1 ) ),
inference(neg_ext,[status(thm)],[c_0_5]) ).
thf(c_0_8,plain,
! [X1: $i > $i,X4: ( $i > $i ) > $i > $i,X3: ( $i > $i ) > $i > $i,X2: $i] :
( ( mult @ X3 @ X4 @ X1 @ X2 )
= ( X3 @ ( X4 @ X1 ) @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_9,negated_conjecture,
( ( ten @ ( ten @ ( mult @ ten @ ten @ esk1_1 ) ) @ esk6_0 )
!= ( ten @ ( ten @ ( ten @ ( ten @ esk1_1 ) ) ) @ esk6_0 ) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(neg_ext,[status(thm)],[c_0_7]),c_0_8]),c_0_8]),c_0_8]),c_0_8]),c_0_8]) ).
thf(c_0_10,negated_conjecture,
( ( mult @ ten @ ten @ esk1_1 )
!= ( ten @ ( ten @ esk1_1 ) ) ),
inference(ext_eqres,[status(thm)],[c_0_9]) ).
thf(c_0_11,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(neg_ext,[status(thm)],[c_0_10]),c_0_8])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : NUM417^1 : TPTP v8.1.2. Released v3.6.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.15/0.35 % Computer : n005.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 300
% 0.15/0.35 % DateTime : Fri May 3 09:15:11 EDT 2024
% 0.15/0.36 % CPUTime :
% 0.21/0.52 Running higher-order theorem proving
% 0.21/0.52 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/tmp/tmp.igoD2VKNux/E---3.1_16998.p
% 0.21/0.53 # Version: 3.1.0-ho
% 0.21/0.53 # Preprocessing class: HSSSSMSSMSSNHHN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting pre_casc_2 with 1500s (5) cores
% 0.21/0.53 # Starting sh2 with 300s (1) cores
% 0.21/0.53 # Starting sh3 with 300s (1) cores
% 0.21/0.53 # Starting new_ho_10 with 300s (1) cores
% 0.21/0.53 # sh3 with pid 17116 completed with status 0
% 0.21/0.53 # Result found by sh3
% 0.21/0.53 # Preprocessing class: HSSSSMSSMSSNHHN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting pre_casc_2 with 1500s (5) cores
% 0.21/0.53 # Starting sh2 with 300s (1) cores
% 0.21/0.53 # Starting sh3 with 300s (1) cores
% 0.21/0.53 # No SInE strategy applied
% 0.21/0.53 # Search class: HUUPM-FFSF32-DHHSFMNN
% 0.21/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.53 # Starting pre_casc_2 with 181s (1) cores
% 0.21/0.53 # pre_casc_2 with pid 17124 completed with status 0
% 0.21/0.53 # Result found by pre_casc_2
% 0.21/0.53 # Preprocessing class: HSSSSMSSMSSNHHN.
% 0.21/0.53 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.53 # Starting pre_casc_2 with 1500s (5) cores
% 0.21/0.53 # Starting sh2 with 300s (1) cores
% 0.21/0.53 # Starting sh3 with 300s (1) cores
% 0.21/0.53 # No SInE strategy applied
% 0.21/0.53 # Search class: HUUPM-FFSF32-DHHSFMNN
% 0.21/0.53 # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.53 # Starting pre_casc_2 with 181s (1) cores
% 0.21/0.53 # Preprocessing time : 0.001 s
% 0.21/0.53 # Presaturation interreduction done
% 0.21/0.53
% 0.21/0.53 # Proof found!
% 0.21/0.53 # SZS status Theorem
% 0.21/0.53 # SZS output start CNFRefutation
% See solution above
% 0.21/0.54 # Parsed axioms : 29
% 0.21/0.54 # Removed by relevancy pruning/SinE : 0
% 0.21/0.54 # Initial clauses : 29
% 0.21/0.54 # Removed in clause preprocessing : 14
% 0.21/0.54 # Initial clauses in saturation : 15
% 0.21/0.54 # Processed clauses : 36
% 0.21/0.54 # ...of these trivial : 0
% 0.21/0.54 # ...subsumed : 1
% 0.21/0.54 # ...remaining for further processing : 35
% 0.21/0.54 # Other redundant clauses eliminated : 0
% 0.21/0.54 # Clauses deleted for lack of memory : 0
% 0.21/0.54 # Backward-subsumed : 0
% 0.21/0.54 # Backward-rewritten : 0
% 0.21/0.54 # Generated clauses : 323
% 0.21/0.54 # ...of the previous two non-redundant : 321
% 0.21/0.54 # ...aggressively subsumed : 0
% 0.21/0.54 # Contextual simplify-reflections : 0
% 0.21/0.54 # Paramodulations : 310
% 0.21/0.54 # Factorizations : 0
% 0.21/0.54 # NegExts : 7
% 0.21/0.54 # Equation resolutions : 0
% 0.21/0.54 # Disequality decompositions : 0
% 0.21/0.54 # Total rewrite steps : 330
% 0.21/0.54 # ...of those cached : 301
% 0.21/0.54 # Propositional unsat checks : 0
% 0.21/0.54 # Propositional check models : 0
% 0.21/0.54 # Propositional check unsatisfiable : 0
% 0.21/0.54 # Propositional clauses : 0
% 0.21/0.54 # Propositional clauses after purity: 0
% 0.21/0.54 # Propositional unsat core size : 0
% 0.21/0.54 # Propositional preprocessing time : 0.000
% 0.21/0.54 # Propositional encoding time : 0.000
% 0.21/0.54 # Propositional solver time : 0.000
% 0.21/0.54 # Success case prop preproc time : 0.000
% 0.21/0.54 # Success case prop encoding time : 0.000
% 0.21/0.54 # Success case prop solver time : 0.000
% 0.21/0.54 # Current number of processed clauses : 20
% 0.21/0.54 # Positive orientable unit clauses : 6
% 0.21/0.54 # Positive unorientable unit clauses: 6
% 0.21/0.54 # Negative unit clauses : 8
% 0.21/0.54 # Non-unit-clauses : 0
% 0.21/0.54 # Current number of unprocessed clauses: 315
% 0.21/0.54 # ...number of literals in the above : 315
% 0.21/0.54 # Current number of archived formulas : 0
% 0.21/0.54 # Current number of archived clauses : 15
% 0.21/0.54 # Clause-clause subsumption calls (NU) : 0
% 0.21/0.54 # Rec. Clause-clause subsumption calls : 0
% 0.21/0.54 # Non-unit clause-clause subsumptions : 0
% 0.21/0.54 # Unit Clause-clause subsumption calls : 28
% 0.21/0.54 # Rewrite failures with RHS unbound : 0
% 0.21/0.54 # BW rewrite match attempts : 389
% 0.21/0.54 # BW rewrite match successes : 4
% 0.21/0.54 # Condensation attempts : 36
% 0.21/0.54 # Condensation successes : 0
% 0.21/0.54 # Termbank termtop insertions : 6307
% 0.21/0.54 # Search garbage collected termcells : 78
% 0.21/0.54
% 0.21/0.54 # -------------------------------------------------
% 0.21/0.54 # User time : 0.008 s
% 0.21/0.54 # System time : 0.002 s
% 0.21/0.54 # Total time : 0.010 s
% 0.21/0.54 # Maximum resident set size: 1756 pages
% 0.21/0.54
% 0.21/0.54 # -------------------------------------------------
% 0.21/0.54 # User time : 0.008 s
% 0.21/0.54 # System time : 0.005 s
% 0.21/0.54 # Total time : 0.013 s
% 0.21/0.54 # Maximum resident set size: 1744 pages
% 0.21/0.54 % E---3.1 exiting
% 0.21/0.54 % E exiting
%------------------------------------------------------------------------------