↑ Up

ConnectPP---0.7.2.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : NUM425+3 : TPTP v9.3.1. Released v4.0.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 : n014.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 08:52:12 AM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
fof(m__724,hypothesis,
    ( sdteqdtlpzmzozddtrp0(xa,xb,xq)
    & aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
    & ? [W0] :
        ( sdtasdt0(xq,W0) = sdtpldt0(xa,smndt0(xb))
        & aInteger0(W0) ) ),
    file('theBenchmark.p',m__724) ).

fof(m__,conjecture,
    ? [W0] :
      ( sdtasdt0(xq,W0) = sdtpldt0(xa,smndt0(xb))
      & aInteger0(W0) ),
    file('theBenchmark.p',m__) ).

fof(f_22_1,plain,
    ( sdteqdtlpzmzozddtrp0(xa,xb,xq)
    & aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
    & ? [W0] :
        ( sdtasdt0(xq,W0) = sdtpldt0(xa,smndt0(xb))
        & aInteger0(W0) ) ),
    inference(fof_nnf,[status(thm)],[m__724]) ).

fof(f_22_2,plain,
    ( sdteqdtlpzmzozddtrp0(xa,xb,xq)
    & aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
    & ? [U_37] :
        ( sdtasdt0(xq,U_37) = sdtpldt0(xa,smndt0(xb))
        & aInteger0(U_37) ) ),
    inference(variable_rename,[status(thm)],[f_22_1]) ).

fof(f_22_3,plain,
    ( sdteqdtlpzmzozddtrp0(xa,xb,xq)
    & aDivisorOf0(xq,sdtpldt0(xa,smndt0(xb)))
    & sdtasdt0(xq,sK2) = sdtpldt0(xa,smndt0(xb))
    & aInteger0(sK2) ),
    inference(skolemize,[status(esa),new_symbols(skolem,[sK2]),skolemize(U_37,sK2)],[f_22_2]) ).

cnf(f_22_4,plain,
    aInteger0(sK2),
    inference(clausify,[status(thm)],[f_22_3]) ).

cnf(f_22_5,plain,
    sdtasdt0(xq,sK2) = sdtpldt0(xa,smndt0(xb)),
    inference(clausify,[status(thm)],[f_22_3]) ).

fof(f_23_1,negated_conjecture,
    ~ ? [W0] :
        ( sdtasdt0(xq,W0) = sdtpldt0(xa,smndt0(xb))
        & aInteger0(W0) ),
    inference(negate,[status(cth)],[m__]) ).

fof(f_23_2,negated_conjecture,
    ! [W0] :
      ( sdtasdt0(xq,W0) != sdtpldt0(xa,smndt0(xb))
      | ~ aInteger0(W0) ),
    inference(fof_nnf,[status(thm)],[f_23_1]) ).

fof(f_23_3,negated_conjecture,
    ! [U_38] :
      ( sdtasdt0(xq,U_38) != sdtpldt0(xa,smndt0(xb))
      | ~ aInteger0(U_38) ),
    inference(variable_rename,[status(thm)],[f_23_2]) ).

fof(f_23_4,negated_conjecture,
    ! [U_38] :
      ( sdtasdt0(xq,U_38) != sdtpldt0(xa,smndt0(xb))
      | ~ aInteger0(U_38) ),
    inference(definitional_conversion,[status(esa)],[f_23_3]) ).

cnf(f_23_5,negated_conjecture,
    ( sdtasdt0(xq,U_38) != sdtpldt0(xa,smndt0(xb))
    | ~ aInteger0(U_38) ),
    inference(clausify,[status(thm)],[f_23_4]) ).

cnf(t1,plain,
    ( sdtasdt0(xq,sK2) != sdtpldt0(xa,smndt0(xb))
    | ~ aInteger0(sK2) ),
    inference(start,[status(thm),parent(0:0)],[f_23_5]) ).

cnf(t2,plain,
    aInteger0(sK2),
    inference(extension,[status(thm),parent(t1:1)],[f_22_4]) ).

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

cnf(t4,plain,
    sdtasdt0(xq,sK2) = sdtpldt0(xa,smndt0(xb)),
    inference(extension,[status(thm),parent(t1:2)],[f_22_5]) ).

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


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : NUM425+3 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.03  This is a FOF_THM_RFO_SEQ problem
% 0.00/0.03  % 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 : n014.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.08/0.34  % CPULimit : 300
% 0.08/0.34  % WCLimit  : 300
% 0.08/0.34  % DateTime : Sat Sep 19 18:23:35 UTC 2026
% 0.08/0.35  % CPUTime  : 
% 0.13/0.41  % SZS status Theorem for theBenchmark
% 0.13/0.41  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------