↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n014.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 03:10:21 PM UTC 2026

% Result   : Theorem 1.29s 1.10s
% Output   : CNFRefutation 1.29s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   18 (   7 unt;   0 def)
%            Number of atoms       :   41 (  25 equ)
%            Maximal formula atoms :    5 (   2 avg)
%            Number of connectives :   37 (  14   ~;  13   |;   2   &)
%                                         (   0 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   4 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   5 con; 0-2 aty)
%            Number of variables   :   33 (   2 sgn  20   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(conj_1,conjecture,
    ! [X106,X107] :
      ( ! [X333] :
          ( ! [X30] :
              ( hBOOL(hAPP(hAPP(c_Natural_Oevalc(v_c),X106),X30))
             => X333 = X30 )
         => X333 = X107 )
     => hBOOL(hAPP(hAPP(c_Natural_Oevalc(v_c),X106),X107)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_1) ).

fof(fact_com__det,axiom,
    ! [X4,X5,X6,X7] :
      ( hBOOL(hAPP(hAPP(c_Natural_Oevalc(X7),X6),X5))
     => ( hBOOL(hAPP(hAPP(c_Natural_Oevalc(X7),X6),X4))
       => X4 = X5 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_com__det) ).

fof(fact_com_Osimps_I18_J,axiom,
    ! [X69] : c_Com_Ocom_OSKIP != hAPP(c_Com_Ocom_OBODY,X69),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_com_Osimps_I18_J) ).

fof(c_0_3,negated_conjecture,
    ~ ! [X106,X107] :
        ( ! [X333] :
            ( ! [X30] :
                ( hBOOL(hAPP(hAPP(c_Natural_Oevalc(v_c),X106),X30))
               => X333 = X30 )
           => X333 = X107 )
       => hBOOL(hAPP(hAPP(c_Natural_Oevalc(v_c),X106),X107)) ),
    inference(assume_negation,[status(cth)],[conj_1]) ).

fof(c_0_4,plain,
    ! [X347,X348,X349,X350] :
      ( X347 = X348
      | ~ hBOOL(hAPP(hAPP(c_Natural_Oevalc(X350),X349),X347))
      | ~ hBOOL(hAPP(hAPP(c_Natural_Oevalc(X350),X349),X348)) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_com__det])])]) ).

fof(c_0_5,negated_conjecture,
    ! [X336] :
      ( ~ hBOOL(hAPP(hAPP(c_Natural_Oevalc(v_c),esk1_0),esk2_0))
      & ( X336 = esk2_0
        | X336 != esk3_1(X336) )
      & ( X336 = esk2_0
        | hBOOL(hAPP(hAPP(c_Natural_Oevalc(v_c),esk1_0),esk3_1(X336))) ) ),
    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_3])])])])])]) ).

cnf(c_0_6,plain,
    ( ~ hBOOL(hAPP(hAPP(c_Natural_Oevalc(X1),X2),X4))
    | ~ hBOOL(hAPP(hAPP(c_Natural_Oevalc(X1),X2),X3))
    | X4 = X3 ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_7,negated_conjecture,
    ( X1 = esk2_0
    | hBOOL(hAPP(hAPP(c_Natural_Oevalc(v_c),esk1_0),esk3_1(X1))) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_8,negated_conjecture,
    ( ~ hBOOL(hAPP(hAPP(c_Natural_Oevalc(v_c),esk1_0),X1))
    | X2 = esk2_0
    | X1 = esk3_1(X2) ),
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

fof(c_0_9,plain,
    ! [X69] : c_Com_Ocom_OSKIP != hAPP(c_Com_Ocom_OBODY,X69),
    inference(fof_simplification,[status(thm)],[fact_com_Osimps_I18_J]) ).

cnf(c_0_10,negated_conjecture,
    ( X1 != esk3_1(X1)
    | X1 = esk2_0 ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_11,negated_conjecture,
    ( X2 = esk2_0
    | X1 = esk2_0
    | esk3_1(X1) = esk3_1(X2) ),
    inference(spm,[status(thm)],[c_0_8,c_0_7]) ).

fof(c_0_12,plain,
    ! [X469] : c_Com_Ocom_OSKIP != hAPP(c_Com_Ocom_OBODY,X469),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_9])]) ).

