↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n013.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 01:57:39 PM UTC 2026

% Result   : Theorem 0.27s 0.55s
% Output   : CNFRefutation 0.27s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   15 (   4 unt;   0 def)
%            Number of atoms       :   46 (  14 equ)
%            Maximal formula atoms :    8 (   3 avg)
%            Number of connectives :   49 (  18   ~;  12   |;  19   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   1 con; 0-2 aty)
%            Number of variables   :   27 (   4 sgn   9   !;  10   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(oneeqone,conjecture,
    ? [X39] :
      ( ? [X22] :
          ( r2(X22,X39)
          & r1(X22) )
      & X39 = X39 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',oneeqone) ).

fof(axiom_1,axiom,
    ? [X1] :
    ! [X2] :
      ( ( X2 = X1
        & r1(X2) )
      | ( X2 != X1
        & ~ r1(X2) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/NUM008+0.ax',axiom_1) ).

fof(axiom_1a,axiom,
    ! [X14,X15] :
    ? [X16] :
      ( ? [X19] :
          ( r3(X14,X15,X19)
          & r2(X19,X16) )
      & ? [X17] :
          ( X17 = X16
          & ? [X18] :
              ( r3(X14,X18,X17)
              & r2(X15,X18) ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/NUM008+0.ax',axiom_1a) ).

fof(c_0_3,negated_conjecture,
    ~ ? [X39] :
        ( ? [X22] :
            ( r2(X22,X39)
            & r1(X22) )
        & X39 = X39 ),
    inference(assume_negation,[status(cth)],[oneeqone]) ).

fof(c_0_4,plain,
    ? [X1] :
    ! [X2] :
      ( ( X2 = X1
        & r1(X2) )
      | ( X2 != X1
        & ~ r1(X2) ) ),
    inference(fof_simplification,[status(thm)],[axiom_1]) ).

fof(c_0_5,negated_conjecture,
    ! [X44,X45] :
      ( ~ r2(X45,X44)
      | ~ r1(X45)
      | X44 != X44 ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_3])])])]) ).

fof(c_0_6,plain,
    ! [X61] :
      ( ( X61 != esk5_0
        | X61 = esk5_0 )
      & ( X61 != esk5_0
        | r1(X61) )
      & ( ~ r1(X61)
        | X61 = esk5_0 )
      & ( ~ r1(X61)
        | r1(X61) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_4])])])]) ).

cnf(c_0_7,negated_conjecture,
    ( ~ r2(X2,X1)
    | ~ r1(X2)
    | $false ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

fof(c_0_8,plain,
    ! [X69,X70] :
      ( r3(X69,X70,esk12_2(X69,X70))
      & r2(esk12_2(X69,X70),esk9_2(X69,X70))
      & esk10_2(X69,X70) = esk9_2(X69,X70)
      & r3(X69,esk11_2(X69,X70),esk10_2(X69,X70))
      & r2(X70,esk11_2(X69,X70)) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[axiom_1a])]) ).

cnf(c_0_9,plain,
    ( X1 != esk5_0
    | r1(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_10,negated_conjecture,
    ( ~ r2(X2,X1)
    | ~ r1(X2) ),
    inference(cn,[status(thm)],[c_0_7]) ).

cnf(c_0_11,plain,
    r2(X1,esk11_2(X2,X1)),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_12,plain,
    r1(esk5_0),
    inference(er,[status(thm)],[c_0_9]) ).

cnf(c_0_13,negated_conjecture,
    ~ r1(X1),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_14,plain,
    $false,
    inference(sr,[status(thm)],[c_0_12,c_0_13]),
    [proof] ).

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