↑ Up

ConnectPP---0.7.2.THM-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : NUM490+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 : 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 08:52:23 AM UTC 2026

% Result   : Theorem 30.16s 30.40s
% Output   : Proof 30.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   15 (   9 unt;   0 def)
%            Number of atoms       :   21 (  19 equ)
%            Maximal formula atoms :    2 (   1 avg)
%            Number of connectives :   15 (   9   ~;   4   |;   2   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    3 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :    2 (   0 sgn   0   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(m__1951,hypothesis,
    sdtasdt0(xn,xm) = sdtpldt0(sdtasdt0(xp,xm),sdtasdt0(xr,xm)),
    file('theBenchmark.p',m__1951) ).

fof(m__,conjecture,
    ( sdtasdt0(xr,xm) = sdtmndt0(sdtasdt0(xn,xm),sdtasdt0(xp,xm))
    | sdtpldt0(sdtasdt0(xp,xm),sdtasdt0(xr,xm)) = sdtasdt0(xn,xm) ),
    file('theBenchmark.p',m__) ).

fof(f_46_1,plain,
    sdtasdt0(xn,xm) = sdtpldt0(sdtasdt0(xp,xm),sdtasdt0(xr,xm)),
    inference(fof_nnf,[status(thm)],[m__1951]) ).

fof(f_46_2,plain,
    sdtasdt0(xn,xm) = sdtpldt0(sdtasdt0(xp,xm),sdtasdt0(xr,xm)),
    inference(definitional_conversion,[status(esa)],[f_46_1]) ).

cnf(f_46_3,plain,
    sdtasdt0(xn,xm) = sdtpldt0(sdtasdt0(xp,xm),sdtasdt0(xr,xm)),
    inference(clausify,[status(thm)],[f_46_2]) ).

fof(f_47_1,negated_conjecture,
    ~ ( sdtasdt0(xr,xm) = sdtmndt0(sdtasdt0(xn,xm),sdtasdt0(xp,xm))
      | sdtpldt0(sdtasdt0(xp,xm),sdtasdt0(xr,xm)) = sdtasdt0(xn,xm) ),
    inference(negate,[status(cth)],[m__]) ).

fof(f_47_2,negated_conjecture,
    ( sdtasdt0(xr,xm) != sdtmndt0(sdtasdt0(xn,xm),sdtasdt0(xp,xm))
    & sdtpldt0(sdtasdt0(xp,xm),sdtasdt0(xr,xm)) != sdtasdt0(xn,xm) ),
    inference(fof_nnf,[status(thm)],[f_47_1]) ).

fof(f_47_3,negated_conjecture,
    ( sdtasdt0(xr,xm) != sdtmndt0(sdtasdt0(xn,xm),sdtasdt0(xp,xm))
    & sdtpldt0(sdtasdt0(xp,xm),sdtasdt0(xr,xm)) != sdtasdt0(xn,xm) ),
    inference(definitional_conversion,[status(esa)],[f_47_2]) ).

cnf(f_47_4,negated_conjecture,
    sdtpldt0(sdtasdt0(xp,xm),sdtasdt0(xr,xm)) != sdtasdt0(xn,xm),
    inference(clausify,[status(thm)],[f_47_3]) ).

cnf(equality_2,axiom,
    ( Eq_x_1 = Eq_x_0
    | Eq_x_0 != Eq_x_1 ),
    theory(equality,[symmetry]) ).

cnf(t1,plain,
    sdtpldt0(sdtasdt0(xp,xm),sdtasdt0(xr,xm)) != sdtasdt0(xn,xm),
    inference(start,[status(thm),parent(0:0)],[f_47_4]) ).

cnf(t2,plain,
    ( sdtasdt0(xn,xm) != sdtpldt0(sdtasdt0(xp,xm),sdtasdt0(xr,xm))
    | sdtpldt0(sdtasdt0(xp,xm),sdtasdt0(xr,xm)) = sdtasdt0(xn,xm) ),
    inference(extension,[status(thm),parent(t1:1)],[equality_2]) ).

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

cnf(t4,plain,
    sdtasdt0(xn,xm) = sdtpldt0(sdtasdt0(xp,xm),sdtasdt0(xr,xm)),
    inference(extension,[status(thm),parent(t2:2)],[f_46_3]) ).

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


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : NUM490+3 : TPTP v9.3.1. Released v4.0.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.07/0.34  % Computer : n001.cluster.edu
% 0.07/0.34  % Model    : x86_64 x86_64
% 0.07/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.34  % Memory   : 8046.5625MB
% 0.07/0.34  % OS       : Linux 6.8.0-71-generic
% 0.07/0.35  % CPULimit : 300
% 0.07/0.35  % WCLimit  : 300
% 0.07/0.35  % DateTime : Sat Sep 19 18:41:54 UTC 2026
% 0.07/0.35  % CPUTime  : 
% 30.16/30.40  % SZS status Theorem for theBenchmark
% 30.16/30.40  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------