TSTP Solution File: NUM302+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM302+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n025.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.25s 1.43s
% Output : CNFRefutation 0.25s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 4
% Syntax : Number of formulae : 13 ( 9 unt; 0 def)
% Number of atoms : 20 ( 0 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 15 ( 8 ~; 5 |; 1 &)
% ( 0 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-1 aty)
% Number of variables : 18 ( 4 sgn 9 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(less_entry_point_neg_pos,axiom,
! [X1,X2,X10,X11] :
( ( rdn_translate(X1,rdn_neg(X10))
& rdn_translate(X2,rdn_pos(X11)) )
=> less(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+1.ax',less_entry_point_neg_pos) ).
fof(nn2_less_something,conjecture,
? [X1] : less(nn2,X1),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',nn2_less_something) ).
fof(rdn0,axiom,
rdn_translate(n0,rdn_pos(rdnn(n0))),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax',rdn0) ).
fof(rdnn2,axiom,
rdn_translate(nn2,rdn_neg(rdnn(n2))),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax',rdnn2) ).
fof(c_0_4,plain,
! [X12,X13,X14,X15] :
( ~ rdn_translate(X12,rdn_neg(X14))
| ~ rdn_translate(X13,rdn_pos(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_neg_pos])])])]) ).
fof(c_0_5,negated_conjecture,
~ ? [X1] : less(nn2,X1),
inference(assume_negation,[status(cth)],[nn2_less_something]) ).
cnf(c_0_6,plain,
( less(X1,X2)
| ~ rdn_translate(X2,rdn_pos(X3))
| ~ rdn_translate(X1,rdn_neg(X4)) ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
cnf(c_0_7,plain,
rdn_translate(n0,rdn_pos(rdnn(n0))),
inference(split_conjunct,[status(thm)],[rdn0]) ).
fof(c_0_8,negated_conjecture,
! [X2] : ~ less(nn2,X2),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])]) ).
cnf(c_0_9,plain,
( less(X1,n0)
| ~ rdn_translate(X1,rdn_neg(X2)) ),
inference(spm,[status(thm)],[c_0_6,c_0_7]) ).
cnf(c_0_10,plain,
rdn_translate(nn2,rdn_neg(rdnn(n2))),
inference(split_conjunct,[status(thm)],[rdnn2]) ).
cnf(c_0_11,negated_conjecture,
~ less(nn2,X1),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : NUM302+1 : TPTP v8.1.0. Released v3.1.0.
% 0.11/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n025.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Wed Jul 6 01:52:58 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.25/1.43 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.25/1.43 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.25/1.43 # Preprocessing time : 0.022 s
% 0.25/1.43
% 0.25/1.43 # Proof found!
% 0.25/1.43 # SZS status Theorem
% 0.25/1.43 # SZS output start CNFRefutation
% See solution above
% 0.25/1.43 # Proof object total steps : 13
% 0.25/1.43 # Proof object clause steps : 6
% 0.25/1.43 # Proof object formula steps : 7
% 0.25/1.43 # Proof object conjectures : 4
% 0.25/1.43 # Proof object clause conjectures : 1
% 0.25/1.43 # Proof object formula conjectures : 3
% 0.25/1.43 # Proof object initial clauses used : 4
% 0.25/1.43 # Proof object initial formulas used : 4
% 0.25/1.43 # Proof object generating inferences : 2
% 0.25/1.43 # Proof object simplifying inferences : 1
% 0.25/1.43 # Training examples: 0 positive, 0 negative
% 0.25/1.43 # Parsed axioms : 402
% 0.25/1.43 # Removed by relevancy pruning/SinE : 301
% 0.25/1.43 # Initial clauses : 103
% 0.25/1.43 # Removed in clause preprocessing : 0
% 0.25/1.43 # Initial clauses in saturation : 103
% 0.25/1.43 # Processed clauses : 108
% 0.25/1.43 # ...of these trivial : 0
% 0.25/1.43 # ...subsumed : 2
% 0.25/1.43 # ...remaining for further processing : 106
% 0.25/1.43 # Other redundant clauses eliminated : 1
% 0.25/1.43 # Clauses deleted for lack of memory : 0
% 0.25/1.43 # Backward-subsumed : 0
% 0.25/1.43 # Backward-rewritten : 0
% 0.25/1.43 # Generated clauses : 31
% 0.25/1.43 # ...of the previous two non-trivial : 26
% 0.25/1.43 # Contextual simplify-reflections : 0
% 0.25/1.43 # Paramodulations : 28
% 0.25/1.43 # Factorizations : 2
% 0.25/1.43 # Equation resolutions : 1
% 0.25/1.43 # Current number of processed clauses : 105
% 0.25/1.43 # Positive orientable unit clauses : 94
% 0.25/1.43 # Positive unorientable unit clauses: 0
% 0.25/1.43 # Negative unit clauses : 2
% 0.25/1.43 # Non-unit-clauses : 9
% 0.25/1.43 # Current number of unprocessed clauses: 21
% 0.25/1.43 # ...number of literals in the above : 49
% 0.25/1.43 # Current number of archived formulas : 0
% 0.25/1.43 # Current number of archived clauses : 0
% 0.25/1.43 # Clause-clause subsumption calls (NU) : 7
% 0.25/1.43 # Rec. Clause-clause subsumption calls : 4
% 0.25/1.43 # Non-unit clause-clause subsumptions : 1
% 0.25/1.43 # Unit Clause-clause subsumption calls : 2
% 0.25/1.43 # Rewrite failures with RHS unbound : 0
% 0.25/1.43 # BW rewrite match attempts : 0
% 0.25/1.43 # BW rewrite match successes : 0
% 0.25/1.43 # Condensation attempts : 0
% 0.25/1.43 # Condensation successes : 0
% 0.25/1.43 # Termbank termtop insertions : 7732
% 0.25/1.43
% 0.25/1.43 # -------------------------------------------------
% 0.25/1.43 # User time : 0.021 s
% 0.25/1.43 # System time : 0.004 s
% 0.25/1.43 # Total time : 0.025 s
% 0.25/1.43 # Maximum resident set size: 4200 pages
%------------------------------------------------------------------------------