↑ Up

ET---2.0.THM-CRf.s

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

% Computer : n027.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:53:14 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
fof(church_46_9_2,conjecture,
    ? [X1] :
    ! [X2] :
      ( ( ( big_f(X1,X1)
         => big_f(X2,X2) )
       => ( big_f(X1,X2)
          & big_g(X1) ) )
     => big_g(X2) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',church_46_9_2) ).

fof(c_0_1,negated_conjecture,
    ~ ? [X1] :
      ! [X2] :
        ( ( ( big_f(X1,X1)
           => big_f(X2,X2) )
         => ( big_f(X1,X2)
            & big_g(X1) ) )
       => big_g(X2) ),
    inference(assume_negation,[status(cth)],[church_46_9_2]) ).

fof(c_0_2,negated_conjecture,
    ! [X3] :
      ( ( big_f(X3,esk1_1(X3))
        | big_f(X3,X3) )
      & ( big_g(X3)
        | big_f(X3,X3) )
      & ( big_f(X3,esk1_1(X3))
        | ~ big_f(esk1_1(X3),esk1_1(X3)) )
      & ( big_g(X3)
        | ~ big_f(esk1_1(X3),esk1_1(X3)) )
      & ~ big_g(esk1_1(X3)) ),
    inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])]) ).

cnf(c_0_3,negated_conjecture,
    ~ big_g(esk1_1(X1)),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_4,negated_conjecture,
    ( big_g(X1)
    | ~ big_f(esk1_1(X1),esk1_1(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_5,negated_conjecture,
    ( big_f(X1,X1)
    | big_g(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_6,negated_conjecture,
    ~ big_f(esk1_1(esk1_1(X1)),esk1_1(esk1_1(X1))),
    inference(spm,[status(thm)],[c_0_3,c_0_4]) ).

cnf(c_0_7,negated_conjecture,
    big_f(esk1_1(X1),esk1_1(X1)),
    inference(spm,[status(thm)],[c_0_3,c_0_5]) ).

cnf(c_0_8,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : SYN325+1 : TPTP v8.1.0. Released v2.0.0.
% 0.12/0.13  % Command  : run_ET %s %d
% 0.13/0.34  % Computer : n027.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 : Mon Jul 11 18:30:49 EDT 2022
% 0.13/0.35  % 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.013 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             : 9
% 0.24/1.42  # Proof object clause steps            : 6
% 0.24/1.42  # Proof object formula steps           : 3
% 0.24/1.42  # Proof object conjectures             : 9
% 0.24/1.42  # Proof object clause conjectures      : 6
% 0.24/1.42  # Proof object formula conjectures     : 3
% 0.24/1.42  # Proof object initial clauses used    : 3
% 0.24/1.42  # Proof object initial formulas used   : 1
% 0.24/1.42  # Proof object generating inferences   : 2
% 0.24/1.42  # Proof object simplifying inferences  : 2
% 0.24/1.42  # Training examples: 0 positive, 0 negative
% 0.24/1.42  # Parsed axioms                        : 1
% 0.24/1.42  # Removed by relevancy pruning/SinE    : 0
% 0.24/1.42  # Initial clauses                      : 5
% 0.24/1.42  # Removed in clause preprocessing      : 0
% 0.24/1.42  # Initial clauses in saturation        : 5
% 0.24/1.42  # Processed clauses                    : 7
% 0.24/1.42  # ...of these trivial                  : 0
% 0.24/1.42  # ...subsumed                          : 0
% 0.24/1.42  # ...remaining for further processing  : 7
% 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                    : 2
% 0.24/1.42  # ...of the previous two non-trivial   : 4
% 0.24/1.42  # Contextual simplify-reflections      : 0
% 0.24/1.42  # Paramodulations                      : 2
% 0.24/1.42  # Factorizations                       : 0
% 0.24/1.42  # Equation resolutions                 : 0
% 0.24/1.42  # Current number of processed clauses  : 4
% 0.24/1.42  #    Positive orientable unit clauses  : 1
% 0.24/1.42  #    Positive unorientable unit clauses: 0
% 0.24/1.42  #    Negative unit clauses             : 1
% 0.24/1.42  #    Non-unit-clauses                  : 2
% 0.24/1.42  # Current number of unprocessed clauses: 2
% 0.24/1.42  # ...number of literals in the above   : 2
% 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 : 1
% 0.24/1.42  # Non-unit clause-clause subsumptions  : 0
% 0.24/1.42  # Unit Clause-clause subsumption calls : 0
% 0.24/1.42  # Rewrite failures with RHS unbound    : 0
% 0.24/1.42  # BW rewrite match attempts            : 2
% 0.24/1.42  # BW rewrite match successes           : 2
% 0.24/1.42  # Condensation attempts                : 0
% 0.24/1.42  # Condensation successes               : 0
% 0.24/1.42  # Termbank termtop insertions          : 272
% 0.24/1.42  
% 0.24/1.42  # -------------------------------------------------
% 0.24/1.42  # User time                : 0.011 s
% 0.24/1.42  # System time              : 0.002 s
% 0.24/1.42  # Total time               : 0.013 s
% 0.24/1.42  # Maximum resident set size: 2756 pages
%------------------------------------------------------------------------------