↑ Up

CSE_E---1.7.UNS-CRf.s

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

% Computer : n017.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:23:33 PM UTC 2026

% Result   : Unsatisfiable 1.24s 1.72s
% Output   : CNFRefutation 1.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   26 (  17 unt;   0 nHn;  16 RR)
%            Number of literals    :   42 (   8 equ;  18 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-3 aty)
%            Number of functors    :    5 (   5 usr;   3 con; 0-2 aty)
%            Number of variables   :   44 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(total_function2,axiom,
    ( X3 = X4
    | ~ product(X1,X2,X3)
    | ~ product(X1,X2,X4) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GRP003-0.ax',total_function2) ).

cnf(right_identity,axiom,
    product(X1,identity,X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/GRP003-0.ax',right_identity) ).

cnf(associativity2,axiom,
    ( product(X3,X4,X6)
    | ~ product(X1,X2,X3)
    | ~ product(X2,X4,X5)
    | ~ product(X1,X5,X6) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/GRP003-0.ax',associativity2) ).

cnf(a_multiply_b_is_identity,hypothesis,
    product(a,b,identity),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_multiply_b_is_identity) ).

cnf(total_function1,axiom,
    product(X1,X2,multiply(X1,X2)),
    file('/export/starexec/sandbox2/benchmark/Axioms/GRP003-0.ax',total_function1) ).

cnf(left_identity,axiom,
    product(identity,X1,X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/GRP003-0.ax',left_identity) ).

cnf(left_inverse,axiom,
    product(inverse(X1),X1,identity),
    file('/export/starexec/sandbox2/benchmark/Axioms/GRP003-0.ax',left_inverse) ).

cnf(prove_b_multiply_a_is_identity,negated_conjecture,
    ~ product(b,a,identity),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_b_multiply_a_is_identity) ).

cnf(c_0_8,axiom,
    ( X3 = X4
    | ~ product(X1,X2,X3)
    | ~ product(X1,X2,X4) ),
    total_function2 ).

cnf(c_0_9,axiom,
    product(X1,identity,X1),
    right_identity ).

cnf(c_0_10,axiom,
    ( product(X3,X4,X6)
    | ~ product(X1,X2,X3)
    | ~ product(X2,X4,X5)
    | ~ product(X1,X5,X6) ),
    associativity2 ).

cnf(c_0_11,hypothesis,
    product(a,b,identity),
    a_multiply_b_is_identity ).

cnf(c_0_12,plain,
    ( X1 = X2
    | ~ product(X2,identity,X1) ),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_13,axiom,
    product(X1,X2,multiply(X1,X2)),
    total_function1 ).

cnf(c_0_14,hypothesis,
    ( product(X1,b,X2)
    | ~ product(X3,identity,X2)
    | ~ product(X3,a,X1) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_15,plain,
    multiply(X1,identity) = X1,
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

cnf(c_0_16,axiom,
    product(identity,X1,X1),
    left_identity ).

cnf(c_0_17,hypothesis,
    ( product(X1,b,X2)
    | ~ product(X2,a,X1) ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_13]),c_0_15]) ).

cnf(c_0_18,axiom,
    product(inverse(X1),X1,identity),
    left_inverse ).

cnf(c_0_19,plain,
    ( X1 = X2
    | ~ product(identity,X2,X1) ),
    inference(spm,[status(thm)],[c_0_8,c_0_16]) ).

cnf(c_0_20,plain,
    ( X1 = multiply(X2,X3)
    | ~ product(X2,X3,X1) ),
    inference(spm,[status(thm)],[c_0_8,c_0_13]) ).

cnf(c_0_21,hypothesis,
    product(identity,b,inverse(a)),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_22,plain,
    multiply(identity,X1) = X1,
    inference(spm,[status(thm)],[c_0_19,c_0_13]) ).

cnf(c_0_23,hypothesis,
    inverse(a) = b,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_22]) ).

cnf(c_0_24,negated_conjecture,
    ~ product(b,a,identity),
    prove_b_multiply_a_is_identity ).

cnf(c_0_25,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_23]),c_0_24]),
    [proof] ).

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