↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : GRP135-1.002 : TPTP v9.2.1. Released v1.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d

% Computer : n028.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue May  5 04:24:32 PM UTC 2026

% Result   : Unsatisfiable 1.26s 1.72s
% Output   : CNFRefutation 1.26s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   33 (  12 unt;  12 nHn;  33 RR)
%            Number of literals    :   69 (   0 equ;  28 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-3 aty)
%            Number of functors    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :   36 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(product_total_function1,axiom,
    ( product(X1,X2,e_1)
    | product(X1,X2,e_2)
    | ~ group_element(X1)
    | ~ group_element(X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',product_total_function1) ).

cnf(element_2,axiom,
    group_element(e_2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',element_2) ).

cnf(element_1,axiom,
    group_element(e_1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',element_1) ).

cnf(product_right_cancellation,axiom,
    ( equalish(X2,X4)
    | ~ product(X1,X2,X3)
    | ~ product(X1,X4,X3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',product_right_cancellation) ).

cnf(qg3,negated_conjecture,
    ( product(X4,X1,X2)
    | ~ product(X1,X2,X3)
    | ~ product(X3,X1,X4) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',qg3) ).

cnf(e_1_is_not_e_2,axiom,
    ~ equalish(e_1,e_2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',e_1_is_not_e_2) ).

cnf(product_left_cancellation,axiom,
    ( equalish(X1,X4)
    | ~ product(X1,X2,X3)
    | ~ product(X4,X2,X3) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',product_left_cancellation) ).

cnf(c_0_7,axiom,
    ( product(X1,X2,e_1)
    | product(X1,X2,e_2)
    | ~ group_element(X1)
    | ~ group_element(X2) ),
    product_total_function1 ).

cnf(c_0_8,axiom,
    group_element(e_2),
    element_2 ).

cnf(c_0_9,plain,
    ( product(X1,e_2,e_2)
    | product(X1,e_2,e_1)
    | ~ group_element(X1) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

cnf(c_0_10,axiom,
    group_element(e_1),
    element_1 ).

cnf(c_0_11,axiom,
    ( equalish(X2,X4)
    | ~ product(X1,X2,X3)
    | ~ product(X1,X4,X3) ),
    product_right_cancellation ).

cnf(c_0_12,plain,
    ( product(e_2,e_2,e_1)
    | product(e_2,e_2,e_2) ),
    inference(spm,[status(thm)],[c_0_9,c_0_8]) ).

cnf(c_0_13,plain,
    ( product(X1,e_1,e_2)
    | product(X1,e_1,e_1)
    | ~ group_element(X1) ),
    inference(spm,[status(thm)],[c_0_7,c_0_10]) ).

cnf(c_0_14,negated_conjecture,
    ( product(X4,X1,X2)
    | ~ product(X1,X2,X3)
    | ~ product(X3,X1,X4) ),
    qg3 ).

cnf(c_0_15,plain,
    ( product(e_2,e_2,e_2)
    | equalish(X1,e_2)
    | ~ product(e_2,X1,e_1) ),
    inference(spm,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_16,plain,
    ( product(e_2,e_1,e_1)
    | product(e_2,e_1,e_2) ),
    inference(spm,[status(thm)],[c_0_13,c_0_8]) ).

cnf(c_0_17,axiom,
    ~ equalish(e_1,e_2),
    e_1_is_not_e_2 ).

cnf(c_0_18,axiom,
    ( equalish(X1,X4)
    | ~ product(X1,X2,X3)
    | ~ product(X4,X2,X3) ),
    product_left_cancellation ).

cnf(c_0_19,negated_conjecture,
    ( product(e_2,e_2,e_2)
    | product(e_1,e_2,X1)
    | ~ product(e_2,X1,e_2) ),
    inference(spm,[status(thm)],[c_0_14,c_0_12]) ).

cnf(c_0_20,plain,
    ( product(e_2,e_1,e_2)
    | product(e_2,e_2,e_2) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).

cnf(c_0_21,plain,
    ( product(e_2,e_2,e_2)
    | equalish(X1,e_2)
    | ~ product(X1,e_2,e_1) ),
    inference(spm,[status(thm)],[c_0_18,c_0_12]) ).

cnf(c_0_22,negated_conjecture,
    ( product(e_1,e_2,e_1)
    | product(e_2,e_2,e_2) ),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_23,negated_conjecture,
    product(e_2,e_2,e_2),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_17]) ).

cnf(c_0_24,negated_conjecture,
    ( equalish(X1,e_2)
    | ~ product(e_2,X1,e_2) ),
    inference(spm,[status(thm)],[c_0_11,c_0_23]) ).

cnf(c_0_25,negated_conjecture,
    ~ product(e_2,e_1,e_2),
    inference(spm,[status(thm)],[c_0_17,c_0_24]) ).

cnf(c_0_26,plain,
    product(e_2,e_1,e_1),
    inference(sr,[status(thm)],[c_0_16,c_0_25]) ).

cnf(c_0_27,plain,
    ( equalish(X1,e_2)
    | ~ product(X1,e_1,e_1) ),
    inference(spm,[status(thm)],[c_0_18,c_0_26]) ).

cnf(c_0_28,plain,
    ( product(e_1,e_1,e_1)
    | product(e_1,e_1,e_2) ),
    inference(spm,[status(thm)],[c_0_13,c_0_10]) ).

cnf(c_0_29,plain,
    ~ product(e_1,e_1,e_1),
    inference(spm,[status(thm)],[c_0_17,c_0_27]) ).

cnf(c_0_30,negated_conjecture,
    ( product(e_1,e_1,X1)
    | ~ product(e_1,X1,e_2) ),
    inference(spm,[status(thm)],[c_0_14,c_0_26]) ).

cnf(c_0_31,plain,
    product(e_1,e_1,e_2),
    inference(sr,[status(thm)],[c_0_28,c_0_29]) ).

cnf(c_0_32,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_29]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : GRP135-1.002 : TPTP v9.2.1. Released v1.2.0.
% 0.00/0.12  % Command    : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.14/0.33  % Computer : n028.cluster.edu
% 0.14/0.33  % Model    : x86_64 x86_64
% 0.14/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33  % Memory   : 8042.1875MB
% 0.14/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33  % CPULimit   : 300
% 0.14/0.33  % WCLimit    : 300
% 0.14/0.33  % DateTime   : Mon May  4 18:25:00 EDT 2026
% 0.14/0.33  % CPUTime    : 
% 0.14/0.34  % start to proof: theBenchmark
% 1.26/1.72  % Version  : CSE_E---1.7
% 1.26/1.72  % Problem  : theBenchmark.p
% 1.26/1.72  % SZS status Unsatisfiable for theBenchmark.p
% 1.26/1.72  % SZS output start CNFRefutation
% See solution above
% 1.26/1.72  % Total time : 1.373s
%------------------------------------------------------------------------------