↑ Up

ConnectPP---0.7.2.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : GRP160-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% 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 : n011.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:41:29 AM UTC 2026

% Result   : Unsatisfiable 0.14s 0.39s
% Output   : Proof 0.14s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(left_identity,axiom,
    multiply(identity,X) = X,
    file('GRP004-0.ax',left_identity) ).

cnf(left_inverse,axiom,
    multiply(inverse(X),X) = identity,
    file('GRP004-0.ax',left_inverse) ).

cnf(associativity,axiom,
    multiply(multiply(X,Y),Z) = multiply(X,multiply(Y,Z)),
    file('GRP004-0.ax',associativity) ).

cnf(symmetry_of_glb,axiom,
    greatest_lower_bound(X,Y) = greatest_lower_bound(Y,X),
    file('GRP004-2.ax',symmetry_of_glb) ).

cnf(symmetry_of_lub,axiom,
    least_upper_bound(X,Y) = least_upper_bound(Y,X),
    file('GRP004-2.ax',symmetry_of_lub) ).

cnf(associativity_of_glb,axiom,
    greatest_lower_bound(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(greatest_lower_bound(X,Y),Z),
    file('GRP004-2.ax',associativity_of_glb) ).

cnf(associativity_of_lub,axiom,
    least_upper_bound(X,least_upper_bound(Y,Z)) = least_upper_bound(least_upper_bound(X,Y),Z),
    file('GRP004-2.ax',associativity_of_lub) ).

cnf(idempotence_of_lub,axiom,
    least_upper_bound(X,X) = X,
    file('GRP004-2.ax',idempotence_of_lub) ).

cnf(idempotence_of_gld,axiom,
    greatest_lower_bound(X,X) = X,
    file('GRP004-2.ax',idempotence_of_gld) ).

cnf(lub_absorbtion,axiom,
    least_upper_bound(X,greatest_lower_bound(X,Y)) = X,
    file('GRP004-2.ax',lub_absorbtion) ).

cnf(glb_absorbtion,axiom,
    greatest_lower_bound(X,least_upper_bound(X,Y)) = X,
    file('GRP004-2.ax',glb_absorbtion) ).

cnf(monotony_lub1,axiom,
    multiply(X,least_upper_bound(Y,Z)) = least_upper_bound(multiply(X,Y),multiply(X,Z)),
    file('GRP004-2.ax',monotony_lub1) ).

cnf(monotony_glb1,axiom,
    multiply(X,greatest_lower_bound(Y,Z)) = greatest_lower_bound(multiply(X,Y),multiply(X,Z)),
    file('GRP004-2.ax',monotony_glb1) ).

cnf(monotony_lub2,axiom,
    multiply(least_upper_bound(Y,Z),X) = least_upper_bound(multiply(Y,X),multiply(Z,X)),
    file('GRP004-2.ax',monotony_lub2) ).

cnf(monotony_glb2,axiom,
    multiply(greatest_lower_bound(Y,Z),X) = greatest_lower_bound(multiply(Y,X),multiply(Z,X)),
    file('GRP004-2.ax',monotony_glb2) ).

cnf(prove_ax_refla,negated_conjecture,
    least_upper_bound(a,a) != a,
    file('theBenchmark.p',prove_ax_refla) ).

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

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

cnf(equality_7,axiom,
    ( least_upper_bound(Eq_x_0,Eq_x_1) = least_upper_bound(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  : GRP160-1 : TPTP v9.3.1. Bugfixed v1.2.1.
% 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.09/0.36  % Computer : n011.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 : Sat Sep 19 08:52:24 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.14/0.39  % SZS status Unsatisfiable for theBenchmark
% 0.14/0.39  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------