↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : LCL682+1.001 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n008.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:16:09 PM UTC 2026

% Result   : Theorem 0.15s 0.48s
% Output   : CNFRefutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   10 (   4 unt;   0 def)
%            Number of atoms       :   96 (   0 equ)
%            Maximal formula atoms :   24 (   9 avg)
%            Number of connectives :  167 (  81   ~;  71   |;  15   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   22 (   8 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    8 (   7 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   9 con; 0-0 aty)
%            Number of variables   :   50 (   0 sgn  44   !;   3   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(main,conjecture,
    ~ ? [X1] :
        ~ ( ! [X2] :
              ( ! [X1] :
                  ( p11(X1)
                  | ~ r1(X2,X1) )
              | ~ r1(X1,X2) )
          | ! [X2] :
              ( ! [X1] :
                  ( p12(X1)
                  | ~ r1(X2,X1) )
              | ~ r1(X1,X2) )
          | ! [X2] :
              ( ! [X1] :
                  ( p13(X1)
                  | ~ r1(X2,X1) )
              | ~ r1(X1,X2) )
          | ! [X2] :
              ( ! [X1] :
                  ( p15(X1)
                  | ~ r1(X2,X1) )
              | ~ r1(X1,X2) )
          | ~ ! [X2] :
                ( ~ ( ~ ! [X1] :
                          ( p12(X1)
                          | ~ r1(X2,X1) )
                    | ~ ! [X1] :
                          ( p14(X1)
                          | ~ r1(X2,X1) )
                    | ~ ! [X1] :
                          ( p12(X1)
                          | ~ r1(X2,X1) )
                    | ~ ! [X1] :
                          ( p16(X1)
                          | ~ r1(X2,X1) ) )
                | ~ r1(X1,X2) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',main) ).

fof(c_0_1,negated_conjecture,
    ~ ~ ? [X1] :
          ~ ( ! [X2] :
                ( ! [X1] :
                    ( p11(X1)
                    | ~ r1(X2,X1) )
                | ~ r1(X1,X2) )
            | ! [X2] :
                ( ! [X1] :
                    ( p12(X1)
                    | ~ r1(X2,X1) )
                | ~ r1(X1,X2) )
            | ! [X2] :
                ( ! [X1] :
                    ( p13(X1)
                    | ~ r1(X2,X1) )
                | ~ r1(X1,X2) )
            | ! [X2] :
                ( ! [X1] :
                    ( p15(X1)
                    | ~ r1(X2,X1) )
                | ~ r1(X1,X2) )
            | ~ ! [X2] :
                  ( ~ ( ~ ! [X1] :
                            ( p12(X1)
                            | ~ r1(X2,X1) )
                      | ~ ! [X1] :
                            ( p14(X1)
                            | ~ r1(X2,X1) )
                      | ~ ! [X1] :
                            ( p12(X1)
                            | ~ r1(X2,X1) )
                      | ~ ! [X1] :
                            ( p16(X1)
                            | ~ r1(X2,X1) ) )
                  | ~ r1(X1,X2) ) ),
    inference(assume_negation,[status(cth)],[main]) ).

fof(c_0_2,negated_conjecture,
    ~ ~ ? [X1] :
          ~ ( ! [X2] :
                ( ! [X1] :
                    ( p11(X1)
                    | ~ r1(X2,X1) )
                | ~ r1(X1,X2) )
            | ! [X2] :
                ( ! [X1] :
                    ( p12(X1)
                    | ~ r1(X2,X1) )
                | ~ r1(X1,X2) )
            | ! [X2] :
                ( ! [X1] :
                    ( p13(X1)
                    | ~ r1(X2,X1) )
                | ~ r1(X1,X2) )
            | ! [X2] :
                ( ! [X1] :
                    ( p15(X1)
                    | ~ r1(X2,X1) )
                | ~ r1(X1,X2) )
            | ~ ! [X2] :
                  ( ~ ( ~ ! [X1] :
                            ( p12(X1)
                            | ~ r1(X2,X1) )
                      | ~ ! [X1] :
                            ( p14(X1)
                            | ~ r1(X2,X1) )
                      | ~ ! [X1] :
                            ( p12(X1)
                            | ~ r1(X2,X1) )
                      | ~ ! [X1] :
                            ( p16(X1)
                            | ~ r1(X2,X1) ) )
                  | ~ r1(X1,X2) ) ),
    inference(fof_simplification,[status(thm)],[c_0_1]) ).

fof(c_0_3,negated_conjecture,
    ! [X5,X6,X7,X8,X9] :
      ( ~ p11(esk9_0)
      & r1(esk8_0,esk9_0)
      & r1(esk1_0,esk8_0)
      & ~ p12(esk7_0)
      & r1(esk6_0,esk7_0)
      & r1(esk1_0,esk6_0)
      & ~ p13(esk5_0)
      & r1(esk4_0,esk5_0)
      & r1(esk1_0,esk4_0)
      & ~ p15(esk3_0)
      & r1(esk2_0,esk3_0)
      & r1(esk1_0,esk2_0)
      & ( ~ r1(esk1_0,X5)
        | p12(X9)
        | ~ r1(X5,X9) )
      & ( ~ r1(esk1_0,X5)
        | p14(X8)
        | ~ r1(X5,X8) )
      & ( ~ r1(esk1_0,X5)
        | p12(X7)
        | ~ r1(X5,X7) )
      & ( ~ r1(esk1_0,X5)
        | p16(X6)
        | ~ r1(X5,X6) ) ),
    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)],[c_0_2])])])])])]) ).

