TSTP Solution File: NUM303+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM303+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n007.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:31 EDT 2022
% Result : Theorem 0.27s 2.45s
% Output : CNFRefutation 0.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of formulae : 24 ( 13 unt; 0 def)
% Number of atoms : 49 ( 8 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 49 ( 24 ~; 17 |; 5 &)
% ( 1 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 38 ( 5 sgn 22 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(n31_not_n12,conjecture,
n31 != n21,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',n31_not_n12) ).
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(rdn31,axiom,
rdn_translate(n31,rdn_pos(rdn(rdnn(n1),rdnn(n3)))),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax',rdn31) ).
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(less_property,axiom,
! [X1,X2] :
( less(X1,X2)
<=> ( ~ less(X2,X1)
& X2 != X1 ) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax',less_property) ).
fof(rdn21,axiom,
rdn_translate(n21,rdn_pos(rdn(rdnn(n1),rdnn(n2)))),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax',rdn21) ).
fof(rdn_positive_less23,axiom,
rdn_positive_less(rdnn(n2),rdnn(n3)),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax',rdn_positive_less23) ).
fof(c_0_7,negated_conjecture,
~ ( n31 != n21 ),
inference(assume_negation,[status(cth)],[n31_not_n12]) ).
fof(c_0_8,negated_conjecture,
n31 = n21,
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_9,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_10,plain,
rdn_translate(n31,rdn_pos(rdn(rdnn(n1),rdnn(n3)))),
inference(split_conjunct,[status(thm)],[rdn31]) ).
cnf(c_0_11,negated_conjecture,
n31 = n21,
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,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_9]) ).
cnf(c_0_13,plain,
rdn_translate(n21,rdn_pos(rdn(rdnn(n1),rdnn(n3)))),
inference(rw,[status(thm)],[c_0_10,c_0_11]) ).
fof(c_0_14,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_15,plain,
! [X3,X4,X3,X4] :
( ( ~ less(X4,X3)
| ~ less(X3,X4) )
& ( X4 != X3
| ~ less(X3,X4) )
& ( less(X4,X3)
| X4 = X3
| less(X3,X4) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[less_property])])])])])]) ).
cnf(c_0_16,plain,
( less(X1,n21)
| ~ rdn_positive_less(X2,rdn(rdnn(n1),rdnn(n3)))
| ~ rdn_translate(X1,rdn_pos(X2)) ),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_17,plain,
( rdn_positive_less(rdn(rdnn(X1),X2),rdn(rdnn(X3),X4))
| ~ rdn_positive_less(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,plain,
( ~ less(X1,X2)
| X2 != X1 ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_19,plain,
( less(X1,n21)
| ~ rdn_positive_less(X2,rdnn(n3))
| ~ rdn_translate(X1,rdn_pos(rdn(rdnn(X3),X2))) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,plain,
rdn_translate(n21,rdn_pos(rdn(rdnn(n1),rdnn(n2)))),
inference(split_conjunct,[status(thm)],[rdn21]) ).
cnf(c_0_21,plain,
rdn_positive_less(rdnn(n2),rdnn(n3)),
inference(split_conjunct,[status(thm)],[rdn_positive_less23]) ).
cnf(c_0_22,plain,
~ less(X1,X1),
inference(er,[status(thm)],[c_0_18]) ).
cnf(c_0_23,plain,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]),c_0_22]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : NUM303+1 : TPTP v8.1.0. Released v3.1.0.
% 0.08/0.14 % Command : run_ET %s %d
% 0.14/0.35 % Computer : n007.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 : Thu Jul 7 01:28:44 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.27/2.45 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.27/2.45 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.27/2.45 # Preprocessing time : 0.022 s
% 0.27/2.45
% 0.27/2.45 # Failure: Out of unprocessed clauses!
% 0.27/2.45 # OLD status GaveUp
% 0.27/2.45 # Parsed axioms : 402
% 0.27/2.45 # Removed by relevancy pruning/SinE : 301
% 0.27/2.45 # Initial clauses : 101
% 0.27/2.45 # Removed in clause preprocessing : 0
% 0.27/2.45 # Initial clauses in saturation : 101
% 0.27/2.45 # Processed clauses : 101
% 0.27/2.45 # ...of these trivial : 0
% 0.27/2.45 # ...subsumed : 0
% 0.27/2.45 # ...remaining for further processing : 101
% 0.27/2.45 # Other redundant clauses eliminated : 0
% 0.27/2.45 # Clauses deleted for lack of memory : 0
% 0.27/2.45 # Backward-subsumed : 0
% 0.27/2.45 # Backward-rewritten : 0
% 0.27/2.45 # Generated clauses : 0
% 0.27/2.45 # ...of the previous two non-trivial : 0
% 0.27/2.45 # Contextual simplify-reflections : 0
% 0.27/2.45 # Paramodulations : 0
% 0.27/2.45 # Factorizations : 0
% 0.27/2.45 # Equation resolutions : 0
% 0.27/2.45 # Current number of processed clauses : 101
% 0.27/2.45 # Positive orientable unit clauses : 101
% 0.27/2.45 # Positive unorientable unit clauses: 0
% 0.27/2.45 # Negative unit clauses : 0
% 0.27/2.45 # Non-unit-clauses : 0
% 0.27/2.45 # Current number of unprocessed clauses: 0
% 0.27/2.45 # ...number of literals in the above : 0
% 0.27/2.45 # Current number of archived formulas : 0
% 0.27/2.45 # Current number of archived clauses : 0
% 0.27/2.45 # Clause-clause subsumption calls (NU) : 0
% 0.27/2.45 # Rec. Clause-clause subsumption calls : 0
% 0.27/2.45 # Non-unit clause-clause subsumptions : 0
% 0.27/2.45 # Unit Clause-clause subsumption calls : 0
% 0.27/2.45 # Rewrite failures with RHS unbound : 0
% 0.27/2.45 # BW rewrite match attempts : 1
% 0.27/2.45 # BW rewrite match successes : 0
% 0.27/2.45 # Condensation attempts : 0
% 0.27/2.45 # Condensation successes : 0
% 0.27/2.45 # Termbank termtop insertions : 7053
% 0.27/2.45
% 0.27/2.45 # -------------------------------------------------
% 0.27/2.45 # User time : 0.020 s
% 0.27/2.45 # System time : 0.005 s
% 0.27/2.45 # Total time : 0.025 s
% 0.27/2.45 # Maximum resident set size: 3900 pages
% 0.27/2.45 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.27/2.45 # Preprocessing time : 0.027 s
% 0.27/2.45
% 0.27/2.45 # Proof found!
% 0.27/2.45 # SZS status Theorem
% 0.27/2.45 # SZS output start CNFRefutation
% See solution above
% 0.27/2.45 # Proof object total steps : 24
% 0.27/2.45 # Proof object clause steps : 12
% 0.27/2.45 # Proof object formula steps : 12
% 0.27/2.45 # Proof object conjectures : 4
% 0.27/2.45 # Proof object clause conjectures : 1
% 0.27/2.45 # Proof object formula conjectures : 3
% 0.27/2.45 # Proof object initial clauses used : 7
% 0.27/2.45 # Proof object initial formulas used : 7
% 0.27/2.45 # Proof object generating inferences : 3
% 0.27/2.45 # Proof object simplifying inferences : 5
% 0.27/2.45 # Training examples: 0 positive, 0 negative
% 0.27/2.45 # Parsed axioms : 402
% 0.27/2.45 # Removed by relevancy pruning/SinE : 0
% 0.27/2.45 # Initial clauses : 407
% 0.27/2.45 # Removed in clause preprocessing : 0
% 0.27/2.45 # Initial clauses in saturation : 407
% 0.27/2.45 # Processed clauses : 8858
% 0.27/2.45 # ...of these trivial : 0
% 0.27/2.45 # ...subsumed : 105
% 0.27/2.45 # ...remaining for further processing : 8753
% 0.27/2.45 # Other redundant clauses eliminated : 2
% 0.27/2.45 # Clauses deleted for lack of memory : 0
% 0.27/2.45 # Backward-subsumed : 0
% 0.27/2.45 # Backward-rewritten : 0
% 0.27/2.45 # Generated clauses : 54032
% 0.27/2.45 # ...of the previous two non-trivial : 53743
% 0.27/2.45 # Contextual simplify-reflections : 0
% 0.27/2.45 # Paramodulations : 54028
% 0.27/2.45 # Factorizations : 2
% 0.27/2.45 # Equation resolutions : 2
% 0.27/2.45 # Current number of processed clauses : 8751
% 0.27/2.45 # Positive orientable unit clauses : 3767
% 0.27/2.45 # Positive unorientable unit clauses: 0
% 0.27/2.45 # Negative unit clauses : 3394
% 0.27/2.45 # Non-unit-clauses : 1590
% 0.27/2.45 # Current number of unprocessed clauses: 45292
% 0.27/2.45 # ...number of literals in the above : 98705
% 0.27/2.45 # Current number of archived formulas : 0
% 0.27/2.45 # Current number of archived clauses : 0
% 0.27/2.45 # Clause-clause subsumption calls (NU) : 379608
% 0.27/2.45 # Rec. Clause-clause subsumption calls : 298148
% 0.27/2.45 # Non-unit clause-clause subsumptions : 105
% 0.27/2.45 # Unit Clause-clause subsumption calls : 6386503
% 0.27/2.45 # Rewrite failures with RHS unbound : 0
% 0.27/2.45 # BW rewrite match attempts : 2
% 0.27/2.45 # BW rewrite match successes : 0
% 0.27/2.45 # Condensation attempts : 0
% 0.27/2.45 # Condensation successes : 0
% 0.27/2.45 # Termbank termtop insertions : 545279
% 0.27/2.45
% 0.27/2.45 # -------------------------------------------------
% 0.27/2.45 # User time : 1.942 s
% 0.27/2.45 # System time : 0.037 s
% 0.27/2.45 # Total time : 1.980 s
% 0.27/2.45 # Maximum resident set size: 60668 pages
% 0.27/23.53 eprover: CPU time limit exceeded, terminating
% 0.27/23.54 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.27/23.54 eprover: No such file or directory
% 0.27/23.55 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.27/23.55 eprover: No such file or directory
% 0.27/23.55 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.27/23.55 eprover: No such file or directory
% 0.27/23.56 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.27/23.56 eprover: No such file or directory
% 0.27/23.56 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.27/23.56 eprover: No such file or directory
% 0.27/23.57 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.27/23.57 eprover: No such file or directory
% 0.27/23.58 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.27/23.58 eprover: No such file or directory
% 0.27/23.58 eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.27/23.58 eprover: No such file or directory
%------------------------------------------------------------------------------