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

% Computer : n013.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:00:41 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(cl5_nebula_norm_0004,conjecture,
    ( ( ! [X18] :
          ( ( leq(X18,pred(pv10))
            & leq(n0,X18) )
         => sum(n0,n4,a_select3(q,X18,tptp_sum_index)) = n1 )
      & ! [X14] :
          ( ( leq(X14,pred(pv12))
            & leq(n0,X14) )
         => a_select3(q,pv10,X14) = divide(sqrt(times(minus(a_select3(center,X14,n0),a_select2(x,pv10)),minus(a_select3(center,X14,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))) )
      & leq(pv12,n4)
      & leq(pv10,n135299)
      & leq(n0,pv12)
      & leq(n0,pv10)
      & pv70 = sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10))))) )
   => ! [X4] :
        ( ( leq(X4,pv12)
          & leq(n0,X4) )
       => ( pv12 = X4
         => divide(sqrt(times(minus(a_select3(center,pv12,n0),a_select2(x,pv10)),minus(a_select3(center,pv12,n0),a_select2(x,pv10)))),pv70) = divide(sqrt(times(minus(a_select3(center,X4,n0),a_select2(x,pv10)),minus(a_select3(center,X4,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cl5_nebula_norm_0004) ).

fof(c_0_1,negated_conjecture,
    ~ ( ( ! [X18] :
            ( ( leq(X18,pred(pv10))
              & leq(n0,X18) )
           => sum(n0,n4,a_select3(q,X18,tptp_sum_index)) = n1 )
        & ! [X14] :
            ( ( leq(X14,pred(pv12))
              & leq(n0,X14) )
           => a_select3(q,pv10,X14) = divide(sqrt(times(minus(a_select3(center,X14,n0),a_select2(x,pv10)),minus(a_select3(center,X14,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))) )
        & leq(pv12,n4)
        & leq(pv10,n135299)
        & leq(n0,pv12)
        & leq(n0,pv10)
        & pv70 = sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10))))) )
     => ! [X4] :
          ( ( leq(X4,pv12)
            & leq(n0,X4) )
         => ( pv12 = X4
           => divide(sqrt(times(minus(a_select3(center,pv12,n0),a_select2(x,pv10)),minus(a_select3(center,pv12,n0),a_select2(x,pv10)))),pv70) = divide(sqrt(times(minus(a_select3(center,X4,n0),a_select2(x,pv10)),minus(a_select3(center,X4,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))) ) ) ),
    inference(assume_negation,[status(cth)],[cl5_nebula_norm_0004]) ).

fof(c_0_2,negated_conjecture,
    ! [X28,X29] :
      ( divide(sqrt(times(minus(a_select3(center,pv12,n0),a_select2(x,pv10)),minus(a_select3(center,pv12,n0),a_select2(x,pv10)))),pv70) != divide(sqrt(times(minus(a_select3(center,esk1_0,n0),a_select2(x,pv10)),minus(a_select3(center,esk1_0,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10))))))
      & pv12 = esk1_0
      & leq(esk1_0,pv12)
      & leq(n0,esk1_0)
      & ( sum(n0,n4,a_select3(q,X29,tptp_sum_index)) = n1
        | ~ leq(X29,pred(pv10))
        | ~ leq(n0,X29) )
      & ( a_select3(q,pv10,X28) = divide(sqrt(times(minus(a_select3(center,X28,n0),a_select2(x,pv10)),minus(a_select3(center,X28,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10))))))
        | ~ leq(X28,pred(pv12))
        | ~ leq(n0,X28) )
      & leq(pv12,n4)
      & leq(pv10,n135299)
      & leq(n0,pv12)
      & leq(n0,pv10)
      & pv70 = sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10))))) ),
    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_1])])])])]) ).

cnf(c_0_3,negated_conjecture,
    divide(sqrt(times(minus(a_select3(center,pv12,n0),a_select2(x,pv10)),minus(a_select3(center,pv12,n0),a_select2(x,pv10)))),pv70) != divide(sqrt(times(minus(a_select3(center,esk1_0,n0),a_select2(x,pv10)),minus(a_select3(center,esk1_0,n0),a_select2(x,pv10)))),sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)))))),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_4,negated_conjecture,
    pv12 = esk1_0,
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_5,negated_conjecture,
    pv70 = sum(n0,n4,sqrt(times(minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10)),minus(a_select3(center,tptp_sum_index,n0),a_select2(x,pv10))))),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

