↑ Up

ConnectPP---0.7.2.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : SYN014-1 : TPTP v9.3.1. Released v1.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 : n004.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:09:13 AM UTC 2026

% Result   : Unsatisfiable 33.07s 33.40s
% Output   : Proof 33.17s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(c_1,negated_conjecture,
    m != n,
    file('theBenchmark.p',c_1) ).

cnf(c_2,negated_conjecture,
    ( m = k
    | n = k ),
    file('theBenchmark.p',c_2) ).

cnf(c_3,negated_conjecture,
    ( element(Y,j)
    | Y != k
    | Y = j ),
    file('theBenchmark.p',c_3) ).

cnf(c_4,negated_conjecture,
    ( ~ element(Y,j)
    | Y = k
    | Y = j ),
    file('theBenchmark.p',c_4) ).

cnf(c_5,negated_conjecture,
    ( f(Y) != m
    | ~ element(Y,m)
    | Y = m ),
    file('theBenchmark.p',c_5) ).

cnf(c_6,negated_conjecture,
    ( f(Y) != Y
    | ~ element(Y,m)
    | Y = m ),
    file('theBenchmark.p',c_6) ).

cnf(c_7,negated_conjecture,
    ( element(Y,f(Y))
    | ~ element(Y,m)
    | Y = m ),
    file('theBenchmark.p',c_7) ).

cnf(c_8,negated_conjecture,
    ( element(f(Y),Y)
    | ~ element(Y,m)
    | Y = m ),
    file('theBenchmark.p',c_8) ).

cnf(c_9,negated_conjecture,
    ( ~ element(V1,Y)
    | ~ element(Y,V1)
    | V1 = Y
    | V1 = m
    | element(Y,m)
    | Y = m ),
    file('theBenchmark.p',c_9) ).

cnf(c_10,negated_conjecture,
    ( g(Y) != n
    | element(Y,n)
    | Y = n ),
    file('theBenchmark.p',c_10) ).

cnf(c_11,negated_conjecture,
    ( g(Y) != Y
    | element(Y,n)
    | Y = n ),
    file('theBenchmark.p',c_11) ).

cnf(c_12,negated_conjecture,
    ( element(Y,g(Y))
    | element(Y,n)
    | Y = n ),
    file('theBenchmark.p',c_12) ).

cnf(c_13,negated_conjecture,
    ( element(g(Y),Y)
    | element(Y,n)
    | Y = n ),
    file('theBenchmark.p',c_13) ).

cnf(c_14,negated_conjecture,
    ( ~ element(V,Y)
    | ~ element(Y,V)
    | V = Y
    | V = n
    | ~ element(Y,n)
    | Y = n ),
    file('theBenchmark.p',c_14) ).

cnf(c_15,negated_conjecture,
    ( element(Y,k)
    | Y != m
    | Y = k ),
    file('theBenchmark.p',c_15) ).

cnf(c_16,negated_conjecture,
    ( element(Y,k)
    | Y != n
    | Y = k ),
    file('theBenchmark.p',c_16) ).

cnf(c_17,negated_conjecture,
    ( ~ element(Y,k)
    | Y = n
    | Y = m
    | Y = k ),
    file('theBenchmark.p',c_17) ).

cnf(equality_1,axiom,
    Eq_x_0 = Eq_x_0,
    theory(equality,[reflexivity]) ).

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

cnf(equality_3,axiom,
    ( Eq_x_0 = Eq_x_2
    | Eq_x_1 != Eq_x_2
    | Eq_x_0 != Eq_x_1 ),
    theory(equality,[transitivity]) ).

cnf(equality_4,axiom,
    ( f(Eq_x_0) = f(Eq_y_0)
    | Eq_x_0 != Eq_y_0 ),
    theory(equality,[substitution_functions]) ).

cnf(equality_5,axiom,
    ( g(Eq_x_0) = g(Eq_y_0)
    | Eq_x_0 != Eq_y_0 ),
    theory(equality,[substitution_functions]) ).

cnf(equality_6,axiom,
    ( element(Eq_y_0,Eq_y_1)
    | ~ element(Eq_x_0,Eq_x_1)
    | Eq_x_1 != Eq_y_1
    | Eq_x_0 != Eq_y_0 ),
    theory(equality,[substitution_predicates]) ).

cnf(sat_proved,plain,
    $false,
    inference(cadical,[status(thm)],[]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN014-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03  This is a CNF_UNS_RFO_SEQ_NHN 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.11/0.37  % Computer : n004.cluster.edu
% 0.11/0.37  % Model    : x86_64 x86_64
% 0.11/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37  % Memory   : 8046.5625MB
% 0.11/0.37  % OS       : Linux 6.8.0-71-generic
% 0.11/0.37  % CPULimit : 300
% 0.11/0.37  % WCLimit  : 300
% 0.11/0.37  % DateTime : Sun Sep 20 06:22:19 UTC 2026
% 0.11/0.37  % CPUTime  : 
% 33.07/33.40  % SZS status Unsatisfiable for theBenchmark
% 33.07/33.40  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------