↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : BOO012-3 : TPTP v9.2.1. Bugfixed v1.2.1.
% 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 : n001.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:11:07 PM UTC 2026

% Result   : Unsatisfiable 5.71s 4.32s
% Output   : CNFRefutation 5.71s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   15
% Syntax   : Number of clauses     :   49 (  28 unt;   0 nHn;  24 RR)
%            Number of literals    :   92 (  14 equ;  45 neg)
%            Maximal clause size   :    5 (   1 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-3 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :  117 (   5 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(distributivity1,axiom,
    ( sum(X3,X5,X7)
    | ~ product(X1,X2,X3)
    | ~ product(X1,X4,X5)
    | ~ sum(X2,X4,X6)
    | ~ product(X1,X6,X7) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/BOO002-0.ax',distributivity1) ).

cnf(additive_inverse1,axiom,
    sum(inverse(X1),X1,multiplicative_identity),
    file('/export/starexec/sandbox2/benchmark/Axioms/BOO002-0.ax',additive_inverse1) ).

cnf(commutativity_of_addition,axiom,
    ( sum(X2,X1,X3)
    | ~ sum(X1,X2,X3) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/BOO002-0.ax',commutativity_of_addition) ).

cnf(sum_and_multiply,axiom,
    sum(X1,multiply(X1,X2),X1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sum_and_multiply) ).

cnf(multiplication_is_well_defined,axiom,
    ( X3 = X4
    | ~ product(X1,X2,X3)
    | ~ product(X1,X2,X4) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/BOO002-0.ax',multiplication_is_well_defined) ).

cnf(multiplicative_identity1,axiom,
    product(multiplicative_identity,X1,X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/BOO002-0.ax',multiplicative_identity1) ).

cnf(multiplicative_inverse2,axiom,
    product(X1,inverse(X1),additive_identity),
    file('/export/starexec/sandbox2/benchmark/Axioms/BOO002-0.ax',multiplicative_inverse2) ).

cnf(sum_product_dual2,axiom,
    ( product(X1,X3,X1)
    | ~ sum(X1,X2,X3) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',sum_product_dual2) ).

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

cnf(addition_is_well_defined,axiom,
    ( X3 = X4
    | ~ sum(X1,X2,X3)
    | ~ sum(X1,X2,X4) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/BOO002-0.ax',addition_is_well_defined) ).

cnf(additive_identity2,axiom,
    sum(X1,additive_identity,X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/BOO002-0.ax',additive_identity2) ).

cnf(closure_of_addition,axiom,
    sum(X1,X2,add(X1,X2)),
    file('/export/starexec/sandbox2/benchmark/Axioms/BOO002-0.ax',closure_of_addition) ).

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

cnf(additive_identity1,axiom,
    sum(additive_identity,X1,X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/BOO002-0.ax',additive_identity1) ).

cnf(prove_inverse_is_an_involution,negated_conjecture,
    inverse(inverse(x)) != x,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_inverse_is_an_involution) ).

cnf(c_0_15,axiom,
    ( sum(X3,X5,X7)
    | ~ product(X1,X2,X3)
    | ~ product(X1,X4,X5)
    | ~ sum(X2,X4,X6)
    | ~ product(X1,X6,X7) ),
    distributivity1 ).

cnf(c_0_16,axiom,
    sum(inverse(X1),X1,multiplicative_identity),
    additive_inverse1 ).

cnf(c_0_17,axiom,
    ( sum(X2,X1,X3)
    | ~ sum(X1,X2,X3) ),
    commutativity_of_addition ).

cnf(c_0_18,axiom,
    sum(X1,multiply(X1,X2),X1),
    sum_and_multiply ).

cnf(c_0_19,axiom,
    ( X3 = X4
    | ~ product(X1,X2,X3)
    | ~ product(X1,X2,X4) ),
    multiplication_is_well_defined ).

cnf(c_0_20,axiom,
    product(multiplicative_identity,X1,X1),
    multiplicative_identity1 ).

cnf(c_0_21,plain,
    ( sum(X1,X2,X3)
    | ~ product(X4,inverse(X5),X1)
    | ~ product(X4,multiplicative_identity,X3)
    | ~ product(X4,X5,X2) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_22,axiom,
    product(X1,inverse(X1),additive_identity),
    multiplicative_inverse2 ).

cnf(c_0_23,axiom,
    ( product(X1,X3,X1)
    | ~ sum(X1,X2,X3) ),
    sum_product_dual2 ).

cnf(c_0_24,plain,
    sum(multiply(X1,X2),X1,X1),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_25,plain,
    ( X1 = X2
    | ~ product(multiplicative_identity,X2,X1) ),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_26,axiom,
    product(X1,X2,multiply(X1,X2)),
    closure_of_multiplication ).

cnf(c_0_27,plain,
    ( sum(X1,additive_identity,X2)
    | ~ product(X3,inverse(inverse(X3)),X1)
    | ~ product(X3,multiplicative_identity,X2) ),
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

cnf(c_0_28,plain,
    product(multiply(X1,X2),X1,multiply(X1,X2)),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_29,plain,
    multiply(multiplicative_identity,X1) = X1,
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_30,axiom,
    ( X3 = X4
    | ~ sum(X1,X2,X3)
    | ~ sum(X1,X2,X4) ),
    addition_is_well_defined ).

cnf(c_0_31,axiom,
    sum(X1,additive_identity,X1),
    additive_identity2 ).

cnf(c_0_32,axiom,
    sum(X1,X2,add(X1,X2)),
    closure_of_addition ).

cnf(c_0_33,plain,
    ( sum(X1,additive_identity,X2)
    | ~ product(X2,inverse(inverse(X2)),X1) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]),c_0_29]),c_0_29]) ).

cnf(c_0_34,plain,
    ( X1 = X2
    | ~ sum(X2,additive_identity,X1) ),
    inference(spm,[status(thm)],[c_0_30,c_0_31]) ).

cnf(c_0_35,axiom,
    ( product(X6,X2,X7)
    | ~ product(X1,X2,X3)
    | ~ product(X4,X2,X5)
    | ~ sum(X1,X4,X6)
    | ~ sum(X3,X5,X7) ),
    distributivity4 ).

cnf(c_0_36,axiom,
    sum(additive_identity,X1,X1),
    additive_identity1 ).

cnf(c_0_37,plain,
    ( X1 = add(X2,X3)
    | ~ sum(X2,X3,X1) ),
    inference(spm,[status(thm)],[c_0_30,c_0_32]) ).

cnf(c_0_38,plain,
    sum(multiply(X1,inverse(inverse(X1))),additive_identity,X1),
    inference(spm,[status(thm)],[c_0_33,c_0_26]) ).

cnf(c_0_39,plain,
    add(X1,additive_identity) = X1,
    inference(spm,[status(thm)],[c_0_34,c_0_32]) ).

cnf(c_0_40,plain,
    ( product(X1,X2,X3)
    | ~ product(X4,X2,additive_identity)
    | ~ product(X5,X2,X3)
    | ~ sum(X4,X5,X1) ),
    inference(spm,[status(thm)],[c_0_35,c_0_36]) ).

cnf(c_0_41,plain,
    multiply(X1,inverse(inverse(X1))) = X1,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]) ).

cnf(c_0_42,plain,
    ( product(multiplicative_identity,X1,X2)
    | ~ product(inverse(X3),X1,additive_identity)
    | ~ product(X3,X1,X2) ),
    inference(spm,[status(thm)],[c_0_40,c_0_16]) ).

cnf(c_0_43,plain,
    product(X1,inverse(inverse(X1)),X1),
    inference(spm,[status(thm)],[c_0_26,c_0_41]) ).

cnf(c_0_44,plain,
    ( X1 = multiply(X2,X3)
    | ~ product(X2,X3,X1) ),
    inference(spm,[status(thm)],[c_0_19,c_0_26]) ).

cnf(c_0_45,plain,
    product(multiplicative_identity,inverse(inverse(X1)),X1),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_22])]) ).

cnf(c_0_46,negated_conjecture,
    inverse(inverse(x)) != x,
    prove_inverse_is_an_involution ).

cnf(c_0_47,plain,
    inverse(inverse(X1)) = X1,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_29]) ).

cnf(c_0_48,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_47])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : BOO012-3 : TPTP v9.2.1. Bugfixed v1.2.1.
% 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 : n001.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   : Tue May  5 10:45:03 EDT 2026
% 0.16/0.33  % CPUTime    : 
% 0.16/0.34  % start to proof: theBenchmark
% 5.71/4.32  % Version  : CSE_E---1.7
% 5.71/4.32  % Problem  : theBenchmark.p
% 5.71/4.32  % SZS status Unsatisfiable for theBenchmark.p
% 5.71/4.32  % SZS output start CNFRefutation
% See solution above
% 5.71/4.33  % Total time : 3.372s
%------------------------------------------------------------------------------