↑ 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  : SWW337+1 : TPTP v9.3.1. Released v5.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n006.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:11:59 PM UTC 2026

% Result   : Theorem 4.58s 2.06s
% Output   : CNFRefutation 4.58s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   20 (   7 unt;   0 def)
%            Number of atoms       :   44 (   0 equ)
%            Maximal formula atoms :    4 (   2 avg)
%            Number of connectives :   40 (  16   ~;  12   |;   3   &)
%                                         (   1 <=>;   8  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    8 (   4 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :   11 (  11 usr;   6 con; 0-2 aty)
%            Number of variables   :   34 (   3 sgn  21   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(conj_1,conjecture,
    ! [X11] :
      ( ! [X3] :
          ( hBOOL(hAPP(hAPP(c_member(tc_Hoare__Mirabelle_Otriple(t_a)),X3),v_G))
         => c_Hoare__Mirabelle_Otriple__valid(t_a,X11,X3) )
     => ! [X3] :
          ( hBOOL(hAPP(hAPP(c_member(tc_Hoare__Mirabelle_Otriple(t_a)),X3),v_ts))
         => c_Hoare__Mirabelle_Otriple__valid(t_a,X11,X3) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_1) ).

fof(fact_mem__def,axiom,
    ! [X5,X13,X6] :
      ( hBOOL(hAPP(hAPP(c_member(X6),X13),X5))
    <=> hBOOL(hAPP(X5,X13)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_mem__def) ).

fof(fact_rev__predicate1D,axiom,
    ! [X14,X6,X13,X15] :
      ( hBOOL(hAPP(X15,X13))
     => ( hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X6,tc_HOL_Obool)),X15),X14))
       => hBOOL(hAPP(X14,X13)) ) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',fact_rev__predicate1D) ).

fof(conj_0,hypothesis,
    hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(tc_Hoare__Mirabelle_Otriple(t_a),tc_HOL_Obool)),v_ts),v_G)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',conj_0) ).

fof(c_0_4,negated_conjecture,
    ~ ! [X11] :
        ( ! [X3] :
            ( hBOOL(hAPP(hAPP(c_member(tc_Hoare__Mirabelle_Otriple(t_a)),X3),v_G))
           => c_Hoare__Mirabelle_Otriple__valid(t_a,X11,X3) )
       => ! [X3] :
            ( hBOOL(hAPP(hAPP(c_member(tc_Hoare__Mirabelle_Otriple(t_a)),X3),v_ts))
           => c_Hoare__Mirabelle_Otriple__valid(t_a,X11,X3) ) ),
    inference(assume_negation,[status(cth)],[conj_1]) ).

fof(c_0_5,negated_conjecture,
    ! [X285] :
      ( ~ c_Hoare__Mirabelle_Otriple__valid(t_a,esk1_0,esk2_0)
      & hBOOL(hAPP(hAPP(c_member(tc_Hoare__Mirabelle_Otriple(t_a)),esk2_0),v_ts))
      & ( c_Hoare__Mirabelle_Otriple__valid(t_a,esk1_0,X285)
        | ~ hBOOL(hAPP(hAPP(c_member(tc_Hoare__Mirabelle_Otriple(t_a)),X285),v_G)) ) ),
    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_4])])])])]) ).

fof(c_0_6,plain,
    ! [X439,X440,X441] :
      ( ( hBOOL(hAPP(hAPP(c_member(X441),X440),X439))
        | ~ hBOOL(hAPP(X439,X440)) )
      & ( hBOOL(hAPP(X439,X440))
        | ~ hBOOL(hAPP(hAPP(c_member(X441),X440),X439)) ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_mem__def])])]) ).

cnf(c_0_7,negated_conjecture,
    ( ~ hBOOL(hAPP(hAPP(c_member(tc_Hoare__Mirabelle_Otriple(t_a)),X1),v_G))
    | c_Hoare__Mirabelle_Otriple__valid(t_a,esk1_0,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_8,plain,
    ( ~ hBOOL(hAPP(X1,X2))
    | hBOOL(hAPP(hAPP(c_member(X3),X2),X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

fof(c_0_9,plain,
    ! [X298,X299,X300,X301] :
      ( hBOOL(hAPP(X298,X300))
      | ~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X299,tc_HOL_Obool)),X301),X298))
      | ~ hBOOL(hAPP(X301,X300)) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_rev__predicate1D])])]) ).

