↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n006.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:31:01 PM UTC 2026

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

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

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

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

cnf(c_0_4,negated_conjecture,
    s(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_5,negated_conjecture,
    ~ p(esk1_0,esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_6,negated_conjecture,
    p(X1,X2),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_3,c_0_4])]) ).

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

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