↑ Up

ConnectPP---0.7.2.UNS-Prf.s

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

% Computer : n016.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:25 AM UTC 2026

% Result   : Unsatisfiable 7.33s 17.66s
% Output   : Proof 7.44s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(clause_1,axiom,
    ( X = Y
    | ~ big_f(X,f(Y)) ),
    file('theBenchmark.p',clause_1) ).

cnf(clause_2,axiom,
    ( big_f(X,f(Y))
    | X != Y ),
    file('theBenchmark.p',clause_2) ).

cnf(clause_3,negated_conjecture,
    ( big_f(g(X,Y),Y)
    | ~ big_f(X,Y)
    | ~ big_f(X,a) ),
    file('theBenchmark.p',clause_3) ).

cnf(clause_4,negated_conjecture,
    ( ~ big_f(Z,Y)
    | ~ big_f(Z,g(X,Y))
    | ~ big_f(X,Y)
    | ~ big_f(X,a) ),
    file('theBenchmark.p',clause_4) ).

cnf(clause_5,negated_conjecture,
    ( big_f(X,a)
    | big_f(X,h(X)) ),
    file('theBenchmark.p',clause_5) ).

cnf(clause_6,negated_conjecture,
    ( big_f(Y,a)
    | big_f(i(Y,X),X)
    | ~ big_f(X,h(Y)) ),
    file('theBenchmark.p',clause_6) ).

cnf(clause_7,negated_conjecture,
    ( ~ big_f(Y,h(X))
    | big_f(i(X,Y),h(X))
    | big_f(X,a) ),
    file('theBenchmark.p',clause_7) ).

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,Eq_x_1) = g(Eq_y_0,Eq_y_1)
    | Eq_x_1 != Eq_y_1
    | Eq_x_0 != Eq_y_0 ),
    theory(equality,[substitution_functions]) ).

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

cnf(equality_7,axiom,
    ( i(Eq_x_0,Eq_x_1) = i(Eq_y_0,Eq_y_1)
    | Eq_x_1 != Eq_y_1
    | Eq_x_0 != Eq_y_0 ),
    theory(equality,[substitution_functions]) ).

cnf(equality_8,axiom,
    ( big_f(Eq_y_0,Eq_y_1)
    | ~ big_f(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  : SYN077-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/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/10.38  % Computer : n016.cluster.edu
% 0.10/10.38  % Model    : x86_64 x86_64
% 0.10/10.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/10.38  % Memory   : 8046.5625MB
% 0.10/10.38  % OS       : Linux 6.8.0-71-generic
% 0.10/10.38  % CPULimit : 300
% 0.10/10.38  % WCLimit  : 300
% 0.10/10.38  % DateTime : Sun Sep 20 06:29:01 UTC 2026
% 0.10/10.38  % CPUTime  : 
% 7.33/17.66  % SZS status Unsatisfiable for theBenchmark
% 7.33/17.66  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------