↑ Up

ConnectPP---0.7.2.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : COL033-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 : n002.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:14:22 AM UTC 2026

% Result   : Unsatisfiable 120.77s 121.05s
% Output   : Proof 122.87s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(b_definition,axiom,
    apply(apply(apply(b,X),Y),Z) = apply(X,apply(Y,Z)),
    file('theBenchmark.p',b_definition) ).

cnf(l_definition,axiom,
    apply(apply(l,X),Y) = apply(X,apply(Y,Y)),
    file('theBenchmark.p',l_definition) ).

cnf(m_definition,axiom,
    apply(m,X) = apply(X,X),
    file('theBenchmark.p',m_definition) ).

cnf(prove_fixed_point,negated_conjecture,
    apply(Y,f(Y)) != apply(f(Y),apply(Y,f(Y))),
    file('theBenchmark.p',prove_fixed_point) ).

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

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : COL033-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03  This is a CNF_UNS_RFO_PEQ_UEQ 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.09/0.36  % Computer : n002.cluster.edu
% 0.09/0.36  % Model    : x86_64 x86_64
% 0.09/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36  % Memory   : 8046.5625MB
% 0.09/0.36  % OS       : Linux 6.8.0-71-generic
% 0.09/0.36  % CPULimit : 300
% 0.09/0.36  % WCLimit  : 300
% 0.09/0.36  % DateTime : Sun Sep 20 14:37:46 UTC 2026
% 0.09/0.36  % CPUTime  : 
% 120.77/121.05  % SZS status Unsatisfiable for theBenchmark
% 120.77/121.05  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------