TSTP Solution File: ITP064^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ITP064^1 : TPTP v8.2.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n020.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:08 EDT 2024
% Result : Theorem 0.68s 0.70s
% Output : CNFRefutation 0.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 17
% Syntax : Number of formulae : 30 ( 14 unt; 12 typ; 0 def)
% Number of atoms : 25 ( 4 equ; 0 cnn)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 135 ( 8 ~; 5 |; 1 &; 120 @)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 6 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 10 ( 10 >; 0 *; 0 +; 0 <<)
% Number of symbols : 12 ( 10 usr; 6 con; 0-2 aty)
% Number of variables : 18 ( 2 ^ 16 !; 0 ?; 18 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
real: $tType ).
thf(decl_sort2,type,
nat: $tType ).
thf(decl_26,type,
genClo1015804716orrect: nat > real > $o ).
thf(decl_32,type,
genClo1163638703lle_te: nat > nat > real ).
thf(decl_36,type,
one_one_nat: nat ).
thf(decl_38,type,
plus_plus_nat: nat > nat > nat ).
thf(decl_45,type,
ord_less_eq_real: real > real > $o ).
thf(decl_47,type,
ord_max_real: real > real > real ).
thf(decl_49,type,
i: nat ).
thf(decl_50,type,
l: nat ).
thf(decl_51,type,
m: nat ).
thf(decl_52,type,
p: nat ).
thf(fact_147_add_Ocommute,axiom,
( plus_plus_nat
= ( ^ [X227: nat,X228: nat] : ( plus_plus_nat @ X228 @ X227 ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_147_add_Ocommute) ).
thf(conj_0,conjecture,
genClo1015804716orrect @ m @ ( ord_max_real @ ( genClo1163638703lle_te @ l @ i ) @ ( genClo1163638703lle_te @ m @ i ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).
thf(fact_0_correct__closed,axiom,
! [X1: nat,X2: real,X3: real] :
( ( ( ord_less_eq_real @ X2 @ X3 )
& ( genClo1015804716orrect @ X1 @ X3 ) )
=> ( genClo1015804716orrect @ X1 @ X2 ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_0_correct__closed) ).
thf(fact_3_tml__le__tp,axiom,
ord_less_eq_real @ ( ord_max_real @ ( genClo1163638703lle_te @ l @ i ) @ ( genClo1163638703lle_te @ m @ i ) ) @ ( genClo1163638703lle_te @ p @ ( plus_plus_nat @ i @ one_one_nat ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_3_tml__le__tp) ).
thf(fact_1_corr__m,axiom,
genClo1015804716orrect @ m @ ( genClo1163638703lle_te @ p @ ( plus_plus_nat @ i @ one_one_nat ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_1_corr__m) ).
thf(c_0_5,plain,
! [X1338: nat,X1339: nat] :
( ( plus_plus_nat @ X1338 @ X1339 )
= ( plus_plus_nat @ X1339 @ X1338 ) ),
inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[fact_147_add_Ocommute])]) ).
thf(c_0_6,negated_conjecture,
~ ( genClo1015804716orrect @ m @ ( ord_max_real @ ( genClo1163638703lle_te @ l @ i ) @ ( genClo1163638703lle_te @ m @ i ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).
thf(c_0_7,plain,
! [X1355: nat,X1356: real,X1357: real] :
( ~ ( ord_less_eq_real @ X1356 @ X1357 )
| ~ ( genClo1015804716orrect @ X1355 @ X1357 )
| ( genClo1015804716orrect @ X1355 @ X1356 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_0_correct__closed])])]) ).
thf(c_0_8,plain,
! [X1754: nat,X1755: nat] :
( ( plus_plus_nat @ X1754 @ X1755 )
= ( plus_plus_nat @ X1755 @ X1754 ) ),
inference(variable_rename,[status(thm)],[c_0_5]) ).
thf(c_0_9,negated_conjecture,
~ ( genClo1015804716orrect @ m @ ( ord_max_real @ ( genClo1163638703lle_te @ l @ i ) @ ( genClo1163638703lle_te @ m @ i ) ) ),
inference(fof_nnf,[status(thm)],[c_0_6]) ).
thf(c_0_10,plain,
! [X1: nat,X2: real,X3: real] :
( ( genClo1015804716orrect @ X1 @ X2 )
| ~ ( ord_less_eq_real @ X2 @ X3 )
| ~ ( genClo1015804716orrect @ X1 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
thf(c_0_11,plain,
ord_less_eq_real @ ( ord_max_real @ ( genClo1163638703lle_te @ l @ i ) @ ( genClo1163638703lle_te @ m @ i ) ) @ ( genClo1163638703lle_te @ p @ ( plus_plus_nat @ i @ one_one_nat ) ),
inference(split_conjunct,[status(thm)],[fact_3_tml__le__tp]) ).
thf(c_0_12,plain,
! [X5: nat,X1: nat] :
( ( plus_plus_nat @ X1 @ X5 )
= ( plus_plus_nat @ X5 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_13,plain,
genClo1015804716orrect @ m @ ( genClo1163638703lle_te @ p @ ( plus_plus_nat @ i @ one_one_nat ) ),
inference(split_conjunct,[status(thm)],[fact_1_corr__m]) ).
thf(c_0_14,negated_conjecture,
~ ( genClo1015804716orrect @ m @ ( ord_max_real @ ( genClo1163638703lle_te @ l @ i ) @ ( genClo1163638703lle_te @ m @ i ) ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_15,plain,
! [X1: nat] :
( ( genClo1015804716orrect @ X1 @ ( ord_max_real @ ( genClo1163638703lle_te @ l @ i ) @ ( genClo1163638703lle_te @ m @ i ) ) )
| ~ ( genClo1015804716orrect @ X1 @ ( genClo1163638703lle_te @ p @ ( plus_plus_nat @ one_one_nat @ i ) ) ) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
thf(c_0_16,plain,
genClo1015804716orrect @ m @ ( genClo1163638703lle_te @ p @ ( plus_plus_nat @ one_one_nat @ i ) ),
inference(spm,[status(thm)],[c_0_13,c_0_12]) ).
thf(c_0_17,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : ITP064^1 : TPTP v8.2.0. Released v7.5.0.
% 0.08/0.15 % Command : run_E %s %d THM
% 0.14/0.37 % Computer : n020.cluster.edu
% 0.14/0.37 % Model : x86_64 x86_64
% 0.14/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37 % Memory : 8042.1875MB
% 0.14/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37 % CPULimit : 300
% 0.14/0.37 % WCLimit : 300
% 0.14/0.37 % DateTime : Sat May 18 18:33:08 EDT 2024
% 0.14/0.37 % 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/benchmark/theBenchmark.p
% 0.68/0.70 # Version: 3.1.0-ho
% 0.68/0.70 # Preprocessing class: HSLSSMSMSSSNHFA.
% 0.68/0.70 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.68/0.70 # Starting new_ho_10 with 1500s (5) cores
% 0.68/0.70 # Starting new_ho_10_cnf2 with 300s (1) cores
% 0.68/0.70 # Starting full_lambda_6 with 300s (1) cores
% 0.68/0.70 # Starting full_lambda_9 with 300s (1) cores
% 0.68/0.70 # new_ho_10 with pid 9806 completed with status 0
% 0.68/0.70 # Result found by new_ho_10
% 0.68/0.70 # Preprocessing class: HSLSSMSMSSSNHFA.
% 0.68/0.70 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.68/0.70 # Starting new_ho_10 with 1500s (5) cores
% 0.68/0.70 # No SInE strategy applied
% 0.68/0.70 # Search class: HGUSM-FSLM32-DHFFFFBN
% 0.68/0.70 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.68/0.70 # Starting new_ho_10 with 901s (1) cores
% 0.68/0.70 # Starting sh5l with 151s (1) cores
% 0.68/0.70 # Starting new_bool_1 with 151s (1) cores
% 0.68/0.70 # Starting ehoh_best8_lambda with 151s (1) cores
% 0.68/0.70 # Starting full_lambda_3 with 146s (1) cores
% 0.68/0.70 # sh5l with pid 9813 completed with status 0
% 0.68/0.70 # Result found by sh5l
% 0.68/0.70 # Preprocessing class: HSLSSMSMSSSNHFA.
% 0.68/0.70 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.68/0.70 # Starting new_ho_10 with 1500s (5) cores
% 0.68/0.70 # No SInE strategy applied
% 0.68/0.70 # Search class: HGUSM-FSLM32-DHFFFFBN
% 0.68/0.70 # Scheduled 5 strats onto 5 cores with 1500 seconds (1500 total)
% 0.68/0.70 # Starting new_ho_10 with 901s (1) cores
% 0.68/0.70 # Starting sh5l with 151s (1) cores
% 0.68/0.70 # Preprocessing time : 0.011 s
% 0.68/0.70 # Presaturation interreduction done
% 0.68/0.70
% 0.68/0.70 # Proof found!
% 0.68/0.70 # SZS status Theorem
% 0.68/0.70 # SZS output start CNFRefutation
% See solution above
% 0.68/0.70 # Parsed axioms : 392
% 0.68/0.70 # Removed by relevancy pruning/SinE : 0
% 0.68/0.70 # Initial clauses : 653
% 0.68/0.70 # Removed in clause preprocessing : 58
% 0.68/0.70 # Initial clauses in saturation : 595
% 0.68/0.70 # Processed clauses : 884
% 0.68/0.70 # ...of these trivial : 33
% 0.68/0.70 # ...subsumed : 302
% 0.68/0.70 # ...remaining for further processing : 549
% 0.68/0.70 # Other redundant clauses eliminated : 117
% 0.68/0.70 # Clauses deleted for lack of memory : 0
% 0.68/0.70 # Backward-subsumed : 7
% 0.68/0.70 # Backward-rewritten : 3
% 0.68/0.70 # Generated clauses : 1878
% 0.68/0.70 # ...of the previous two non-redundant : 1272
% 0.68/0.70 # ...aggressively subsumed : 0
% 0.68/0.70 # Contextual simplify-reflections : 0
% 0.68/0.70 # Paramodulations : 1750
% 0.68/0.70 # Factorizations : 4
% 0.68/0.70 # NegExts : 0
% 0.68/0.70 # Equation resolutions : 123
% 0.68/0.70 # Disequality decompositions : 0
% 0.68/0.70 # Total rewrite steps : 810
% 0.68/0.70 # ...of those cached : 585
% 0.68/0.70 # Propositional unsat checks : 0
% 0.68/0.70 # Propositional check models : 0
% 0.68/0.70 # Propositional check unsatisfiable : 0
% 0.68/0.70 # Propositional clauses : 0
% 0.68/0.70 # Propositional clauses after purity: 0
% 0.68/0.70 # Propositional unsat core size : 0
% 0.68/0.70 # Propositional preprocessing time : 0.000
% 0.68/0.70 # Propositional encoding time : 0.000
% 0.68/0.70 # Propositional solver time : 0.000
% 0.68/0.70 # Success case prop preproc time : 0.000
% 0.68/0.70 # Success case prop encoding time : 0.000
% 0.68/0.70 # Success case prop solver time : 0.000
% 0.68/0.70 # Current number of processed clauses : 196
% 0.68/0.70 # Positive orientable unit clauses : 70
% 0.68/0.70 # Positive unorientable unit clauses: 6
% 0.68/0.70 # Negative unit clauses : 4
% 0.68/0.70 # Non-unit-clauses : 116
% 0.68/0.70 # Current number of unprocessed clauses: 1251
% 0.68/0.70 # ...number of literals in the above : 2834
% 0.68/0.70 # Current number of archived formulas : 0
% 0.68/0.70 # Current number of archived clauses : 278
% 0.68/0.70 # Clause-clause subsumption calls (NU) : 22039
% 0.68/0.70 # Rec. Clause-clause subsumption calls : 17643
% 0.68/0.70 # Non-unit clause-clause subsumptions : 321
% 0.68/0.70 # Unit Clause-clause subsumption calls : 589
% 0.68/0.70 # Rewrite failures with RHS unbound : 0
% 0.68/0.70 # BW rewrite match attempts : 184
% 0.68/0.70 # BW rewrite match successes : 145
% 0.68/0.70 # Condensation attempts : 884
% 0.68/0.70 # Condensation successes : 24
% 0.68/0.70 # Termbank termtop insertions : 93183
% 0.68/0.70 # Search garbage collected termcells : 10110
% 0.68/0.70
% 0.68/0.70 # -------------------------------------------------
% 0.68/0.70 # User time : 0.124 s
% 0.68/0.70 # System time : 0.017 s
% 0.68/0.70 # Total time : 0.140 s
% 0.68/0.70 # Maximum resident set size: 4608 pages
% 0.68/0.70
% 0.68/0.70 # -------------------------------------------------
% 0.68/0.70 # User time : 0.478 s
% 0.68/0.70 # System time : 0.041 s
% 0.68/0.70 # Total time : 0.520 s
% 0.68/0.70 # Maximum resident set size: 2384 pages
% 0.68/0.70 % E---3.1 exiting
% 0.68/0.70 % E exiting
%------------------------------------------------------------------------------