↑ Up

ConnectPP---0.7.2.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : SWV145+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n011.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 09:02:48 AM UTC 2026

% Result   : Theorem 3.48s 18.87s
% Output   : Proof 3.48s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   18 (   9 unt;   0 def)
%            Number of atoms       :   33 (   0 equ)
%            Maximal formula atoms :    4 (   1 avg)
%            Number of connectives :   30 (  15   ~;   8   |;   5   &)
%                                         (   1 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    6 (   3 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-1 aty)
%            Number of variables   :   16 (   0 sgn  13   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(reflexivity_leq,axiom,
    ! [X] : leq(X,X),
    file('SWV003+0.ax',reflexivity_leq) ).

fof(leq_succ_succ,axiom,
    ! [X,Y] :
      ( leq(succ(X),succ(Y))
    <=> leq(X,Y) ),
    file('SWV003+0.ax',leq_succ_succ) ).

fof(gauss_array_0015,conjecture,
    ( ~ leq(tptp_float_0_001,tptp_float_0_001)
   => leq(n0,s_best7) ),
    file('theBenchmark.p',gauss_array_0015) ).

fof(f_4_1,plain,
    ! [X] : leq(X,X),
    inference(fof_nnf,[status(thm)],[reflexivity_leq]) ).

fof(f_4_2,plain,
    ! [U_6] : leq(U_6,U_6),
    inference(variable_rename,[status(thm)],[f_4_1]) ).

cnf(f_4_3,plain,
    leq(U_6,U_6),
    inference(clausify,[status(thm)],[f_4_2]) ).

fof(f_42_1,plain,
    ! [X,Y] :
      ( ( leq(succ(X),succ(Y))
        | ~ leq(X,Y) )
      & ( leq(X,Y)
        | ~ leq(succ(X),succ(Y)) ) ),
    inference(fof_nnf,[status(thm)],[leq_succ_succ]) ).

fof(f_42_2,plain,
    ! [U_141,U_140] :
      ( ( leq(succ(U_141),succ(U_140))
        | ~ leq(U_141,U_140) )
      & ( leq(U_141,U_140)
        | ~ leq(succ(U_141),succ(U_140)) ) ),
    inference(variable_rename,[status(thm)],[f_42_1]) ).

fof(f_42_3,plain,
    ( ! [U_145,U_143] :
        ( leq(succ(U_145),succ(U_143))
        | ~ leq(U_145,U_143) )
    & ! [U_144,U_142] :
        ( leq(U_144,U_142)
        | ~ leq(succ(U_144),succ(U_142)) ) ),
    inference(miniscope,[status(thm)],[f_42_2]) ).

cnf(f_42_4,plain,
    ( leq(U_144,U_142)
    | ~ leq(succ(U_144),succ(U_142)) ),
    inference(clausify,[status(thm)],[f_42_3]) ).

fof(f_53_1,negated_conjecture,
    ( ~ leq(n0,s_best7)
    & ~ leq(tptp_float_0_001,tptp_float_0_001) ),
    inference(negate,[status(cth)],[gauss_array_0015]) ).

fof(f_53_2,negated_conjecture,
    ( ~ leq(n0,s_best7)
    & ~ leq(tptp_float_0_001,tptp_float_0_001) ),
    inference(definitional_conversion,[status(esa)],[f_53_1]) ).

cnf(f_53_3,negated_conjecture,
    ~ leq(tptp_float_0_001,tptp_float_0_001),
    inference(clausify,[status(thm)],[f_53_2]) ).

cnf(t1,plain,
    ~ leq(tptp_float_0_001,tptp_float_0_001),
    inference(start,[status(thm),parent(0:0)],[f_53_3]) ).

cnf(t2,plain,
    ( ~ leq(succ(tptp_float_0_001),succ(tptp_float_0_001))
    | leq(tptp_float_0_001,tptp_float_0_001) ),
    inference(extension,[status(thm),parent(t1:1)],[f_42_4]) ).

cnf(t3,plain,
    $false,
    inference(connection,[status(thm),parent(t2:1)],[t2:1,t1:1]) ).

cnf(t4,plain,
    leq(succ(tptp_float_0_001),succ(tptp_float_0_001)),
    inference(extension,[status(thm),parent(t2:2)],[f_4_3]) ).

cnf(t5,plain,
    $false,
    inference(connection,[status(thm),parent(t4:1)],[t4:1,t2:2]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SWV145+1 : TPTP v9.3.1. Bugfixed v3.3.0.
% 0.00/0.03  This is a FOF_THM_RFO_SEQ problem
% 0.00/0.04  % Command  : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.34   % Computer : n011.cluster.edu
% 0.08/0.34   % Model    : x86_64 x86_64
% 0.08/0.34   % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.34   % Memory   : 8046.5625MB
% 0.08/0.34   % OS       : Linux 6.8.0-71-generic
% 0.07/15.63  % CPULimit : 300
% 0.07/15.63  % WCLimit  : 300
% 0.07/15.63  % DateTime : Sun Sep 20 03:05:01 UTC 2026
% 0.07/15.63  % CPUTime  : 
% 3.48/18.87  % SZS status Theorem for theBenchmark
% 3.48/18.87  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------