↑ Up

ConnectPP---0.7.2.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : MGT103+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 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 : n010.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:50:52 AM UTC 2026

% Result   : Unsatisfiable 0.22s 0.49s
% Output   : Proof 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    3
% Syntax   : Number of formulae    :   22 (  13 unt;   0 def)
%            Number of atoms       :   37 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   31 (  16   ~;  10   |;   4   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    7 (   3 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   20 (   0 sgn  16   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(irreflexive,axiom,
    ! [X] : ~ less(X,X),
    file('MGT002+0.ax',irreflexive) ).

fof(transitive,axiom,
    ! [X,Y,Z] :
      ( ( less(Y,Z)
        & less(X,Y) )
     => less(X,Z) ),
    file('MGT002+0.ax',transitive) ).

fof(contradiction,axiom,
    ( less(v600,v800)
    & less(v800,v600) ),
    file('theBenchmark.p',contradiction) ).

fof(f_1_1,plain,
    ! [X] : ~ less(X,X),
    inference(fof_nnf,[status(thm)],[irreflexive]) ).

fof(f_1_2,plain,
    ! [U_0] : ~ less(U_0,U_0),
    inference(variable_rename,[status(thm)],[f_1_1]) ).

fof(f_1_3,plain,
    ! [U_0] : ~ less(U_0,U_0),
    inference(definitional_conversion,[status(esa)],[f_1_2]) ).

cnf(f_1_4,plain,
    ~ less(U_0,U_0),
    inference(clausify,[status(thm)],[f_1_3]) ).

fof(f_2_1,plain,
    ! [X,Y,Z] :
      ( less(X,Z)
      | ~ less(Y,Z)
      | ~ less(X,Y) ),
    inference(fof_nnf,[status(thm)],[transitive]) ).

fof(f_2_2,plain,
    ! [U_3,U_2,U_1] :
      ( less(U_3,U_1)
      | ~ less(U_2,U_1)
      | ~ less(U_3,U_2) ),
    inference(variable_rename,[status(thm)],[f_2_1]) ).

fof(f_2_3,plain,
    ! [U_3,U_2,U_1] :
      ( less(U_3,U_1)
      | ~ less(U_2,U_1)
      | ~ less(U_3,U_2) ),
    inference(definitional_conversion,[status(esa)],[f_2_2]) ).

cnf(f_2_4,plain,
    ( less(U_3,U_1)
    | ~ less(U_2,U_1)
    | ~ less(U_3,U_2) ),
    inference(clausify,[status(thm)],[f_2_3]) ).

fof(f_34_1,plain,
    ( less(v600,v800)
    & less(v800,v600) ),
    inference(fof_nnf,[status(thm)],[contradiction]) ).

fof(f_34_2,plain,
    ( less(v600,v800)
    & less(v800,v600) ),
    inference(definitional_conversion,[status(esa)],[f_34_1]) ).

cnf(f_34_3,plain,
    less(v800,v600),
    inference(clausify,[status(thm)],[f_34_2]) ).

cnf(f_34_4,plain,
    less(v600,v800),
    inference(clausify,[status(thm)],[f_34_2]) ).

cnf(t1,plain,
    ~ less(v600,v600),
    inference(start,[status(thm),parent(0:0)],[f_1_4]) ).

cnf(t2,plain,
    ( ~ less(v800,v600)
    | ~ less(v600,v800)
    | less(v600,v600) ),
    inference(extension,[status(thm),parent(t1:1)],[f_2_4]) ).

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

cnf(t4,plain,
    less(v600,v800),
    inference(extension,[status(thm),parent(t2:2)],[f_34_4]) ).

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

cnf(t6,plain,
    less(v800,v600),
    inference(extension,[status(thm),parent(t2:3)],[f_34_3]) ).

cnf(t7,plain,
    $false,
    inference(connection,[status(thm),parent(t6:1)],[t6:1,t2:3]) ).


%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : MGT103+1 : TPTP v9.3.1. Bugfixed v9.3.1.
% 0.00/0.03  This is a FOF_UNS_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.36  % Computer : n010.cluster.edu
% 0.08/0.36  % Model    : x86_64 x86_64
% 0.08/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36  % Memory   : 8046.5625MB
% 0.08/0.36  % OS       : Linux 6.8.0-71-generic
% 0.08/0.36  % CPULimit : 300
% 0.08/0.36  % WCLimit  : 300
% 0.08/0.36  % DateTime : Sat Sep 19 16:21:38 UTC 2026
% 0.08/0.37  % CPUTime  : 
% 0.22/0.49  % SZS status Unsatisfiable for theBenchmark
% 0.22/0.49  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------