TSTP Solution File: ITP118^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ITP118^1 : TPTP v8.2.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n003.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 22:16:23 EDT 2024
% Result : Theorem 0.48s 0.59s
% Output : CNFRefutation 0.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 18
% Syntax : Number of formulae : 29 ( 15 unt; 14 typ; 0 def)
% Number of atoms : 15 ( 14 equ; 0 cnn)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 100 ( 4 ~; 0 |; 0 &; 96 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Number of types : 4 ( 4 usr)
% Number of type conns : 9 ( 9 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 10 usr; 5 con; 0-2 aty)
% Number of variables : 12 ( 0 ^ 12 !; 0 ?; 12 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
real: $tType ).
thf(decl_sort2,type,
int: $tType ).
thf(decl_sort3,type,
n: $tType ).
thf(decl_sort4,type,
finite1489363574real_n: $tType ).
thf(decl_39,type,
finite772340589real_n: finite1489363574real_n > n > real ).
thf(decl_44,type,
abs_abs_int: int > int ).
thf(decl_45,type,
abs_abs_real: real > real ).
thf(decl_49,type,
minus_1037315151real_n: finite1489363574real_n > finite1489363574real_n > finite1489363574real_n ).
thf(decl_51,type,
minus_minus_real: real > real > real ).
thf(decl_70,type,
ring_1_of_int_real: int > real ).
thf(decl_104,type,
i: n ).
thf(decl_105,type,
m: int ).
thf(decl_106,type,
x: finite1489363574real_n ).
thf(decl_107,type,
y: finite1489363574real_n ).
thf(conj_0,conjecture,
( ( ring_1_of_int_real @ ( abs_abs_int @ m ) )
= ( abs_abs_real @ ( finite772340589real_n @ ( minus_1037315151real_n @ x @ y ) @ i ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).
thf(fact_9_of__int__abs,axiom,
! [X14: int] :
( ( ring_1_of_int_real @ ( abs_abs_int @ X14 ) )
= ( abs_abs_real @ ( ring_1_of_int_real @ X14 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_9_of__int__abs) ).
thf(fact_6_vector__minus__component,axiom,
! [X8: finite1489363574real_n,X9: finite1489363574real_n,X10: n] :
( ( finite772340589real_n @ ( minus_1037315151real_n @ X8 @ X9 ) @ X10 )
= ( minus_minus_real @ ( finite772340589real_n @ X8 @ X10 ) @ ( finite772340589real_n @ X9 @ X10 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_6_vector__minus__component) ).
thf(fact_2_m,axiom,
( ( ring_1_of_int_real @ m )
= ( minus_minus_real @ ( finite772340589real_n @ x @ i ) @ ( finite772340589real_n @ y @ i ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_2_m) ).
thf(c_0_4,negated_conjecture,
( ( ring_1_of_int_real @ ( abs_abs_int @ m ) )
!= ( abs_abs_real @ ( finite772340589real_n @ ( minus_1037315151real_n @ x @ y ) @ i ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).
thf(c_0_5,negated_conjecture,
( ( ring_1_of_int_real @ ( abs_abs_int @ m ) )
!= ( abs_abs_real @ ( finite772340589real_n @ ( minus_1037315151real_n @ x @ y ) @ i ) ) ),
inference(fof_nnf,[status(thm)],[c_0_4]) ).
thf(c_0_6,plain,
! [X1279: int] :
( ( ring_1_of_int_real @ ( abs_abs_int @ X1279 ) )
= ( abs_abs_real @ ( ring_1_of_int_real @ X1279 ) ) ),
inference(variable_rename,[status(thm)],[fact_9_of__int__abs]) ).
thf(c_0_7,plain,
! [X1341: finite1489363574real_n,X1342: finite1489363574real_n,X1343: n] :
( ( finite772340589real_n @ ( minus_1037315151real_n @ X1341 @ X1342 ) @ X1343 )
= ( minus_minus_real @ ( finite772340589real_n @ X1341 @ X1343 ) @ ( finite772340589real_n @ X1342 @ X1343 ) ) ),
inference(variable_rename,[status(thm)],[fact_6_vector__minus__component]) ).
thf(c_0_8,negated_conjecture,
( ( ring_1_of_int_real @ ( abs_abs_int @ m ) )
!= ( abs_abs_real @ ( finite772340589real_n @ ( minus_1037315151real_n @ x @ y ) @ i ) ) ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_9,plain,
! [X1: int] :
( ( ring_1_of_int_real @ ( abs_abs_int @ X1 ) )
= ( abs_abs_real @ ( ring_1_of_int_real @ X1 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
thf(c_0_10,plain,
( ( ring_1_of_int_real @ m )
= ( minus_minus_real @ ( finite772340589real_n @ x @ i ) @ ( finite772340589real_n @ y @ i ) ) ),
inference(split_conjunct,[status(thm)],[fact_2_m]) ).
thf(c_0_11,plain,
! [X9: finite1489363574real_n,X8: finite1489363574real_n,X7: n] :
( ( finite772340589real_n @ ( minus_1037315151real_n @ X8 @ X9 ) @ X7 )
= ( minus_minus_real @ ( finite772340589real_n @ X8 @ X7 ) @ ( finite772340589real_n @ X9 @ X7 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_12,negated_conjecture,
( ( abs_abs_real @ ( finite772340589real_n @ ( minus_1037315151real_n @ x @ y ) @ i ) )
!= ( abs_abs_real @ ( ring_1_of_int_real @ m ) ) ),
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
thf(c_0_13,plain,
( ( finite772340589real_n @ ( minus_1037315151real_n @ x @ y ) @ i )
= ( ring_1_of_int_real @ m ) ),
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
thf(c_0_14,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : ITP118^1 : TPTP v8.2.0. Released v7.5.0.
% 0.04/0.14 % Command : run_E %s %d THM
% 0.14/0.36 % Computer : n003.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 300
% 0.14/0.36 % DateTime : Sat May 18 16:21:23 EDT 2024
% 0.14/0.36 % CPUTime :
% 0.22/0.51 Running higher-order theorem proving
% 0.22/0.51 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.48/0.59 # Version: 3.1.0-ho
% 0.48/0.59 # Preprocessing class: HSLSSMSMSSMNHFA.
% 0.48/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.48/0.59 # Starting new_ho_3 with 1500s (5) cores
% 0.48/0.59 # Starting sh7 with 300s (1) cores
% 0.48/0.59 # Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.48/0.59 # Starting pre_casc_7 with 300s (1) cores
% 0.48/0.59 # new_ho_3 with pid 26828 completed with status 0
% 0.48/0.59 # Result found by new_ho_3
% 0.48/0.59 # Preprocessing class: HSLSSMSMSSMNHFA.
% 0.48/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.48/0.59 # Starting new_ho_3 with 1500s (5) cores
% 0.48/0.59 # SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
% 0.48/0.59 # Search class: HGHSM-FSLM32-MHFFFSBN
% 0.48/0.59 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.48/0.59 # Starting sh9 with 811s (1) cores
% 0.48/0.59 # Starting new_ho_3 with 151s (1) cores
% 0.48/0.59 # Starting almost_fo_1 with 136s (1) cores
% 0.48/0.59 # Starting lpo6_lambda_fix with 136s (1) cores
% 0.48/0.59 # Starting sh6 with 136s (1) cores
% 0.48/0.59 # sh9 with pid 26832 completed with status 0
% 0.48/0.59 # Result found by sh9
% 0.48/0.59 # Preprocessing class: HSLSSMSMSSMNHFA.
% 0.48/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.48/0.59 # Starting new_ho_3 with 1500s (5) cores
% 0.48/0.59 # SinE strategy is GSinE(CountFormulas,hypos,5,,4,20000,1.0,true)
% 0.48/0.59 # Search class: HGHSM-FSLM32-MHFFFSBN
% 0.48/0.59 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.48/0.59 # Starting sh9 with 811s (1) cores
% 0.48/0.59 # Preprocessing time : 0.008 s
% 0.48/0.59 # Presaturation interreduction done
% 0.48/0.59
% 0.48/0.59 # Proof found!
% 0.48/0.59 # SZS status Theorem
% 0.48/0.59 # SZS output start CNFRefutation
% See solution above
% 0.48/0.59 # Parsed axioms : 466
% 0.48/0.59 # Removed by relevancy pruning/SinE : 172
% 0.48/0.59 # Initial clauses : 537
% 0.48/0.59 # Removed in clause preprocessing : 21
% 0.48/0.59 # Initial clauses in saturation : 516
% 0.48/0.59 # Processed clauses : 247
% 0.48/0.59 # ...of these trivial : 11
% 0.48/0.59 # ...subsumed : 28
% 0.48/0.59 # ...remaining for further processing : 208
% 0.48/0.59 # Other redundant clauses eliminated : 30
% 0.48/0.59 # Clauses deleted for lack of memory : 0
% 0.48/0.59 # Backward-subsumed : 0
% 0.48/0.59 # Backward-rewritten : 6
% 0.48/0.59 # Generated clauses : 30
% 0.48/0.59 # ...of the previous two non-redundant : 11
% 0.48/0.59 # ...aggressively subsumed : 0
% 0.48/0.59 # Contextual simplify-reflections : 1
% 0.48/0.59 # Paramodulations : 0
% 0.48/0.59 # Factorizations : 0
% 0.48/0.59 # NegExts : 0
% 0.48/0.59 # Equation resolutions : 30
% 0.48/0.59 # Disequality decompositions : 0
% 0.48/0.59 # Total rewrite steps : 54
% 0.48/0.59 # ...of those cached : 17
% 0.48/0.59 # Propositional unsat checks : 0
% 0.48/0.59 # Propositional check models : 0
% 0.48/0.59 # Propositional check unsatisfiable : 0
% 0.48/0.59 # Propositional clauses : 0
% 0.48/0.59 # Propositional clauses after purity: 0
% 0.48/0.59 # Propositional unsat core size : 0
% 0.48/0.59 # Propositional preprocessing time : 0.000
% 0.48/0.59 # Propositional encoding time : 0.000
% 0.48/0.59 # Propositional solver time : 0.000
% 0.48/0.59 # Success case prop preproc time : 0.000
% 0.48/0.59 # Success case prop encoding time : 0.000
% 0.48/0.59 # Success case prop solver time : 0.000
% 0.48/0.59 # Current number of processed clauses : 172
% 0.48/0.59 # Positive orientable unit clauses : 75
% 0.48/0.59 # Positive unorientable unit clauses: 7
% 0.48/0.59 # Negative unit clauses : 2
% 0.48/0.59 # Non-unit-clauses : 88
% 0.48/0.59 # Current number of unprocessed clauses: 280
% 0.48/0.59 # ...number of literals in the above : 999
% 0.48/0.59 # Current number of archived formulas : 0
% 0.48/0.59 # Current number of archived clauses : 6
% 0.48/0.59 # Clause-clause subsumption calls (NU) : 1338
% 0.48/0.59 # Rec. Clause-clause subsumption calls : 1281
% 0.48/0.59 # Non-unit clause-clause subsumptions : 25
% 0.48/0.59 # Unit Clause-clause subsumption calls : 82
% 0.48/0.59 # Rewrite failures with RHS unbound : 0
% 0.48/0.59 # BW rewrite match attempts : 7
% 0.48/0.59 # BW rewrite match successes : 7
% 0.48/0.59 # Condensation attempts : 247
% 0.48/0.59 # Condensation successes : 0
% 0.48/0.59 # Termbank termtop insertions : 33924
% 0.48/0.59 # Search garbage collected termcells : 9054
% 0.48/0.59
% 0.48/0.59 # -------------------------------------------------
% 0.48/0.59 # User time : 0.045 s
% 0.48/0.59 # System time : 0.010 s
% 0.48/0.59 # Total time : 0.055 s
% 0.48/0.59 # Maximum resident set size: 4576 pages
% 0.48/0.59
% 0.48/0.59 # -------------------------------------------------
% 0.48/0.59 # User time : 0.115 s
% 0.48/0.59 # System time : 0.033 s
% 0.48/0.59 # Total time : 0.148 s
% 0.48/0.59 # Maximum resident set size: 2600 pages
% 0.48/0.59 % E---3.1 exiting
% 0.48/0.59 % E exiting
%------------------------------------------------------------------------------