cnf(c_0_4,negated_conjecture,
    ( ~ r1(esk1_0,X1)
    | ~ r1(X1,X2)
    | p12(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_5,negated_conjecture,
    r1(esk1_0,esk6_0),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_6,negated_conjecture,
    ~ p12(esk7_0),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_7,negated_conjecture,
    ( ~ r1(esk6_0,X1)
    | p12(X1) ),
    inference(spm,[status(thm)],[c_0_4,c_0_5]) ).

cnf(c_0_8,negated_conjecture,
    r1(esk6_0,esk7_0),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : LCL682+1.001 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.42  % Computer : n008.cluster.edu
% 0.10/0.42  % Model    : x86_64 x86_64
% 0.10/0.42  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.42  % Memory   : 8046.5625MB
% 0.10/0.42  % OS       : Linux 6.8.0-71-generic
% 0.10/0.42  % CPULimit : 300
% 0.10/0.42  % WCLimit  : 300
% 0.10/0.42  % DateTime : Mon Sep 21 00:57:08 UTC 2026
% 0.10/0.43  % CPUTime  : 
% 0.10/0.43  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.47  Running first-order theorem proving
% 0.15/0.47  Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.15/0.48  % Version: 3.5.1
% 0.15/0.48  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.48  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.48  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.48  % Starting new_bool_3 with 300s (1) cores
% 0.15/0.48  % Starting new_bool_1 with 300s (1) cores
% 0.15/0.48  % Starting sh5l with 300s (1) cores
% 0.15/0.48  % sh5l with pid 3999331 completed with status 0
% 0.15/0.48  % Result found by sh5l
% 0.15/0.48  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.48  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.48  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.48  % Starting new_bool_3 with 300s (1) cores
% 0.15/0.48  % Starting new_bool_1 with 300s (1) cores
% 0.15/0.48  % Starting sh5l with 300s (1) cores
% 0.15/0.48  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.15/0.48  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.48  % Search class: FHUNF-FFSM00-SFFFFFNN
% 0.15/0.48  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.48  % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.48  % SubtermCWHack with pid 3999337 completed with status 0
% 0.15/0.48  % Result found by SubtermCWHack
% 0.15/0.48  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.15/0.48  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.48  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.48  % Starting new_bool_3 with 300s (1) cores
% 0.15/0.48  % Starting new_bool_1 with 300s (1) cores
% 0.15/0.48  % Starting sh5l with 300s (1) cores
% 0.15/0.48  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 0.15/0.48  % SinE strategy is gf500_gu_R04_F100_L20000
% 0.15/0.48  % Search class: FHUNF-FFSM00-SFFFFFNN
% 0.15/0.48  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.48  % Starting SubtermCWHack with 31s (1) cores
% 0.15/0.48  % Preprocessing time       : 0.001 s
% 0.15/0.48  
% 0.15/0.48  % Proof found!
% 0.15/0.48  % SZS status Theorem
% 0.15/0.48  % SZS output start CNFRefutation
% See solution above
% 0.15/0.48  % Parsed axioms                        : 3
% 0.15/0.48  % Removed by relevancy pruning/SinE    : 0
% 0.15/0.48  % Initial clauses                      : 18
% 0.15/0.48  % Removed in clause preprocessing      : 0
% 0.15/0.48  % Initial clauses in saturation        : 18
% 0.15/0.48  % Processed clauses                    : 26
% 0.15/0.48  % ...of these trivial                  : 0
% 0.15/0.48  % ...subsumed                          : 1
% 0.15/0.48  % ...remaining for further processing  : 25
% 0.15/0.48  % Other redundant clauses eliminated   : 0
% 0.15/0.48  % Clauses deleted for lack of memory   : 0
% 0.15/0.48  % Backward-subsumed                    : 0
% 0.15/0.48  % Backward-rewritten                   : 0
% 0.15/0.48  % Generated clauses                    : 13
% 0.15/0.48  % ...of the previous two non-redundant : 12
% 0.15/0.48  % ...aggressively subsumed             : 0
% 0.15/0.48  % Contextual simplify-reflections      : 0
% 0.15/0.48  % Paramodulations                      : 13
% 0.15/0.48  % Factorizations                       : 0
% 0.15/0.48  % NegExts                              : 0
% 0.15/0.48  % Equation resolutions                 : 0
% 0.15/0.48  % Disequality decompositions           : 0
% 0.15/0.48  % Total rewrite steps                  : 1
% 0.15/0.48  % ...of those cached                   : 0
% 0.15/0.48  % Propositional unsat checks           : 0
% 0.15/0.48  %    Propositional check models        : 0
% 0.15/0.48  %    Propositional check unsatisfiable : 0
% 0.15/0.48  %    Propositional clauses             : 0
% 0.15/0.48  %    Propositional clauses after purity: 0
% 0.15/0.48  %    Propositional unsat core size     : 0
% 0.15/0.48  %    Propositional preprocessing time  : 0.000
% 0.15/0.48  %    Propositional encoding time       : 0.000
% 0.15/0.48  %    Propositional solver time         : 0.000
% 0.15/0.48  %    Success case prop preproc time    : 0.000
% 0.15/0.48  %    Success case prop encoding time   : 0.000
% 0.15/0.48  %    Success case prop solver time     : 0.000
% 0.15/0.48  % Current number of processed clauses  : 25
% 0.15/0.48  %    Positive orientable unit clauses  : 9
% 0.15/0.48  %    Positive unorientable unit clauses: 0
% 0.15/0.48  %    Negative unit clauses             : 6
% 0.15/0.48  %    Non-unit-clauses                  : 10
% 0.15/0.48  % Current number of unprocessed clauses: 4
% 0.15/0.48  % ...number of literals in the above   : 10
% 0.15/0.48  % Current number of archived formulas  : 0
% 0.15/0.48  % Current number of archived clauses   : 0
% 0.15/0.48  % Clause-clause subsumption calls (NU) : 24
% 0.15/0.48  % Rec. Clause-clause subsumption calls : 24
% 0.15/0.48  % Non-unit clause-clause subsumptions  : 1
% 0.15/0.48  % Unit Clause-clause subsumption calls : 20
% 0.15/0.48  % Rewrite failures with RHS unbound    : 0
% 0.15/0.48  % BW rewrite match attempts            : 8
% 0.15/0.48  % BW rewrite match successes           : 0
% 0.15/0.48  % Condensation attempts                : 0
% 0.15/0.48  % Condensation successes               : 0
% 0.15/0.48  % Termbank termtop insertions          : 1107
% 0.15/0.48  % Search garbage collected termcells   : 224
% 0.15/0.48  
% 0.15/0.48  % -------------------------------------------------
% 0.15/0.48  % User time                : 0.003 s
% 0.15/0.48  % System time              : 0.002 s
% 0.15/0.49  % Total time               : 0.005 s
% 0.15/0.49  % Maximum resident set size: 3632 pages
% 0.15/0.49  
% 0.15/0.49  % -------------------------------------------------
% 0.15/0.49  % User time                : 0.004 s
% 0.15/0.49  % System time              : 0.005 s
% 0.15/0.49  % Total time               : 0.009 s
% 0.15/0.49  % Maximum resident set size: 4608 pages
% 0.15/0.49  % E exiting
%------------------------------------------------------------------------------