↑ Up

E-SAT---3.5.1.UNS-CRf.s

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

% Result   : Unsatisfiable 0.35s 0.70s
% Output   : CNFRefutation 0.35s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   34 (   4 unt;   0 def)
%            Number of atoms       :  140 (   0 equ)
%            Maximal formula atoms :   29 (   4 avg)
%            Number of connectives :  170 (  64   ~;  61   |;  27   &)
%                                         (   5 <=>;  13  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   20 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :   11 (  10 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   1 con; 0-2 aty)
%            Number of variables   :   75 (   1 sgn  39   !;   5   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(axiom_4,axiom,
    ! [X1] :
      ( cc(X1)
    <=> ! [X2] :
          ( rinvR(X1,X2)
         => ! [X3] :
              ( rinvP(X2,X3)
             => ! [X4] :
                  ( rinvS(X3,X4)
                 => ~ ca(X4) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_4) ).

fof(axiom_7,axiom,
    ! [X1,X2] :
      ( rinvS(X1,X2)
    <=> rs(X2,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_7) ).

fof(axiom_2,axiom,
    ! [X1] :
      ( cUnsatisfiable(X1)
     => ? [X2] :
          ( ? [X3] :
              ( cowlThing(X3)
              & rr(X2,X3) )
          & ! [X3] :
              ( rp(X2,X3)
             => ! [X4] :
                  ( rr(X3,X4)
                 => cc(X4) ) )
          & ! [X3] :
              ( rp(X2,X3)
             => ? [X4] :
                  ( cowlThing(X4)
                  & rp(X3,X4) ) )
          & ! [X3] :
              ( rp(X2,X3)
             => ? [X4] :
                  ( cowlThing(X4)
                  & rr(X3,X4) ) )
          & ! [X3] :
              ( rr(X2,X3)
             => cc(X3) )
          & ? [X3] :
              ( cowlThing(X3)
              & rp(X2,X3) )
          & rs(X1,X2) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_2) ).

fof(axiom_3,axiom,
    ! [X1] :
      ( cUnsatisfiable(X1)
     => ca(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_3) ).

fof(axiom_5,axiom,
    ! [X1,X2] :
      ( rinvP(X1,X2)
    <=> rp(X2,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_5) ).

fof(axiom_6,axiom,
    ! [X1,X2] :
      ( rinvR(X1,X2)
    <=> rr(X2,X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_6) ).

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

fof(c_0_7,plain,
    ! [X1] :
      ( cc(X1)
    <=> ! [X2] :
          ( rinvR(X1,X2)
         => ! [X3] :
              ( rinvP(X2,X3)
             => ! [X4] :
                  ( rinvS(X3,X4)
                 => ~ ca(X4) ) ) ) ),
    inference(fof_simplification,[status(thm)],[axiom_4]) ).

fof(c_0_8,plain,
    ! [X31,X32] :
      ( ( rinvS(X31,X32)
        | ~ rs(X32,X31) )
      & ( rs(X32,X31)
        | ~ rinvS(X31,X32) ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_7])])]) ).

fof(c_0_9,plain,
    ! [X7,X10,X11,X13,X15,X16] :
      ( ( ~ cUnsatisfiable(X7)
        | cowlThing(esk5_1(X7)) )
      & ( ~ cUnsatisfiable(X7)
        | rr(esk1_1(X7),esk5_1(X7)) )
      & ( ~ cUnsatisfiable(X7)
        | cc(X16)
        | ~ rr(X15,X16)
        | ~ rp(esk1_1(X7),X15) )
      & ( ~ cUnsatisfiable(X7)
        | ~ rp(esk1_1(X7),X13)
        | cowlThing(esk4_2(X7,X13)) )
      & ( ~ cUnsatisfiable(X7)
        | ~ rp(esk1_1(X7),X13)
        | rp(X13,esk4_2(X7,X13)) )
      & ( ~ cUnsatisfiable(X7)
        | ~ rp(esk1_1(X7),X11)
        | cowlThing(esk3_2(X7,X11)) )
      & ( ~ cUnsatisfiable(X7)
        | ~ rp(esk1_1(X7),X11)
        | rr(X11,esk3_2(X7,X11)) )
      & ( ~ cUnsatisfiable(X7)
        | cc(X10)
        | ~ rr(esk1_1(X7),X10) )
      & ( ~ cUnsatisfiable(X7)
        | cowlThing(esk2_1(X7)) )
      & ( ~ cUnsatisfiable(X7)
        | rp(esk1_1(X7),esk2_1(X7)) )
      & ( ~ cUnsatisfiable(X7)
        | rs(X7,esk1_1(X7)) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_2])])])])])]) ).

