↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SYN351+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 : n001.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:47 PM UTC 2026

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

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

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

fof(c_0_2,negated_conjecture,
    ! [X8,X9] :
      ( ( ~ big_f(esk1_0,esk3_2(X8,X9),X8,esk3_2(X8,X9))
        | big_f(esk1_0,X9,X8,X9)
        | big_f(esk1_0,X8,esk1_0,X9) )
      & ( ~ big_f(esk1_0,esk3_2(X8,X9),X8,esk3_2(X8,X9))
        | ~ big_f(esk1_0,X9,X8,X9)
        | ~ big_f(esk1_0,X8,esk1_0,X9) )
      & ( ~ big_f(esk1_0,esk3_2(X8,X9),X8,esk3_2(X8,X9))
        | big_f(esk1_0,esk3_2(X8,X9),X8,esk3_2(X8,X9)) )
      & ( big_f(esk1_0,X9,X8,X9)
        | big_f(esk1_0,X9,X8,X9)
        | big_f(esk1_0,X8,esk1_0,X9) )
      & ( big_f(esk1_0,X9,X8,X9)
        | ~ big_f(esk1_0,X9,X8,X9)
        | ~ big_f(esk1_0,X8,esk1_0,X9) )
      & ( big_f(esk1_0,X9,X8,X9)
        | big_f(esk1_0,esk3_2(X8,X9),X8,esk3_2(X8,X9)) )
      & big_f(esk1_0,X8,esk1_0,X9)
      & ( big_f(esk1_0,X8,esk1_0,X9)
        | ~ big_f(X8,esk2_0,X8,X9) )
      & ( big_f(X8,esk2_0,X8,X9)
        | ~ big_f(esk1_0,X8,esk1_0,X9) )
      & big_f(esk1_0,X9,esk1_0,esk3_2(X8,X9)) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[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_f(esk1_0,esk3_2(X1,X2),X1,esk3_2(X1,X2))
    | ~ big_f(esk1_0,X2,X1,X2)
    | ~ big_f(esk1_0,X1,esk1_0,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_4,negated_conjecture,
    big_f(esk1_0,X1,esk1_0,X2),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_5,negated_conjecture,
    ( ~ big_f(esk1_0,X2,X1,X2)
    | ~ big_f(esk1_0,esk3_2(X1,X2),X1,esk3_2(X1,X2)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_3,c_0_4])]) ).

cnf(c_0_6,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_4]),c_0_4])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN351+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.10/0.36  % Computer : n001.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Mon Sep 21 10:56:30 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 0.10/0.37  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.41  Running first-order theorem proving
% 0.10/0.41  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.10/0.43  % Version: 3.5.1
% 0.10/0.43  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.10/0.43  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.43  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.10/0.43  % Starting new_bool_3 with 300s (1) cores
% 0.10/0.43  % Starting new_bool_1 with 300s (1) cores
% 0.10/0.43  % Starting sh5l with 300s (1) cores
% 0.10/0.43  % new_bool_3 with pid 2947372 completed with status 0
% 0.10/0.43  % Result found by new_bool_3
% 0.10/0.43  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.10/0.43  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.43  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.10/0.43  % Starting new_bool_3 with 300s (1) cores
% 0.10/0.43  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.10/0.43  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.43  % Search class: FGHNS-FFSF22-SFFFFFNN
% 0.10/0.43  % partial match(1): FGHNF-FFSF22-SFFFFFNN
% 0.10/0.43  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.43  % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.43  % SubtermCWHack with pid 2947378 completed with status 0
% 0.10/0.43  % Result found by SubtermCWHack
% 0.10/0.43  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.10/0.43  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.10/0.43  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.10/0.43  % Starting new_bool_3 with 300s (1) cores
% 0.10/0.43  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.10/0.43  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.10/0.43  % Search class: FGHNS-FFSF22-SFFFFFNN
% 0.10/0.43  % partial match(1): FGHNF-FFSF22-SFFFFFNN
% 0.10/0.43  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.10/0.43  % Starting SubtermCWHack with 31s (1) cores
% 0.10/0.43  % Preprocessing time       : 0.001 s
% 0.10/0.43  
% 0.10/0.43  % Proof found!
% 0.10/0.43  % SZS status Theorem
% 0.10/0.43  % SZS output start CNFRefutation
% See solution above
% 0.10/0.43  % Parsed axioms                        : 1
% 0.10/0.43  % Removed by relevancy pruning/SinE    : 0
% 0.10/0.43  % Initial clauses                      : 10
% 0.10/0.43  % Removed in clause preprocessing      : 2
% 0.10/0.43  % Initial clauses in saturation        : 8
% 0.10/0.43  % Processed clauses                    : 8
% 0.10/0.43  % ...of these trivial                  : 4
% 0.10/0.43  % ...subsumed                          : 0
% 0.10/0.43  % ...remaining for further processing  : 4
% 0.10/0.43  % Other redundant clauses eliminated   : 0
% 0.10/0.43  % Clauses deleted for lack of memory   : 0
% 0.10/0.43  % Backward-subsumed                    : 0
% 0.10/0.43  % Backward-rewritten                   : 0
% 0.10/0.43  % Generated clauses                    : 2
% 0.10/0.43  % ...of the previous two non-redundant : 0
% 0.10/0.43  % ...aggressively subsumed             : 0
% 0.10/0.43  % Contextual simplify-reflections      : 0
% 0.10/0.43  % Paramodulations                      : 2
% 0.10/0.43  % Factorizations                       : 0
% 0.10/0.43  % NegExts                              : 0
% 0.10/0.43  % Equation resolutions                 : 0
% 0.10/0.43  % Disequality decompositions           : 0
% 0.10/0.43  % Total rewrite steps                  : 8
% 0.10/0.43  % ...of those cached                   : 4
% 0.10/0.43  % Propositional unsat checks           : 0
% 0.10/0.43  %    Propositional check models        : 0
% 0.10/0.43  %    Propositional check unsatisfiable : 0
% 0.10/0.43  %    Propositional clauses             : 0
% 0.10/0.43  %    Propositional clauses after purity: 0
% 0.10/0.43  %    Propositional unsat core size     : 0
% 0.10/0.43  %    Propositional preprocessing time  : 0.000
% 0.10/0.43  %    Propositional encoding time       : 0.000
% 0.10/0.43  %    Propositional solver time         : 0.000
% 0.10/0.43  %    Success case prop preproc time    : 0.000
% 0.10/0.43  %    Success case prop encoding time   : 0.000
% 0.10/0.43  %    Success case prop solver time     : 0.000
% 0.10/0.43  % Current number of processed clauses  : 4
% 0.10/0.43  %    Positive orientable unit clauses  : 2
% 0.10/0.43  %    Positive unorientable unit clauses: 0
% 0.10/0.43  %    Negative unit clauses             : 0
% 0.10/0.43  %    Non-unit-clauses                  : 2
% 0.10/0.43  % Current number of unprocessed clauses: 0
% 0.10/0.43  % ...number of literals in the above   : 0
% 0.10/0.43  % Current number of archived formulas  : 0
% 0.10/0.43  % Current number of archived clauses   : 0
% 0.10/0.43  % Clause-clause subsumption calls (NU) : 0
% 0.10/0.43  % Rec. Clause-clause subsumption calls : 0
% 0.10/0.43  % Non-unit clause-clause subsumptions  : 0
% 0.10/0.43  % Unit Clause-clause subsumption calls : 0
% 0.10/0.43  % Rewrite failures with RHS unbound    : 0
% 0.10/0.43  % BW rewrite match attempts            : 0
% 0.10/0.43  % BW rewrite match successes           : 0
% 0.10/0.43  % Condensation attempts                : 0
% 0.10/0.43  % Condensation successes               : 0
% 0.10/0.43  % Termbank termtop insertions          : 600
% 0.10/0.43  % Search garbage collected termcells   : 161
% 0.10/0.43  
% 0.10/0.43  % -------------------------------------------------
% 0.10/0.43  % User time                : 0.003 s
% 0.10/0.43  % System time              : 0.001 s
% 0.10/0.43  % Total time               : 0.004 s
% 0.10/0.43  % Maximum resident set size: 3628 pages
% 0.10/0.43  
% 0.10/0.43  % -------------------------------------------------
% 0.10/0.43  % User time                : 0.004 s
% 0.10/0.43  % System time              : 0.006 s
% 0.10/0.43  % Total time               : 0.009 s
% 0.10/0.43  % Maximum resident set size: 4608 pages
% 0.10/0.43  % E exiting
%------------------------------------------------------------------------------