↑ Up

ConnectPP---0.7.2.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : GRP702-10 : TPTP v9.3.1. Released v8.1.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 : n026.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:42:17 AM UTC 2026

% Result   : Unsatisfiable 23.46s 23.71s
% Output   : Proof 24.83s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(f01,axiom,
    mult(A,ld(A,B)) = B,
    file('theBenchmark.p',f01) ).

cnf(f02,axiom,
    ld(A,mult(A,B)) = B,
    file('theBenchmark.p',f02) ).

cnf(f03,axiom,
    mult(rd(A,B),B) = A,
    file('theBenchmark.p',f03) ).

cnf(f04,axiom,
    rd(mult(A,B),B) = A,
    file('theBenchmark.p',f04) ).

cnf(f05,axiom,
    mult(A,unit) = A,
    file('theBenchmark.p',f05) ).

cnf(f06,axiom,
    mult(unit,A) = A,
    file('theBenchmark.p',f06) ).

cnf(f07,axiom,
    mult(A,mult(B,mult(B,C))) = mult(mult(mult(A,B),B),C),
    file('theBenchmark.p',f07) ).

cnf(f08,axiom,
    mult(op_c,mult(A,B)) = mult(mult(op_c,A),B),
    file('theBenchmark.p',f08) ).

cnf(f09,axiom,
    mult(A,mult(B,op_c)) = mult(mult(A,B),op_c),
    file('theBenchmark.p',f09) ).

cnf(f10,axiom,
    mult(A,mult(op_c,B)) = mult(mult(A,op_c),B),
    file('theBenchmark.p',f10) ).

cnf(f11,axiom,
    op_d = ld(A,mult(op_c,A)),
    file('theBenchmark.p',f11) ).

cnf(f12,axiom,
    op_e = mult(mult(rd(op_c,mult(A,B)),B),A),
    file('theBenchmark.p',f12) ).

cnf(f13,axiom,
    op_f = mult(A,mult(B,ld(mult(A,B),op_c))),
    file('theBenchmark.p',f13) ).

cnf(goal,negated_conjecture,
    mult(op_d,mult(x0,x1)) != mult(mult(op_d,x0),x1),
    file('theBenchmark.p',goal) ).

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,
    ( ld(Eq_x_0,Eq_x_1) = ld(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,
    ( mult(Eq_x_0,Eq_x_1) = mult(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,
    ( rd(Eq_x_0,Eq_x_1) = rd(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.03  % Problem  : GRP702-10 : TPTP v9.3.1. Released v8.1.0.
% 0.00/0.03  This is a CNF_UNS_RFO_PEQ_UEQ 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/0.37  % Computer : n026.cluster.edu
% 0.10/0.37  % Model    : x86_64 x86_64
% 0.10/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37  % Memory   : 8046.5625MB
% 0.10/0.37  % OS       : Linux 6.8.0-71-generic
% 0.10/0.37  % CPULimit : 300
% 0.10/0.37  % WCLimit  : 300
% 0.10/0.37  % DateTime : Sat Sep 19 10:23:35 UTC 2026
% 0.10/0.37  % CPUTime  : 
% 23.46/23.71  % SZS status Unsatisfiable for theBenchmark
% 23.46/23.71  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------