TSTP Solution File: NUM737^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : NUM737^1 : TPTP v8.2.0. Released v3.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n014.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:15:52 EDT 2024
% Result : Theorem 6.54s 1.31s
% Output : CNFRefutation 6.54s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 18
% Syntax : Number of formulae : 49 ( 27 unt; 10 typ; 0 def)
% Number of atoms : 51 ( 14 equ; 0 cnn)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 403 ( 13 ~; 10 |; 0 &; 378 @)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 6 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 6 ( 6 >; 0 *; 0 +; 0 <<)
% Number of symbols : 10 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 62 ( 0 ^ 62 !; 0 ?; 62 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
frac: $tType ).
thf(decl_sort2,type,
nat: $tType ).
thf(decl_22,type,
x: frac ).
thf(decl_23,type,
y: frac ).
thf(decl_24,type,
z: frac ).
thf(decl_25,type,
u: frac ).
thf(decl_26,type,
more: nat > nat > $o ).
thf(decl_27,type,
ts: nat > nat > nat ).
thf(decl_28,type,
num: frac > nat ).
thf(decl_29,type,
den: frac > nat ).
thf(satz32d,axiom,
! [X1: nat,X2: nat,X3: nat] :
( ( more @ X1 @ X2 )
=> ( more @ ( ts @ X3 @ X1 ) @ ( ts @ X3 @ X2 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz32d) ).
thf(satz31,axiom,
! [X1: nat,X2: nat,X3: nat] :
( ( ts @ ( ts @ X1 @ X2 ) @ X3 )
= ( ts @ X1 @ ( ts @ X2 @ X3 ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz31) ).
thf(satz33a,axiom,
! [X1: nat,X2: nat,X3: nat] :
( ( more @ ( ts @ X1 @ X3 ) @ ( ts @ X2 @ X3 ) )
=> ( more @ X1 @ X2 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz33a) ).
thf(m,axiom,
more @ ( ts @ ( num @ x ) @ ( den @ y ) ) @ ( ts @ ( num @ y ) @ ( den @ x ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',m) ).
thf(satz29,axiom,
! [X1: nat,X2: nat] :
( ( ts @ X1 @ X2 )
= ( ts @ X2 @ X1 ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz29) ).
thf(f,axiom,
( ( ts @ ( num @ y ) @ ( den @ u ) )
= ( ts @ ( num @ u ) @ ( den @ y ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',f) ).
thf(e,axiom,
( ( ts @ ( num @ x ) @ ( den @ z ) )
= ( ts @ ( num @ z ) @ ( den @ x ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',e) ).
thf(satz44,conjecture,
more @ ( ts @ ( num @ z ) @ ( den @ u ) ) @ ( ts @ ( num @ u ) @ ( den @ z ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',satz44) ).
thf(c_0_8,plain,
! [X22: nat,X23: nat,X24: nat] :
( ~ ( more @ X22 @ X23 )
| ( more @ ( ts @ X24 @ X22 ) @ ( ts @ X24 @ X23 ) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[satz32d])])]) ).
thf(c_0_9,plain,
! [X27: nat,X28: nat,X29: nat] :
( ( ts @ ( ts @ X27 @ X28 ) @ X29 )
= ( ts @ X27 @ ( ts @ X28 @ X29 ) ) ),
inference(variable_rename,[status(thm)],[satz31]) ).
thf(c_0_10,plain,
! [X19: nat,X20: nat,X21: nat] :
( ~ ( more @ ( ts @ X19 @ X21 ) @ ( ts @ X20 @ X21 ) )
| ( more @ X19 @ X20 ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[satz33a])])]) ).
thf(c_0_11,plain,
! [X1: nat,X3: nat,X2: nat] :
( ( more @ ( ts @ X3 @ X1 ) @ ( ts @ X3 @ X2 ) )
| ~ ( more @ X1 @ X2 ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_12,plain,
more @ ( ts @ ( num @ x ) @ ( den @ y ) ) @ ( ts @ ( num @ y ) @ ( den @ x ) ),
inference(split_conjunct,[status(thm)],[m]) ).
thf(c_0_13,plain,
! [X25: nat,X26: nat] :
( ( ts @ X25 @ X26 )
= ( ts @ X26 @ X25 ) ),
inference(variable_rename,[status(thm)],[satz29]) ).
thf(c_0_14,plain,
! [X1: nat,X2: nat,X3: nat] :
( ( ts @ ( ts @ X1 @ X2 ) @ X3 )
= ( ts @ X1 @ ( ts @ X2 @ X3 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
thf(c_0_15,plain,
( ( ts @ ( num @ y ) @ ( den @ u ) )
= ( ts @ ( num @ u ) @ ( den @ y ) ) ),
inference(split_conjunct,[status(thm)],[f]) ).
thf(c_0_16,plain,
! [X1: nat,X3: nat,X2: nat] :
( ( more @ X1 @ X3 )
| ~ ( more @ ( ts @ X1 @ X2 ) @ ( ts @ X3 @ X2 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_17,plain,
! [X1: nat] : ( more @ ( ts @ X1 @ ( ts @ ( num @ x ) @ ( den @ y ) ) ) @ ( ts @ X1 @ ( ts @ ( num @ y ) @ ( den @ x ) ) ) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
thf(c_0_18,plain,
! [X2: nat,X1: nat] :
( ( ts @ X1 @ X2 )
= ( ts @ X2 @ X1 ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_19,plain,
! [X1: nat] :
( ( ts @ ( num @ y ) @ ( ts @ ( den @ u ) @ X1 ) )
= ( ts @ ( num @ u ) @ ( ts @ ( den @ y ) @ X1 ) ) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_14]) ).
thf(c_0_20,plain,
! [X1: nat,X2: nat,X3: nat,X6: nat] :
( ( more @ ( ts @ X1 @ X2 ) @ X3 )
| ~ ( more @ ( ts @ X1 @ ( ts @ X2 @ X6 ) ) @ ( ts @ X3 @ X6 ) ) ),
inference(spm,[status(thm)],[c_0_16,c_0_14]) ).
thf(c_0_21,plain,
! [X1: nat] : ( more @ ( ts @ X1 @ ( ts @ ( num @ x ) @ ( den @ y ) ) ) @ ( ts @ ( num @ y ) @ ( ts @ ( den @ x ) @ X1 ) ) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_14]) ).
thf(c_0_22,plain,
! [X1: nat] :
( ( ts @ ( num @ y ) @ ( ts @ X1 @ ( den @ u ) ) )
= ( ts @ ( num @ u ) @ ( ts @ ( den @ y ) @ X1 ) ) ),
inference(spm,[status(thm)],[c_0_19,c_0_18]) ).
thf(c_0_23,plain,
! [X1: nat,X2: nat,X3: nat] :
( ( ts @ X1 @ ( ts @ X2 @ X3 ) )
= ( ts @ X2 @ ( ts @ X1 @ X3 ) ) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_18]),c_0_14]) ).
thf(c_0_24,plain,
! [X1: nat,X2: nat,X3: nat] :
( ( more @ X1 @ X2 )
| ~ ( more @ ( ts @ X3 @ X1 ) @ ( ts @ X2 @ X3 ) ) ),
inference(spm,[status(thm)],[c_0_16,c_0_18]) ).
thf(c_0_25,plain,
( ( ts @ ( num @ x ) @ ( den @ z ) )
= ( ts @ ( num @ z ) @ ( den @ x ) ) ),
inference(split_conjunct,[status(thm)],[e]) ).
thf(c_0_26,plain,
! [X1: nat,X2: nat,X3: nat,X6: nat,X7: nat] :
( ( more @ ( ts @ X1 @ X2 ) @ ( ts @ X3 @ X6 ) )
| ~ ( more @ ( ts @ X1 @ ( ts @ X2 @ X7 ) ) @ ( ts @ X3 @ ( ts @ X6 @ X7 ) ) ) ),
inference(spm,[status(thm)],[c_0_20,c_0_14]) ).
thf(c_0_27,plain,
more @ ( ts @ ( num @ x ) @ ( ts @ ( den @ u ) @ ( den @ y ) ) ) @ ( ts @ ( num @ u ) @ ( ts @ ( den @ x ) @ ( den @ y ) ) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_18]),c_0_23]) ).
thf(c_0_28,plain,
! [X1: nat,X3: nat,X2: nat] :
( ( more @ X1 @ X2 )
| ~ ( more @ ( ts @ X3 @ X1 ) @ ( ts @ X3 @ X2 ) ) ),
inference(spm,[status(thm)],[c_0_24,c_0_18]) ).
thf(c_0_29,plain,
! [X1: nat] :
( ( ts @ ( num @ x ) @ ( ts @ ( den @ z ) @ X1 ) )
= ( ts @ ( num @ z ) @ ( ts @ ( den @ x ) @ X1 ) ) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_25]),c_0_14]) ).
thf(c_0_30,plain,
more @ ( ts @ ( num @ x ) @ ( den @ u ) ) @ ( ts @ ( num @ u ) @ ( den @ x ) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
thf(c_0_31,negated_conjecture,
~ ( more @ ( ts @ ( num @ z ) @ ( den @ u ) ) @ ( ts @ ( num @ u ) @ ( den @ z ) ) ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[satz44])]) ).
thf(c_0_32,plain,
! [X1: nat,X2: nat] :
( ( more @ X1 @ ( ts @ ( den @ z ) @ X2 ) )
| ~ ( more @ ( ts @ ( num @ x ) @ X1 ) @ ( ts @ ( num @ z ) @ ( ts @ ( den @ x ) @ X2 ) ) ) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
thf(c_0_33,plain,
! [X1: nat] : ( more @ ( ts @ X1 @ ( ts @ ( num @ x ) @ ( den @ u ) ) ) @ ( ts @ X1 @ ( ts @ ( num @ u ) @ ( den @ x ) ) ) ),
inference(spm,[status(thm)],[c_0_11,c_0_30]) ).
thf(c_0_34,negated_conjecture,
~ ( more @ ( ts @ ( num @ z ) @ ( den @ u ) ) @ ( ts @ ( num @ u ) @ ( den @ z ) ) ),
inference(fof_nnf,[status(thm)],[c_0_31]) ).
thf(c_0_35,plain,
! [X1: nat,X2: nat] :
( ( more @ X1 @ ( ts @ ( den @ z ) @ X2 ) )
| ~ ( more @ ( ts @ ( num @ x ) @ X1 ) @ ( ts @ ( num @ z ) @ ( ts @ X2 @ ( den @ x ) ) ) ) ),
inference(spm,[status(thm)],[c_0_32,c_0_18]) ).
thf(c_0_36,plain,
! [X1: nat] : ( more @ ( ts @ ( num @ x ) @ ( ts @ X1 @ ( den @ u ) ) ) @ ( ts @ X1 @ ( ts @ ( num @ u ) @ ( den @ x ) ) ) ),
inference(spm,[status(thm)],[c_0_33,c_0_23]) ).
thf(c_0_37,negated_conjecture,
~ ( more @ ( ts @ ( num @ z ) @ ( den @ u ) ) @ ( ts @ ( num @ u ) @ ( den @ z ) ) ),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
thf(c_0_38,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_18]),c_0_37]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : NUM737^1 : TPTP v8.2.0. Released v3.7.0.
% 0.07/0.12 % Command : run_E %s %d THM
% 0.12/0.33 % Computer : n014.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Mon May 20 04:59:37 EDT 2024
% 0.12/0.33 % CPUTime :
% 0.18/0.46 Running higher-order theorem proving
% 0.18/0.46 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
% 6.54/1.31 # Version: 3.1.0-ho
% 6.54/1.31 # Preprocessing class: HSMSSMSSSSSNFFN.
% 6.54/1.31 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.54/1.31 # Starting new_ho_10 with 1500s (5) cores
% 6.54/1.31 # Starting new_bool_1 with 300s (1) cores
% 6.54/1.31 # Starting full_lambda_5 with 300s (1) cores
% 6.54/1.31 # Starting new_ho_10_unif with 300s (1) cores
% 6.54/1.31 # new_ho_10 with pid 21900 completed with status 0
% 6.54/1.31 # Result found by new_ho_10
% 6.54/1.31 # Preprocessing class: HSMSSMSSSSSNFFN.
% 6.54/1.31 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.54/1.31 # Starting new_ho_10 with 1500s (5) cores
% 6.54/1.31 # No SInE strategy applied
% 6.54/1.31 # Search class: HHUSS-FFSS21-SFFFFFNN
% 6.54/1.31 # partial match(1): FHUSS-FFSS21-SFFFFFNN
% 6.54/1.31 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 6.54/1.31 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 6.54/1.31 # Starting new_ho_10 with 151s (1) cores
% 6.54/1.31 # Starting new_bool_3 with 136s (1) cores
% 6.54/1.31 # Starting new_bool_1 with 136s (1) cores
% 6.54/1.31 # Starting sh5l with 136s (1) cores
% 6.54/1.31 # new_bool_3 with pid 21908 completed with status 0
% 6.54/1.31 # Result found by new_bool_3
% 6.54/1.31 # Preprocessing class: HSMSSMSSSSSNFFN.
% 6.54/1.31 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.54/1.31 # Starting new_ho_10 with 1500s (5) cores
% 6.54/1.31 # No SInE strategy applied
% 6.54/1.31 # Search class: HHUSS-FFSS21-SFFFFFNN
% 6.54/1.31 # partial match(1): FHUSS-FFSS21-SFFFFFNN
% 6.54/1.31 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 6.54/1.31 # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 6.54/1.31 # Starting new_ho_10 with 151s (1) cores
% 6.54/1.31 # Starting new_bool_3 with 136s (1) cores
% 6.54/1.31 # Preprocessing time : 0.001 s
% 6.54/1.31 # Presaturation interreduction done
% 6.54/1.31
% 6.54/1.31 # Proof found!
% 6.54/1.31 # SZS status Theorem
% 6.54/1.31 # SZS output start CNFRefutation
% See solution above
% 6.54/1.31 # Parsed axioms : 19
% 6.54/1.31 # Removed by relevancy pruning/SinE : 0
% 6.54/1.31 # Initial clauses : 19
% 6.54/1.31 # Removed in clause preprocessing : 11
% 6.54/1.31 # Initial clauses in saturation : 8
% 6.54/1.31 # Processed clauses : 3556
% 6.54/1.31 # ...of these trivial : 284
% 6.54/1.31 # ...subsumed : 2662
% 6.54/1.31 # ...remaining for further processing : 609
% 6.54/1.31 # Other redundant clauses eliminated : 0
% 6.54/1.31 # Clauses deleted for lack of memory : 0
% 6.54/1.31 # Backward-subsumed : 14
% 6.54/1.31 # Backward-rewritten : 3
% 6.54/1.31 # Generated clauses : 32132
% 6.54/1.31 # ...of the previous two non-redundant : 31833
% 6.54/1.31 # ...aggressively subsumed : 0
% 6.54/1.31 # Contextual simplify-reflections : 0
% 6.54/1.31 # Paramodulations : 32132
% 6.54/1.31 # Factorizations : 0
% 6.54/1.31 # NegExts : 0
% 6.54/1.31 # Equation resolutions : 0
% 6.54/1.31 # Disequality decompositions : 0
% 6.54/1.31 # Total rewrite steps : 22371
% 6.54/1.31 # ...of those cached : 19686
% 6.54/1.31 # Propositional unsat checks : 0
% 6.54/1.31 # Propositional check models : 0
% 6.54/1.31 # Propositional check unsatisfiable : 0
% 6.54/1.31 # Propositional clauses : 0
% 6.54/1.31 # Propositional clauses after purity: 0
% 6.54/1.31 # Propositional unsat core size : 0
% 6.54/1.31 # Propositional preprocessing time : 0.000
% 6.54/1.31 # Propositional encoding time : 0.000
% 6.54/1.31 # Propositional solver time : 0.000
% 6.54/1.31 # Success case prop preproc time : 0.000
% 6.54/1.31 # Success case prop encoding time : 0.000
% 6.54/1.31 # Success case prop solver time : 0.000
% 6.54/1.31 # Current number of processed clauses : 584
% 6.54/1.31 # Positive orientable unit clauses : 37
% 6.54/1.31 # Positive unorientable unit clauses: 4
% 6.54/1.31 # Negative unit clauses : 1
% 6.54/1.31 # Non-unit-clauses : 542
% 6.54/1.31 # Current number of unprocessed clauses: 28278
% 6.54/1.31 # ...number of literals in the above : 56117
% 6.54/1.31 # Current number of archived formulas : 0
% 6.54/1.31 # Current number of archived clauses : 25
% 6.54/1.31 # Clause-clause subsumption calls (NU) : 136823
% 6.54/1.31 # Rec. Clause-clause subsumption calls : 136823
% 6.54/1.31 # Non-unit clause-clause subsumptions : 2639
% 6.54/1.31 # Unit Clause-clause subsumption calls : 22
% 6.54/1.31 # Rewrite failures with RHS unbound : 0
% 6.54/1.31 # BW rewrite match attempts : 1112
% 6.54/1.31 # BW rewrite match successes : 83
% 6.54/1.31 # Condensation attempts : 0
% 6.54/1.31 # Condensation successes : 0
% 6.54/1.31 # Termbank termtop insertions : 966316
% 6.54/1.31 # Search garbage collected termcells : 87
% 6.54/1.31
% 6.54/1.31 # -------------------------------------------------
% 6.54/1.31 # User time : 0.755 s
% 6.54/1.31 # System time : 0.025 s
% 6.54/1.31 # Total time : 0.780 s
% 6.54/1.31 # Maximum resident set size: 1808 pages
% 6.54/1.31
% 6.54/1.31 # -------------------------------------------------
% 6.54/1.31 # User time : 3.995 s
% 6.54/1.31 # System time : 0.117 s
% 6.54/1.31 # Total time : 4.112 s
% 6.54/1.31 # Maximum resident set size: 1724 pages
% 6.54/1.31 % E---3.1 exiting
% 6.54/1.32 % E exiting
%------------------------------------------------------------------------------