TSTP Solution File: NUM304+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : NUM304+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n024.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.26s 1.43s
% Output : CNFRefutation 0.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 4
% Syntax : Number of formulae : 17 ( 10 unt; 0 def)
% Number of atoms : 34 ( 8 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 36 ( 19 ~; 11 |; 4 &)
% ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% Maximal formula depth : 9 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-1 aty)
% Number of variables : 28 ( 6 sgn 15 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(something_not_n12,conjecture,
? [X1] : X1 != n12,
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',something_not_n12) ).
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(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(rdn0,axiom,
rdn_translate(n0,rdn_pos(rdnn(n0))),
file('/export/starexec/sandbox/benchmark/Axioms/NUM005+0.ax',rdn0) ).
fof(c_0_4,negated_conjecture,
~ ? [X1] : X1 != n12,
inference(assume_negation,[status(cth)],[something_not_n12]) ).
fof(c_0_5,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])])])])])]) ).
fof(c_0_6,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_7,negated_conjecture,
! [X2] : X2 = n12,
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])]) ).
cnf(c_0_8,plain,
( ~ less(X1,X2)
| X2 != X1 ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
cnf(c_0_9,plain,
( less(X1,X2)
| ~ rdn_translate(X2,rdn_pos(X3))
| ~ rdn_translate(X1,rdn_neg(X4)) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_10,negated_conjecture,
X1 = n12,
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
rdn_translate(n0,rdn_pos(rdnn(n0))),
inference(split_conjunct,[status(thm)],[rdn0]) ).
cnf(c_0_12,plain,
~ less(X1,X1),
inference(er,[status(thm)],[c_0_8]) ).
cnf(c_0_13,plain,
( less(X1,X2)
| ~ rdn_translate(X2,n12)
| ~ rdn_translate(X1,n12) ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_10]),c_0_10]) ).
cnf(c_0_14,plain,
rdn_translate(n0,n12),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_11,c_0_10]),c_0_10]) ).
cnf(c_0_15,plain,
~ rdn_translate(X1,n12),
inference(spm,[status(thm)],[c_0_12,c_0_13]) ).
cnf(c_0_16,plain,
$false,
inference(sr,[status(thm)],[c_0_14,c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NUM304+1 : TPTP v8.1.0. Released v3.1.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n024.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Tue Jul 5 07:09:44 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.26/1.43 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.26/1.43 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.26/1.43 # Preprocessing time : 0.022 s
% 0.26/1.43
% 0.26/1.43 # Failure: Out of unprocessed clauses!
% 0.26/1.43 # OLD status GaveUp
% 0.26/1.43 # Parsed axioms : 402
% 0.26/1.43 # Removed by relevancy pruning/SinE : 301
% 0.26/1.43 # Initial clauses : 101
% 0.26/1.43 # Removed in clause preprocessing : 0
% 0.26/1.43 # Initial clauses in saturation : 101
% 0.26/1.43 # Processed clauses : 105
% 0.26/1.43 # ...of these trivial : 98
% 0.26/1.43 # ...subsumed : 0
% 0.26/1.43 # ...remaining for further processing : 7
% 0.26/1.43 # Other redundant clauses eliminated : 0
% 0.26/1.43 # Clauses deleted for lack of memory : 0
% 0.26/1.43 # Backward-subsumed : 1
% 0.26/1.43 # Backward-rewritten : 3
% 0.26/1.43 # Generated clauses : 18
% 0.26/1.43 # ...of the previous two non-trivial : 13
% 0.26/1.43 # Contextual simplify-reflections : 0
% 0.26/1.43 # Paramodulations : 18
% 0.26/1.43 # Factorizations : 0
% 0.26/1.43 # Equation resolutions : 0
% 0.26/1.43 # Current number of processed clauses : 3
% 0.26/1.43 # Positive orientable unit clauses : 2
% 0.26/1.43 # Positive unorientable unit clauses: 1
% 0.26/1.43 # Negative unit clauses : 0
% 0.26/1.43 # Non-unit-clauses : 0
% 0.26/1.43 # Current number of unprocessed clauses: 0
% 0.26/1.43 # ...number of literals in the above : 0
% 0.26/1.43 # Current number of archived formulas : 0
% 0.26/1.43 # Current number of archived clauses : 4
% 0.26/1.43 # Clause-clause subsumption calls (NU) : 0
% 0.26/1.43 # Rec. Clause-clause subsumption calls : 0
% 0.26/1.43 # Non-unit clause-clause subsumptions : 0
% 0.26/1.43 # Unit Clause-clause subsumption calls : 3
% 0.26/1.43 # Rewrite failures with RHS unbound : 3
% 0.26/1.43 # BW rewrite match attempts : 7
% 0.26/1.43 # BW rewrite match successes : 7
% 0.26/1.43 # Condensation attempts : 0
% 0.26/1.43 # Condensation successes : 0
% 0.26/1.43 # Termbank termtop insertions : 7516
% 0.26/1.43
% 0.26/1.43 # -------------------------------------------------
% 0.26/1.43 # User time : 0.014 s
% 0.26/1.43 # System time : 0.008 s
% 0.26/1.43 # Total time : 0.022 s
% 0.26/1.43 # Maximum resident set size: 3640 pages
% 0.26/1.43 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.26/1.43 # Preprocessing time : 0.026 s
% 0.26/1.43
% 0.26/1.43 # Proof found!
% 0.26/1.43 # SZS status Theorem
% 0.26/1.43 # SZS output start CNFRefutation
% See solution above
% 0.26/1.43 # Proof object total steps : 17
% 0.26/1.43 # Proof object clause steps : 9
% 0.26/1.43 # Proof object formula steps : 8
% 0.26/1.43 # Proof object conjectures : 4
% 0.26/1.43 # Proof object clause conjectures : 1
% 0.26/1.43 # Proof object formula conjectures : 3
% 0.26/1.43 # Proof object initial clauses used : 4
% 0.26/1.43 # Proof object initial formulas used : 4
% 0.26/1.43 # Proof object generating inferences : 1
% 0.26/1.43 # Proof object simplifying inferences : 6
% 0.26/1.43 # Training examples: 0 positive, 0 negative
% 0.26/1.43 # Parsed axioms : 402
% 0.26/1.43 # Removed by relevancy pruning/SinE : 0
% 0.26/1.43 # Initial clauses : 407
% 0.26/1.43 # Removed in clause preprocessing : 0
% 0.26/1.43 # Initial clauses in saturation : 407
% 0.26/1.43 # Processed clauses : 412
% 0.26/1.43 # ...of these trivial : 369
% 0.26/1.43 # ...subsumed : 6
% 0.26/1.43 # ...remaining for further processing : 37
% 0.26/1.43 # Other redundant clauses eliminated : 2
% 0.26/1.43 # Clauses deleted for lack of memory : 0
% 0.26/1.43 # Backward-subsumed : 6
% 0.26/1.43 # Backward-rewritten : 1
% 0.26/1.43 # Generated clauses : 137
% 0.26/1.43 # ...of the previous two non-trivial : 94
% 0.26/1.43 # Contextual simplify-reflections : 4
% 0.26/1.43 # Paramodulations : 122
% 0.26/1.43 # Factorizations : 2
% 0.26/1.43 # Equation resolutions : 2
% 0.26/1.43 # Current number of processed clauses : 17
% 0.26/1.43 # Positive orientable unit clauses : 5
% 0.26/1.43 # Positive unorientable unit clauses: 1
% 0.26/1.43 # Negative unit clauses : 2
% 0.26/1.43 # Non-unit-clauses : 9
% 0.26/1.43 # Current number of unprocessed clauses: 19
% 0.26/1.43 # ...number of literals in the above : 44
% 0.26/1.43 # Current number of archived formulas : 0
% 0.26/1.43 # Current number of archived clauses : 18
% 0.26/1.43 # Clause-clause subsumption calls (NU) : 468
% 0.26/1.43 # Rec. Clause-clause subsumption calls : 206
% 0.26/1.43 # Non-unit clause-clause subsumptions : 9
% 0.26/1.43 # Unit Clause-clause subsumption calls : 57
% 0.26/1.43 # Rewrite failures with RHS unbound : 27
% 0.26/1.43 # BW rewrite match attempts : 23
% 0.26/1.43 # BW rewrite match successes : 23
% 0.26/1.43 # Condensation attempts : 0
% 0.26/1.43 # Condensation successes : 0
% 0.26/1.43 # Termbank termtop insertions : 19610
% 0.26/1.43
% 0.26/1.43 # -------------------------------------------------
% 0.26/1.43 # User time : 0.022 s
% 0.26/1.43 # System time : 0.007 s
% 0.26/1.43 # Total time : 0.029 s
% 0.26/1.43 # Maximum resident set size: 3912 pages
%------------------------------------------------------------------------------