fof(c_0_10,plain,
    ! [X19,X20,X21,X22,X23] :
      ( ( cc(X23)
        | ca(esk8_1(X23)) )
      & ( cc(X23)
        | rinvS(esk7_1(X23),esk8_1(X23)) )
      & ( cc(X23)
        | rinvP(esk6_1(X23),esk7_1(X23)) )
      & ( cc(X23)
        | rinvR(X23,esk6_1(X23)) )
      & ( ~ ca(X22)
        | ~ rinvS(X21,X22)
        | ~ rinvP(X20,X21)
        | ~ rinvR(X19,X20)
        | ~ cc(X19) ) ),
    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)],[c_0_7])])])])])])]) ).

cnf(c_0_11,plain,
    ( ~ rs(X1,X2)
    | rinvS(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_12,plain,
    ( ~ cUnsatisfiable(X1)
    | rs(X1,esk1_1(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

fof(c_0_13,plain,
    ! [X18] :
      ( ca(X18)
      | ~ cUnsatisfiable(X18) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_3])])]) ).

fof(c_0_14,plain,
    ! [X27,X28] :
      ( ( rinvP(X27,X28)
        | ~ rp(X28,X27) )
      & ( rp(X28,X27)
        | ~ rinvP(X27,X28) ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_5])])]) ).

