↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n004.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 02:42:34 PM UTC 2026

% Result   : Theorem 0.28s 0.46s
% Output   : CNFRefutation 0.28s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   15 (   9 unt;   0 def)
%            Number of atoms       :   83 (  33 equ)
%            Maximal formula atoms :   16 (   5 avg)
%            Number of connectives :  103 (  35   ~;  30   |;  23   &)
%                                         (   0 <=>;  15  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   21 (   7 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   7 con; 0-2 aty)
%            Number of variables   :   39 (   0 sgn  24   !;   9   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(co1,conjecture,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssList(X2)
         => ! [X3] :
              ( ssList(X3)
             => ! [X4] :
                  ( ! [X8] :
                      ( ssList(X8)
                     => ! [X9] :
                          ( ssList(X9)
                         => ! [X10] :
                              ( app(X8,X10) != X3
                              | app(app(X8,X9),X10) != X4
                              | ~ ssList(X10) ) ) )
                  | ? [X5] :
                      ( ? [X6] :
                          ( ? [X7] :
                              ( app(X5,X7) = X1
                              & app(app(X5,X6),X7) = X2
                              & ssList(X7) )
                          & ssList(X6) )
                      & ssList(X5) )
                  | X1 != X3
                  | X2 != X4
                  | ~ ssList(X4) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).

fof(c_0_1,negated_conjecture,
    ~ ! [X1] :
        ( ssList(X1)
       => ! [X2] :
            ( ssList(X2)
           => ! [X3] :
                ( ssList(X3)
               => ! [X4] :
                    ( ! [X8] :
                        ( ssList(X8)
                       => ! [X9] :
                            ( ssList(X9)
                           => ! [X10] :
                                ( app(X8,X10) != X3
                                | app(app(X8,X9),X10) != X4
                                | ~ ssList(X10) ) ) )
                    | ? [X5] :
                        ( ? [X6] :
                            ( ? [X7] :
                                ( app(X5,X7) = X1
                                & app(app(X5,X6),X7) = X2
                                & ssList(X7) )
                            & ssList(X6) )
                        & ssList(X5) )
                    | X1 != X3
                    | X2 != X4
                    | ~ ssList(X4) ) ) ) ),
    inference(assume_negation,[status(cth)],[co1]) ).

fof(c_0_2,negated_conjecture,
    ~ ! [X1] :
        ( ssList(X1)
       => ! [X2] :
            ( ssList(X2)
           => ! [X3] :
                ( ssList(X3)
               => ! [X4] :
                    ( ! [X8] :
                        ( ssList(X8)
                       => ! [X9] :
                            ( ssList(X9)
                           => ! [X10] :
                                ( app(X8,X10) != X3
                                | app(app(X8,X9),X10) != X4
                                | ~ ssList(X10) ) ) )
                    | ? [X5] :
                        ( ? [X6] :
                            ( ? [X7] :
                                ( app(X5,X7) = X1
                                & app(app(X5,X6),X7) = X2
                                & ssList(X7) )
                            & ssList(X6) )
                        & ssList(X5) )
                    | X1 != X3
                    | X2 != X4
                    | ~ ssList(X4) ) ) ) ),
    inference(fof_simplification,[status(thm)],[c_0_1]) ).

fof(c_0_3,negated_conjecture,
    ! [X15,X16,X17] :
      ( app(esk5_0,esk7_0) = esk3_0
      & app(app(esk5_0,esk6_0),esk7_0) = esk4_0
      & ssList(esk7_0)
      & ssList(esk6_0)
      & ssList(esk5_0)
      & ( app(X15,X17) != esk1_0
        | app(app(X15,X16),X17) != esk2_0
        | ~ ssList(X17)
        | ~ ssList(X16)
        | ~ ssList(X15) )
      & esk1_0 = esk3_0
      & esk2_0 = esk4_0
      & ssList(esk4_0)
      & ssList(esk3_0)
      & ssList(esk2_0)
      & ssList(esk1_0) ),
    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,
    ( app(X1,X3) != esk1_0
    | app(app(X1,X2),X3) != esk2_0
    | ~ ssList(X3)
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_5,negated_conjecture,
    esk2_0 = esk4_0,
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_6,negated_conjecture,
    app(esk5_0,esk7_0) = esk3_0,
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_7,negated_conjecture,
    esk1_0 = esk3_0,
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_8,negated_conjecture,
    ( ~ ssList(X1)
    | ~ ssList(X2)
    | ~ ssList(X3)
    | app(X1,X3) != esk1_0
    | app(app(X1,X2),X3) != esk4_0 ),
    inference(rw,[status(thm)],[c_0_4,c_0_5]) ).

cnf(c_0_9,negated_conjecture,
    app(app(esk5_0,esk6_0),esk7_0) = esk4_0,
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_10,negated_conjecture,
    app(esk5_0,esk7_0) = esk1_0,
    inference(rw,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_11,negated_conjecture,
    ssList(esk7_0),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_12,negated_conjecture,
    ssList(esk6_0),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_13,negated_conjecture,
    ssList(esk5_0),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_14,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_10]),c_0_11]),c_0_12]),c_0_13])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWC006+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.37  % Computer : n004.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 : Mon Sep 21 07:48:35 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.28/0.46  % Version: 3.5.1
