↑ Up

ET---2.0.THM-CRf.s

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

% Computer : n010.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 : Thu Jul 21 05:51:17 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
fof(pel25_2,axiom,
    ! [X1] :
      ( big_f(X1)
     => ( ~ big_g(X1)
        & big_r(X1) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',pel25_2) ).

fof(pel25_3,axiom,
    ! [X1] :
      ( big_p(X1)
     => ( big_g(X1)
        & big_f(X1) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',pel25_3) ).

fof(pel25_1,axiom,
    ? [X1] : big_p(X1),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',pel25_1) ).

fof(c_0_3,plain,
    ! [X2] :
      ( ( ~ big_g(X2)
        | ~ big_f(X2) )
      & ( big_r(X2)
        | ~ big_f(X2) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[pel25_2])])])]) ).

fof(c_0_4,plain,
    ! [X2] :
      ( ( big_g(X2)
        | ~ big_p(X2) )
      & ( big_f(X2)
        | ~ big_p(X2) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[pel25_3])])]) ).

fof(c_0_5,plain,
    big_p(esk1_0),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[pel25_1])]) ).

cnf(c_0_6,plain,
    ( ~ big_f(X1)
    | ~ big_g(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_7,plain,
    ( big_g(X1)
    | ~ big_p(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_8,plain,
    ( big_f(X1)
    | ~ big_p(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_9,plain,
    big_p(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_10,plain,
    ~ big_p(X1),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]) ).

cnf(c_0_11,plain,
    $false,
    inference(sr,[status(thm)],[c_0_9,c_0_10]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SYN055+1 : TPTP v8.1.0. Released v2.0.0.
% 0.06/0.12  % Command  : run_ET %s %d
% 0.13/0.34  % Computer : n010.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 12 03:25:30 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.23/1.41  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.41  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.41  # Preprocessing time       : 0.014 s
% 0.23/1.41  
% 0.23/1.41  # Proof found!
% 0.23/1.41  # SZS status Theorem
% 0.23/1.41  # SZS output start CNFRefutation
% See solution above
% 0.23/1.41  # Proof object total steps             : 12
% 0.23/1.41  # Proof object clause steps            : 6
% 0.23/1.41  # Proof object formula steps           : 6
% 0.23/1.41  # Proof object conjectures             : 0
% 0.23/1.41  # Proof object clause conjectures      : 0
% 0.23/1.41  # Proof object formula conjectures     : 0
% 0.23/1.41  # Proof object initial clauses used    : 4
% 0.23/1.41  # Proof object initial formulas used   : 3
% 0.23/1.41  # Proof object generating inferences   : 1
% 0.23/1.41  # Proof object simplifying inferences  : 2
% 0.23/1.41  # Training examples: 0 positive, 0 negative
% 0.23/1.41  # Parsed axioms                        : 5
% 0.23/1.41  # Removed by relevancy pruning/SinE    : 0
% 0.23/1.41  # Initial clauses                      : 8
% 0.23/1.41  # Removed in clause preprocessing      : 0
% 0.23/1.41  # Initial clauses in saturation        : 8
% 0.23/1.41  # Processed clauses                    : 11
% 0.23/1.41  # ...of these trivial                  : 0
% 0.23/1.41  # ...subsumed                          : 0
% 0.23/1.41  # ...remaining for further processing  : 11
% 0.23/1.41  # Other redundant clauses eliminated   : 0
% 0.23/1.41  # Clauses deleted for lack of memory   : 0
% 0.23/1.41  # Backward-subsumed                    : 0
% 0.23/1.41  # Backward-rewritten                   : 2
% 0.23/1.41  # Generated clauses                    : 6
% 0.23/1.41  # ...of the previous two non-trivial   : 4
% 0.23/1.41  # Contextual simplify-reflections      : 3
% 0.23/1.41  # Paramodulations                      : 4
% 0.23/1.41  # Factorizations                       : 0
% 0.23/1.41  # Equation resolutions                 : 0
% 0.23/1.41  # Current number of processed clauses  : 7
% 0.23/1.41  #    Positive orientable unit clauses  : 1
% 0.23/1.41  #    Positive unorientable unit clauses: 0
% 0.23/1.41  #    Negative unit clauses             : 1
% 0.23/1.41  #    Non-unit-clauses                  : 5
% 0.23/1.41  # Current number of unprocessed clauses: 0
% 0.23/1.41  # ...number of literals in the above   : 0
% 0.23/1.41  # Current number of archived formulas  : 0
% 0.23/1.41  # Current number of archived clauses   : 4
% 0.23/1.41  # Clause-clause subsumption calls (NU) : 4
% 0.23/1.41  # Rec. Clause-clause subsumption calls : 4
% 0.23/1.41  # Non-unit clause-clause subsumptions  : 3
% 0.23/1.41  # Unit Clause-clause subsumption calls : 3
% 0.23/1.41  # Rewrite failures with RHS unbound    : 0
% 0.23/1.41  # BW rewrite match attempts            : 2
% 0.23/1.41  # BW rewrite match successes           : 2
% 0.23/1.41  # Condensation attempts                : 0
% 0.23/1.41  # Condensation successes               : 0
% 0.23/1.41  # Termbank termtop insertions          : 363
% 0.23/1.41  
% 0.23/1.41  # -------------------------------------------------
% 0.23/1.41  # User time                : 0.014 s
% 0.23/1.41  # System time              : 0.000 s
% 0.23/1.41  # Total time               : 0.014 s
% 0.23/1.41  # Maximum resident set size: 2768 pages
%------------------------------------------------------------------------------