↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : KRS127+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 : n019.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:00:49 PM UTC 2026

% Result   : Unsatisfiable 0.12s 0.44s
% Output   : CNFRefutation 0.12s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   25 (   4 unt;   0 def)
%            Number of atoms       :   87 (   6 equ)
%            Maximal formula atoms :   30 (   3 avg)
%            Number of connectives :  109 (  47   ~;  43   |;  14   &)
%                                         (   3 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   20 (   4 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   1 con; 0-1 aty)
%            Number of variables   :   41 (   2 sgn  19   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(axiom_4,axiom,
    ! [X4] :
      ( cd(X4)
    <=> ~ ? [X5] : ra_Px1(X4,X5) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4) ).

fof(axiom_5,axiom,
    ! [X4] :
      ( cdxcomp(X4)
    <=> ? [X6] : ra_Px1(X4,X6) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_5) ).

fof(axiom_2,axiom,
    ! [X4] :
      ( cUnsatisfiable(X4)
    <=> ( ! [X6,X7] :
            ( ( rr(X4,X7)
              & rr(X4,X6) )
           => X6 = X7 )
        & ? [X5] :
            ( cd(X5)
            & rr(X4,X5) )
        & ? [X5] :
            ( cc(X5)
            & rr(X4,X5) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).

fof(axiom_3,axiom,
    ! [X4] :
      ( cc(X4)
     => cdxcomp(X4) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).

fof(axiom_6,axiom,
    cUnsatisfiable(i2003_11_14_17_22_27794),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_6) ).

fof(c_0_5,plain,
    ! [X49,X50,X51] :
      ( ( cd(X51)
        | ra_Px1(X51,esk5_1(X51)) )
      & ( ~ ra_Px1(X49,X50)
        | ~ cd(X49) ) ),
    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)],[axiom_4])])])])])]) ).

fof(c_0_6,plain,
    ! [X53,X55,X56] :
      ( ( cdxcomp(X55)
        | ~ ra_Px1(X55,X56) )
      & ( ra_Px1(X53,esk6_1(X53))
        | ~ cdxcomp(X53) ) ),
    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)],[axiom_5])])])])])]) ).

fof(c_0_7,plain,
    ! [X38,X41,X42,X43,X44,X45] :
      ( ( cUnsatisfiable(X43)
        | ~ cd(X45)
        | ~ rr(X43,X45)
        | ~ cc(X44)
        | ~ rr(X43,X44)
        | esk3_1(X43) != esk4_1(X43) )
      & ( cUnsatisfiable(X43)
        | ~ cd(X45)
        | ~ rr(X43,X45)
        | ~ cc(X44)
        | ~ rr(X43,X44)
        | rr(X43,esk4_1(X43)) )
      & ( cUnsatisfiable(X43)
        | ~ cd(X45)
        | ~ rr(X43,X45)
        | ~ cc(X44)
        | ~ rr(X43,X44)
        | rr(X43,esk3_1(X43)) )
      & ( ~ cUnsatisfiable(X38)
        | X41 = X42
        | ~ rr(X38,X42)
        | ~ rr(X38,X41) )
      & ( ~ cUnsatisfiable(X38)
        | cd(esk2_1(X38)) )
      & ( ~ cUnsatisfiable(X38)
        | rr(X38,esk2_1(X38)) )
      & ( ~ cUnsatisfiable(X38)
        | cc(esk1_1(X38)) )
      & ( ~ cUnsatisfiable(X38)
        | rr(X38,esk1_1(X38)) ) ),
    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)],[axiom_2])])])])])])]) ).

