↑ Up

E---3.5.1.THM-CRf.s

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

% Result   : Theorem 3.18s 0.94s
% Output   : CNFRefutation 3.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   48 (  11 unt;   0 def)
%            Number of atoms       :  135 (  23 equ)
%            Maximal formula atoms :   20 (   2 avg)
%            Number of connectives :  129 (  42   ~;  60   |;  19   &)
%                                         (   3 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   4 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    6 (   4 usr;   1 prp; 0-3 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-3 aty)
%            Number of variables   :  100 (  11 sgn  34   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(sum_defn,axiom,
    ! [X1,X2,X4] :
      ( X1 = sum(X2,X4)
    <=> ! [X5] :
          ( incident_c(X5,X1)
        <=> ( incident_c(X5,X4)
            | incident_c(X5,X2) ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO004+0.ax',sum_defn) ).

fof(proposition_2_14_2,conjecture,
    ! [X1,X2,X4,X3] :
      ( ( meet(X3,X2,X4)
        & part_of(X4,X1)
        & part_of(X2,X1)
        & open(X1) )
     => open(sum(X2,X4)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',proposition_2_14_2) ).

fof(part_of_defn,axiom,
    ! [X1,X2] :
      ( part_of(X2,X1)
    <=> ! [X3] :
          ( incident_c(X3,X2)
         => incident_c(X3,X1) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO004+0.ax',part_of_defn) ).

fof(c1,axiom,
    ! [X1,X2] :
      ( ( X2 != X1
        & part_of(X2,X1) )
     => open(X2) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GEO004+0.ax',c1) ).

fof(c_0_4,plain,
    ! [X18,X19,X20,X21,X22,X23,X24,X25] :
      ( ( X23 = sum(X24,X25)
        | incident_c(esk6_3(X23,X24,X25),X25)
        | incident_c(esk6_3(X23,X24,X25),X24)
        | incident_c(esk6_3(X23,X24,X25),X23) )
      & ( X23 = sum(X24,X25)
        | ~ incident_c(esk6_3(X23,X24,X25),X23)
        | ~ incident_c(esk6_3(X23,X24,X25),X25) )
      & ( X23 = sum(X24,X25)
        | ~ incident_c(esk6_3(X23,X24,X25),X23)
        | ~ incident_c(esk6_3(X23,X24,X25),X24) )
      & ( X18 != sum(X19,X20)
        | incident_c(X22,X18)
        | ~ incident_c(X22,X20) )
      & ( X18 != sum(X19,X20)
        | incident_c(X22,X18)
        | ~ incident_c(X22,X19) )
      & ( X18 != sum(X19,X20)
        | incident_c(X21,X20)
        | incident_c(X21,X19)
        | ~ incident_c(X21,X18) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[sum_defn])])])])])])]) ).

fof(c_0_5,negated_conjecture,
    ~ ! [X1,X2,X4,X3] :
        ( ( meet(X3,X2,X4)
          & part_of(X4,X1)
          & part_of(X2,X1)
          & open(X1) )
       => open(sum(X2,X4)) ),
    inference(assume_negation,[status(cth)],[proposition_2_14_2]) ).

fof(c_0_6,plain,
    ! [X39,X40,X41,X42,X43] :
      ( ( part_of(X43,X42)
        | ~ incident_c(esk9_2(X42,X43),X42) )
      & ( part_of(X43,X42)
        | incident_c(esk9_2(X42,X43),X43) )
      & ( incident_c(X41,X39)
        | ~ incident_c(X41,X40)
        | ~ part_of(X40,X39) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[part_of_defn])])])])])])]) ).

