↑ Up

ConnectPP---0.7.2.UNS-Prf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : ConnectPP---0.7.2
% Problem  : GRP039-4 : 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 : 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 08:41:11 AM UTC 2026

% Result   : Unsatisfiable 267.48s 267.89s
% Output   : Proof 270.02s
% Verified : 
% SZS Type : ERROR: Analysing output (MakeTreeStats fails)

% Comments : 
%------------------------------------------------------------------------------
cnf(left_identity,axiom,
    product(identity,X,X),
    file('GRP003-0.ax',left_identity) ).

cnf(right_identity,axiom,
    product(X,identity,X),
    file('GRP003-0.ax',right_identity) ).

cnf(left_inverse,axiom,
    product(inverse(X),X,identity),
    file('GRP003-0.ax',left_inverse) ).

cnf(right_inverse,axiom,
    product(X,inverse(X),identity),
    file('GRP003-0.ax',right_inverse) ).

cnf(total_function1,axiom,
    product(X,Y,multiply(X,Y)),
    file('GRP003-0.ax',total_function1) ).

cnf(total_function2,axiom,
    ( Z = W
    | ~ product(X,Y,W)
    | ~ product(X,Y,Z) ),
    file('GRP003-0.ax',total_function2) ).

cnf(associativity1,axiom,
    ( product(X,V,W)
    | ~ product(U,Z,W)
    | ~ product(Y,Z,V)
    | ~ product(X,Y,U) ),
    file('GRP003-0.ax',associativity1) ).

cnf(associativity2,axiom,
    ( product(U,Z,W)
    | ~ product(X,V,W)
    | ~ product(Y,Z,V)
    | ~ product(X,Y,U) ),
    file('GRP003-0.ax',associativity2) ).

cnf(closure_of_inverse,axiom,
    ( subgroup_member(inverse(X))
    | ~ subgroup_member(X) ),
    file('GRP003-1.ax',closure_of_inverse) ).

cnf(closure_of_product,axiom,
    ( subgroup_member(C)
    | ~ product(A,B,C)
    | ~ subgroup_member(B)
    | ~ subgroup_member(A) ),
    file('GRP003-1.ax',closure_of_product) ).

cnf(identity_is_in_subgroup,axiom,
    subgroup_member(identity),
    file('theBenchmark.p',identity_is_in_subgroup) ).

cnf(an_element_in_O2,axiom,
    ( subgroup_member(A)
    | subgroup_member(B)
    | subgroup_member(element_in_O2(A,B)) ),
    file('theBenchmark.p',an_element_in_O2) ).

cnf(property_of_O2,axiom,
    ( subgroup_member(A)
    | subgroup_member(B)
    | product(A,element_in_O2(A,B),B) ),
    file('theBenchmark.p',property_of_O2) ).

cnf(b_is_in_subgroup,negated_conjecture,
    subgroup_member(b),
    file('theBenchmark.p',b_is_in_subgroup) ).

cnf(b_times_a_inverse_is_c,negated_conjecture,
    product(b,inverse(a),c),
    file('theBenchmark.p',b_times_a_inverse_is_c) ).

cnf(a_times_c_is_d,negated_conjecture,
    product(a,c,d),
    file('theBenchmark.p',a_times_c_is_d) ).

cnf(prove_d_is_in_subgroup,negated_conjecture,
    ~ subgroup_member(d),
    file('theBenchmark.p',prove_d_is_in_subgroup) ).

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

cnf(equality_5,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_6,axiom,
    ( element_in_O2(Eq_x_0,Eq_x_1) = element_in_O2(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,
    ( product(Eq_y_0,Eq_y_1,Eq_y_2)
    | ~ product(Eq_x_0,Eq_x_1,Eq_x_2)
    | Eq_x_2 != Eq_y_2
    | Eq_x_1 != Eq_y_1
    | Eq_x_0 != Eq_y_0 ),
    theory(equality,[substitution_predicates]) ).

cnf(equality_8,axiom,
    ( subgroup_member(Eq_y_0)
    | ~ subgroup_member(Eq_x_0)
    | 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.02  % Problem  : GRP039-4 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03  This is a CNF_UNS_RFO_SEQ_NHN problem
% 0.00/0.03  % Command  : /export/starexec/sandbox/solver/bin/connect++ --verbosity 1 --no-colour --tptp-proof --schedule default --timeout 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.35  % Computer : n016.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 08:39:51 UTC 2026
% 0.08/0.35  % CPUTime  : 
% 267.48/267.89  % SZS status Unsatisfiable for theBenchmark
% 267.48/267.89  % SZS output start Proof for theBenchmark
% See solution above
%------------------------------------------------------------------------------