cnf(c_0_8,plain,
    ( ~ ra_Px1(X1,X2)
    | ~ cd(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_9,plain,
    ( ~ cdxcomp(X1)
    | ra_Px1(X1,esk6_1(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

fof(c_0_10,plain,
    ! [X48] :
      ( cdxcomp(X48)
      | ~ cc(X48) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_3])])]) ).

cnf(c_0_11,plain,
    ( ~ cUnsatisfiable(X1)
    | ~ rr(X1,X3)
    | ~ rr(X1,X2)
    | X2 = X3 ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_12,plain,
    ( ~ cUnsatisfiable(X1)
    | rr(X1,esk2_1(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_13,plain,
    ( ~ cd(X1)
    | ~ cdxcomp(X1) ),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_14,plain,
    ( ~ cc(X1)
    | cdxcomp(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_15,plain,
    ( ~ cUnsatisfiable(X2)
    | ~ rr(X2,X1)
    | X1 = esk2_1(X2) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_16,plain,
    ( ~ cUnsatisfiable(X1)
    | rr(X1,esk1_1(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_17,plain,
    ( ~ cc(X1)
    | ~ cd(X1) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_18,plain,
    ( ~ cUnsatisfiable(X1)
    | cc(esk1_1(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_19,plain,
    ( ~ cUnsatisfiable(X1)
    | cd(esk2_1(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_20,plain,
    ( ~ cUnsatisfiable(X1)
    | esk2_1(X1) = esk1_1(X1) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_21,plain,
    ( ~ cUnsatisfiable(X1)
    | ~ cd(esk1_1(X1)) ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_22,plain,
    cUnsatisfiable(i2003_11_14_17_22_27794),
    inference(split_conjunct,[status(thm)],[axiom_6]) ).

cnf(c_0_23,plain,
    ~ cUnsatisfiable(X1),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).

cnf(c_0_24,plain,
    $false,
    inference(sr,[status(thm)],[c_0_22,c_0_23]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : KRS127+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.37  % Computer : n019.cluster.edu
% 0.12/0.37  % Model    : x86_64 x86_64
% 0.12/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37  % Memory   : 8046.5625MB
% 0.12/0.37  % OS       : Linux 6.8.0-71-generic
% 0.12/0.37  % CPULimit : 300
% 0.12/0.37  % WCLimit  : 300
% 0.12/0.37  % DateTime : Sun Sep 20 22:54:51 UTC 2026
% 0.12/0.38  % CPUTime  : 
% 0.12/0.38  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.42  Running first-order theorem proving
% 0.12/0.42  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.44  % Version: 3.5.1
% 0.12/0.44  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.44  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.44  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.44  % Starting new_bool_3 with 300s (1) cores
% 0.12/0.44  % Starting new_bool_1 with 300s (1) cores
% 0.12/0.44  % Starting sh5l with 300s (1) cores
% 0.12/0.44  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1098089 completed with status 0
% 0.12/0.44  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.12/0.44  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.44  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.44  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.44  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.44  % No SInE strategy applied
% 0.12/0.44  % Search class: FGHSF-FFSF11-SFFFFFNN
% 0.12/0.44  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.44  % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.44  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.12/0.44  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S4d with 136s (1) cores
% 0.12/0.44  % Starting new_bool_3 with 136s (1) cores
% 0.12/0.44  % Starting new_bool_1 with 136s (1) cores
% 0.12/0.44  % SubtermCWHack with pid 1098102 completed with status 0
% 0.12/0.44  % Result found by SubtermCWHack
% 0.12/0.44  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.12/0.44  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.44  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.12/0.44  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.12/0.44  % No SInE strategy applied
% 0.12/0.44  % Search class: FGHSF-FFSF11-SFFFFFNN
% 0.12/0.44  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.12/0.44  % Starting SubtermCWHack with 136s (1) cores
% 0.12/0.44  % Preprocessing time       : 0.001 s
% 0.12/0.44  
% 0.12/0.44  % Proof found!
% 0.12/0.44  % SZS status Unsatisfiable
% 0.12/0.44  % SZS output start CNFRefutation
% See solution above
% 0.12/0.45  % Parsed axioms                        : 19
% 0.12/0.45  % Removed by relevancy pruning/SinE    : 0
% 0.12/0.45  % Initial clauses                      : 30
% 0.12/0.45  % Removed in clause preprocessing      : 13
% 0.12/0.45  % Initial clauses in saturation        : 17
% 0.12/0.45  % Processed clauses                    : 21
% 0.12/0.45  % ...of these trivial                  : 0
% 0.12/0.45  % ...subsumed                          : 0
% 0.12/0.45  % ...remaining for further processing  : 21
% 0.12/0.45  % Other redundant clauses eliminated   : 0
% 0.12/0.45  % Clauses deleted for lack of memory   : 0
% 0.12/0.45  % Backward-subsumed                    : 8
% 0.12/0.45  % Backward-rewritten                   : 0
% 0.12/0.45  % Generated clauses                    : 14
% 0.12/0.45  % ...of the previous two non-redundant : 9
% 0.12/0.45  % ...aggressively subsumed             : 0
% 0.12/0.45  % Contextual simplify-reflections      : 1
% 0.12/0.45  % Paramodulations                      : 13
% 0.12/0.45  % Factorizations                       : 0
% 0.12/0.45  % NegExts                              : 0
% 0.12/0.45  % Equation resolutions                 : 0
% 0.12/0.45  % Disequality decompositions           : 0
% 0.12/0.45  % Total rewrite steps                  : 0
% 0.12/0.45  % ...of those cached                   : 0
% 0.12/0.45  % Propositional unsat checks           : 0
% 0.12/0.45  %    Propositional check models        : 0
% 0.12/0.45  %    Propositional check unsatisfiable : 0
% 0.12/0.45  %    Propositional clauses             : 0
% 0.12/0.45  %    Propositional clauses after purity: 0
% 0.12/0.45  %    Propositional unsat core size     : 0
% 0.12/0.45  %    Propositional preprocessing time  : 0.000
% 0.12/0.45  %    Propositional encoding time       : 0.000
% 0.12/0.45  %    Propositional solver time         : 0.000
% 0.12/0.45  %    Success case prop preproc time    : 0.000
% 0.12/0.45  %    Success case prop encoding time   : 0.000
% 0.12/0.45  %    Success case prop solver time     : 0.000
% 0.12/0.45  % Current number of processed clauses  : 12
% 0.12/0.45  %    Positive orientable unit clauses  : 0
% 0.12/0.45  %    Positive unorientable unit clauses: 0
% 0.12/0.45  %    Negative unit clauses             : 2
% 0.12/0.45  %    Non-unit-clauses                  : 10
% 0.12/0.45  % Current number of unprocessed clauses: 5
% 0.12/0.45  % ...number of literals in the above   : 23
% 0.12/0.45  % Current number of archived formulas  : 0
% 0.12/0.45  % Current number of archived clauses   : 10
% 0.12/0.45  % Clause-clause subsumption calls (NU) : 45
% 0.12/0.45  % Rec. Clause-clause subsumption calls : 41
% 0.12/0.45  % Non-unit clause-clause subsumptions  : 1
% 0.12/0.45  % Unit Clause-clause subsumption calls : 8
% 0.12/0.45  % Rewrite failures with RHS unbound    : 0
% 0.12/0.45  % BW rewrite match attempts            : 0
% 0.12/0.45  % BW rewrite match successes           : 0
% 0.12/0.45  % Condensation attempts                : 0
% 0.12/0.45  % Condensation successes               : 0
% 0.12/0.45  % Termbank termtop insertions          : 2047
% 0.12/0.45  % Search garbage collected termcells   : 495
% 0.12/0.45  
% 0.12/0.45  % -------------------------------------------------
% 0.12/0.45  % User time                : 0.006 s
% 0.12/0.45  % System time              : 0.003 s
% 0.12/0.45  % Total time               : 0.009 s
% 0.12/0.45  % Maximum resident set size: 3652 pages
% 0.12/0.45  
% 0.12/0.45  % -------------------------------------------------
% 0.12/0.45  % User time                : 0.011 s
% 0.12/0.45  % System time              : 0.013 s
% 0.12/0.45  % Total time               : 0.024 s
% 0.12/0.45  % Maximum resident set size: 4864 pages
% 0.12/0.45  % E exiting
%------------------------------------------------------------------------------