TSTP Solution File: NUM294+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM294+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n008.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 : 600s
% DateTime : Mon Jul 18 09:31:27 EDT 2022
% Result : Theorem 0.27s 3.46s
% Output : CNFRefutation 0.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of formulae : 19 ( 11 unt; 0 def)
% Number of atoms : 35 ( 0 equ)
% Maximal formula atoms : 4 ( 1 avg)
% Number of connectives : 31 ( 15 ~; 12 |; 2 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 33 ( 4 sgn 17 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(less_entry_point_pos_pos,axiom,
! [X1,X2,X10,X11] :
( ( rdn_translate(X1,rdn_pos(X10))
& rdn_translate(X2,rdn_pos(X11))
& rdn_positive_less(X10,X11) )
=> less(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax',less_entry_point_pos_pos) ).
fof(rdn20,axiom,
rdn_translate(n20,rdn_pos(rdn(rdnn(n0),rdnn(n2)))),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax',rdn20) ).
fof(rdn_positive_less_multi_digit_high,axiom,
! [X4,X5,X6,X7] :
( rdn_positive_less(X5,X7)
=> rdn_positive_less(rdn(rdnn(X4),X5),rdn(rdnn(X6),X7)) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax',rdn_positive_less_multi_digit_high) ).
fof(n12_less_something,conjecture,
? [X1] : less(n12,X1),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',n12_less_something) ).
fof(rdn12,axiom,
rdn_translate(n12,rdn_pos(rdn(rdnn(n2),rdnn(n1)))),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax',rdn12) ).
fof(rdn_positive_less12,axiom,
rdn_positive_less(rdnn(n1),rdnn(n2)),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax',rdn_positive_less12) ).
fof(c_0_6,plain,
! [X12,X13,X14,X15] :
( ~ rdn_translate(X12,rdn_pos(X14))
| ~ rdn_translate(X13,rdn_pos(X15))
| ~ rdn_positive_less(X14,X15)
| less(X12,X13) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[less_entry_point_pos_pos])])])]) ).
cnf(c_0_7,plain,
( less(X1,X2)
| ~ rdn_positive_less(X3,X4)
| ~ rdn_translate(X2,rdn_pos(X4))
| ~ rdn_translate(X1,rdn_pos(X3)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_8,plain,
rdn_translate(n20,rdn_pos(rdn(rdnn(n0),rdnn(n2)))),
inference(split_conjunct,[status(thm)],[rdn20]) ).
fof(c_0_9,plain,
! [X8,X9,X10,X11] :
( ~ rdn_positive_less(X9,X11)
| rdn_positive_less(rdn(rdnn(X8),X9),rdn(rdnn(X10),X11)) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[rdn_positive_less_multi_digit_high])]) ).
fof(c_0_10,negated_conjecture,
~ ? [X1] : less(n12,X1),
inference(assume_negation,[status(cth)],[n12_less_something]) ).
cnf(c_0_11,plain,
( less(X1,n20)
| ~ rdn_positive_less(X2,rdn(rdnn(n0),rdnn(n2)))
| ~ rdn_translate(X1,rdn_pos(X2)) ),
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_12,plain,
( rdn_positive_less(rdn(rdnn(X1),X2),rdn(rdnn(X3),X4))
| ~ rdn_positive_less(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_13,negated_conjecture,
! [X2] : ~ less(n12,X2),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])]) ).
cnf(c_0_14,plain,
( less(X1,n20)
| ~ rdn_positive_less(X2,rdnn(n2))
| ~ rdn_translate(X1,rdn_pos(rdn(rdnn(X3),X2))) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_15,plain,
rdn_translate(n12,rdn_pos(rdn(rdnn(n2),rdnn(n1)))),
inference(split_conjunct,[status(thm)],[rdn12]) ).
cnf(c_0_16,plain,
rdn_positive_less(rdnn(n1),rdnn(n2)),
inference(split_conjunct,[status(thm)],[rdn_positive_less12]) ).
cnf(c_0_17,negated_conjecture,
~ less(n12,X1),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]),c_0_17]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : NUM294+1 : TPTP v8.1.0. Released v3.1.0.
% 0.04/0.14 % Command : run_ET %s %d
% 0.14/0.35 % Computer : n008.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Fri Jul 8 00:08:08 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.27/3.46 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.27/3.46 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.27/3.46 # Preprocessing time : 0.023 s
% 0.27/3.46
% 0.27/3.46 # Failure: Out of unprocessed clauses!
% 0.27/3.46 # OLD status GaveUp
% 0.27/3.46 # Parsed axioms : 402
% 0.27/3.46 # Removed by relevancy pruning/SinE : 301
% 0.27/3.46 # Initial clauses : 103
% 0.27/3.46 # Removed in clause preprocessing : 0
% 0.27/3.46 # Initial clauses in saturation : 103
% 0.27/3.46 # Processed clauses : 431
% 0.27/3.46 # ...of these trivial : 12
% 0.27/3.46 # ...subsumed : 103
% 0.27/3.46 # ...remaining for further processing : 316
% 0.27/3.46 # Other redundant clauses eliminated : 1
% 0.27/3.46 # Clauses deleted for lack of memory : 0
% 0.27/3.46 # Backward-subsumed : 0
% 0.27/3.46 # Backward-rewritten : 35
% 0.27/3.46 # Generated clauses : 360
% 0.27/3.46 # ...of the previous two non-trivial : 332
% 0.27/3.46 # Contextual simplify-reflections : 20
% 0.27/3.46 # Paramodulations : 357
% 0.27/3.46 # Factorizations : 2
% 0.27/3.46 # Equation resolutions : 1
% 0.27/3.46 # Current number of processed clauses : 280
% 0.27/3.46 # Positive orientable unit clauses : 139
% 0.27/3.46 # Positive unorientable unit clauses: 0
% 0.27/3.46 # Negative unit clauses : 41
% 0.27/3.46 # Non-unit-clauses : 100
% 0.27/3.46 # Current number of unprocessed clauses: 0
% 0.27/3.46 # ...number of literals in the above : 0
% 0.27/3.46 # Current number of archived formulas : 0
% 0.27/3.46 # Current number of archived clauses : 35
% 0.27/3.46 # Clause-clause subsumption calls (NU) : 2785
% 0.27/3.46 # Rec. Clause-clause subsumption calls : 2458
% 0.27/3.46 # Non-unit clause-clause subsumptions : 77
% 0.27/3.46 # Unit Clause-clause subsumption calls : 1391
% 0.27/3.46 # Rewrite failures with RHS unbound : 0
% 0.27/3.46 # BW rewrite match attempts : 19
% 0.27/3.46 # BW rewrite match successes : 19
% 0.27/3.46 # Condensation attempts : 0
% 0.27/3.46 # Condensation successes : 0
% 0.27/3.46 # Termbank termtop insertions : 11507
% 0.27/3.46
% 0.27/3.46 # -------------------------------------------------
% 0.27/3.46 # User time : 0.036 s
% 0.27/3.46 # System time : 0.003 s
% 0.27/3.46 # Total time : 0.039 s
% 0.27/3.46 # Maximum resident set size: 4464 pages
% 0.27/3.46 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.27/3.46 # Preprocessing time : 0.026 s
% 0.27/3.46
% 0.27/3.46 # Proof found!
% 0.27/3.46 # SZS status Theorem
% 0.27/3.46 # SZS output start CNFRefutation
% See solution above
% 0.27/3.46 # Proof object total steps : 19
% 0.27/3.46 # Proof object clause steps : 9
% 0.27/3.46 # Proof object formula steps : 10
% 0.27/3.46 # Proof object conjectures : 4
% 0.27/3.46 # Proof object clause conjectures : 1
% 0.27/3.46 # Proof object formula conjectures : 3
% 0.27/3.46 # Proof object initial clauses used : 6
% 0.27/3.46 # Proof object initial formulas used : 6
% 0.27/3.46 # Proof object generating inferences : 3
% 0.27/3.46 # Proof object simplifying inferences : 3
% 0.27/3.46 # Training examples: 0 positive, 0 negative
% 0.27/3.46 # Parsed axioms : 402
% 0.27/3.46 # Removed by relevancy pruning/SinE : 0
% 0.27/3.46 # Initial clauses : 407
% 0.27/3.46 # Removed in clause preprocessing : 0
% 0.27/3.46 # Initial clauses in saturation : 407
% 0.27/3.46 # Processed clauses : 11553
% 0.27/3.46 # ...of these trivial : 0
% 0.27/3.46 # ...subsumed : 393
% 0.27/3.46 # ...remaining for further processing : 11160
% 0.27/3.46 # Other redundant clauses eliminated : 2
% 0.27/3.46 # Clauses deleted for lack of memory : 0
% 0.27/3.46 # Backward-subsumed : 90
% 0.27/3.46 # Backward-rewritten : 0
% 0.27/3.46 # Generated clauses : 58762
% 0.27/3.46 # ...of the previous two non-trivial : 58341
% 0.27/3.46 # Contextual simplify-reflections : 0
% 0.27/3.46 # Paramodulations : 58758
% 0.27/3.46 # Factorizations : 2
% 0.27/3.46 # Equation resolutions : 2
% 0.27/3.46 # Current number of processed clauses : 11068
% 0.27/3.46 # Positive orientable unit clauses : 4737
% 0.27/3.46 # Positive unorientable unit clauses: 0
% 0.27/3.46 # Negative unit clauses : 4529
% 0.27/3.46 # Non-unit-clauses : 1802
% 0.27/3.46 # Current number of unprocessed clauses: 47195
% 0.27/3.46 # ...number of literals in the above : 101722
% 0.27/3.46 # Current number of archived formulas : 0
% 0.27/3.46 # Current number of archived clauses : 90
% 0.27/3.46 # Clause-clause subsumption calls (NU) : 670356
% 0.27/3.46 # Rec. Clause-clause subsumption calls : 458698
% 0.27/3.46 # Non-unit clause-clause subsumptions : 91
% 0.27/3.46 # Unit Clause-clause subsumption calls : 9258662
% 0.27/3.46 # Rewrite failures with RHS unbound : 0
% 0.27/3.46 # BW rewrite match attempts : 1
% 0.27/3.46 # BW rewrite match successes : 0
% 0.27/3.46 # Condensation attempts : 0
% 0.27/3.46 # Condensation successes : 0
% 0.27/3.46 # Termbank termtop insertions : 585305
% 0.27/3.46
% 0.27/3.46 # -------------------------------------------------
% 0.27/3.46 # User time : 2.615 s
% 0.27/3.46 # System time : 0.040 s
% 0.27/3.46 # Total time : 2.655 s
% 0.27/3.46 # Maximum resident set size: 67492 pages
% 0.27/4.03 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.27/4.03 eprover: No such file or directory
% 0.27/4.03 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.27/4.03 eprover: No such file or directory
% 0.27/4.04 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.27/4.04 eprover: No such file or directory
% 0.27/4.04 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.27/4.04 eprover: No such file or directory
% 0.27/4.05 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.27/4.05 eprover: No such file or directory
% 0.27/4.06 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.27/4.06 eprover: No such file or directory
% 0.27/4.06 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.27/4.06 eprover: No such file or directory
% 0.27/4.07 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.27/4.07 eprover: No such file or directory
% 0.27/4.07 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.27/4.07 eprover: No such file or directory
% 0.27/4.08 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.27/4.08 eprover: No such file or directory
% 0.27/4.09 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.27/4.09 eprover: No such file or directory
%------------------------------------------------------------------------------