↑ 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  : SEU444+3 : TPTP v9.3.1. Released v3.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n001.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 02:29:29 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(t56_relset_2,conjecture,
    ! [X1,X2,X3] :
      ( m2_relset_1(X3,X2,X1)
     => ( k10_relset_1(X1,X2,k6_relset_1(X2,X1,X3),k10_relset_1(X2,X1,X3,X2)) = k10_relset_1(X1,X2,k6_relset_1(X2,X1,X3),k2_funct_5(X3))
        & k1_funct_5(X3) = k10_relset_1(X1,X2,k6_relset_1(X2,X1,X3),X1) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t56_relset_2) ).

fof(t51_relset_2,axiom,
    ! [X1,X2,X3] :
      ( m2_relset_1(X3,X2,X1)
     => ( k2_funct_5(X3) = k10_relset_1(X2,X1,X3,X2)
        & k1_funct_5(X3) = k10_relset_1(X1,X2,k6_relset_1(X2,X1,X3),X1) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t51_relset_2) ).

fof(c_0_2,negated_conjecture,
    ~ ! [X1,X2,X3] :
        ( m2_relset_1(X3,X2,X1)
       => ( k10_relset_1(X1,X2,k6_relset_1(X2,X1,X3),k10_relset_1(X2,X1,X3,X2)) = k10_relset_1(X1,X2,k6_relset_1(X2,X1,X3),k2_funct_5(X3))
          & k1_funct_5(X3) = k10_relset_1(X1,X2,k6_relset_1(X2,X1,X3),X1) ) ),
    inference(assume_negation,[status(cth)],[t56_relset_2]) ).

fof(c_0_3,negated_conjecture,
    ( ( k10_relset_1(esk1_0,esk2_0,k6_relset_1(esk2_0,esk1_0,esk3_0),k10_relset_1(esk2_0,esk1_0,esk3_0,esk2_0)) != k10_relset_1(esk1_0,esk2_0,k6_relset_1(esk2_0,esk1_0,esk3_0),k2_funct_5(esk3_0))
      | k1_funct_5(esk3_0) != k10_relset_1(esk1_0,esk2_0,k6_relset_1(esk2_0,esk1_0,esk3_0),esk1_0) )
    & m2_relset_1(esk3_0,esk2_0,esk1_0) ),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_2])])])]) ).

fof(c_0_4,plain,
    ! [X46,X47,X48] :
      ( ( ~ m2_relset_1(X48,X47,X46)
        | k2_funct_5(X48) = k10_relset_1(X47,X46,X48,X47) )
      & ( ~ m2_relset_1(X48,X47,X46)
        | k1_funct_5(X48) = k10_relset_1(X46,X47,k6_relset_1(X47,X46,X48),X46) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t51_relset_2])])])]) ).

cnf(c_0_5,negated_conjecture,
    ( k10_relset_1(esk1_0,esk2_0,k6_relset_1(esk2_0,esk1_0,esk3_0),k10_relset_1(esk2_0,esk1_0,esk3_0,esk2_0)) != k10_relset_1(esk1_0,esk2_0,k6_relset_1(esk2_0,esk1_0,esk3_0),k2_funct_5(esk3_0))
    | k1_funct_5(esk3_0) != k10_relset_1(esk1_0,esk2_0,k6_relset_1(esk2_0,esk1_0,esk3_0),esk1_0) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_6,plain,
    ( ~ m2_relset_1(X1,X2,X3)
    | k2_funct_5(X1) = k10_relset_1(X2,X3,X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_7,negated_conjecture,
    m2_relset_1(esk3_0,esk2_0,esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_8,negated_conjecture,
    k10_relset_1(esk1_0,esk2_0,k6_relset_1(esk2_0,esk1_0,esk3_0),esk1_0) != k1_funct_5(esk3_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7])]) ).

cnf(c_0_9,plain,
    ( ~ m2_relset_1(X1,X3,X2)
    | k1_funct_5(X1) = k10_relset_1(X2,X3,k6_relset_1(X3,X2,X1),X2) ),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_10,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_9]),c_0_7])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU444+3 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.37  % Computer : n001.cluster.edu
