↑ Up

ET---2.0.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : NUM295+1 : TPTP v8.1.0. Released v3.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% 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  : 600s
% DateTime : Mon Jul 18 09:31:28 EDT 2022

% Result   : Theorem 0.24s 1.42s
% Output   : CNFRefutation 0.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   16 (  10 unt;   0 def)
%            Number of atoms       :   32 (   5 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :   30 (  14   ~;  10   |;   4   &)
%                                         (   1 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   1 con; 0-1 aty)
%            Number of variables   :   33 (  11 sgn  16   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(something_less_something,conjecture,
    ? [X1,X2] : less(X1,X2),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',something_less_something) ).

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,X2] : less(X1,X2),
    inference(assume_negation,[status(cth)],[something_less_something]) ).

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,negated_conjecture,
    ! [X3,X4] : ~ less(X3,X4),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])]) ).

fof(c_0_7,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])])])]) ).

cnf(c_0_8,plain,
    ( less(X1,X2)
    | X2 = X1
    | less(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_9,negated_conjecture,
    ~ less(X1,X2),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_10,plain,
    ( less(X1,X2)
    | ~ rdn_translate(X2,rdn_pos(X3))
    | ~ rdn_translate(X1,rdn_neg(X4)) ),
    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,
    X1 = X2,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_8,c_0_9]),c_0_9]) ).

cnf(c_0_13,plain,
    ~ rdn_translate(X1,rdn_neg(X2)),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_9]) ).

cnf(c_0_14,plain,
    rdn_translate(n0,X1),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_15,plain,
    $false,
    inference(spm,[status(thm)],[c_0_13,c_0_14]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : NUM295+1 : TPTP v8.1.0. Released v3.1.0.
% 0.12/0.12  % Command  : run_ET %s %d
% 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  : 600
% 0.12/0.33  % DateTime : Thu Jul  7 06:09:07 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.24/1.42  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.24/1.42  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.24/1.42  # Preprocessing time       : 0.021 s
% 0.24/1.42  
% 0.24/1.42  # Proof found!
% 0.24/1.42  # SZS status Theorem
% 0.24/1.42  # SZS output start CNFRefutation
% See solution above
% 0.24/1.42  # Proof object total steps             : 16
% 0.24/1.42  # Proof object clause steps            : 8
% 0.24/1.42  # Proof object formula steps           : 8
% 0.24/1.42  # Proof object conjectures             : 4
% 0.24/1.42  # Proof object clause conjectures      : 1
% 0.24/1.42  # Proof object formula conjectures     : 3
% 0.24/1.42  # Proof object initial clauses used    : 4
% 0.24/1.42  # Proof object initial formulas used   : 4
% 0.24/1.42  # Proof object generating inferences   : 3
% 0.24/1.42  # Proof object simplifying inferences  : 3
% 0.24/1.42  # Training examples: 0 positive, 0 negative
% 0.24/1.42  # Parsed axioms                        : 402
% 0.24/1.42  # Removed by relevancy pruning/SinE    : 301
% 0.24/1.42  # Initial clauses                      : 103
% 0.24/1.42  # Removed in clause preprocessing      : 0
% 0.24/1.42  # Initial clauses in saturation        : 103
% 0.24/1.42  # Processed clauses                    : 107
% 0.24/1.42  # ...of these trivial                  : 0
% 0.24/1.42  # ...subsumed                          : 2
% 0.24/1.42  # ...remaining for further processing  : 105
% 0.24/1.42  # Other redundant clauses eliminated   : 0
% 0.24/1.42  # Clauses deleted for lack of memory   : 0
% 0.24/1.42  # Backward-subsumed                    : 0
% 0.24/1.42  # Backward-rewritten                   : 3
% 0.24/1.42  # Generated clauses                    : 1439
% 0.24/1.42  # ...of the previous two non-trivial   : 1434
% 0.24/1.42  # Contextual simplify-reflections      : 0
% 0.24/1.42  # Paramodulations                      : 1439
% 0.24/1.42  # Factorizations                       : 0
% 0.24/1.42  # Equation resolutions                 : 0
% 0.24/1.42  # Current number of processed clauses  : 102
% 0.24/1.42  #    Positive orientable unit clauses  : 94
% 0.24/1.42  #    Positive unorientable unit clauses: 1
% 0.24/1.42  #    Negative unit clauses             : 2
% 0.24/1.42  #    Non-unit-clauses                  : 5
% 0.24/1.42  # Current number of unprocessed clauses: 1406
% 0.24/1.42  # ...number of literals in the above   : 1448
% 0.24/1.42  # Current number of archived formulas  : 0
% 0.24/1.42  # Current number of archived clauses   : 3
% 0.24/1.42  # Clause-clause subsumption calls (NU) : 1
% 0.24/1.42  # Rec. Clause-clause subsumption calls : 0
% 0.24/1.42  # Non-unit clause-clause subsumptions  : 0
% 0.24/1.42  # Unit Clause-clause subsumption calls : 12
% 0.24/1.42  # Rewrite failures with RHS unbound    : 114
% 0.24/1.42  # BW rewrite match attempts            : 47
% 0.24/1.42  # BW rewrite match successes           : 47
% 0.24/1.42  # Condensation attempts                : 0
% 0.24/1.42  # Condensation successes               : 0
% 0.24/1.42  # Termbank termtop insertions          : 18555
% 0.24/1.42  
% 0.24/1.42  # -------------------------------------------------
% 0.24/1.42  # User time                : 0.030 s
% 0.24/1.42  # System time              : 0.002 s
% 0.24/1.42  # Total time               : 0.032 s
% 0.24/1.42  # Maximum resident set size: 4728 pages
%------------------------------------------------------------------------------