cnf(c_0_15,plain,
    ( ~ cUnsatisfiable(X2)
    | ~ rp(esk1_1(X2),X1)
    | rr(X1,esk3_2(X2,X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_16,plain,
    ( ~ cUnsatisfiable(X1)
    | rp(esk1_1(X1),esk2_1(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_17,plain,
    ( ~ ca(X4)
    | ~ rinvS(X3,X4)
    | ~ rinvP(X2,X3)
    | ~ rinvR(X1,X2)
    | ~ cc(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_18,plain,
    ( ~ cUnsatisfiable(X1)
    | rinvS(esk1_1(X1),X1) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_19,plain,
    ( ~ cUnsatisfiable(X1)
    | ca(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_20,plain,
    ( ~ rp(X1,X2)
    | rinvP(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

fof(c_0_21,plain,
    ! [X29,X30] :
      ( ( rinvR(X29,X30)
        | ~ rr(X30,X29) )
      & ( rr(X30,X29)
        | ~ rinvR(X29,X30) ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[axiom_6])])]) ).

cnf(c_0_22,plain,
    ( ~ cUnsatisfiable(X1)
    | ~ rr(X2,X3)
    | ~ rp(esk1_1(X1),X2)
    | cc(X3) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_23,plain,
    ( ~ cUnsatisfiable(X1)
    | rr(esk2_1(X1),esk3_2(X1,esk2_1(X1))) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_24,plain,
    ( ~ cUnsatisfiable(X2)
    | ~ cc(X3)
    | ~ rinvR(X3,X1)
    | ~ rinvP(X1,esk1_1(X2)) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).

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

cnf(c_0_26,plain,
    ( ~ rr(X1,X2)
    | rinvR(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_21]) ).

cnf(c_0_27,plain,
    ( ~ cUnsatisfiable(X1)
    | ~ cUnsatisfiable(X2)
    | ~ rp(esk1_1(X2),esk2_1(X1))
    | cc(esk3_2(X1,esk2_1(X1))) ),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_28,plain,
    ( ~ cUnsatisfiable(X2)
    | ~ cc(X1)
    | ~ rinvR(X1,esk2_1(X2)) ),
    inference(spm,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_29,plain,
    ( ~ cUnsatisfiable(X1)
    | rinvR(esk3_2(X1,esk2_1(X1)),esk2_1(X1)) ),
    inference(spm,[status(thm)],[c_0_26,c_0_23]) ).

cnf(c_0_30,plain,
    ( ~ cUnsatisfiable(X1)
    | cc(esk3_2(X1,esk2_1(X1))) ),
    inference(spm,[status(thm)],[c_0_27,c_0_16]) ).

cnf(c_0_31,plain,
    cUnsatisfiable(i2003_11_14_17_19_28752),
    inference(split_conjunct,[status(thm)],[axiom_9]) ).

cnf(c_0_32,plain,
    ~ cUnsatisfiable(X1),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]) ).

cnf(c_0_33,plain,
    $false,
    inference(sr,[status(thm)],[c_0_31,c_0_32]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : KRS082+1 : TPTP v9.3.1. Released v3.1.0.
% 0.00/0.09  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.50  % Computer : n002.cluster.edu
% 0.24/0.50  % Model    : x86_64 x86_64
% 0.24/0.50  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.24/0.50  % Memory   : 8046.5625MB
% 0.24/0.50  % OS       : Linux 6.8.0-71-generic
% 0.24/0.50  % CPULimit : 300
% 0.24/0.50  % WCLimit  : 300
% 0.24/0.50  % DateTime : Sun Sep 20 22:55:47 UTC 2026
% 0.24/0.51  % CPUTime  : 
% 0.24/0.51  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.29/0.59  Running first-order theorem proving
% 0.29/0.59  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.35/0.69  % Version: 3.5.1
% 0.35/0.69  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.35/0.69  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.35/0.69  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.35/0.69  % Starting new_bool_3 with 300s (1) cores
% 0.35/0.69  % Starting new_bool_1 with 300s (1) cores
% 0.35/0.69  % Starting sh5l with 300s (1) cores
% 0.35/0.69  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1882529 completed with status 0
% 0.35/0.69  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.35/0.69  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.35/0.69  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.35/0.69  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.35/0.69  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.35/0.69  % No SInE strategy applied
% 0.35/0.69  % Search class: FGHNF-FFSF21-SFFFFFNN
% 0.35/0.69  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.35/0.69  % Starting SubtermCWHack with 136s (1) cores
% 0.35/0.69  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.35/0.69  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S032N with 136s (1) cores
% 0.35/0.70  % Starting new_bool_3 with 136s (1) cores
% 0.35/0.70  % Starting new_bool_1 with 136s (1) cores
% 0.35/0.70  % new_bool_1 with pid 1882552 completed with status 0
% 0.35/0.70  % Result found by new_bool_1
% 0.35/0.70  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.35/0.70  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.35/0.70  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.35/0.70  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.35/0.70  % No SInE strategy applied
% 0.35/0.70  % Search class: FGHNF-FFSF21-SFFFFFNN
% 0.35/0.70  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.35/0.70  % Starting SubtermCWHack with 136s (1) cores
% 0.35/0.70  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.35/0.70  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S032N with 136s (1) cores
% 0.35/0.70  % Starting new_bool_3 with 136s (1) cores
% 0.35/0.70  % Starting new_bool_1 with 136s (1) cores
% 0.35/0.70  % Preprocessing time       : 0.002 s
% 0.35/0.70  % Presaturation interreduction done
% 0.35/0.70  
% 0.35/0.70  % Proof found!
% 0.35/0.70  % SZS status Unsatisfiable
% 0.35/0.70  % SZS output start CNFRefutation
% See solution above
% 0.35/0.70  % Parsed axioms                        : 10
% 0.35/0.70  % Removed by relevancy pruning/SinE    : 0
% 0.35/0.70  % Initial clauses                      : 29
% 0.35/0.70  % Removed in clause preprocessing      : 5
% 0.35/0.70  % Initial clauses in saturation        : 24
% 0.35/0.70  % Processed clauses                    : 79
% 0.35/0.70  % ...of these trivial                  : 0
% 0.35/0.70  % ...subsumed                          : 7
% 0.35/0.70  % ...remaining for further processing  : 72
% 0.35/0.70  % Other redundant clauses eliminated   : 0
% 0.35/0.70  % Clauses deleted for lack of memory   : 0
% 0.35/0.70  % Backward-subsumed                    : 25
% 0.35/0.70  % Backward-rewritten                   : 0
% 0.35/0.70  % Generated clauses                    : 39
% 0.35/0.70  % ...of the previous two non-redundant : 36
% 0.35/0.70  % ...aggressively subsumed             : 0
% 0.35/0.70  % Contextual simplify-reflections      : 3
% 0.35/0.70  % Paramodulations                      : 38
% 0.35/0.70  % Factorizations                       : 0
% 0.35/0.70  % NegExts                              : 0
% 0.35/0.70  % Equation resolutions                 : 0
% 0.35/0.70  % Disequality decompositions           : 0
% 0.35/0.70  % Total rewrite steps                  : 0
% 0.35/0.70  % ...of those cached                   : 0
% 0.35/0.70  % Propositional unsat checks           : 0
% 0.35/0.70  %    Propositional check models        : 0
% 0.35/0.70  %    Propositional check unsatisfiable : 0
% 0.35/0.70  %    Propositional clauses             : 0
% 0.35/0.70  %    Propositional clauses after purity: 0
% 0.35/0.70  %    Propositional unsat core size     : 0
% 0.35/0.70  %    Propositional preprocessing time  : 0.000
% 0.35/0.70  %    Propositional encoding time       : 0.000
% 0.35/0.70  %    Propositional solver time         : 0.000
% 0.35/0.70  %    Success case prop preproc time    : 0.000
% 0.35/0.70  %    Success case prop encoding time   : 0.000
% 0.35/0.70  %    Success case prop solver time     : 0.000
% 0.35/0.70  % Current number of processed clauses  : 22
% 0.35/0.70  %    Positive orientable unit clauses  : 0
% 0.35/0.70  %    Positive unorientable unit clauses: 0
% 0.35/0.70  %    Negative unit clauses             : 2
% 0.35/0.70  %    Non-unit-clauses                  : 20
% 0.35/0.70  % Current number of unprocessed clauses: 5
% 0.35/0.70  % ...number of literals in the above   : 10
% 0.35/0.70  % Current number of archived formulas  : 0
% 0.35/0.70  % Current number of archived clauses   : 51
% 0.35/0.70  % Clause-clause subsumption calls (NU) : 442
% 0.35/0.70  % Rec. Clause-clause subsumption calls : 326
% 0.35/0.70  % Non-unit clause-clause subsumptions  : 11
% 0.35/0.70  % Unit Clause-clause subsumption calls : 24
% 0.35/0.70  % Rewrite failures with RHS unbound    : 0
% 0.35/0.70  % BW rewrite match attempts            : 0
% 0.35/0.70  % BW rewrite match successes           : 0
% 0.35/0.70  % Condensation attempts                : 0
% 0.35/0.70  % Condensation successes               : 0
% 0.35/0.70  % Termbank termtop insertions          : 2495
% 0.35/0.70  % Search garbage collected termcells   : 392
% 0.35/0.70  
% 0.35/0.70  % -------------------------------------------------
% 0.35/0.70  % User time                : 0.015 s
% 0.35/0.70  % System time              : 0.006 s
% 0.35/0.70  % Total time               : 0.021 s
% 0.35/0.70  % Maximum resident set size: 3640 pages
% 0.35/0.70  
% 0.35/0.70  % -------------------------------------------------
% 0.35/0.70  % User time                : 0.028 s
% 0.35/0.70  % System time              : 0.029 s
% 0.35/0.70  % Total time               : 0.057 s
% 0.35/0.70  % Maximum resident set size: 4864 pages
% 0.35/0.70  % E exiting
%------------------------------------------------------------------------------