TSTP Solution File: ANA125^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ANA125^1 : TPTP v8.2.0. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n021.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 : Mon May 20 18:38:20 EDT 2024
% Result : Theorem 0.17s 0.45s
% Output : CNFRefutation 0.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 15
% Syntax : Number of formulae : 32 ( 14 unt; 8 typ; 0 def)
% Number of atoms : 38 ( 14 equ; 0 cnn)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 120 ( 11 ~; 5 |; 1 &; 99 @)
% ( 0 <=>; 4 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 5 avg)
% Number of types : 2 ( 1 usr)
% Number of type conns : 25 ( 25 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 43 ( 6 ^ 37 !; 0 ?; 43 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
'type/realax/real': $tType ).
thf(decl_22,type,
'const/realax/real_mul': 'type/realax/real' > 'type/realax/real' > 'type/realax/real' ).
thf(decl_23,type,
'const/iterate/polynomial_function': ( 'type/realax/real' > 'type/realax/real' ) > $o ).
thf(decl_24,type,
esk1_0: 'type/realax/real' > 'type/realax/real' ).
thf(decl_25,type,
esk2_0: 'type/realax/real' ).
thf(decl_26,type,
esk3_2: ( 'type/realax/real' > 'type/realax/real' ) > 'type/realax/real' > 'type/realax/real' > 'type/realax/real' ).
thf(decl_27,type,
esk4_0: 'type/realax/real' > 'type/realax/real' ).
thf(decl_29,type,
esk6_2: ( 'type/realax/real' > 'type/realax/real' ) > 'type/realax/real' > 'type/realax/real' ).
thf('thm/iterate/POLYNOMIAL_FUNCTION_RMUL_',conjecture,
! [X1: 'type/realax/real' > 'type/realax/real',X2: 'type/realax/real'] :
( ( 'const/iterate/polynomial_function' @ X1 )
=> ( 'const/iterate/polynomial_function'
@ ^ [X3: 'type/realax/real'] : ( 'const/realax/real_mul' @ ( X1 @ X3 ) @ X2 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/iterate/POLYNOMIAL_FUNCTION_RMUL_') ).
thf('thm/iterate/POLYNOMIAL_FUNCTION_LMUL_',axiom,
! [X1: 'type/realax/real' > 'type/realax/real',X2: 'type/realax/real'] :
( ( 'const/iterate/polynomial_function' @ X1 )
=> ( 'const/iterate/polynomial_function'
@ ^ [X3: 'type/realax/real'] : ( 'const/realax/real_mul' @ X2 @ ( X1 @ X3 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/iterate/POLYNOMIAL_FUNCTION_LMUL_') ).
thf('thm/realax/REAL_MUL_SYM_',axiom,
! [X4: 'type/realax/real',X2: 'type/realax/real'] :
( ( 'const/realax/real_mul' @ X4 @ X2 )
= ( 'const/realax/real_mul' @ X2 @ X4 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p','thm/realax/REAL_MUL_SYM_') ).
thf(c_0_3,negated_conjecture,
~ ! [X1: 'type/realax/real' > 'type/realax/real',X2: 'type/realax/real'] :
( ( 'const/iterate/polynomial_function' @ X1 )
=> ( 'const/iterate/polynomial_function'
@ ^ [Z0: 'type/realax/real'] : ( 'const/realax/real_mul' @ ( X1 @ Z0 ) @ X2 ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],['thm/iterate/POLYNOMIAL_FUNCTION_RMUL_'])]) ).
thf(c_0_4,plain,
! [X1: 'type/realax/real' > 'type/realax/real',X2: 'type/realax/real'] :
( ( 'const/iterate/polynomial_function' @ X1 )
=> ( 'const/iterate/polynomial_function'
@ ^ [Z0: 'type/realax/real'] : ( 'const/realax/real_mul' @ X2 @ ( X1 @ Z0 ) ) ) ),
inference(fof_simplification,[status(thm)],['thm/iterate/POLYNOMIAL_FUNCTION_LMUL_']) ).
thf(c_0_5,negated_conjecture,
( ( 'const/iterate/polynomial_function' @ esk1_0 )
& ~ ( 'const/iterate/polynomial_function'
@ ^ [Z0: 'type/realax/real'] : ( 'const/realax/real_mul' @ ( esk1_0 @ Z0 ) @ esk2_0 ) ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).
thf(c_0_6,plain,
! [X18: 'type/realax/real'] :
( ( esk4_0 @ X18 )
= ( 'const/realax/real_mul' @ ( esk1_0 @ X18 ) @ esk2_0 ) ),
introduced(definition) ).
thf(c_0_7,plain,
! [X11: 'type/realax/real' > 'type/realax/real',X12: 'type/realax/real'] :
( ~ ( 'const/iterate/polynomial_function' @ X11 )
| ( 'const/iterate/polynomial_function'
@ ^ [Z0: 'type/realax/real'] : ( 'const/realax/real_mul' @ X12 @ ( X11 @ Z0 ) ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])]) ).
thf(c_0_8,plain,
! [X17: 'type/realax/real',X2: 'type/realax/real',X1: 'type/realax/real' > 'type/realax/real'] :
( ( esk3_2 @ X1 @ X2 @ X17 )
= ( 'const/realax/real_mul' @ X2 @ ( X1 @ X17 ) ) ),
introduced(definition) ).
thf(c_0_9,negated_conjecture,
( ( 'const/iterate/polynomial_function' @ esk4_0 )
!= $true ),
inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_5]),c_0_6]) ).
thf(c_0_10,plain,
! [X2: 'type/realax/real',X1: 'type/realax/real' > 'type/realax/real'] :
( ( ( 'const/iterate/polynomial_function' @ ( esk3_2 @ X1 @ X2 ) )
= $true )
| ~ ( 'const/iterate/polynomial_function' @ X1 ) ),
inference(lift_lambdas,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_7]),c_0_8]) ).
thf(c_0_11,negated_conjecture,
~ ( 'const/iterate/polynomial_function' @ esk4_0 ),
inference(cn,[status(thm)],[c_0_9]) ).
thf(c_0_12,plain,
! [X2: 'type/realax/real',X1: 'type/realax/real' > 'type/realax/real'] :
( ( 'const/iterate/polynomial_function' @ ( esk3_2 @ X1 @ X2 ) )
| ~ ( 'const/iterate/polynomial_function' @ X1 ) ),
inference(cn,[status(thm)],[c_0_10]) ).
thf(c_0_13,plain,
! [X19: 'type/realax/real',X20: 'type/realax/real',X21: 'type/realax/real' > 'type/realax/real'] :
( ( esk3_2 @ X21 @ X20 @ X19 )
= ( 'const/realax/real_mul' @ X20 @ ( X21 @ X19 ) ) ),
inference(variable_rename,[status(thm)],]) ).
thf(c_0_14,plain,
! [X22: 'type/realax/real'] :
( ( esk4_0 @ X22 )
= ( 'const/realax/real_mul' @ ( esk1_0 @ X22 ) @ esk2_0 ) ),
inference(variable_rename,[status(thm)],]) ).
thf(c_0_15,plain,
! [X13: 'type/realax/real',X14: 'type/realax/real'] :
( ( 'const/realax/real_mul' @ X13 @ X14 )
= ( 'const/realax/real_mul' @ X14 @ X13 ) ),
inference(variable_rename,[status(thm)],['thm/realax/REAL_MUL_SYM_']) ).
thf(c_0_16,plain,
! [X2: 'type/realax/real',X1: 'type/realax/real' > 'type/realax/real'] :
( ( ( esk3_2 @ X1 @ X2 )
!= esk4_0 )
| ~ ( 'const/iterate/polynomial_function' @ X1 ) ),
inference(ext_sup,[status(thm)],[c_0_11,c_0_12]) ).
thf(c_0_17,plain,
! [X1: 'type/realax/real' > 'type/realax/real',X2: 'type/realax/real',X3: 'type/realax/real'] :
( ( esk3_2 @ X1 @ X2 @ X3 )
= ( 'const/realax/real_mul' @ X2 @ ( X1 @ X3 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_18,plain,
! [X2: 'type/realax/real'] :
( ( esk4_0 @ X2 )
= ( 'const/realax/real_mul' @ ( esk1_0 @ X2 ) @ esk2_0 ) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
thf(c_0_19,plain,
! [X3: 'type/realax/real',X2: 'type/realax/real'] :
( ( 'const/realax/real_mul' @ X2 @ X3 )
= ( 'const/realax/real_mul' @ X3 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
thf(c_0_20,plain,
! [X2: 'type/realax/real',X1: 'type/realax/real' > 'type/realax/real'] :
( ( ( 'const/realax/real_mul' @ X2 @ ( X1 @ ( esk6_2 @ X1 @ X2 ) ) )
!= ( esk4_0 @ ( esk6_2 @ X1 @ X2 ) ) )
| ~ ( 'const/iterate/polynomial_function' @ X1 ) ),
inference(rw,[status(thm)],[inference(neg_ext,[status(thm)],[c_0_16]),c_0_17]) ).
thf(c_0_21,plain,
! [X2: 'type/realax/real'] :
( ( 'const/realax/real_mul' @ esk2_0 @ ( esk1_0 @ X2 ) )
= ( esk4_0 @ X2 ) ),
inference(spm,[status(thm)],[c_0_18,c_0_19]) ).
thf(c_0_22,negated_conjecture,
'const/iterate/polynomial_function' @ esk1_0,
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_23,plain,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : ANA125^1 : TPTP v8.2.0. Released v7.0.0.
% 0.11/0.12 % Command : run_E %s %d THM
% 0.12/0.32 % Computer : n021.cluster.edu
% 0.12/0.32 % Model : x86_64 x86_64
% 0.12/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.32 % Memory : 8042.1875MB
% 0.12/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.32 % CPULimit : 300
% 0.12/0.32 % WCLimit : 300
% 0.12/0.32 % DateTime : Mon May 20 08:00:08 EDT 2024
% 0.12/0.32 % CPUTime :
% 0.17/0.44 Running higher-order theorem proving
% 0.17/0.44 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.17/0.45 # Version: 3.1.0-ho
% 0.17/0.45 # Preprocessing class: HSSSSMSSSSMNSSN.
% 0.17/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45 # Starting sh3 with 1500s (5) cores
% 0.17/0.45 # Starting ehoh_best8_lambda with 300s (1) cores
% 0.17/0.45 # Starting sh2lt with 300s (1) cores
% 0.17/0.45 # Starting ho_unfolding_1 with 300s (1) cores
% 0.17/0.45 # sh3 with pid 28852 completed with status 0
% 0.17/0.45 # Result found by sh3
% 0.17/0.45 # Preprocessing class: HSSSSMSSSSMNSSN.
% 0.17/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45 # Starting sh3 with 1500s (5) cores
% 0.17/0.45 # No SInE strategy applied
% 0.17/0.45 # Search class: HHUSS-FFSF22-SSSFFFNN
% 0.17/0.45 # partial match(1): HHUSF-FFSF22-SSSFFFNN
% 0.17/0.45 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.45 # Starting new_ho_10 with 811s (1) cores
% 0.17/0.45 # Starting sh3 with 151s (1) cores
% 0.17/0.45 # Starting new_bool_1 with 136s (1) cores
% 0.17/0.45 # Starting new_bool_2 with 136s (1) cores
% 0.17/0.45 # Starting new_bool_9 with 136s (1) cores
% 0.17/0.45 # sh3 with pid 28861 completed with status 0
% 0.17/0.45 # Result found by sh3
% 0.17/0.45 # Preprocessing class: HSSSSMSSSSMNSSN.
% 0.17/0.45 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.45 # Starting sh3 with 1500s (5) cores
% 0.17/0.45 # No SInE strategy applied
% 0.17/0.45 # Search class: HHUSS-FFSF22-SSSFFFNN
% 0.17/0.45 # partial match(1): HHUSF-FFSF22-SSSFFFNN
% 0.17/0.45 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.17/0.45 # Starting new_ho_10 with 811s (1) cores
% 0.17/0.45 # Starting sh3 with 151s (1) cores
% 0.17/0.45 # Preprocessing time : 0.001 s
% 0.17/0.45 # Presaturation interreduction done
% 0.17/0.45
% 0.17/0.45 # Proof found!
% 0.17/0.45 # SZS status Theorem
% 0.17/0.45 # SZS output start CNFRefutation
% See solution above
% 0.17/0.45 # Parsed axioms : 6
% 0.17/0.45 # Removed by relevancy pruning/SinE : 0
% 0.17/0.45 # Initial clauses : 9
% 0.17/0.45 # Removed in clause preprocessing : 3
% 0.17/0.45 # Initial clauses in saturation : 6
% 0.17/0.45 # Processed clauses : 18
% 0.17/0.45 # ...of these trivial : 1
% 0.17/0.45 # ...subsumed : 0
% 0.17/0.45 # ...remaining for further processing : 17
% 0.17/0.45 # Other redundant clauses eliminated : 0
% 0.17/0.45 # Clauses deleted for lack of memory : 0
% 0.17/0.45 # Backward-subsumed : 0
% 0.17/0.45 # Backward-rewritten : 0
% 0.17/0.45 # Generated clauses : 10
% 0.17/0.45 # ...of the previous two non-redundant : 7
% 0.17/0.45 # ...aggressively subsumed : 0
% 0.17/0.45 # Contextual simplify-reflections : 0
% 0.17/0.45 # Paramodulations : 6
% 0.17/0.45 # Factorizations : 0
% 0.17/0.45 # NegExts : 2
% 0.17/0.45 # Equation resolutions : 0
% 0.17/0.45 # Disequality decompositions : 0
% 0.17/0.45 # Total rewrite steps : 5
% 0.17/0.45 # ...of those cached : 1
% 0.17/0.45 # Propositional unsat checks : 0
% 0.17/0.45 # Propositional check models : 0
% 0.17/0.45 # Propositional check unsatisfiable : 0
% 0.17/0.45 # Propositional clauses : 0
% 0.17/0.45 # Propositional clauses after purity: 0
% 0.17/0.45 # Propositional unsat core size : 0
% 0.17/0.45 # Propositional preprocessing time : 0.000
% 0.17/0.45 # Propositional encoding time : 0.000
% 0.17/0.45 # Propositional solver time : 0.000
% 0.17/0.45 # Success case prop preproc time : 0.000
% 0.17/0.45 # Success case prop encoding time : 0.000
% 0.17/0.45 # Success case prop solver time : 0.000
% 0.17/0.45 # Current number of processed clauses : 11
% 0.17/0.45 # Positive orientable unit clauses : 4
% 0.17/0.45 # Positive unorientable unit clauses: 1
% 0.17/0.45 # Negative unit clauses : 3
% 0.17/0.45 # Non-unit-clauses : 3
% 0.17/0.45 # Current number of unprocessed clauses: 0
% 0.17/0.45 # ...number of literals in the above : 0
% 0.17/0.45 # Current number of archived formulas : 0
% 0.17/0.45 # Current number of archived clauses : 6
% 0.17/0.45 # Clause-clause subsumption calls (NU) : 2
% 0.17/0.45 # Rec. Clause-clause subsumption calls : 1
% 0.17/0.45 # Non-unit clause-clause subsumptions : 0
% 0.17/0.45 # Unit Clause-clause subsumption calls : 3
% 0.17/0.45 # Rewrite failures with RHS unbound : 0
% 0.17/0.45 # BW rewrite match attempts : 8
% 0.17/0.45 # BW rewrite match successes : 6
% 0.17/0.45 # Condensation attempts : 0
% 0.17/0.45 # Condensation successes : 0
% 0.17/0.45 # Termbank termtop insertions : 550
% 0.17/0.45 # Search garbage collected termcells : 71
% 0.17/0.45
% 0.17/0.45 # -------------------------------------------------
% 0.17/0.45 # User time : 0.004 s
% 0.17/0.45 # System time : 0.002 s
% 0.17/0.45 # Total time : 0.006 s
% 0.17/0.45 # Maximum resident set size: 1828 pages
% 0.17/0.45
% 0.17/0.45 # -------------------------------------------------
% 0.17/0.45 # User time : 0.010 s
% 0.17/0.45 # System time : 0.009 s
% 0.17/0.45 # Total time : 0.019 s
% 0.17/0.45 # Maximum resident set size: 1720 pages
% 0.17/0.45 % E---3.1 exiting
% 0.17/0.46 % E exiting
%------------------------------------------------------------------------------