↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SYN328+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n008.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Sep 24 03:23:41 PM UTC 2026

% Result   : Theorem 0.11s 0.44s
% Output   : CNFRefutation 0.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   19 (   4 unt;   0 def)
%            Number of atoms       :   85 (   0 equ)
%            Maximal formula atoms :   28 (   4 avg)
%            Number of connectives :   92 (  26   ~;  32   |;  14   &)
%                                         (   6 <=>;  14  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   15 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-1 aty)
%            Number of functors    :    4 (   4 usr;   0 con; 1-1 aty)
%            Number of variables   :   22 (   3 sgn   5   !;   2   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(church_46_12_3,conjecture,
    ? [X1] :
    ! [X2,X3] :
      ( ( ( big_f(X2)
         => big_g(X2) )
      <=> big_f(X1) )
     => ( ( ( big_f(X2)
           => big_h(X2) )
        <=> big_g(X1) )
       => ( ( ( ( big_f(X2)
               => big_g(X2) )
             => big_h(X2) )
          <=> big_h(X1) )
         => ( big_h(X3)
            & big_g(X3)
            & big_f(X3) ) ) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',church_46_12_3) ).

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

fof(c_0_2,negated_conjecture,
    ! [X4] :
      ( ( ~ big_h(esk4_1(X4))
        | ~ big_g(esk3_1(X4))
        | ~ big_f(esk2_1(X4)) )
      & ( ~ big_h(X4)
        | big_h(esk1_1(X4))
        | ~ big_g(esk1_1(X4)) )
      & ( ~ big_h(X4)
        | big_h(esk1_1(X4))
        | big_f(esk1_1(X4)) )
      & ( big_h(X4)
        | ~ big_h(esk1_1(X4)) )
      & ( big_h(X4)
        | big_g(esk1_1(X4))
        | ~ big_f(esk1_1(X4)) )
      & ( big_h(esk1_1(X4))
        | ~ big_f(esk1_1(X4))
        | ~ big_g(X4) )
      & ( big_g(X4)
        | ~ big_h(esk1_1(X4)) )
      & ( big_g(X4)
        | big_f(esk1_1(X4)) )
      & ( big_g(esk1_1(X4))
        | ~ big_f(esk1_1(X4))
        | ~ big_f(X4) )
      & ( big_f(X4)
        | ~ big_g(esk1_1(X4)) )
      & ( big_f(X4)
        | big_f(esk1_1(X4)) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])]) ).

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

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

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

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

cnf(c_0_7,negated_conjecture,
    ( big_f(X1)
    | big_h(X1) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_4]),c_0_5]) ).

cnf(c_0_8,negated_conjecture,
    ( ~ big_h(esk1_1(X1))
    | big_h(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_9,negated_conjecture,
    ( ~ big_g(X1)
    | big_h(esk1_1(X1)) ),
    inference(csr,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_10,negated_conjecture,
    ( big_f(esk1_1(X1))
    | big_h(X1) ),
    inference(spm,[status(thm)],[c_0_8,c_0_7]) ).

cnf(c_0_11,negated_conjecture,
    ( big_h(X1)
    | big_h(esk1_1(esk1_1(X1))) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_4]),c_0_10]) ).

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

cnf(c_0_13,negated_conjecture,
    big_h(X1),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_11]),c_0_8]) ).

cnf(c_0_14,negated_conjecture,
    ( ~ big_h(esk1_1(esk1_1(X1)))
    | big_f(X1) ),
    inference(spm,[status(thm)],[c_0_3,c_0_12]) ).

cnf(c_0_15,negated_conjecture,
    ( ~ big_h(esk4_1(X1))
    | ~ big_g(esk3_1(X1))
    | ~ big_f(esk2_1(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_16,negated_conjecture,
    big_g(X1),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]) ).

cnf(c_0_17,negated_conjecture,
    big_f(X1),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_13])]) ).

