↑ Up

E-SAT---3.5.1.THM-CRf.s

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

% Result   : Theorem 0.39s 0.57s
% Output   : CNFRefutation 0.39s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   21 (  11 unt;   0 def)
%            Number of atoms       :   39 (  23 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   33 (  15   ~;  13   |;   1   &)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   3 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   :   27 (   2 sgn  14   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
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(conj_1,hypothesis,
    ! [X333] :
      ( ! [X30] :
          ( hBOOL(hAPP(hAPP(c_Natural_Oevalc(v_c),v_Z),X30))
         => X333 = X30 )
     => X333 = v_s_H ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_1) ).

fof(conj_3,conjecture,
    hBOOL(hAPP(hAPP(c_Natural_Oevalc(v_c),v_Z),v_s_H)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_3) ).

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_4,plain,
    ! [X346,X347,X348,X349] :
      ( X346 = X347
      | ~ hBOOL(hAPP(hAPP(c_Natural_Oevalc(X349),X348),X346))
      | ~ hBOOL(hAPP(hAPP(c_Natural_Oevalc(X349),X348),X347)) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_com__det])])]) ).

fof(c_0_5,hypothesis,
    ! [X334] :
      ( ( X334 = v_s_H
        | X334 != esk1_1(X334) )
      & ( X334 = v_s_H
        | hBOOL(hAPP(hAPP(c_Natural_Oevalc(v_c),v_Z),esk1_1(X334))) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[conj_1])])])])]) ).

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,hypothesis,
    ( X1 = v_s_H
    | hBOOL(hAPP(hAPP(c_Natural_Oevalc(v_c),v_Z),esk1_1(X1))) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

fof(c_0_8,negated_conjecture,
    ~ hBOOL(hAPP(hAPP(c_Natural_Oevalc(v_c),v_Z),v_s_H)),
    inference(assume_negation,[status(cth)],[conj_3]) ).

cnf(c_0_9,hypothesis,
    ( ~ hBOOL(hAPP(hAPP(c_Natural_Oevalc(v_c),v_Z),X1))
    | X2 = v_s_H
    | X1 = esk1_1(X2) ),
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

fof(c_0_10,negated_conjecture,
    ~ hBOOL(hAPP(hAPP(c_Natural_Oevalc(v_c),v_Z),v_s_H)),
    inference(fof_simplification,[status(thm)],[c_0_8]) ).

fof(c_0_11,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_12,hypothesis,
    ( X1 != esk1_1(X1)
    | X1 = v_s_H ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_13,hypothesis,
    ( X2 = v_s_H
    | X1 = v_s_H
    | esk1_1(X1) = esk1_1(X2) ),
    inference(spm,[status(thm)],[c_0_9,c_0_7]) ).

fof(c_0_14,negated_conjecture,
    ~ hBOOL(hAPP(hAPP(c_Natural_Oevalc(v_c),v_Z),v_s_H)),
    inference(fof_nnf,[status(thm)],[c_0_10]) ).

fof(c_0_15,plain,
    ! [X468] : c_Com_Ocom_OSKIP != hAPP(c_Com_Ocom_OBODY,X468),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_11])]) ).

cnf(c_0_16,hypothesis,
    ( X1 = v_s_H
    | esk1_1(X1) = v_s_H ),
    inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13])]) ).

cnf(c_0_17,negated_conjecture,
    ~ hBOOL(hAPP(hAPP(c_Natural_Oevalc(v_c),v_Z),v_s_H)),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

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

cnf(c_0_19,hypothesis,
    X1 = v_s_H,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_16]),c_0_17]) ).