% 0.09/0.37  % Model    : x86_64 x86_64
% 0.09/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37  % Memory   : 8046.5625MB
% 0.09/0.37  % OS       : Linux 6.8.0-71-generic
% 0.09/0.37  % CPULimit : 300
% 0.09/0.37  % WCLimit  : 300
% 0.09/0.37  % DateTime : Mon Sep 21 06:38:46 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.09/0.37  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.41  Running first-order theorem proving
% 0.09/0.41  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
% 88.57/14.54  % Version: 3.5.1
% 88.57/14.54  % Preprocessing class: FMLLMMLLSSSNFFN.
% 88.57/14.54  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 88.57/14.54  % Starting new_bool_3 with 900s (3) cores
% 88.57/14.54  % Starting new_bool_1 with 900s (3) cores
% 88.57/14.54  % Starting sh5l with 300s (1) cores
% 88.57/14.54  % Starting G-E--_211_C18_F1_AE_CS_SP_S0Y with 300s (1) cores
% 88.57/14.54  % new_bool_1 with pid 2436640 completed with status 0
% 88.57/14.54  % Result found by new_bool_1
% 88.57/14.54  % Preprocessing class: FMLLMMLLSSSNFFN.
% 88.57/14.54  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 88.57/14.54  % Starting new_bool_3 with 900s (3) cores
% 88.57/14.54  % Starting new_bool_1 with 900s (3) cores
% 88.57/14.54  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 88.57/14.54  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 88.57/14.54  % Search class: FGHSM-SMLM32-MFFFFFNN
% 88.57/14.54  % Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 88.57/14.54  % Starting SubtermCWHack with 82s (1) cores
% 88.57/14.54  % Starting new_bool_1 with 91s (1) cores
% 88.57/14.54  % Starting C12_02_nc_SAT001_MinMin_p005000_rr with 68s (1) cores
% 88.57/14.54  % C12_02_nc_SAT001_MinMin_p005000_rr with pid 2436646 completed with status 0
% 88.57/14.54  % Result found by C12_02_nc_SAT001_MinMin_p005000_rr
% 88.57/14.54  % Preprocessing class: FMLLMMLLSSSNFFN.
% 88.57/14.54  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 88.57/14.54  % Starting new_bool_3 with 900s (3) cores
% 88.57/14.54  % Starting new_bool_1 with 900s (3) cores
% 88.57/14.54  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 88.57/14.54  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 88.57/14.54  % Search class: FGHSM-SMLM32-MFFFFFNN
% 88.57/14.54  % Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 88.57/14.54  % Starting SubtermCWHack with 82s (1) cores
% 88.57/14.54  % Starting new_bool_1 with 91s (1) cores
% 88.57/14.54  % Starting C12_02_nc_SAT001_MinMin_p005000_rr with 68s (1) cores
% 88.57/14.54  % Preprocessing time       : 0.171 s
% 88.57/14.54  % Presaturation interreduction done
% 88.57/14.54  
% 88.57/14.54  % Proof found!
% 88.57/14.54  % SZS status Theorem
% 88.57/14.54  % SZS output start CNFRefutation
% See solution above
% 88.57/14.54  % Parsed axioms                        : 19127
% 88.57/14.54  % Removed by relevancy pruning/SinE    : 16396
% 88.57/14.54  % Initial clauses                      : 6748
% 88.57/14.54  % Removed in clause preprocessing      : 177
% 88.57/14.54  % Initial clauses in saturation        : 6571
% 88.57/14.54  % Processed clauses                    : 25724
% 88.57/14.54  % ...of these trivial                  : 348
% 88.57/14.54  % ...subsumed                          : 13039
% 88.57/14.54  % ...remaining for further processing  : 12337
% 88.57/14.54  % Other redundant clauses eliminated   : 710
% 88.57/14.54  % Clauses deleted for lack of memory   : 0
% 88.57/14.54  % Backward-subsumed                    : 250
% 88.57/14.54  % Backward-rewritten                   : 183
% 88.57/14.54  % Generated clauses                    : 104113
% 88.57/14.54  % ...of the previous two non-redundant : 73746
% 88.57/14.54  % ...aggressively subsumed             : 0
% 88.57/14.54  % Contextual simplify-reflections      : 447
% 88.57/14.54  % Paramodulations                      : 103431
% 88.57/14.54  % Factorizations                       : 1
% 88.57/14.54  % NegExts                              : 0
% 88.57/14.54  % Equation resolutions                 : 718
% 88.57/14.54  % Disequality decompositions           : 0
% 88.57/14.54  % Total rewrite steps                  : 66706
% 88.57/14.54  % ...of those cached                   : 64507
% 88.57/14.54  % Propositional unsat checks           : 3
% 88.57/14.54  %    Propositional check models        : 2
% 88.57/14.54  %    Propositional check unsatisfiable : 0
% 88.57/14.54  %    Propositional clauses             : 0
% 88.57/14.54  %    Propositional clauses after purity: 0
% 88.57/14.54  %    Propositional unsat core size     : 0
% 88.57/14.54  %    Propositional preprocessing time  : 0.000
% 88.57/14.54  %    Propositional encoding time       : 0.141
% 88.57/14.54  %    Propositional solver time         : 0.082
% 88.57/14.54  %    Success case prop preproc time    : 0.000
% 88.57/14.54  %    Success case prop encoding time   : 0.000
% 88.57/14.54  %    Success case prop solver time     : 0.000
% 88.57/14.54  % Current number of processed clauses  : 5544
% 88.57/14.54  %    Positive orientable unit clauses  : 929
% 88.57/14.54  %    Positive unorientable unit clauses: 4
% 88.57/14.54  %    Negative unit clauses             : 946
% 88.57/14.54  %    Non-unit-clauses                  : 3665
% 88.57/14.54  % Current number of unprocessed clauses: 59385
% 88.57/14.54  % ...number of literals in the above   : 177014
% 88.57/14.54  % Current number of archived formulas  : 0
% 88.57/14.54  % Current number of archived clauses   : 6327
% 88.57/14.54  % Clause-clause subsumption calls (NU) : 29930339
% 88.57/14.54  % Rec. Clause-clause subsumption calls : 3211796
% 88.57/14.54  % Non-unit clause-clause subsumptions  : 6241
% 88.57/14.54  % Unit Clause-clause subsumption calls : 680679
% 88.57/14.54  % Rewrite failures with RHS unbound    : 12
% 88.57/14.54  % BW rewrite match attempts            : 646
% 88.57/14.54  % BW rewrite match successes           : 394
% 88.57/14.54  % Condensation attempts                : 0
% 88.57/14.54  % Condensation successes               : 0
% 88.57/14.54  % Termbank termtop insertions          : 2526133
% 88.57/14.54  % Search garbage collected termcells   : 281734
% 88.57/14.54  
% 88.57/14.54  % -------------------------------------------------
% 88.57/14.54  % User time                : 12.559 s
% 88.57/14.54  % System time              : 0.214 s
% 88.57/14.54  % Total time               : 12.773 s
% 88.57/14.54  % Maximum resident set size: 54708 pages
% 88.57/14.54  
% 88.57/14.54  % -------------------------------------------------
% 88.57/14.54  % User time                : 37.827 s
% 88.57/14.54  % System time              : 0.702 s
% 88.57/14.54  % Total time               : 38.529 s
% 88.57/14.54  % Maximum resident set size: 32768 pages
% 88.57/14.54  % E exiting
%------------------------------------------------------------------------------