↑ Up

ConnectPP---0.7.2.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : LDA007-3 : 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 : n005.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:26 AM UTC 2026

% Result   : Unsatisfiable 30.15s 30.49s
% Output   : Proof 30.25s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(a1,axiom,
    f(X,f(Y,Z)) = f(f(X,Y),f(X,Z)),
    file('theBenchmark.p',a1) ).

cnf(clause_1,axiom,
    tt = f(t,t),
    file('theBenchmark.p',clause_1) ).

cnf(clause_2,axiom,
    ts = f(t,s),
    file('theBenchmark.p',clause_2) ).

cnf(clause_3,axiom,
    tt_ts = f(tt,ts),
    file('theBenchmark.p',clause_3) ).

cnf(clause_4,axiom,
    tk = f(t,k),
    file('theBenchmark.p',clause_4) ).

cnf(clause_5,axiom,
    tsk = f(ts,k),
    file('theBenchmark.p',clause_5) ).

cnf(prove_equation,negated_conjecture,
    f(t,tsk) != f(tt_ts,tk),
    file('theBenchmark.p',prove_equation) ).

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,Eq_x_1) = f(Eq_y_0,Eq_y_1)
    | Eq_x_1 != Eq_y_1
    | 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.02  % Problem  : LDA007-3 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03  This is a CNF_UNS_RFO_PEQ_UEQ problem
% 0.00/0.03  % Command  : /export/starexec/sandbox2/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.08/0.35  % Computer : n005.cluster.edu
% 0.08/0.35  % Model    : x86_64 x86_64
% 0.08/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35  % Memory   : 8046.5625MB
% 0.08/0.35  % OS       : Linux 6.8.0-71-generic
% 0.08/0.35  % CPULimit : 300
% 0.08/0.35  % WCLimit  : 300
% 0.08/0.35  % DateTime : Sat Sep 19 16:03:33 UTC 2026
% 0.08/0.35  % CPUTime  : 
% 30.15/30.49  % SZS status Unsatisfiable for theBenchmark
% 30.15/30.49  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------