cnf(c_0_7,plain,
    ( X3 != sum(X4,X2)
    | ~ incident_c(X1,X2)
    | incident_c(X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

fof(c_0_8,negated_conjecture,
    ( ~ open(sum(esk2_0,esk3_0))
    & meet(esk4_0,esk2_0,esk3_0)
    & part_of(esk3_0,esk1_0)
    & part_of(esk2_0,esk1_0)
    & open(esk1_0) ),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).

fof(c_0_9,plain,
    ! [X1,X2] :
      ( ( X2 != X1
        & part_of(X2,X1) )
     => open(X2) ),
    inference(fof_simplification,[status(thm)],[c1]) ).

cnf(c_0_10,plain,
    ( ~ incident_c(esk9_2(X1,X2),X1)
    | part_of(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_11,plain,
    ( ~ incident_c(X1,X3)
    | incident_c(X1,sum(X2,X3)) ),
    inference(er,[status(thm)],[c_0_7]) ).

cnf(c_0_12,plain,
    ( ~ incident_c(X3,X1)
    | ~ part_of(X1,X2)
    | incident_c(X3,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_13,negated_conjecture,
    part_of(esk3_0,esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

fof(c_0_14,plain,
    ! [X16,X17] :
      ( open(X17)
      | X17 = X16
      | ~ part_of(X17,X16) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).

cnf(c_0_15,plain,
    ( ~ incident_c(esk9_2(sum(X2,X3),X1),X3)
    | part_of(X1,sum(X2,X3)) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_16,plain,
    ( part_of(X2,X1)
    | incident_c(esk9_2(X1,X2),X2) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_17,negated_conjecture,
    ( ~ incident_c(X1,esk3_0)
    | incident_c(X1,esk1_0) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_18,plain,
    ( ~ part_of(X1,X2)
    | open(X1)
    | X1 = X2 ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_19,plain,
    part_of(X1,sum(X2,X1)),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_20,negated_conjecture,
    ( part_of(esk3_0,X1)
    | incident_c(esk9_2(X1,esk3_0),esk1_0) ),
    inference(spm,[status(thm)],[c_0_17,c_0_16]) ).

cnf(c_0_21,plain,
    ( X1 = sum(X2,X3)
    | incident_c(esk6_3(X1,X2,X3),X3)
    | incident_c(esk6_3(X1,X2,X3),X2)
    | incident_c(esk6_3(X1,X2,X3),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_22,plain,
    ( X3 != sum(X2,X4)
    | ~ incident_c(X1,X2)
    | incident_c(X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_23,negated_conjecture,
    ~ open(sum(esk2_0,esk3_0)),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_24,plain,
    ( open(X2)
    | sum(X1,X2) = X2 ),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_25,negated_conjecture,
    part_of(esk3_0,sum(X1,esk1_0)),
    inference(spm,[status(thm)],[c_0_15,c_0_20]) ).

cnf(c_0_26,plain,
    ( incident_c(esk6_3(X1,X1,X2),X1)
    | incident_c(esk6_3(X1,X1,X2),X2)
    | sum(X1,X2) = X1 ),
    inference(ef,[status(thm)],[c_0_21]) ).

cnf(c_0_27,plain,
    ( ~ incident_c(X1,X2)
    | incident_c(X1,sum(X2,X3)) ),
    inference(er,[status(thm)],[c_0_22]) ).

cnf(c_0_28,negated_conjecture,
    sum(X1,sum(esk2_0,esk3_0)) = sum(esk2_0,esk3_0),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_29,negated_conjecture,
    ( ~ incident_c(X1,esk3_0)
    | incident_c(X1,sum(X2,esk1_0)) ),
    inference(spm,[status(thm)],[c_0_12,c_0_25]) ).

cnf(c_0_30,plain,
    ( ~ incident_c(esk6_3(X1,X2,X3),X1)
    | ~ incident_c(esk6_3(X1,X2,X3),X2)
    | X1 = sum(X2,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_31,plain,
    ( incident_c(esk6_3(X1,X1,X1),X1)
    | sum(X1,X1) = X1 ),
    inference(ef,[status(thm)],[c_0_26]) ).

cnf(c_0_32,plain,
    ( X2 != sum(X3,X4)
    | ~ incident_c(X1,X2)
    | incident_c(X1,X4)
    | incident_c(X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_33,negated_conjecture,
    ( ~ incident_c(X1,X2)
    | incident_c(X1,sum(esk2_0,esk3_0)) ),
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_34,negated_conjecture,
    part_of(esk2_0,esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_35,negated_conjecture,
    ( ~ incident_c(esk9_2(sum(X2,esk1_0),X1),esk3_0)
    | part_of(X1,sum(X2,esk1_0)) ),
    inference(spm,[status(thm)],[c_0_10,c_0_29]) ).

cnf(c_0_36,plain,
    sum(X1,X1) = X1,
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_31]) ).

cnf(c_0_37,plain,
    ( ~ incident_c(X1,sum(X3,X2))
    | incident_c(X1,X3)
    | incident_c(X1,X2) ),
    inference(er,[status(thm)],[c_0_32]) ).

cnf(c_0_38,negated_conjecture,
    ( part_of(X2,X1)
    | incident_c(esk9_2(X1,X2),sum(esk2_0,esk3_0)) ),
    inference(spm,[status(thm)],[c_0_33,c_0_16]) ).

cnf(c_0_39,negated_conjecture,
    ( ~ incident_c(X1,esk2_0)
    | incident_c(X1,esk1_0) ),
    inference(spm,[status(thm)],[c_0_12,c_0_34]) ).

cnf(c_0_40,negated_conjecture,
    ( ~ incident_c(esk9_2(esk1_0,X1),esk3_0)
    | part_of(X1,esk1_0) ),
    inference(spm,[status(thm)],[c_0_35,c_0_36]) ).

cnf(c_0_41,negated_conjecture,
    ( part_of(X2,X1)
    | incident_c(esk9_2(X1,X2),esk3_0)
    | incident_c(esk9_2(X1,X2),esk2_0) ),
    inference(spm,[status(thm)],[c_0_37,c_0_38]) ).

cnf(c_0_42,negated_conjecture,
    ( ~ incident_c(esk9_2(esk1_0,X1),esk2_0)
    | part_of(X1,esk1_0) ),
    inference(spm,[status(thm)],[c_0_10,c_0_39]) ).

cnf(c_0_43,negated_conjecture,
    part_of(X1,esk1_0),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]) ).

cnf(c_0_44,negated_conjecture,
    ( open(X1)
    | X1 = esk1_0 ),
    inference(spm,[status(thm)],[c_0_18,c_0_43]) ).

cnf(c_0_45,negated_conjecture,
    sum(esk2_0,esk3_0) = esk1_0,
    inference(spm,[status(thm)],[c_0_23,c_0_44]) ).

cnf(c_0_46,negated_conjecture,
    open(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_47,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_45]),c_0_46])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GEO093+1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.40  % Computer : n004.cluster.edu
% 0.10/0.40  % Model    : x86_64 x86_64
% 0.10/0.40  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.40  % Memory   : 8046.5625MB
% 0.10/0.40  % OS       : Linux 6.8.0-71-generic
% 0.10/0.40  % CPULimit : 300
% 0.10/0.40  % WCLimit  : 300
% 0.10/0.40  % DateTime : Sun Sep 20 10:41:51 UTC 2026
% 0.10/0.40  % CPUTime  : 
% 0.10/0.40  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.45  Running first-order theorem proving
% 0.10/0.45  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
% 3.18/0.94  % Version: 3.5.1
% 3.18/0.94  % Preprocessing class: FSMSSMSSSSSNFFN.
% 3.18/0.94  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.18/0.94  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.18/0.94  % Starting new_bool_3 with 300s (1) cores
% 3.18/0.94  % Starting new_bool_1 with 300s (1) cores
% 3.18/0.94  % Starting sh5l with 300s (1) cores
% 3.18/0.94  % new_bool_1 with pid 660221 completed with status 0
% 3.18/0.94  % Result found by new_bool_1
% 3.18/0.94  % Preprocessing class: FSMSSMSSSSSNFFN.
% 3.18/0.94  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.18/0.94  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.18/0.94  % Starting new_bool_3 with 300s (1) cores
% 3.18/0.94  % Starting new_bool_1 with 300s (1) cores
% 3.18/0.94  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 3.18/0.94  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 3.18/0.94  % Search class: FGHSF-FFMS32-SFFFFFNN
% 3.18/0.94  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 3.18/0.94  % Starting SubtermCWHack with 31s (1) cores
% 3.18/0.94  % SubtermCWHack with pid 660224 completed with status 0
% 3.18/0.94  % Result found by SubtermCWHack
% 3.18/0.94  % Preprocessing class: FSMSSMSSSSSNFFN.
% 3.18/0.94  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.18/0.94  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 3.18/0.94  % Starting new_bool_3 with 300s (1) cores
% 3.18/0.94  % Starting new_bool_1 with 300s (1) cores
% 3.18/0.94  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 3.18/0.94  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 3.18/0.94  % Search class: FGHSF-FFMS32-SFFFFFNN
% 3.18/0.94  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 3.18/0.94  % Starting SubtermCWHack with 31s (1) cores
% 3.18/0.94  % Preprocessing time       : 0.002 s
% 3.18/0.94  
% 3.18/0.94  % Proof found!
% 3.18/0.94  % SZS status Theorem
% 3.18/0.94  % SZS output start CNFRefutation
% See solution above
% 3.18/0.94  % Parsed axioms                        : 17
% 3.18/0.94  % Removed by relevancy pruning/SinE    : 5
% 3.18/0.94  % Initial clauses                      : 39
% 3.18/0.94  % Removed in clause preprocessing      : 0
% 3.18/0.94  % Initial clauses in saturation        : 39
% 3.18/0.94  % Processed clauses                    : 5669
% 3.18/0.94  % ...of these trivial                  : 10
% 3.18/0.94  % ...subsumed                          : 5112
% 3.18/0.94  % ...remaining for further processing  : 547
% 3.18/0.94  % Other redundant clauses eliminated   : 12
% 3.18/0.94  % Clauses deleted for lack of memory   : 0
% 3.18/0.94  % Backward-subsumed                    : 25
% 3.18/0.94  % Backward-rewritten                   : 77
% 3.18/0.94  % Generated clauses                    : 33389
% 3.18/0.94  % ...of the previous two non-redundant : 29909
% 3.18/0.94  % ...aggressively subsumed             : 0
% 3.18/0.94  % Contextual simplify-reflections      : 23
% 3.18/0.94  % Paramodulations                      : 33215
% 3.18/0.94  % Factorizations                       : 162
% 3.18/0.94  % NegExts                              : 0
% 3.18/0.94  % Equation resolutions                 : 12
% 3.18/0.94  % Disequality decompositions           : 0
% 3.18/0.94  % Total rewrite steps                  : 5507
% 3.18/0.94  % ...of those cached                   : 5335
% 3.18/0.94  % Propositional unsat checks           : 0
% 3.18/0.94  %    Propositional check models        : 0
% 3.18/0.94  %    Propositional check unsatisfiable : 0
% 3.18/0.94  %    Propositional clauses             : 0
% 3.18/0.94  %    Propositional clauses after purity: 0
% 3.18/0.94  %    Propositional unsat core size     : 0
% 3.18/0.94  %    Propositional preprocessing time  : 0.000
% 3.18/0.94  %    Propositional encoding time       : 0.000
% 3.18/0.94  %    Propositional solver time         : 0.000
% 3.18/0.94  %    Success case prop preproc time    : 0.000
% 3.18/0.94  %    Success case prop encoding time   : 0.000
% 3.18/0.94  %    Success case prop solver time     : 0.000
% 3.18/0.94  % Current number of processed clauses  : 442
% 3.18/0.94  %    Positive orientable unit clauses  : 39
% 3.18/0.94  %    Positive unorientable unit clauses: 0
% 3.18/0.94  %    Negative unit clauses             : 0
% 3.18/0.94  %    Non-unit-clauses                  : 403
% 3.18/0.94  % Current number of unprocessed clauses: 24001
% 3.18/0.94  % ...number of literals in the above   : 124236
% 3.18/0.94  % Current number of archived formulas  : 0
% 3.18/0.94  % Current number of archived clauses   : 102
% 3.18/0.94  % Clause-clause subsumption calls (NU) : 100665
% 3.18/0.94  % Rec. Clause-clause subsumption calls : 37846
% 3.18/0.94  % Non-unit clause-clause subsumptions  : 5140
% 3.18/0.94  % Unit Clause-clause subsumption calls : 1068
% 3.18/0.94  % Rewrite failures with RHS unbound    : 0
% 3.18/0.94  % BW rewrite match attempts            : 208
% 3.18/0.94  % BW rewrite match successes           : 14
% 3.18/0.94  % Condensation attempts                : 0
% 3.18/0.94  % Condensation successes               : 0
% 3.18/0.94  % Termbank termtop insertions          : 444379
% 3.18/0.94  % Search garbage collected termcells   : 917
% 3.18/0.94  
% 3.18/0.94  % -------------------------------------------------
% 3.18/0.94  % User time                : 0.438 s
% 3.18/0.94  % System time              : 0.024 s
% 3.18/0.94  % Total time               : 0.462 s
% 3.18/0.94  % Maximum resident set size: 3608 pages
% 3.18/0.94  
% 3.18/0.94  % -------------------------------------------------
% 3.18/0.94  % User time                : 0.440 s
% 3.18/0.94  % System time              : 0.029 s
% 3.18/0.94  % Total time               : 0.469 s
% 3.18/0.94  % Maximum resident set size: 4864 pages
% 3.18/0.94  % E exiting
%------------------------------------------------------------------------------