↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : CSR079+1 : TPTP v9.3.1. Bugfixed v7.3.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 12:16:36 PM UTC 2026

% Result   : Theorem 18.70s 4.32s
% Output   : CNFRefutation 18.70s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   16
% Syntax   : Number of formulae    :   52 (  41 unt;   0 def)
%            Number of atoms       :   76 (  26 equ)
%            Maximal formula atoms :    5 (   1 avg)
%            Number of connectives :   45 (  21   ~;  17   |;   4   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    9 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :   15 (  15 usr;  15 con; 0-0 aty)
%            Number of variables   :   23 (   2 sgn  10   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(local_24,axiom,
    s__Class5_2 = s__Class5_3,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',local_24) ).

fof(local_23,axiom,
    s__Class5_1 = s__Class5_2,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',local_23) ).

fof(local_25,axiom,
    s__Class5_3 = s__Class5_4,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',local_25) ).

fof(local_26,axiom,
    s__Class5_4 = s__Class5_5,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',local_26) ).

fof(local_27,axiom,
    s__Class5_5 = s__Class5_6,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',local_27) ).

fof(local_28,axiom,
    s__Class5_6 = s__Class5_7,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',local_28) ).

fof(local_29,axiom,
    s__Class5_7 = s__Class5_8,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',local_29) ).

fof(local_30,axiom,
    s__Class5_8 = s__Class5_9,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',local_30) ).

fof(kb_SUMO_27,axiom,
    ! [X6,X7,X8] :
      ( ( s__instance(X6,s__SetOrClass)
        & s__instance(X7,s__SetOrClass) )
     => ( ( s__instance(X8,X6)
          & s__subclass(X6,X7) )
       => s__instance(X8,X7) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+0.ax',kb_SUMO_27) ).

fof(kb_SUMO_26,axiom,
    ! [X6,X7] :
      ( s__subclass(X6,X7)
     => ( s__instance(X7,s__SetOrClass)
        & s__instance(X6,s__SetOrClass) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+0.ax',kb_SUMO_26) ).

fof(local_31,axiom,
    s__Class5_9 = s__Class5_10,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',local_31) ).

fof(prove_from_SUMO,conjecture,
    s__instance(s__Organism5_1,s__Animal),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_from_SUMO) ).

fof(local_33,axiom,
    s__subclass(s__Class5_10,s__Reptile),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',local_33) ).

fof(kb_SUMOcache_7275,axiom,
    s__subclass(s__Reptile,s__Animal),
    file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+3.ax',kb_SUMOcache_7275) ).

fof(local_32,axiom,
    s__subclass(s__Lizard5_1,s__Class5_1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',local_32) ).

fof(local_2,axiom,
    s__instance(s__Organism5_1,s__Lizard5_1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',local_2) ).

cnf(c_0_16,plain,
    s__Class5_2 = s__Class5_3,
    inference(split_conjunct,[status(thm)],[local_24]) ).

cnf(c_0_17,plain,
    s__Class5_1 = s__Class5_2,
    inference(split_conjunct,[status(thm)],[local_23]) ).

cnf(c_0_18,plain,
    s__Class5_3 = s__Class5_4,
    inference(split_conjunct,[status(thm)],[local_25]) ).

cnf(c_0_19,plain,
    s__Class5_3 = s__Class5_1,
    inference(rw,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_20,plain,
    s__Class5_4 = s__Class5_5,
    inference(split_conjunct,[status(thm)],[local_26]) ).

cnf(c_0_21,plain,
    s__Class5_4 = s__Class5_1,
    inference(rw,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_22,plain,
    s__Class5_5 = s__Class5_6,
    inference(split_conjunct,[status(thm)],[local_27]) ).

cnf(c_0_23,plain,
    s__Class5_5 = s__Class5_1,
    inference(rw,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_24,plain,
    s__Class5_6 = s__Class5_7,
    inference(split_conjunct,[status(thm)],[local_28]) ).

cnf(c_0_25,plain,
    s__Class5_6 = s__Class5_1,
    inference(rw,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_26,plain,
    s__Class5_7 = s__Class5_8,
    inference(split_conjunct,[status(thm)],[local_29]) ).

cnf(c_0_27,plain,
    s__Class5_7 = s__Class5_1,
    inference(rw,[status(thm)],[c_0_24,c_0_25]) ).

cnf(c_0_28,plain,
    s__Class5_8 = s__Class5_9,
    inference(split_conjunct,[status(thm)],[local_30]) ).

cnf(c_0_29,plain,
    s__Class5_8 = s__Class5_1,
    inference(rw,[status(thm)],[c_0_26,c_0_27]) ).

fof(c_0_30,plain,
    ! [X622,X623,X624] :
      ( s__instance(X624,X623)
      | ~ s__instance(X624,X622)
      | ~ s__subclass(X622,X623)
      | ~ s__instance(X622,s__SetOrClass)
      | ~ s__instance(X623,s__SetOrClass) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_27])])]) ).

fof(c_0_31,plain,
    ! [X620,X621] :
      ( ( ~ s__subclass(X620,X621)
        | s__instance(X621,s__SetOrClass) )
      & ( ~ s__subclass(X620,X621)
        | s__instance(X620,s__SetOrClass) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_26])])])]) ).

cnf(c_0_32,plain,
    s__Class5_9 = s__Class5_10,
    inference(split_conjunct,[status(thm)],[local_31]) ).

cnf(c_0_33,plain,
    s__Class5_9 = s__Class5_1,
    inference(rw,[status(thm)],[c_0_28,c_0_29]) ).

fof(c_0_34,negated_conjecture,
    ~ s__instance(s__Organism5_1,s__Animal),
    inference(assume_negation,[status(cth)],[prove_from_SUMO]) ).

cnf(c_0_35,plain,
    ( ~ s__instance(X3,X2)
    | ~ s__subclass(X2,X1)
    | ~ s__instance(X2,s__SetOrClass)
    | ~ s__instance(X1,s__SetOrClass)
    | s__instance(X3,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_30]) ).

cnf(c_0_36,plain,
    ( ~ s__subclass(X2,X1)
    | s__instance(X1,s__SetOrClass) ),
    inference(split_conjunct,[status(thm)],[c_0_31]) ).

cnf(c_0_37,plain,
    ( ~ s__subclass(X1,X2)
    | s__instance(X1,s__SetOrClass) ),
    inference(split_conjunct,[status(thm)],[c_0_31]) ).

cnf(c_0_38,plain,
    s__subclass(s__Class5_10,s__Reptile),
    inference(split_conjunct,[status(thm)],[local_33]) ).

cnf(c_0_39,plain,
    s__Class5_10 = s__Class5_1,
    inference(rw,[status(thm)],[c_0_32,c_0_33]) ).

fof(c_0_40,negated_conjecture,
    ~ s__instance(s__Organism5_1,s__Animal),
    inference(fof_simplification,[status(thm)],[c_0_34]) ).

cnf(c_0_41,plain,
    ( ~ s__instance(X1,X3)
    | ~ s__subclass(X3,X2)
    | s__instance(X1,X2) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_35,c_0_36]),c_0_37]) ).

cnf(c_0_42,plain,
    s__subclass(s__Reptile,s__Animal),
    inference(split_conjunct,[status(thm)],[kb_SUMOcache_7275]) ).

cnf(c_0_43,plain,
    s__subclass(s__Lizard5_1,s__Class5_1),
    inference(split_conjunct,[status(thm)],[local_32]) ).

cnf(c_0_44,plain,
    s__subclass(s__Class5_1,s__Reptile),
    inference(rw,[status(thm)],[c_0_38,c_0_39]) ).

fof(c_0_45,negated_conjecture,
    ~ s__instance(s__Organism5_1,s__Animal),
    inference(fof_nnf,[status(thm)],[c_0_40]) ).

cnf(c_0_46,plain,
    ( ~ s__instance(X1,s__Reptile)
    | s__instance(X1,s__Animal) ),
    inference(spm,[status(thm)],[c_0_41,c_0_42]) ).

cnf(c_0_47,plain,
    ( ~ s__instance(X1,s__Lizard5_1)
    | s__instance(X1,s__Class5_1) ),
    inference(spm,[status(thm)],[c_0_41,c_0_43]) ).

cnf(c_0_48,plain,
    ( ~ s__instance(X1,s__Class5_1)
    | s__instance(X1,s__Reptile) ),
    inference(spm,[status(thm)],[c_0_41,c_0_44]) ).

cnf(c_0_49,negated_conjecture,
    ~ s__instance(s__Organism5_1,s__Animal),
    inference(split_conjunct,[status(thm)],[c_0_45]) ).

cnf(c_0_50,plain,
    s__instance(s__Organism5_1,s__Lizard5_1),
    inference(split_conjunct,[status(thm)],[local_2]) ).

cnf(c_0_51,plain,
    $false,
    inference(cdclpropres,[status(thm)],[c_0_46,c_0_47,c_0_48,c_0_49,c_0_50]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : CSR079+1 : TPTP v9.3.1. Bugfixed v7.3.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.35  % Computer : n012.cluster.edu
% 0.10/0.35  % Model    : x86_64 x86_64
% 0.10/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35  % Memory   : 8046.5625MB
% 0.10/0.35  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.10/0.36  % DateTime : Mon Sep 21 14:48:51 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 0.10/0.36  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.40  Running first-order theorem proving
% 0.10/0.40  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
% 18.70/4.32  % Version: 3.5.1
% 18.70/4.32  % Preprocessing class: FMLLSMSLSSSNFFN.
% 18.70/4.32  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 18.70/4.32  % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 18.70/4.32  % Starting new_bool_3 with 300s (1) cores
% 18.70/4.32  % Starting new_bool_1 with 300s (1) cores
% 18.70/4.32  % Starting sh5l with 300s (1) cores
% 18.70/4.32  % G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with pid 2591273 completed with status 0
% 18.70/4.32  % Result found by G-E--_208_B07_F1_AE_CS_SP_PS_S0Y
% 18.70/4.32  % Preprocessing class: FMLLSMSLSSSNFFN.
% 18.70/4.32  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 18.70/4.32  % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 18.70/4.32  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 18.70/4.32  % SinE strategy is gf200_h_gu_RUU_F100_L20000
% 18.70/4.32  % Search class: FGHSM-SMLM31-MFFFFFNN
% 18.70/4.32  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 18.70/4.32  % Starting SubtermCWHack with 136s (1) cores
% 18.70/4.32  % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 151s (1) cores
% 18.70/4.32  % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 136s (1) cores
% 18.70/4.32  % Starting new_bool_3 with 136s (1) cores
% 18.70/4.32  % Starting new_bool_1 with 136s (1) cores
% 18.70/4.32  % G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with pid 2591282 completed with status 0
% 18.70/4.32  % Result found by G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y
% 18.70/4.32  % Preprocessing class: FMLLSMSLSSSNFFN.
% 18.70/4.32  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 18.70/4.32  % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 18.70/4.32  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 18.70/4.32  % SinE strategy is gf200_h_gu_RUU_F100_L20000
% 18.70/4.32  % Search class: FGHSM-SMLM31-MFFFFFNN
% 18.70/4.32  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 18.70/4.32  % Starting SubtermCWHack with 136s (1) cores
% 18.70/4.32  % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 151s (1) cores
% 18.70/4.32  % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 136s (1) cores
% 18.70/4.32  % Preprocessing time       : 0.109 s
% 18.70/4.32  % Presaturation interreduction done
% 18.70/4.32  % SatCheck found unsatisfiable ground set
% 18.70/4.32  
% 18.70/4.32  % Proof found!
% 18.70/4.32  % SZS status Theorem
% 18.70/4.32  % SZS output start CNFRefutation
% See solution above
% 18.70/4.32  % Parsed axioms                        : 14821
% 18.70/4.32  % Removed by relevancy pruning/SinE    : 5253
% 18.70/4.32  % Initial clauses                      : 10386
% 18.70/4.32  % Removed in clause preprocessing      : 60
% 18.70/4.32  % Initial clauses in saturation        : 10326
% 18.70/4.32  % Processed clauses                    : 22967
% 18.70/4.32  % ...of these trivial                  : 2552
% 18.70/4.32  % ...subsumed                          : 415
% 18.70/4.32  % ...remaining for further processing  : 20000
% 18.70/4.32  % Other redundant clauses eliminated   : 101
% 18.70/4.32  % Clauses deleted for lack of memory   : 0
% 18.70/4.32  % Backward-subsumed                    : 24
% 18.70/4.32  % Backward-rewritten                   : 930
% 18.70/4.32  % Generated clauses                    : 47439
% 18.70/4.32  % ...of the previous two non-redundant : 46430
% 18.70/4.32  % ...aggressively subsumed             : 0
% 18.70/4.32  % Contextual simplify-reflections      : 460
% 18.70/4.32  % Paramodulations                      : 47341
% 18.70/4.32  % Factorizations                       : 4
% 18.70/4.32  % NegExts                              : 0
% 18.70/4.32  % Equation resolutions                 : 103
% 18.70/4.32  % Disequality decompositions           : 0
% 18.70/4.32  % Total rewrite steps                  : 7138
% 18.70/4.32  % ...of those cached                   : 5167
% 18.70/4.32  % Propositional unsat checks           : 5
% 18.70/4.32  %    Propositional check models        : 4
% 18.70/4.32  %    Propositional check unsatisfiable : 1
% 18.70/4.32  %    Propositional clauses             : 44818
% 18.70/4.32  %    Propositional clauses after purity: 6047
% 18.70/4.32  %    Propositional unsat core size     : 5
% 18.70/4.32  %    Propositional preprocessing time  : 0.000
% 18.70/4.32  %    Propositional encoding time       : 0.123
% 18.70/4.32  %    Propositional solver time         : 0.088
% 18.70/4.32  %    Success case prop preproc time    : 0.000
% 18.70/4.32  %    Success case prop encoding time   : 0.048
% 18.70/4.32  %    Success case prop solver time     : 0.011
% 18.70/4.32  % Current number of processed clauses  : 9176
% 18.70/4.32  %    Positive orientable unit clauses  : 7096
% 18.70/4.32  %    Positive unorientable unit clauses: 28
% 18.70/4.32  %    Negative unit clauses             : 11
% 18.70/4.32  %    Non-unit-clauses                  : 2041
% 18.70/4.32  % Current number of unprocessed clauses: 35642
% 18.70/4.32  % ...number of literals in the above   : 76657
% 18.70/4.32  % Current number of archived formulas  : 0
% 18.70/4.32  % Current number of archived clauses   : 10766
% 18.70/4.32  % Clause-clause subsumption calls (NU) : 2600871
% 18.70/4.32  % Rec. Clause-clause subsumption calls : 608553
% 18.70/4.32  % Non-unit clause-clause subsumptions  : 852
% 18.70/4.32  % Unit Clause-clause subsumption calls : 452588
% 18.70/4.32  % Rewrite failures with RHS unbound    : 198
% 18.70/4.32  % BW rewrite match attempts            : 4455
% 18.70/4.32  % BW rewrite match successes           : 681
% 18.70/4.32  % Condensation attempts                : 0
% 18.70/4.32  % Condensation successes               : 0
% 18.70/4.32  % Termbank termtop insertions          : 1040803
% 18.70/4.32  % Search garbage collected termcells   : 83467
% 18.70/4.32  
% 18.70/4.32  % -------------------------------------------------
% 18.70/4.32  % User time                : 3.342 s
% 18.70/4.32  % System time              : 0.159 s
% 18.70/4.32  % Total time               : 3.501 s
% 18.70/4.32  % Maximum resident set size: 37228 pages
% 18.70/4.32  
% 18.70/4.32  % -------------------------------------------------
% 18.70/4.32  % User time                : 12.215 s
% 18.70/4.32  % System time              : 0.568 s
% 18.70/4.32  % Total time               : 12.783 s
% 18.70/4.32  % Maximum resident set size: 15616 pages
% 18.70/4.32  % E exiting
%------------------------------------------------------------------------------