cnf(c_0_6,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_3,c_0_4]),c_0_4]),c_0_5])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWV154+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.35  % Computer : n013.cluster.edu
% 0.08/0.35  % Model    : x86_64 x86_64
% 0.08/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35  % Memory   : 8046.5625MB
% 0.08/0.35  % OS       : Linux 6.8.0-71-generic
% 0.08/0.35  % CPULimit : 300
% 0.08/0.35  % WCLimit  : 300
% 0.08/0.35  % DateTime : Mon Sep 21 08:32:51 UTC 2026
% 0.08/0.35  % CPUTime  : 
% 0.08/0.35  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.39  Running first-order theorem proving
% 0.12/0.39  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
% 0.12/0.43  % Version: 3.5.1
% 0.12/0.43  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.12/0.43  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.43  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.12/0.43  % Starting new_bool_3 with 300s (1) cores
% 0.12/0.43  % Starting new_bool_1 with 300s (1) cores
% 0.12/0.43  % Starting sh5l with 300s (1) cores
% 0.12/0.43  % new_bool_3 with pid 370748 completed with status 0
% 0.12/0.43  % Result found by new_bool_3
% 0.12/0.43  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.12/0.43  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.43  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.12/0.43  % Starting new_bool_3 with 300s (1) cores
% 0.12/0.43  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/0.43  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.43  % Search class: FGUSM-FFMM31-DFFFFFNN
% 0.12/0.43  % partial match(1): FGHSM-FFMM31-DFFFFFNN
% 0.12/0.43  % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.43  % Starting SubtermCWHack with 31s (1) cores
% 0.12/0.43  % SubtermCWHack with pid 370753 completed with status 0
% 0.12/0.43  % Result found by SubtermCWHack
% 0.12/0.43  % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.12/0.43  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.12/0.43  % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.12/0.43  % Starting new_bool_3 with 300s (1) cores
% 0.12/0.43  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.12/0.43  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.12/0.43  % Search class: FGUSM-FFMM31-DFFFFFNN
% 0.12/0.43  % partial match(1): FGHSM-FFMM31-DFFFFFNN
% 0.12/0.43  % Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.12/0.43  % Starting SubtermCWHack with 31s (1) cores
% 0.12/0.43  % Preprocessing time       : 0.002 s
% 0.12/0.43  
% 0.12/0.43  % Proof found!
% 0.12/0.43  % SZS status Theorem
% 0.12/0.43  % SZS output start CNFRefutation
% See solution above
% 0.12/0.43  % Parsed axioms                        : 92
% 0.12/0.43  % Removed by relevancy pruning/SinE    : 23
% 0.12/0.43  % Initial clauses                      : 82
% 0.12/0.43  % Removed in clause preprocessing      : 0
% 0.12/0.43  % Initial clauses in saturation        : 82
% 0.12/0.43  % Processed clauses                    : 352
% 0.12/0.43  % ...of these trivial                  : 2
% 0.12/0.43  % ...subsumed                          : 125
% 0.12/0.43  % ...remaining for further processing  : 224
% 0.12/0.43  % Other redundant clauses eliminated   : 0
% 0.12/0.43  % Clauses deleted for lack of memory   : 0
% 0.12/0.43  % Backward-subsumed                    : 1
% 0.12/0.43  % Backward-rewritten                   : 12
% 0.12/0.43  % Generated clauses                    : 837
% 0.12/0.43  % ...of the previous two non-redundant : 548
% 0.12/0.43  % ...aggressively subsumed             : 0
% 0.12/0.43  % Contextual simplify-reflections      : 0
% 0.12/0.43  % Paramodulations                      : 835
% 0.12/0.43  % Factorizations                       : 2
% 0.12/0.43  % NegExts                              : 0
% 0.12/0.43  % Equation resolutions                 : 0
% 0.12/0.43  % Disequality decompositions           : 0
% 0.12/0.43  % Total rewrite steps                  : 409
% 0.12/0.43  % ...of those cached                   : 341
% 0.12/0.43  % Propositional unsat checks           : 0
% 0.12/0.43  %    Propositional check models        : 0
% 0.12/0.43  %    Propositional check unsatisfiable : 0
% 0.12/0.43  %    Propositional clauses             : 0
% 0.12/0.43  %    Propositional clauses after purity: 0
% 0.12/0.43  %    Propositional unsat core size     : 0
% 0.12/0.43  %    Propositional preprocessing time  : 0.000
% 0.12/0.43  %    Propositional encoding time       : 0.000
% 0.12/0.43  %    Propositional solver time         : 0.000
% 0.12/0.43  %    Success case prop preproc time    : 0.000
% 0.12/0.43  %    Success case prop encoding time   : 0.000
% 0.12/0.43  %    Success case prop solver time     : 0.000
% 0.12/0.43  % Current number of processed clauses  : 211
% 0.12/0.43  %    Positive orientable unit clauses  : 91
% 0.12/0.43  %    Positive unorientable unit clauses: 0
% 0.12/0.43  %    Negative unit clauses             : 29
% 0.12/0.43  %    Non-unit-clauses                  : 91
% 0.12/0.43  % Current number of unprocessed clauses: 278
% 0.12/0.43  % ...number of literals in the above   : 732
% 0.12/0.43  % Current number of archived formulas  : 0
% 0.12/0.43  % Current number of archived clauses   : 13
% 0.12/0.43  % Clause-clause subsumption calls (NU) : 1796
% 0.12/0.43  % Rec. Clause-clause subsumption calls : 1716
% 0.12/0.43  % Non-unit clause-clause subsumptions  : 27
% 0.12/0.43  % Unit Clause-clause subsumption calls : 423
% 0.12/0.43  % Rewrite failures with RHS unbound    : 0
% 0.12/0.43  % BW rewrite match attempts            : 12
% 0.12/0.43  % BW rewrite match successes           : 7
% 0.12/0.43  % Condensation attempts                : 0
% 0.12/0.43  % Condensation successes               : 0
% 0.12/0.43  % Termbank termtop insertions          : 11355
% 0.12/0.43  % Search garbage collected termcells   : 742
% 0.12/0.43  
% 0.12/0.43  % -------------------------------------------------
% 0.12/0.43  % User time                : 0.018 s
% 0.12/0.43  % System time              : 0.005 s
% 0.12/0.43  % Total time               : 0.023 s
% 0.12/0.43  % Maximum resident set size: 3748 pages
% 0.12/0.43  
% 0.12/0.43  % -------------------------------------------------
% 0.12/0.43  % User time                : 0.022 s
% 0.12/0.43  % System time              : 0.010 s
% 0.12/0.43  % Total time               : 0.032 s
% 0.12/0.43  % Maximum resident set size: 4864 pages
% 0.12/0.43  % E exiting
%------------------------------------------------------------------------------