cnf(c_0_18,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_13])]),c_0_16]),c_0_17])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN328+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.38  % Computer : n008.cluster.edu
% 0.11/0.38  % Model    : x86_64 x86_64
% 0.11/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38  % Memory   : 8046.5625MB
% 0.11/0.38  % OS       : Linux 6.8.0-71-generic
% 0.11/0.38  % CPULimit : 300
% 0.11/0.38  % WCLimit  : 300
% 0.11/0.38  % DateTime : Mon Sep 21 10:50:25 UTC 2026
% 0.11/0.38  % CPUTime  : 
% 0.11/0.38  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.42  Running first-order theorem proving
% 0.11/0.42  Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/0.44  % Version: 3.5.1
% 0.11/0.44  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.11/0.44  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.44  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.11/0.44  % Starting new_bool_3 with 300s (1) cores
% 0.11/0.44  % Starting new_bool_1 with 300s (1) cores
% 0.11/0.44  % Starting sh5l with 300s (1) cores
% 0.11/0.44  % new_bool_3 with pid 803262 completed with status 0
% 0.11/0.44  % Result found by new_bool_3
% 0.11/0.44  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.11/0.44  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.44  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.11/0.44  % Starting new_bool_3 with 300s (1) cores
% 0.11/0.44  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/0.44  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.44  % Search class: FGHNF-FFSF11-SFFFFFNN
% 0.11/0.44  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.44  % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.44  % SubtermCWHack with pid 803266 completed with status 0
% 0.11/0.44  % Result found by SubtermCWHack
% 0.11/0.44  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.11/0.44  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.11/0.44  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.11/0.44  % Starting new_bool_3 with 300s (1) cores
% 0.11/0.44  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.11/0.44  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.11/0.44  % Search class: FGHNF-FFSF11-SFFFFFNN
% 0.11/0.44  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.11/0.44  % Starting SubtermCWHack with 31s (1) cores
% 0.11/0.44  % Preprocessing time       : 0.001 s
% 0.11/0.44  
% 0.11/0.44  % Proof found!
% 0.11/0.44  % SZS status Theorem
% 0.11/0.44  % SZS output start CNFRefutation
% See solution above
% 0.11/0.44  % Parsed axioms                        : 1
% 0.11/0.44  % Removed by relevancy pruning/SinE    : 0
% 0.11/0.44  % Initial clauses                      : 11
% 0.11/0.44  % Removed in clause preprocessing      : 0
% 0.11/0.44  % Initial clauses in saturation        : 11
% 0.11/0.44  % Processed clauses                    : 24
% 0.11/0.44  % ...of these trivial                  : 1
% 0.11/0.44  % ...subsumed                          : 3
% 0.11/0.44  % ...remaining for further processing  : 19
% 0.11/0.44  % Other redundant clauses eliminated   : 0
% 0.11/0.44  % Clauses deleted for lack of memory   : 0
% 0.11/0.44  % Backward-subsumed                    : 3
% 0.11/0.44  % Backward-rewritten                   : 13
% 0.11/0.44  % Generated clauses                    : 20
% 0.11/0.44  % ...of the previous two non-redundant : 20
% 0.11/0.44  % ...aggressively subsumed             : 0
% 0.11/0.44  % Contextual simplify-reflections      : 4
% 0.11/0.44  % Paramodulations                      : 20
% 0.11/0.44  % Factorizations                       : 0
% 0.11/0.44  % NegExts                              : 0
% 0.11/0.44  % Equation resolutions                 : 0
% 0.11/0.44  % Disequality decompositions           : 0
% 0.11/0.44  % Total rewrite steps                  : 21
% 0.11/0.44  % ...of those cached                   : 10
% 0.11/0.44  % Propositional unsat checks           : 0
% 0.11/0.44  %    Propositional check models        : 0
% 0.11/0.44  %    Propositional check unsatisfiable : 0
% 0.11/0.44  %    Propositional clauses             : 0
% 0.11/0.44  %    Propositional clauses after purity: 0
% 0.11/0.44  %    Propositional unsat core size     : 0
% 0.11/0.44  %    Propositional preprocessing time  : 0.000
% 0.11/0.44  %    Propositional encoding time       : 0.000
% 0.11/0.44  %    Propositional solver time         : 0.000
% 0.11/0.44  %    Success case prop preproc time    : 0.000
% 0.11/0.44  %    Success case prop encoding time   : 0.000
% 0.11/0.44  %    Success case prop solver time     : 0.000
% 0.11/0.44  % Current number of processed clauses  : 3
% 0.11/0.44  %    Positive orientable unit clauses  : 3
% 0.11/0.44  %    Positive unorientable unit clauses: 0
% 0.11/0.44  %    Negative unit clauses             : 0
% 0.11/0.44  %    Non-unit-clauses                  : 0
% 0.11/0.44  % Current number of unprocessed clauses: 0
% 0.11/0.44  % ...number of literals in the above   : 0
% 0.11/0.44  % Current number of archived formulas  : 0
% 0.11/0.44  % Current number of archived clauses   : 16
% 0.11/0.44  % Clause-clause subsumption calls (NU) : 22
% 0.11/0.44  % Rec. Clause-clause subsumption calls : 22
% 0.11/0.44  % Non-unit clause-clause subsumptions  : 8
% 0.11/0.44  % Unit Clause-clause subsumption calls : 2
% 0.11/0.44  % Rewrite failures with RHS unbound    : 0
% 0.11/0.44  % BW rewrite match attempts            : 9
% 0.11/0.44  % BW rewrite match successes           : 9
% 0.11/0.44  % Condensation attempts                : 0
% 0.11/0.44  % Condensation successes               : 0
% 0.11/0.44  % Termbank termtop insertions          : 1227
% 0.11/0.44  % Search garbage collected termcells   : 258
% 0.11/0.44  
% 0.11/0.44  % -------------------------------------------------
% 0.11/0.44  % User time                : 0.003 s
% 0.11/0.44  % System time              : 0.001 s
% 0.11/0.44  % Total time               : 0.004 s
% 0.11/0.44  % Maximum resident set size: 3628 pages
% 0.11/0.44  
% 0.11/0.44  % -------------------------------------------------
% 0.11/0.44  % User time                : 0.005 s
% 0.11/0.44  % System time              : 0.002 s
% 0.11/0.44  % Total time               : 0.008 s
% 0.11/0.44  % Maximum resident set size: 4608 pages
% 0.11/0.44  % E exiting
%------------------------------------------------------------------------------