↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n011.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:51 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(x2116,conjecture,
    ( ( ! [X3] :
          ( big_p(X3)
         => ( big_p(h(X3))
            & big_p(g(X3)) ) )
      & ! [X1] :
        ? [X2] :
          ( big_p(X1)
         => ( big_p(X2)
            & big_r(X1,g(h(X2))) ) ) )
   => ! [X1] :
        ( big_p(X1)
       => ? [X2] :
            ( big_p(X2)
            & big_r(X1,X2) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',x2116) ).

fof(c_0_1,negated_conjecture,
    ~ ( ( ! [X3] :
            ( big_p(X3)
           => ( big_p(h(X3))
              & big_p(g(X3)) ) )
        & ! [X1] :
          ? [X2] :
            ( big_p(X1)
           => ( big_p(X2)
              & big_r(X1,g(h(X2))) ) ) )
     => ! [X1] :
          ( big_p(X1)
         => ? [X2] :
              ( big_p(X2)
              & big_r(X1,X2) ) ) ),
    inference(assume_negation,[status(cth)],[x2116]) ).

fof(c_0_2,negated_conjecture,
    ! [X4,X6,X8] :
      ( ( ~ big_p(X8)
        | ~ big_r(esk2_0,X8) )
      & big_p(esk2_0)
      & ( ~ big_p(X6)
        | big_p(h(X6)) )
      & ( ~ big_p(X6)
        | big_p(g(X6)) )
      & ( ~ big_p(X4)
        | big_p(esk1_1(X4)) )
      & ( ~ big_p(X4)
        | big_r(X4,g(h(esk1_1(X4)))) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[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_p(X1)
    | ~ big_r(esk2_0,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_4,negated_conjecture,
    ( ~ big_p(X1)
    | big_r(X1,g(h(esk1_1(X1)))) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_5,negated_conjecture,
    big_p(esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_6,negated_conjecture,
    ~ big_p(g(h(esk1_1(esk2_0)))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_4]),c_0_5])]) ).

cnf(c_0_7,negated_conjecture,
    ( ~ big_p(X1)
    | big_p(g(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_8,negated_conjecture,
    ~ big_p(h(esk1_1(esk2_0))),
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_9,negated_conjecture,
    ( ~ big_p(X1)
    | big_p(h(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_10,negated_conjecture,
    ~ big_p(esk1_1(esk2_0)),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

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

cnf(c_0_12,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_5])]),
    [proof] ).

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