↑ Up

E-SAT---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E-SAT---3.5.1
% Problem  : SYN069+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 : 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:32:25 PM UTC 2026

% Result   : Theorem 0.15s 0.64s
% Output   : CNFRefutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   29 (   7 unt;   0 def)
%            Number of atoms       :   98 (   0 equ)
%            Maximal formula atoms :   27 (   3 avg)
%            Number of connectives :  109 (  40   ~;  42   |;  23   &)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   16 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    7 (   6 usr;   1 prp; 0-2 aty)
%            Number of functors    :    3 (   3 usr;   1 con; 0-1 aty)
%            Number of variables   :   39 (  10 sgn  13   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(pel45_2,axiom,
    ~ ? [X2] :
        ( big_k(X2)
        & big_l(X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel45_2) ).

fof(pel45_3,axiom,
    ? [X1] :
      ( ! [X3] :
          ( ( big_h(X1,X3)
            & big_g(X3) )
         => big_j(X1,X3) )
      & ! [X2] :
          ( big_h(X1,X2)
         => big_l(X2) )
      & big_f(X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel45_3) ).

fof(pel45_1,axiom,
    ! [X1] :
      ( ( ! [X2] :
            ( ( big_h(X1,X2)
              & big_g(X2) )
           => big_j(X1,X2) )
        & big_f(X1) )
     => ! [X3] :
          ( big_k(X3)
          & big_h(X1,X3)
          & big_g(X3) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel45_1) ).

fof(pel45,conjecture,
    ? [X1] :
      ( ~ ? [X2] :
            ( big_h(X1,X2)
            & big_g(X2) )
      & big_f(X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',pel45) ).

fof(c_0_4,plain,
    ! [X14] :
      ( ~ big_k(X14)
      | ~ big_l(X14) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[pel45_2])])]) ).

fof(c_0_5,plain,
    ! [X12,X13] :
      ( ( big_j(esk3_0,X13)
        | ~ big_h(esk3_0,X13)
        | ~ big_g(X13) )
      & ( big_l(X12)
        | ~ big_h(esk3_0,X12) )
      & big_f(esk3_0) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[pel45_3])])])])]) ).

fof(c_0_6,plain,
    ! [X6,X8,X9,X10] :
      ( ( ~ big_f(X6)
        | ~ big_j(X6,esk2_1(X6))
        | big_k(X10) )
      & ( ~ big_f(X6)
        | ~ big_j(X6,esk2_1(X6))
        | big_h(X6,X9) )
      & ( ~ big_f(X6)
        | ~ big_j(X6,esk2_1(X6))
        | big_g(X8) )
      & ( ~ big_f(X6)
        | big_h(X6,esk2_1(X6))
        | big_k(X10) )
      & ( ~ big_f(X6)
        | big_h(X6,esk2_1(X6))
        | big_h(X6,X9) )
      & ( ~ big_f(X6)
        | big_h(X6,esk2_1(X6))
        | big_g(X8) )
      & ( ~ big_f(X6)
        | big_g(esk2_1(X6))
        | big_k(X10) )
      & ( ~ big_f(X6)
        | big_g(esk2_1(X6))
        | big_h(X6,X9) )
      & ( ~ big_f(X6)
        | big_g(esk2_1(X6))
        | big_g(X8) ) ),
    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)],[pel45_1])])])])])])]) ).

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

cnf(c_0_8,plain,
    ( ~ big_h(esk3_0,X1)
    | big_l(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_9,plain,
    ( ~ big_f(X2)
    | big_h(X2,esk2_1(X2))
    | big_k(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_10,plain,
    big_f(esk3_0),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

fof(c_0_11,negated_conjecture,
    ~ ? [X1] :
        ( ~ ? [X2] :
              ( big_h(X1,X2)
              & big_g(X2) )
        & big_f(X1) ),
    inference(assume_negation,[status(cth)],[pel45]) ).

cnf(c_0_12,plain,
    ( ~ big_h(esk3_0,X1)
    | ~ big_k(X1) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_13,plain,
    ( big_h(esk3_0,esk2_1(esk3_0))
    | big_k(X1) ),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

fof(c_0_14,negated_conjecture,
    ! [X4] :
      ( ( ~ big_f(X4)
        | big_h(X4,esk1_1(X4)) )
      & ( ~ big_f(X4)
        | big_g(esk1_1(X4)) ) ),
    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_11])])])])]) ).

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

cnf(c_0_16,plain,
    ( ~ big_h(esk3_0,X1)
    | big_h(esk3_0,esk2_1(esk3_0)) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_17,negated_conjecture,
    ( ~ big_f(X1)
    | big_h(X1,esk1_1(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_18,plain,
    ( big_g(X1)
    | big_g(esk2_1(esk3_0)) ),
    inference(spm,[status(thm)],[c_0_15,c_0_10]) ).

cnf(c_0_19,plain,
    ( ~ big_f(X2)
    | ~ big_j(X2,esk2_1(X2))
    | big_g(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_20,plain,
    ( ~ big_h(esk3_0,X1)
    | ~ big_g(X1)
    | big_j(esk3_0,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_21,negated_conjecture,
    big_h(esk3_0,esk2_1(esk3_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_10])]) ).

cnf(c_0_22,plain,
    big_g(esk2_1(esk3_0)),
    inference(ef,[status(thm)],[c_0_18]) ).

cnf(c_0_23,plain,
    big_g(X1),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_10]),c_0_21]),c_0_22])]) ).

cnf(c_0_24,plain,
    ( ~ big_f(X2)
    | ~ big_j(X2,esk2_1(X2))
    | big_k(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_25,plain,
    ( ~ big_h(esk3_0,X1)
    | big_j(esk3_0,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_23])]) ).

cnf(c_0_26,plain,
    big_k(X1),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_10]),c_0_21])]) ).

cnf(c_0_27,plain,
    ~ big_h(esk3_0,X1),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_26])]) ).

cnf(c_0_28,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[c_0_21,c_0_27]),
    [proof] ).

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