cnf(c_0_20,plain,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_18,c_0_19]),c_0_19]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.01  % Problem  : SWW350+1 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.02  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.04/0.31  % Computer : n012.cluster.edu
% 0.04/0.31  % Model    : x86_64 x86_64
% 0.04/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.04/0.31  % Memory   : 8046.5625MB
% 0.04/0.31  % OS       : Linux 6.8.0-71-generic
% 0.04/0.31  % CPULimit : 300
% 0.04/0.31  % WCLimit  : 300
% 0.04/0.31  % DateTime : Mon Sep 21 09:48:37 UTC 2026
% 0.04/0.31  % CPUTime  : 
% 0.04/0.32  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.34  Running first-order theorem proving
% 0.07/0.34  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.39/0.57  % Version: 3.5.1
% 0.39/0.57  % Preprocessing class: FMLMSLSMSSSNFFN.
% 0.39/0.57  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.39/0.57  % Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 0.39/0.57  % Starting new_bool_3 with 300s (1) cores
% 0.39/0.57  % Starting new_bool_1 with 300s (1) cores
% 0.39/0.57  % Starting sh5l with 300s (1) cores
% 0.39/0.57  % new_bool_3 with pid 2106966 completed with status 0
% 0.39/0.57  % Result found by new_bool_3
% 0.39/0.57  % Preprocessing class: FMLMSLSMSSSNFFN.
% 0.39/0.57  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.39/0.57  % Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 0.39/0.57  % Starting new_bool_3 with 300s (1) cores
% 0.39/0.57  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.39/0.57  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.39/0.57  % Search class: FGHSM-FSLM32-DFFFFFNN
% 0.39/0.57  % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.39/0.57  % Starting SubtermCWHack with 28s (1) cores
% 0.39/0.57  % SubtermCWHack with pid 2106969 completed with status 0
% 0.39/0.57  % Result found by SubtermCWHack
% 0.39/0.57  % Preprocessing class: FMLMSLSMSSSNFFN.
% 0.39/0.57  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.39/0.57  % Starting SAT001_MinMin_p005000_rr_RG with 1500s (5) cores
% 0.39/0.57  % Starting new_bool_3 with 300s (1) cores
% 0.39/0.57  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.39/0.57  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.39/0.57  % Search class: FGHSM-FSLM32-DFFFFFNN
% 0.39/0.57  % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 0.39/0.57  % Starting SubtermCWHack with 28s (1) cores
% 0.39/0.57  % Preprocessing time       : 0.010 s
% 0.39/0.57  
% 0.39/0.57  % Proof found!
% 0.39/0.57  % SZS status Theorem
% 0.39/0.57  % SZS output start CNFRefutation
% See solution above
% 0.39/0.57  % Parsed axioms                        : 5229
% 0.39/0.57  % Removed by relevancy pruning/SinE    : 4785
% 0.39/0.57  % Initial clauses                      : 678
% 0.39/0.57  % Removed in clause preprocessing      : 29
% 0.39/0.57  % Initial clauses in saturation        : 649
% 0.39/0.57  % Processed clauses                    : 859
% 0.39/0.57  % ...of these trivial                  : 47
% 0.39/0.57  % ...subsumed                          : 439
% 0.39/0.57  % ...remaining for further processing  : 373
% 0.39/0.57  % Other redundant clauses eliminated   : 126
% 0.39/0.57  % Clauses deleted for lack of memory   : 0
% 0.39/0.57  % Backward-subsumed                    : 11
% 0.39/0.57  % Backward-rewritten                   : 313
% 0.39/0.57  % Generated clauses                    : 2161
% 0.39/0.57  % ...of the previous two non-redundant : 1669
% 0.39/0.57  % ...aggressively subsumed             : 0
% 0.39/0.57  % Contextual simplify-reflections      : 1
% 0.39/0.57  % Paramodulations                      : 2015
% 0.39/0.57  % Factorizations                       : 4
% 0.39/0.57  % NegExts                              : 0
% 0.39/0.57  % Equation resolutions                 : 148
% 0.39/0.57  % Disequality decompositions           : 0
% 0.39/0.57  % Total rewrite steps                  : 921
% 0.39/0.57  % ...of those cached                   : 346
% 0.39/0.57  % Propositional unsat checks           : 0
% 0.39/0.57  %    Propositional check models        : 0
% 0.39/0.57  %    Propositional check unsatisfiable : 0
% 0.39/0.57  %    Propositional clauses             : 0
% 0.39/0.57  %    Propositional clauses after purity: 0
% 0.39/0.57  %    Propositional unsat core size     : 0
% 0.39/0.57  %    Propositional preprocessing time  : 0.000
% 0.39/0.57  %    Propositional encoding time       : 0.000
% 0.39/0.57  %    Propositional solver time         : 0.000
% 0.39/0.57  %    Success case prop preproc time    : 0.000
% 0.39/0.57  %    Success case prop encoding time   : 0.000
% 0.39/0.57  %    Success case prop solver time     : 0.000
% 0.39/0.57  % Current number of processed clauses  : 5
% 0.39/0.57  %    Positive orientable unit clauses  : 3
% 0.39/0.57  %    Positive unorientable unit clauses: 1
% 0.39/0.57  %    Negative unit clauses             : 0
% 0.39/0.57  %    Non-unit-clauses                  : 1
% 0.39/0.57  % Current number of unprocessed clauses: 1357
% 0.39/0.57  % ...number of literals in the above   : 2850
% 0.39/0.57  % Current number of archived formulas  : 0
% 0.39/0.57  % Current number of archived clauses   : 324
% 0.39/0.57  % Clause-clause subsumption calls (NU) : 5699
% 0.39/0.57  % Rec. Clause-clause subsumption calls : 5614
% 0.39/0.57  % Non-unit clause-clause subsumptions  : 123
% 0.39/0.57  % Unit Clause-clause subsumption calls : 592
% 0.39/0.57  % Rewrite failures with RHS unbound    : 111
% 0.39/0.57  % BW rewrite match attempts            : 1397
% 0.39/0.57  % BW rewrite match successes           : 429
% 0.39/0.57  % Condensation attempts                : 0
% 0.39/0.57  % Condensation successes               : 0
% 0.39/0.57  % Termbank termtop insertions          : 221494
% 0.39/0.57  % Search garbage collected termcells   : 55314
% 0.39/0.57  
% 0.39/0.57  % -------------------------------------------------
% 0.39/0.57  % User time                : 0.073 s
% 0.39/0.57  % System time              : 0.016 s
% 0.39/0.57  % Total time               : 0.088 s
% 0.39/0.57  % Maximum resident set size: 13024 pages
% 0.39/0.57  
% 0.39/0.57  % -------------------------------------------------
% 0.39/0.57  % User time                : 0.190 s
% 0.39/0.57  % System time              : 0.022 s
% 0.39/0.57  % Total time               : 0.211 s
% 0.39/0.57  % Maximum resident set size: 12544 pages
% 0.39/0.57  % E exiting
%------------------------------------------------------------------------------