cnf(c_0_10,negated_conjecture,
    ~ c_Hoare__Mirabelle_Otriple__valid(t_a,esk1_0,esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_11,negated_conjecture,
    ( ~ hBOOL(hAPP(v_G,X1))
    | c_Hoare__Mirabelle_Otriple__valid(t_a,esk1_0,X1) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_12,plain,
    ( ~ hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(X3,tc_HOL_Obool)),X1),X4))
    | ~ hBOOL(hAPP(X1,X2))
    | hBOOL(hAPP(X4,X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_13,hypothesis,
    hBOOL(hAPP(hAPP(c_Orderings_Oord__class_Oless__eq(tc_fun(tc_Hoare__Mirabelle_Otriple(t_a),tc_HOL_Obool)),v_ts),v_G)),
    inference(split_conjunct,[status(thm)],[conj_0]) ).

cnf(c_0_14,plain,
    ( ~ hBOOL(hAPP(hAPP(c_member(X1),X2),X3))
    | hBOOL(hAPP(X3,X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_15,negated_conjecture,
    hBOOL(hAPP(hAPP(c_member(tc_Hoare__Mirabelle_Otriple(t_a)),esk2_0),v_ts)),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_16,negated_conjecture,
    ~ hBOOL(hAPP(v_G,esk2_0)),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_17,hypothesis,
    ( ~ hBOOL(hAPP(v_ts,X1))
    | hBOOL(hAPP(v_G,X1)) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_18,negated_conjecture,
    hBOOL(hAPP(v_ts,esk2_0)),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_19,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05  % Problem  : SWW337+1 : TPTP v9.3.1. Released v5.2.0.
% 0.00/0.08  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.20/0.48  % Computer : n006.cluster.edu
% 0.20/0.48  % Model    : x86_64 x86_64
% 0.20/0.48  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.20/0.48  % Memory   : 8046.5625MB
% 0.20/0.48  % OS       : Linux 6.8.0-71-generic
% 0.20/0.48  % CPULimit : 300
% 0.20/0.48  % WCLimit  : 300
% 0.20/0.48  % DateTime : Mon Sep 21 09:47:58 UTC 2026
% 0.20/0.49  % CPUTime  : 
% 0.20/0.49  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.24/0.58  Running first-order theorem proving
% 0.24/0.58  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
% 4.58/2.06  % Version: 3.5.1
% 4.58/2.06  % Preprocessing class: FMLMSMSMSSSNFFN.
% 4.58/2.06  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.58/2.06  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.58/2.06  % Starting new_bool_3 with 300s (1) cores
% 4.58/2.06  % Starting new_bool_1 with 300s (1) cores
% 4.58/2.06  % Starting sh5l with 300s (1) cores
% 4.58/2.06  % new_bool_3 with pid 2552056 completed with status 0
% 4.58/2.06  % Result found by new_bool_3
% 4.58/2.06  % Preprocessing class: FMLMSMSMSSSNFFN.
% 4.58/2.06  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.58/2.06  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.58/2.06  % Starting new_bool_3 with 300s (1) cores
% 4.58/2.06  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 4.58/2.06  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 4.58/2.06  % Search class: FGHSM-FSLM32-DFFFFFNN
% 4.58/2.06  % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 4.58/2.06  % Starting SubtermCWHack with 28s (1) cores
% 4.58/2.06  % SubtermCWHack with pid 2552059 completed with status 0
% 4.58/2.06  % Result found by SubtermCWHack
% 4.58/2.06  % Preprocessing class: FMLMSMSMSSSNFFN.
% 4.58/2.06  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 4.58/2.06  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 4.58/2.06  % Starting new_bool_3 with 300s (1) cores
% 4.58/2.06  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 4.58/2.06  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 4.58/2.06  % Search class: FGHSM-FSLM32-DFFFFFNN
% 4.58/2.06  % Scheduled 13 strats onto 1 cores with 300 seconds (300 total)
% 4.58/2.06  % Starting SubtermCWHack with 28s (1) cores
% 4.58/2.06  % Preprocessing time       : 0.030 s
% 4.58/2.06  
% 4.58/2.06  % Proof found!
% 4.58/2.06  % SZS status Theorem
% 4.58/2.06  % SZS output start CNFRefutation
% See solution above
% 4.58/2.06  % Parsed axioms                        : 5226
% 4.58/2.06  % Removed by relevancy pruning/SinE    : 4661
% 4.58/2.06  % Initial clauses                      : 838
% 4.58/2.06  % Removed in clause preprocessing      : 34
% 4.58/2.06  % Initial clauses in saturation        : 804
% 4.58/2.06  % Processed clauses                    : 2465
% 4.58/2.06  % ...of these trivial                  : 66
% 4.58/2.06  % ...subsumed                          : 1492
% 4.58/2.06  % ...remaining for further processing  : 907
% 4.58/2.06  % Other redundant clauses eliminated   : 1562
% 4.58/2.06  % Clauses deleted for lack of memory   : 0
% 4.58/2.06  % Backward-subsumed                    : 17
% 4.58/2.06  % Backward-rewritten                   : 41
% 4.58/2.06  % Generated clauses                    : 29594
% 4.58/2.06  % ...of the previous two non-redundant : 23898
% 4.58/2.06  % ...aggressively subsumed             : 0
% 4.58/2.06  % Contextual simplify-reflections      : 0
% 4.58/2.06  % Paramodulations                      : 28010
% 4.58/2.06  % Factorizations                       : 19
% 4.58/2.06  % NegExts                              : 0
% 4.58/2.06  % Equation resolutions                 : 1577
% 4.58/2.06  % Disequality decompositions           : 0
% 4.58/2.06  % Total rewrite steps                  : 8626
% 4.58/2.06  % ...of those cached                   : 7720
% 4.58/2.06  % Propositional unsat checks           : 0
% 4.58/2.06  %    Propositional check models        : 0
% 4.58/2.06  %    Propositional check unsatisfiable : 0
% 4.58/2.06  %    Propositional clauses             : 0
% 4.58/2.06  %    Propositional clauses after purity: 0
% 4.58/2.06  %    Propositional unsat core size     : 0
% 4.58/2.06  %    Propositional preprocessing time  : 0.000
% 4.58/2.06  %    Propositional encoding time       : 0.000
% 4.58/2.06  %    Propositional solver time         : 0.000
% 4.58/2.06  %    Success case prop preproc time    : 0.000
% 4.58/2.06  %    Success case prop encoding time   : 0.000
% 4.58/2.06  %    Success case prop solver time     : 0.000
% 4.58/2.06  % Current number of processed clauses  : 783
% 4.58/2.06  %    Positive orientable unit clauses  : 160
% 4.58/2.06  %    Positive unorientable unit clauses: 12
% 4.58/2.06  %    Negative unit clauses             : 65
% 4.58/2.06  %    Non-unit-clauses                  : 546
% 4.58/2.06  % Current number of unprocessed clauses: 22151
% 4.58/2.06  % ...number of literals in the above   : 76608
% 4.58/2.06  % Current number of archived formulas  : 0
% 4.58/2.06  % Current number of archived clauses   : 58
% 4.58/2.06  % Clause-clause subsumption calls (NU) : 57959
% 4.58/2.06  % Rec. Clause-clause subsumption calls : 30917
% 4.58/2.06  % Non-unit clause-clause subsumptions  : 986
% 4.58/2.06  % Unit Clause-clause subsumption calls : 886
% 4.58/2.06  % Rewrite failures with RHS unbound    : 132
% 4.58/2.06  % BW rewrite match attempts            : 2492
% 4.58/2.06  % BW rewrite match successes           : 97
% 4.58/2.06  % Condensation attempts                : 0
% 4.58/2.06  % Condensation successes               : 0
% 4.58/2.06  % Termbank termtop insertions          : 684034
% 4.58/2.06  % Search garbage collected termcells   : 55016
% 4.58/2.06  
% 4.58/2.06  % -------------------------------------------------
% 4.58/2.06  % User time                : 0.854 s
% 4.58/2.06  % System time              : 0.058 s
% 4.58/2.06  % Total time               : 0.912 s
% 4.58/2.06  % Maximum resident set size: 12664 pages
% 4.58/2.06  
% 4.58/2.06  % -------------------------------------------------
% 4.58/2.06  % User time                : 1.326 s
% 4.58/2.06  % System time              : 0.075 s
% 4.58/2.06  % Total time               : 1.401 s
% 4.58/2.06  % Maximum resident set size: 12288 pages
% 4.58/2.06  % E exiting
%------------------------------------------------------------------------------