% 0.28/0.46  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.28/0.46  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/0.46  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.28/0.46  % Starting new_bool_3 with 300s (1) cores
% 0.28/0.46  % Starting new_bool_1 with 300s (1) cores
% 0.28/0.46  % Starting sh5l with 300s (1) cores
% 0.28/0.46  % new_bool_3 with pid 2635337 completed with status 0
% 0.28/0.46  % Result found by new_bool_3
% 0.28/0.46  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.28/0.46  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/0.46  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.28/0.46  % Starting new_bool_3 with 300s (1) cores
% 0.28/0.46  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.28/0.46  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.28/0.46  % Search class: FGHSF-FFMM21-SFFFFFNN
% 0.28/0.46  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.28/0.46  % Starting SubtermCWHack with 28s (1) cores
% 0.28/0.46  % SubtermCWHack with pid 2635340 completed with status 0
% 0.28/0.46  % Result found by SubtermCWHack
% 0.28/0.46  % Preprocessing class: FSLSSMSSSSSNFFN.
% 0.28/0.46  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.28/0.46  % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.28/0.46  % Starting new_bool_3 with 300s (1) cores
% 0.28/0.46  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.28/0.46  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.28/0.46  % Search class: FGHSF-FFMM21-SFFFFFNN
% 0.28/0.46  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.28/0.46  % Starting SubtermCWHack with 28s (1) cores
% 0.28/0.46  % Preprocessing time       : 0.002 s
% 0.28/0.46  
% 0.28/0.46  % Proof found!
% 0.28/0.46  % SZS status Theorem
% 0.28/0.46  % SZS output start CNFRefutation
% See solution above
% 0.28/0.46  % Parsed axioms                        : 96
% 0.28/0.46  % Removed by relevancy pruning/SinE    : 79
% 0.28/0.46  % Initial clauses                      : 35
% 0.28/0.46  % Removed in clause preprocessing      : 0
% 0.28/0.46  % Initial clauses in saturation        : 35
% 0.28/0.46  % Processed clauses                    : 121
% 0.28/0.46  % ...of these trivial                  : 1
% 0.28/0.46  % ...subsumed                          : 37
% 0.28/0.46  % ...remaining for further processing  : 83
% 0.28/0.46  % Other redundant clauses eliminated   : 10
% 0.28/0.46  % Clauses deleted for lack of memory   : 0
% 0.28/0.46  % Backward-subsumed                    : 1
% 0.28/0.46  % Backward-rewritten                   : 2
% 0.28/0.46  % Generated clauses                    : 638
% 0.28/0.46  % ...of the previous two non-redundant : 525
% 0.28/0.46  % ...aggressively subsumed             : 0
% 0.28/0.46  % Contextual simplify-reflections      : 0
% 0.28/0.46  % Paramodulations                      : 625
% 0.28/0.46  % Factorizations                       : 0
% 0.28/0.46  % NegExts                              : 0
% 0.28/0.46  % Equation resolutions                 : 14
% 0.28/0.46  % Disequality decompositions           : 0
% 0.28/0.46  % Total rewrite steps                  : 674
% 0.28/0.46  % ...of those cached                   : 664
% 0.28/0.46  % Propositional unsat checks           : 0
% 0.28/0.46  %    Propositional check models        : 0
% 0.28/0.46  %    Propositional check unsatisfiable : 0
% 0.28/0.46  %    Propositional clauses             : 0
% 0.28/0.46  %    Propositional clauses after purity: 0
% 0.28/0.46  %    Propositional unsat core size     : 0
% 0.28/0.46  %    Propositional preprocessing time  : 0.000
% 0.28/0.46  %    Propositional encoding time       : 0.000
% 0.28/0.46  %    Propositional solver time         : 0.000
% 0.28/0.46  %    Success case prop preproc time    : 0.000
% 0.28/0.46  %    Success case prop encoding time   : 0.000
% 0.28/0.46  %    Success case prop solver time     : 0.000
% 0.28/0.46  % Current number of processed clauses  : 79
% 0.28/0.46  %    Positive orientable unit clauses  : 14
% 0.28/0.46  %    Positive unorientable unit clauses: 0
% 0.28/0.46  %    Negative unit clauses             : 1
% 0.28/0.46  %    Non-unit-clauses                  : 64
% 0.28/0.46  % Current number of unprocessed clauses: 398
% 0.28/0.46  % ...number of literals in the above   : 1501
% 0.28/0.46  % Current number of archived formulas  : 0
% 0.28/0.46  % Current number of archived clauses   : 3
% 0.28/0.46  % Clause-clause subsumption calls (NU) : 359
% 0.28/0.46  % Rec. Clause-clause subsumption calls : 325
% 0.28/0.46  % Non-unit clause-clause subsumptions  : 38
% 0.28/0.46  % Unit Clause-clause subsumption calls : 0
% 0.28/0.46  % Rewrite failures with RHS unbound    : 0
% 0.28/0.46  % BW rewrite match attempts            : 2
% 0.28/0.46  % BW rewrite match successes           : 2
% 0.28/0.46  % Condensation attempts                : 0
% 0.28/0.46  % Condensation successes               : 0
% 0.28/0.46  % Termbank termtop insertions          : 11476
% 0.28/0.46  % Search garbage collected termcells   : 1288
% 0.28/0.46  
% 0.28/0.46  % -------------------------------------------------
% 0.28/0.46  % User time                : 0.014 s
% 0.28/0.46  % System time              : 0.002 s
% 0.28/0.46  % Total time               : 0.016 s
% 0.28/0.46  % Maximum resident set size: 3760 pages
% 0.28/0.46  
% 0.28/0.46  % -------------------------------------------------
% 0.28/0.46  % User time                : 0.018 s
% 0.28/0.46  % System time              : 0.006 s
% 0.28/0.46  % Total time               : 0.025 s
% 0.28/0.46  % Maximum resident set size: 4608 pages
% 0.28/0.46  % E exiting
%------------------------------------------------------------------------------