cnf(c_0_13,negated_conjecture,
    ( X1 = esk2_0
    | esk3_1(X1) = esk2_0 ),
    inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11])]) ).

cnf(c_0_14,negated_conjecture,
    ~ hBOOL(hAPP(hAPP(c_Natural_Oevalc(v_c),esk1_0),esk2_0)),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_15,plain,
    c_Com_Ocom_OSKIP != hAPP(c_Com_Ocom_OBODY,X1),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_16,negated_conjecture,
    X1 = esk2_0,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_13]),c_0_14]) ).

cnf(c_0_17,plain,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16]),c_0_16]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWW348+1 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.38  % Computer : n014.cluster.edu
% 0.12/0.38  % Model    : x86_64 x86_64
% 0.12/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38  % Memory   : 8046.5625MB
% 0.12/0.38  % OS       : Linux 6.8.0-71-generic
% 0.12/0.38  % CPULimit : 300
% 0.12/0.38  % WCLimit  : 300
% 0.12/0.38  % DateTime : Mon Sep 21 09: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.43  Running first-order theorem proving
% 0.12/0.43  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
% 1.29/1.10  % Version: 3.5.1
% 1.29/1.10  % Preprocessing class: FMLMSLSMSSSNFFN.
% 1.29/1.10  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.29/1.10  % Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 1.29/1.10  % Starting new_bool_3 with 300s (1) cores
% 1.29/1.10  % Starting new_bool_1 with 300s (1) cores
% 1.29/1.10  % Starting sh5l with 300s (1) cores
% 1.29/1.10  % new_bool_3 with pid 3771854 completed with status 0
% 1.29/1.10  % Result found by new_bool_3
% 1.29/1.10  % Preprocessing class: FMLMSLSMSSSNFFN.
% 1.29/1.10  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.29/1.10  % Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 1.29/1.10  % Starting new_bool_3 with 300s (1) cores
% 1.29/1.10  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 1.29/1.10  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.29/1.10  % Search class: FGHSM-FSLM32-DFFFFFNN
% 1.29/1.10  % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 1.29/1.10  % Starting SubtermCWHack with 28s (1) cores
% 1.29/1.10  % SubtermCWHack with pid 3771857 completed with status 0
% 1.29/1.10  % Result found by SubtermCWHack
% 1.29/1.10  % Preprocessing class: FMLMSLSMSSSNFFN.
% 1.29/1.10  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.29/1.10  % Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 1.29/1.10  % Starting new_bool_3 with 300s (1) cores
% 1.29/1.10  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 1.29/1.10  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 1.29/1.10  % Search class: FGHSM-FSLM32-DFFFFFNN
% 1.29/1.10  % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 1.29/1.10  % Starting SubtermCWHack with 28s (1) cores
% 1.29/1.10  % Preprocessing time       : 0.025 s
% 1.29/1.10  
% 1.29/1.10  % Proof found!
% 1.29/1.10  % SZS status Theorem
% 1.29/1.10  % SZS output start CNFRefutation
% See solution above
% 1.29/1.10  % Parsed axioms                        : 5227
% 1.29/1.10  % Removed by relevancy pruning/SinE    : 4785
% 1.29/1.10  % Initial clauses                      : 677
% 1.29/1.10  % Removed in clause preprocessing      : 29
% 1.29/1.10  % Initial clauses in saturation        : 648
% 1.29/1.10  % Processed clauses                    : 859
% 1.29/1.10  % ...of these trivial                  : 47
% 1.29/1.10  % ...subsumed                          : 440
% 1.29/1.10  % ...remaining for further processing  : 372
% 1.29/1.10  % Other redundant clauses eliminated   : 126
% 1.29/1.10  % Clauses deleted for lack of memory   : 0
% 1.29/1.10  % Backward-subsumed                    : 11
% 1.29/1.10  % Backward-rewritten                   : 312
% 1.29/1.10  % Generated clauses                    : 2163
% 1.29/1.10  % ...of the previous two non-redundant : 1671
% 1.29/1.10  % ...aggressively subsumed             : 0
% 1.29/1.10  % Contextual simplify-reflections      : 1
% 1.29/1.10  % Paramodulations                      : 2017
% 1.29/1.10  % Factorizations                       : 4
% 1.29/1.10  % NegExts                              : 0
% 1.29/1.10  % Equation resolutions                 : 148
% 1.29/1.10  % Disequality decompositions           : 0
% 1.29/1.10  % Total rewrite steps                  : 926
% 1.29/1.10  % ...of those cached                   : 355
% 1.29/1.10  % Propositional unsat checks           : 0
% 1.29/1.10  %    Propositional check models        : 0
% 1.29/1.10  %    Propositional check unsatisfiable : 0
% 1.29/1.10  %    Propositional clauses             : 0
% 1.29/1.10  %    Propositional clauses after purity: 0
% 1.29/1.10  %    Propositional unsat core size     : 0
% 1.29/1.10  %    Propositional preprocessing time  : 0.000
% 1.29/1.10  %    Propositional encoding time       : 0.000
% 1.29/1.10  %    Propositional solver time         : 0.000
% 1.29/1.10  %    Success case prop preproc time    : 0.000
% 1.29/1.10  %    Success case prop encoding time   : 0.000
% 1.29/1.10  %    Success case prop solver time     : 0.000
% 1.29/1.10  % Current number of processed clauses  : 5
% 1.29/1.10  %    Positive orientable unit clauses  : 3
% 1.29/1.10  %    Positive unorientable unit clauses: 1
% 1.29/1.10  %    Negative unit clauses             : 0
% 1.29/1.10  %    Non-unit-clauses                  : 1
% 1.29/1.10  % Current number of unprocessed clauses: 1357
% 1.29/1.10  % ...number of literals in the above   : 2849
% 1.29/1.10  % Current number of archived formulas  : 0
% 1.29/1.10  % Current number of archived clauses   : 323
% 1.29/1.10  % Clause-clause subsumption calls (NU) : 5219
% 1.29/1.10  % Rec. Clause-clause subsumption calls : 5138
% 1.29/1.10  % Non-unit clause-clause subsumptions  : 123
% 1.29/1.10  % Unit Clause-clause subsumption calls : 613
% 1.29/1.10  % Rewrite failures with RHS unbound    : 111
% 1.29/1.10  % BW rewrite match attempts            : 1382
% 1.29/1.10  % BW rewrite match successes           : 426
% 1.29/1.10  % Condensation attempts                : 0
% 1.29/1.10  % Condensation successes               : 0
% 1.29/1.10  % Termbank termtop insertions          : 221522
% 1.29/1.10  % Search garbage collected termcells   : 55359
% 1.29/1.10  
% 1.29/1.10  % -------------------------------------------------
% 1.29/1.10  % User time                : 0.192 s
% 1.29/1.10  % System time              : 0.042 s
% 1.29/1.10  % Total time               : 0.234 s
% 1.29/1.10  % Maximum resident set size: 12964 pages
% 1.29/1.10  
% 1.29/1.10  % -------------------------------------------------
% 1.29/1.10  % User time                : 0.563 s
% 1.29/1.10  % System time              : 0.061 s
% 1.29/1.10  % Total time               : 0.624 s
% 1.29/1.10  % Maximum resident set size: 12800 pages
% 1.29/1.10  % E exiting
%------------------------------------------------------------------------------