↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : BOO004-10 : TPTP v9.2.1. Released v7.5.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 : n019.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:03 PM UTC 2026

% Result   : Unsatisfiable 1.56s 1.81s
% Output   : CNFRefutation 1.56s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   32 (  32 unt;   0 nHn;   3 RR)
%            Number of literals    :   32 (  31 equ;   2 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    6 (   1 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :   11 (  11 usr;   4 con; 0-4 aty)
%            Number of variables   :   70 (   4 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(distributivity5,axiom,
    ifeq(product(X1,X2,X3),true,ifeq(sum(X4,X3,X5),true,ifeq(sum(X4,X2,X6),true,ifeq(sum(X4,X1,X7),true,product(X7,X6,X5),true),true),true),true) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',distributivity5) ).

cnf(additive_identity2,axiom,
    sum(X1,additive_identity,X1) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',additive_identity2) ).

cnf(ifeq_axiom_001,axiom,
    ifeq(X1,X1,X2,X3) = X2,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifeq_axiom_001) ).

cnf(multiplicative_inverse1,axiom,
    product(inverse(X1),X1,additive_identity) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiplicative_inverse1) ).

cnf(additive_inverse2,axiom,
    sum(X1,inverse(X1),multiplicative_identity) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',additive_inverse2) ).

cnf(multiplication_is_well_defined,axiom,
    ifeq2(product(X1,X2,X3),true,ifeq2(product(X1,X2,X4),true,X4,X3),X3) = X3,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiplication_is_well_defined) ).

cnf(multiplicative_identity1,axiom,
    product(multiplicative_identity,X1,X1) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiplicative_identity1) ).

cnf(ifeq_axiom,axiom,
    ifeq2(X1,X1,X2,X3) = X2,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifeq_axiom) ).

cnf(closure_of_multiplication,axiom,
    product(X1,X2,multiply(X1,X2)) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',closure_of_multiplication) ).

cnf(closure_of_addition,axiom,
    sum(X1,X2,add(X1,X2)) = true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',closure_of_addition) ).

cnf(prove_both_equalities,negated_conjecture,
    sum(x,x,x) != true,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_both_equalities) ).

cnf(c_0_11,axiom,
    ifeq(product(X1,X2,X3),true,ifeq(sum(X4,X3,X5),true,ifeq(sum(X4,X2,X6),true,ifeq(sum(X4,X1,X7),true,product(X7,X6,X5),true),true),true),true) = true,
    distributivity5 ).

cnf(c_0_12,axiom,
    sum(X1,additive_identity,X1) = true,
    additive_identity2 ).

cnf(c_0_13,axiom,
    ifeq(X1,X1,X2,X3) = X2,
    ifeq_axiom_001 ).

cnf(c_0_14,plain,
    ifeq(product(X1,X2,additive_identity),true,ifeq(sum(X3,X2,X4),true,ifeq(sum(X3,X1,X5),true,product(X5,X4,X3),true),true),true) = true,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).

cnf(c_0_15,axiom,
    product(inverse(X1),X1,additive_identity) = true,
    multiplicative_inverse1 ).

cnf(c_0_16,plain,
    ifeq(sum(X1,X2,X3),true,ifeq(sum(X1,inverse(X2),X4),true,product(X4,X3,X1),true),true) = true,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_13]) ).

cnf(c_0_17,axiom,
    sum(X1,inverse(X1),multiplicative_identity) = true,
    additive_inverse2 ).

cnf(c_0_18,axiom,
    ifeq2(product(X1,X2,X3),true,ifeq2(product(X1,X2,X4),true,X4,X3),X3) = X3,
    multiplication_is_well_defined ).

cnf(c_0_19,axiom,
    product(multiplicative_identity,X1,X1) = true,
    multiplicative_identity1 ).

cnf(c_0_20,axiom,
    ifeq2(X1,X1,X2,X3) = X2,
    ifeq_axiom ).

cnf(c_0_21,axiom,
    product(X1,X2,multiply(X1,X2)) = true,
    closure_of_multiplication ).

cnf(c_0_22,plain,
    ifeq(sum(X1,X1,X2),true,product(multiplicative_identity,X2,X1),true) = true,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_13]) ).

cnf(c_0_23,axiom,
    sum(X1,X2,add(X1,X2)) = true,
    closure_of_addition ).

cnf(c_0_24,plain,
    ifeq2(product(multiplicative_identity,X1,X2),true,X1,X2) = X2,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]) ).

cnf(c_0_25,plain,
    ifeq2(product(X1,X2,X3),true,multiply(X1,X2),X3) = X3,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_21]),c_0_20]) ).

cnf(c_0_26,plain,
    product(multiplicative_identity,add(X1,X1),X1) = true,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_13]) ).

cnf(c_0_27,plain,
    multiply(multiplicative_identity,X1) = X1,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_21]),c_0_20]) ).

cnf(c_0_28,plain,
    add(X1,X1) = X1,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_20]) ).

cnf(c_0_29,negated_conjecture,
    sum(x,x,x) != true,
    prove_both_equalities ).

cnf(c_0_30,plain,
    sum(X1,X1,X1) = true,
    inference(spm,[status(thm)],[c_0_23,c_0_28]) ).

cnf(c_0_31,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : BOO004-10 : TPTP v9.2.1. Released v7.5.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.15/0.33  % Computer : n019.cluster.edu
% 0.15/0.33  % Model    : x86_64 x86_64
% 0.15/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.33  % Memory   : 8042.1875MB
% 0.15/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.33  % CPULimit   : 300
% 0.15/0.33  % WCLimit    : 300
% 0.15/0.33  % DateTime   : Tue May  5 10:44:44 EDT 2026
% 0.15/0.33  % CPUTime    : 
% 0.15/0.34  % start to proof: theBenchmark
% 1.56/1.81  % Version  : CSE_E---1.7
% 1.56/1.81  % Problem  : theBenchmark.p
% 1.56/1.81  % SZS status Unsatisfiable for theBenchmark.p
% 1.56/1.81  % SZS output start CNFRefutation
% See solution above
% 1.56/1.82  % Total time : 1.371s
%------------------------------------------------------------------------------