↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n018.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:26:11 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(y2141,conjecture,
    ( ! [X1] :
      ? [X2] :
        ( ( q(X1)
          | q(X2) )
        & p(X1) )
   => ? [X3] :
        ( q(X3)
        & p(X3) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',y2141) ).

fof(c_0_1,negated_conjecture,
    ~ ( ! [X1] :
        ? [X2] :
          ( ( q(X1)
            | q(X2) )
          & p(X1) )
     => ? [X3] :
          ( q(X3)
          & p(X3) ) ),
    inference(assume_negation,[status(cth)],[y2141]) ).

fof(c_0_2,negated_conjecture,
    ! [X4,X6,X7] :
      ( ( ~ q(X7)
        | ~ p(X7) )
      & ( q(X6)
        | q(esk1_0) )
      & p(X4) ),
    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,
    ( q(X1)
    | q(esk1_0) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_4,negated_conjecture,
    ( ~ q(X1)
    | ~ p(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_5,negated_conjecture,
    p(X1),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_6,negated_conjecture,
    q(esk1_0),
    inference(ef,[status(thm)],[c_0_3]) ).

cnf(c_0_7,negated_conjecture,
    ~ q(X1),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_4,c_0_5])]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN733+1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.06  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/0.43  % Computer : n018.cluster.edu
% 0.17/0.43  % Model    : x86_64 x86_64
% 0.17/0.43  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.43  % Memory   : 8046.5625MB
% 0.17/0.43  % OS       : Linux 6.8.0-71-generic
% 0.17/0.43  % CPULimit : 300
% 0.17/0.43  % WCLimit  : 300
% 0.17/0.43  % DateTime : Mon Sep 21 11:16:14 UTC 2026
% 0.17/0.43  % CPUTime  : 
% 0.17/0.43  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/0.50  Running first-order theorem proving
% 0.17/0.50  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.26/0.54  % Version: 3.5.1
% 0.26/0.54  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.26/0.54  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.54  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.26/0.54  % Starting new_bool_3 with 300s (1) cores
% 0.26/0.54  % Starting new_bool_1 with 300s (1) cores
% 0.26/0.54  % Starting sh5l with 300s (1) cores
% 0.26/0.54  % sh5l with pid 1744904 completed with status 0
% 0.26/0.54  % Result found by sh5l
% 0.26/0.54  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.26/0.54  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.54  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.26/0.54  % Starting new_bool_3 with 300s (1) cores
% 0.26/0.54  % Starting new_bool_1 with 300s (1) cores
% 0.26/0.54  % Starting sh5l with 300s (1) cores
% 0.26/0.54  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.26/0.54  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.26/0.54  % Search class: FGHNF-FFSF00-SFFFFFNN
% 0.26/0.54  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.54  % Starting SubtermCWHack with 31s (1) cores
% 0.26/0.54  % SubtermCWHack with pid 1744912 completed with status 0
% 0.26/0.54  % Result found by SubtermCWHack
% 0.26/0.54  % Preprocessing class: FSSSSMSSSSSNFFN.
% 0.26/0.54  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.26/0.54  % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 0.26/0.54  % Starting new_bool_3 with 300s (1) cores
% 0.26/0.54  % Starting new_bool_1 with 300s (1) cores
% 0.26/0.54  % Starting sh5l with 300s (1) cores
% 0.26/0.54  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.26/0.54  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.26/0.54  % Search class: FGHNF-FFSF00-SFFFFFNN
% 0.26/0.54  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.26/0.54  % Starting SubtermCWHack with 31s (1) cores
% 0.26/0.54  % Preprocessing time       : 0.002 s
% 0.26/0.54  
% 0.26/0.54  % Proof found!
% 0.26/0.54  % SZS status Theorem
% 0.26/0.54  % SZS output start CNFRefutation
% See solution above
% 0.26/0.54  % Parsed axioms                        : 1
% 0.26/0.54  % Removed by relevancy pruning/SinE    : 0
% 0.26/0.54  % Initial clauses                      : 3
% 0.26/0.54  % Removed in clause preprocessing      : 0
% 0.26/0.54  % Initial clauses in saturation        : 3
% 0.26/0.54  % Processed clauses                    : 4
% 0.26/0.54  % ...of these trivial                  : 0
% 0.26/0.54  % ...subsumed                          : 0
% 0.26/0.54  % ...remaining for further processing  : 4
% 0.26/0.54  % Other redundant clauses eliminated   : 0
% 0.26/0.54  % Clauses deleted for lack of memory   : 0
% 0.26/0.54  % Backward-subsumed                    : 1
% 0.26/0.54  % Backward-rewritten                   : 0
% 0.26/0.54  % Generated clauses                    : 3
% 0.26/0.54  % ...of the previous two non-redundant : 2
% 0.26/0.54  % ...aggressively subsumed             : 0
% 0.26/0.54  % Contextual simplify-reflections      : 0
% 0.26/0.54  % Paramodulations                      : 0
% 0.26/0.54  % Factorizations                       : 2
% 0.26/0.54  % NegExts                              : 0
% 0.26/0.54  % Equation resolutions                 : 0
% 0.26/0.54  % Disequality decompositions           : 0
% 0.26/0.54  % Total rewrite steps                  : 1
% 0.26/0.54  % ...of those cached                   : 0
% 0.26/0.54  % Propositional unsat checks           : 0
% 0.26/0.54  %    Propositional check models        : 0
% 0.26/0.54  %    Propositional check unsatisfiable : 0
% 0.26/0.54  %    Propositional clauses             : 0
% 0.26/0.54  %    Propositional clauses after purity: 0
% 0.26/0.54  %    Propositional unsat core size     : 0
% 0.26/0.54  %    Propositional preprocessing time  : 0.000
% 0.26/0.54  %    Propositional encoding time       : 0.000
% 0.26/0.54  %    Propositional solver time         : 0.000
% 0.26/0.54  %    Success case prop preproc time    : 0.000
% 0.26/0.54  %    Success case prop encoding time   : 0.000
% 0.26/0.54  %    Success case prop solver time     : 0.000
% 0.26/0.54  % Current number of processed clauses  : 2
% 0.26/0.54  %    Positive orientable unit clauses  : 1
% 0.26/0.54  %    Positive unorientable unit clauses: 0
% 0.26/0.54  %    Negative unit clauses             : 1
% 0.26/0.54  %    Non-unit-clauses                  : 0
% 0.26/0.54  % Current number of unprocessed clauses: 0
% 0.26/0.54  % ...number of literals in the above   : 0
% 0.26/0.54  % Current number of archived formulas  : 0
% 0.26/0.54  % Current number of archived clauses   : 2
% 0.26/0.54  % Clause-clause subsumption calls (NU) : 0
% 0.26/0.54  % Rec. Clause-clause subsumption calls : 0
% 0.26/0.54  % Non-unit clause-clause subsumptions  : 0
% 0.26/0.54  % Unit Clause-clause subsumption calls : 1
% 0.26/0.54  % Rewrite failures with RHS unbound    : 0
% 0.26/0.54  % BW rewrite match attempts            : 1
% 0.26/0.54  % BW rewrite match successes           : 1
% 0.26/0.54  % Condensation attempts                : 0
% 0.26/0.54  % Condensation successes               : 0
% 0.26/0.54  % Termbank termtop insertions          : 212
% 0.26/0.54  % Search garbage collected termcells   : 78
% 0.26/0.54  
% 0.26/0.54  % -------------------------------------------------
% 0.26/0.54  % User time                : 0.002 s
% 0.26/0.54  % System time              : 0.004 s
% 0.26/0.54  % Total time               : 0.005 s
% 0.26/0.54  % Maximum resident set size: 3624 pages
% 0.26/0.54  
% 0.26/0.54  % -------------------------------------------------
% 0.26/0.54  % User time                : 0.002 s
% 0.26/0.54  % System time              : 0.012 s
% 0.26/0.54  % Total time               : 0.013 s
% 0.26/0.54  % Maximum resident set size: 4864 pages
% 0.26/0.54  % E exiting
%------------------------------------------------------------------------------