↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : ITP012+1 : TPTP v9.3.1. Bugfixed v7.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/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:53:37 PM UTC 2026

% Result   : Theorem 0.13s 0.47s
% Output   : CNFRefutation 0.13s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   16 (   7 unt;   0 def)
%            Number of atoms       :   25 (  16 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   15 (   6   ~;   3   |;   3   &)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   5 con; 0-2 aty)
%            Number of variables   :   30 (   0 sgn  20   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(thm_2Einteger_2EINT__DIVIDES__RSUB,conjecture,
    ! [X24,X25,X26] :
      ( p(s(tyop_2Emin_2Ebool,c_2Einteger_2Eint__divides_2E2(s(tyop_2Einteger_2Eint,X24),s(tyop_2Einteger_2Eint,X25))))
     => s(tyop_2Emin_2Ebool,c_2Einteger_2Eint__divides_2E2(s(tyop_2Einteger_2Eint,X24),s(tyop_2Einteger_2Eint,c_2Einteger_2Eint__sub_2E2(s(tyop_2Einteger_2Eint,X26),s(tyop_2Einteger_2Eint,X25))))) = s(tyop_2Emin_2Ebool,c_2Einteger_2Eint__divides_2E2(s(tyop_2Einteger_2Eint,X24),s(tyop_2Einteger_2Eint,X26))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm_2Einteger_2EINT__DIVIDES__RSUB) ).

fof(thm_2Einteger_2EINT__DIVIDES__RADD,axiom,
    ! [X24,X25,X26] :
      ( p(s(tyop_2Emin_2Ebool,c_2Einteger_2Eint__divides_2E2(s(tyop_2Einteger_2Eint,X24),s(tyop_2Einteger_2Eint,X25))))
     => s(tyop_2Emin_2Ebool,c_2Einteger_2Eint__divides_2E2(s(tyop_2Einteger_2Eint,X24),s(tyop_2Einteger_2Eint,c_2Einteger_2Eint__add_2E2(s(tyop_2Einteger_2Eint,X26),s(tyop_2Einteger_2Eint,X25))))) = s(tyop_2Emin_2Ebool,c_2Einteger_2Eint__divides_2E2(s(tyop_2Einteger_2Eint,X24),s(tyop_2Einteger_2Eint,X26))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm_2Einteger_2EINT__DIVIDES__RADD) ).

fof(thm_2Einteger_2Eint__sub,axiom,
    ! [X9,X10] : s(tyop_2Einteger_2Eint,c_2Einteger_2Eint__sub_2E2(s(tyop_2Einteger_2Eint,X9),s(tyop_2Einteger_2Eint,X10))) = s(tyop_2Einteger_2Eint,c_2Einteger_2Eint__add_2E2(s(tyop_2Einteger_2Eint,X9),s(tyop_2Einteger_2Eint,c_2Einteger_2Eint__neg_2E1(s(tyop_2Einteger_2Eint,X10))))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm_2Einteger_2Eint__sub) ).

fof(thm_2Einteger_2EINT__DIVIDES__NEG,axiom,
    ! [X24,X25] :
      ( s(tyop_2Emin_2Ebool,c_2Einteger_2Eint__divides_2E2(s(tyop_2Einteger_2Eint,c_2Einteger_2Eint__neg_2E1(s(tyop_2Einteger_2Eint,X24))),s(tyop_2Einteger_2Eint,X25))) = s(tyop_2Emin_2Ebool,c_2Einteger_2Eint__divides_2E2(s(tyop_2Einteger_2Eint,X24),s(tyop_2Einteger_2Eint,X25)))
      & s(tyop_2Emin_2Ebool,c_2Einteger_2Eint__divides_2E2(s(tyop_2Einteger_2Eint,X24),s(tyop_2Einteger_2Eint,c_2Einteger_2Eint__neg_2E1(s(tyop_2Einteger_2Eint,X25))))) = s(tyop_2Emin_2Ebool,c_2Einteger_2Eint__divides_2E2(s(tyop_2Einteger_2Eint,X24),s(tyop_2Einteger_2Eint,X25))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',thm_2Einteger_2EINT__DIVIDES__NEG) ).

fof(c_0_4,negated_conjecture,
    ~ ! [X24,X25,X26] :
        ( p(s(tyop_2Emin_2Ebool,c_2Einteger_2Eint__divides_2E2(s(tyop_2Einteger_2Eint,X24),s(tyop_2Einteger_2Eint,X25))))
       => s(tyop_2Emin_2Ebool,c_2Einteger_2Eint__divides_2E2(s(tyop_2Einteger_2Eint,X24),s(tyop_2Einteger_2Eint,c_2Einteger_2Eint__sub_2E2(s(tyop_2Einteger_2Eint,X26),s(tyop_2Einteger_2Eint,X25))))) = s(tyop_2Emin_2Ebool,c_2Einteger_2Eint__divides_2E2(s(tyop_2Einteger_2Eint,X24),s(tyop_2Einteger_2Eint,X26))) ),
    inference(assume_negation,[status(cth)],[thm_2Einteger_2EINT__DIVIDES__RSUB]) ).

fof(c_0_5,plain,
    ! [X58,X59,X60] :
      ( s(tyop_2Emin_2Ebool,c_2Einteger_2Eint__divides_2E2(s(tyop_2Einteger_2Eint,X58),s(tyop_2Einteger_2Eint,c_2Einteger_2Eint__add_2E2(s(tyop_2Einteger_2Eint,X60),s(tyop_2Einteger_2Eint,X59))))) = s(tyop_2Emin_2Ebool,c_2Einteger_2Eint__divides_2E2(s(tyop_2Einteger_2Eint,X58),s(tyop_2Einteger_2Eint,X60)))
      | ~ p(s(tyop_2Emin_2Ebool,c_2Einteger_2Eint__divides_2E2(s(tyop_2Einteger_2Eint,X58),s(tyop_2Einteger_2Eint,X59)))) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[thm_2Einteger_2EINT__DIVIDES__RADD])])]) ).

fof(c_0_6,plain,
    ! [X63,X64] : s(tyop_2Einteger_2Eint,c_2Einteger_2Eint__sub_2E2(s(tyop_2Einteger_2Eint,X63),s(tyop_2Einteger_2Eint,X64))) = s(tyop_2Einteger_2Eint,c_2Einteger_2Eint__add_2E2(s(tyop_2Einteger_2Eint,X63),s(tyop_2Einteger_2Eint,c_2Einteger_2Eint__neg_2E1(s(tyop_2Einteger_2Eint,X64))))),
    inference(variable_rename,[status(thm)],[thm_2Einteger_2Eint__sub]) ).

fof(c_0_7,plain,
    ! [X61,X62] :
      ( s(tyop_2Emin_2Ebool,c_2Einteger_2Eint__divides_2E2(s(tyop_2Einteger_2Eint,c_2Einteger_2Eint__neg_2E1(s(tyop_2Einteger_2Eint,X61))),s(tyop_2Einteger_2Eint,X62))) = s(tyop_2Emin_2Ebool,c_2Einteger_2Eint__divides_2E2(s(tyop_2Einteger_2Eint,X61),s(tyop_2Einteger_2Eint,X62)))
      & s(tyop_2Emin_2Ebool,c_2Einteger_2Eint__divides_2E2(s(tyop_2Einteger_2Eint,X61),s(tyop_2Einteger_2Eint,c_2Einteger_2Eint__neg_2E1(s(tyop_2Einteger_2Eint,X62))))) = s(tyop_2Emin_2Ebool,c_2Einteger_2Eint__divides_2E2(s(tyop_2Einteger_2Eint,X61),s(tyop_2Einteger_2Eint,X62))) ),
    inference(variable_rename,[status(thm)],[thm_2Einteger_2EINT__DIVIDES__NEG]) ).

fof(c_0_8,negated_conjecture,
    ( s(tyop_2Emin_2Ebool,c_2Einteger_2Eint__divides_2E2(s(tyop_2Einteger_2Eint,esk1_0),s(tyop_2Einteger_2Eint,c_2Einteger_2Eint__sub_2E2(s(tyop_2Einteger_2Eint,esk3_0),s(tyop_2Einteger_2Eint,esk2_0))))) != s(tyop_2Emin_2Ebool,c_2Einteger_2Eint__divides_2E2(s(tyop_2Einteger_2Eint,esk1_0),s(tyop_2Einteger_2Eint,esk3_0)))
    & p(s(tyop_2Emin_2Ebool,c_2Einteger_2Eint__divides_2E2(s(tyop_2Einteger_2Eint,esk1_0),s(tyop_2Einteger_2Eint,esk2_0)))) ),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).

cnf(c_0_9,plain,
    ( ~ p(s(tyop_2Emin_2Ebool,c_2Einteger_2Eint__divides_2E2(s(tyop_2Einteger_2Eint,X1),s(tyop_2Einteger_2Eint,X2))))
    | s(tyop_2Emin_2Ebool,c_2Einteger_2Eint__divides_2E2(s(tyop_2Einteger_2Eint,X1),s(tyop_2Einteger_2Eint,c_2Einteger_2Eint__add_2E2(s(tyop_2Einteger_2Eint,X3),s(tyop_2Einteger_2Eint,X2))))) = s(tyop_2Emin_2Ebool,c_2Einteger_2Eint__divides_2E2(s(tyop_2Einteger_2Eint,X1),s(tyop_2Einteger_2Eint,X3))) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_10,plain,
    s(tyop_2Einteger_2Eint,c_2Einteger_2Eint__sub_2E2(s(tyop_2Einteger_2Eint,X1),s(tyop_2Einteger_2Eint,X2))) = s(tyop_2Einteger_2Eint,c_2Einteger_2Eint__add_2E2(s(tyop_2Einteger_2Eint,X1),s(tyop_2Einteger_2Eint,c_2Einteger_2Eint__neg_2E1(s(tyop_2Einteger_2Eint,X2))))),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_11,plain,
    s(tyop_2Emin_2Ebool,c_2Einteger_2Eint__divides_2E2(s(tyop_2Einteger_2Eint,X1),s(tyop_2Einteger_2Eint,c_2Einteger_2Eint__neg_2E1(s(tyop_2Einteger_2Eint,X2))))) = s(tyop_2Emin_2Ebool,c_2Einteger_2Eint__divides_2E2(s(tyop_2Einteger_2Eint,X1),s(tyop_2Einteger_2Eint,X2))),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_12,negated_conjecture,
    s(tyop_2Emin_2Ebool,c_2Einteger_2Eint__divides_2E2(s(tyop_2Einteger_2Eint,esk1_0),s(tyop_2Einteger_2Eint,c_2Einteger_2Eint__sub_2E2(s(tyop_2Einteger_2Eint,esk3_0),s(tyop_2Einteger_2Eint,esk2_0))))) != s(tyop_2Emin_2Ebool,c_2Einteger_2Eint__divides_2E2(s(tyop_2Einteger_2Eint,esk1_0),s(tyop_2Einteger_2Eint,esk3_0))),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_13,plain,
    ( ~ p(s(tyop_2Emin_2Ebool,c_2Einteger_2Eint__divides_2E2(s(tyop_2Einteger_2Eint,X1),s(tyop_2Einteger_2Eint,X3))))
    | s(tyop_2Emin_2Ebool,c_2Einteger_2Eint__divides_2E2(s(tyop_2Einteger_2Eint,X1),s(tyop_2Einteger_2Eint,c_2Einteger_2Eint__sub_2E2(s(tyop_2Einteger_2Eint,X2),s(tyop_2Einteger_2Eint,X3))))) = s(tyop_2Emin_2Ebool,c_2Einteger_2Eint__divides_2E2(s(tyop_2Einteger_2Eint,X1),s(tyop_2Einteger_2Eint,X2))) ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]) ).

cnf(c_0_14,negated_conjecture,
    p(s(tyop_2Emin_2Ebool,c_2Einteger_2Eint__divides_2E2(s(tyop_2Einteger_2Eint,esk1_0),s(tyop_2Einteger_2Eint,esk2_0)))),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_15,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : ITP012+1 : TPTP v9.3.1. Bugfixed v7.5.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/0.35  % Computer : n004.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.35  % CPULimit : 300
% 0.10/0.35  % WCLimit  : 300
% 0.10/0.36  % DateTime : Sun Sep 20 21:45:35 UTC 2026
% 0.10/0.36  % CPUTime  : 
% 0.10/0.36  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.39  Running first-order theorem proving
% 0.13/0.39  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
% 0.13/0.47  % Version: 3.5.1
% 0.13/0.47  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/0.47  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.47  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/0.47  % Starting new_bool_3 with 300s (1) cores
% 0.13/0.47  % Starting new_bool_1 with 300s (1) cores
% 0.13/0.47  % Starting sh5l with 300s (1) cores
% 0.13/0.47  % new_bool_1 with pid 1523324 completed with status 0
% 0.13/0.47  % Result found by new_bool_1
% 0.13/0.47  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/0.47  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.47  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/0.47  % Starting new_bool_3 with 300s (1) cores
% 0.13/0.47  % Starting new_bool_1 with 300s (1) cores
% 0.13/0.47  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.47  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.47  % Search class: FGUSS-FFMF21-MFFFFFNN
% 0.13/0.47  % partial match(1): FGUSM-FFMF21-MFFFFFNN
% 0.13/0.47  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.47  % Starting SubtermCWHack with 31s (1) cores
% 0.13/0.47  % SubtermCWHack with pid 1523328 completed with status 0
% 0.13/0.47  % Result found by SubtermCWHack
% 0.13/0.47  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.13/0.47  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.13/0.47  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.13/0.47  % Starting new_bool_3 with 300s (1) cores
% 0.13/0.47  % Starting new_bool_1 with 300s (1) cores
% 0.13/0.47  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.13/0.47  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.13/0.47  % Search class: FGUSS-FFMF21-MFFFFFNN
% 0.13/0.47  % partial match(1): FGUSM-FFMF21-MFFFFFNN
% 0.13/0.47  % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.13/0.47  % Starting SubtermCWHack with 31s (1) cores
% 0.13/0.47  % Preprocessing time       : 0.002 s
% 0.13/0.47  
% 0.13/0.47  % Proof found!
% 0.13/0.47  % SZS status Theorem
% 0.13/0.47  % SZS output start CNFRefutation
% See solution above
% 0.13/0.47  % Parsed axioms                        : 52
% 0.13/0.47  % Removed by relevancy pruning/SinE    : 37
% 0.13/0.47  % Initial clauses                      : 213
% 0.13/0.47  % Removed in clause preprocessing      : 181
% 0.13/0.47  % Initial clauses in saturation        : 32
% 0.13/0.47  % Processed clauses                    : 244
% 0.13/0.47  % ...of these trivial                  : 3
% 0.13/0.47  % ...subsumed                          : 198
% 0.13/0.47  % ...remaining for further processing  : 43
% 0.13/0.47  % Other redundant clauses eliminated   : 0
% 0.13/0.47  % Clauses deleted for lack of memory   : 0
% 0.13/0.47  % Backward-subsumed                    : 4
% 0.13/0.47  % Backward-rewritten                   : 0
% 0.13/0.47  % Generated clauses                    : 2340
% 0.13/0.47  % ...of the previous two non-redundant : 1968
% 0.13/0.47  % ...aggressively subsumed             : 0
% 0.13/0.47  % Contextual simplify-reflections      : 1
% 0.13/0.47  % Paramodulations                      : 2135
% 0.13/0.47  % Factorizations                       : 196
% 0.13/0.47  % NegExts                              : 0
% 0.13/0.47  % Equation resolutions                 : 9
% 0.13/0.47  % Disequality decompositions           : 0
% 0.13/0.47  % Total rewrite steps                  : 239
% 0.13/0.47  % ...of those cached                   : 228
% 0.13/0.47  % Propositional unsat checks           : 0
% 0.13/0.47  %    Propositional check models        : 0
% 0.13/0.47  %    Propositional check unsatisfiable : 0
% 0.13/0.47  %    Propositional clauses             : 0
% 0.13/0.47  %    Propositional clauses after purity: 0
% 0.13/0.47  %    Propositional unsat core size     : 0
% 0.13/0.47  %    Propositional preprocessing time  : 0.000
% 0.13/0.47  %    Propositional encoding time       : 0.000
% 0.13/0.47  %    Propositional solver time         : 0.000
% 0.13/0.47  %    Success case prop preproc time    : 0.000
% 0.13/0.47  %    Success case prop encoding time   : 0.000
% 0.13/0.47  %    Success case prop solver time     : 0.000
% 0.13/0.47  % Current number of processed clauses  : 39
% 0.13/0.47  %    Positive orientable unit clauses  : 4
% 0.13/0.47  %    Positive unorientable unit clauses: 0
% 0.13/0.47  %    Negative unit clauses             : 1
% 0.13/0.47  %    Non-unit-clauses                  : 34
% 0.13/0.47  % Current number of unprocessed clauses: 1722
% 0.13/0.47  % ...number of literals in the above   : 10859
% 0.13/0.47  % Current number of archived formulas  : 0
% 0.13/0.47  % Current number of archived clauses   : 4
% 0.13/0.47  % Clause-clause subsumption calls (NU) : 420
% 0.13/0.47  % Rec. Clause-clause subsumption calls : 412
% 0.13/0.47  % Non-unit clause-clause subsumptions  : 203
% 0.13/0.47  % Unit Clause-clause subsumption calls : 0
% 0.13/0.47  % Rewrite failures with RHS unbound    : 0
% 0.13/0.47  % BW rewrite match attempts            : 4
% 0.13/0.47  % BW rewrite match successes           : 0
% 0.13/0.47  % Condensation attempts                : 0
% 0.13/0.47  % Condensation successes               : 0
% 0.13/0.47  % Termbank termtop insertions          : 68839
% 0.13/0.47  % Search garbage collected termcells   : 1641
% 0.13/0.47  
% 0.13/0.47  % -------------------------------------------------
% 0.13/0.47  % User time                : 0.048 s
% 0.13/0.47  % System time              : 0.006 s
% 0.13/0.47  % Total time               : 0.054 s
% 0.13/0.47  % Maximum resident set size: 3992 pages
% 0.13/0.47  
% 0.13/0.47  % -------------------------------------------------
% 0.13/0.47  % User time                : 0.051 s
% 0.13/0.47  % System time              : 0.011 s
% 0.13/0.47  % Total time               : 0.062 s
% 0.13/0.47  % Maximum resident set size: 4864 pages
% 0.13/0.47  % E exiting
%------------------------------------------------------------------------------