↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : RNG021-7 : 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 : n003.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 05:05:01 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(prove_linearised_form3,negated_conjecture,
    associator(add(u,v),x,y) != add(associator(u,x,y),associator(v,x,y)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_linearised_form3) ).

cnf(associator,axiom,
    associator(X1,X2,X3) = add(multiply(multiply(X1,X2),X3),additive_inverse(multiply(X1,multiply(X2,X3)))),
    file('/export/starexec/sandbox2/benchmark/Axioms/RNG003-0.ax',associator) ).

cnf(inverse_product2,axiom,
    multiply(X1,additive_inverse(X2)) = additive_inverse(multiply(X1,X2)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',inverse_product2) ).

cnf(associativity_for_addition,axiom,
    add(X1,add(X2,X3)) = add(add(X1,X2),X3),
    file('/export/starexec/sandbox2/benchmark/Axioms/RNG003-0.ax',associativity_for_addition) ).

cnf(commutativity_for_addition,axiom,
    add(X1,X2) = add(X2,X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/RNG003-0.ax',commutativity_for_addition) ).

cnf(distribute2,axiom,
    multiply(add(X1,X2),X3) = add(multiply(X1,X3),multiply(X2,X3)),
    file('/export/starexec/sandbox2/benchmark/Axioms/RNG003-0.ax',distribute2) ).

cnf(c_0_6,negated_conjecture,
    associator(add(u,v),x,y) != add(associator(u,x,y),associator(v,x,y)),
    prove_linearised_form3 ).

cnf(c_0_7,axiom,
    associator(X1,X2,X3) = add(multiply(multiply(X1,X2),X3),additive_inverse(multiply(X1,multiply(X2,X3)))),
    associator ).

cnf(c_0_8,negated_conjecture,
    add(multiply(multiply(add(u,v),x),y),additive_inverse(multiply(add(u,v),multiply(x,y)))) != add(add(multiply(multiply(u,x),y),additive_inverse(multiply(u,multiply(x,y)))),add(multiply(multiply(v,x),y),additive_inverse(multiply(v,multiply(x,y))))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7]),c_0_7]),c_0_7]) ).

cnf(c_0_9,axiom,
    multiply(X1,additive_inverse(X2)) = additive_inverse(multiply(X1,X2)),
    inverse_product2 ).

cnf(c_0_10,negated_conjecture,
    add(add(multiply(multiply(u,x),y),multiply(u,multiply(x,additive_inverse(y)))),add(multiply(multiply(v,x),y),multiply(v,multiply(x,additive_inverse(y))))) != add(multiply(multiply(add(u,v),x),y),multiply(add(u,v),multiply(x,additive_inverse(y)))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9]),c_0_9]),c_0_9]),c_0_9]),c_0_9]),c_0_9]) ).

cnf(c_0_11,axiom,
    add(X1,add(X2,X3)) = add(add(X1,X2),X3),
    associativity_for_addition ).

cnf(c_0_12,axiom,
    add(X1,X2) = add(X2,X1),
    commutativity_for_addition ).

cnf(c_0_13,negated_conjecture,
    add(multiply(multiply(u,x),y),add(multiply(u,multiply(x,additive_inverse(y))),add(multiply(multiply(v,x),y),multiply(v,multiply(x,additive_inverse(y)))))) != add(multiply(multiply(add(u,v),x),y),multiply(add(u,v),multiply(x,additive_inverse(y)))),
    inference(rw,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_14,plain,
    add(X1,add(X2,X3)) = add(X3,add(X1,X2)),
    inference(spm,[status(thm)],[c_0_12,c_0_11]) ).

cnf(c_0_15,axiom,
    multiply(add(X1,X2),X3) = add(multiply(X1,X3),multiply(X2,X3)),
    distribute2 ).

cnf(c_0_16,negated_conjecture,
    add(multiply(multiply(u,x),y),add(multiply(multiply(v,x),y),multiply(add(u,v),multiply(x,additive_inverse(y))))) != add(multiply(multiply(add(u,v),x),y),multiply(add(u,v),multiply(x,additive_inverse(y)))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_13,c_0_14]),c_0_15]),c_0_12]) ).

cnf(c_0_17,plain,
    add(multiply(X1,X2),add(multiply(X3,X2),X4)) = add(multiply(add(X1,X3),X2),X4),
    inference(spm,[status(thm)],[c_0_11,c_0_15]) ).

cnf(c_0_18,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17]),c_0_15])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem    : RNG021-7 : TPTP v9.2.1. Released v1.0.0.
% 0.00/0.11  % 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.32  % Computer : n003.cluster.edu
% 0.16/0.32  % Model    : x86_64 x86_64
% 0.16/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.32  % Memory   : 8042.1875MB
% 0.16/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.16/0.32  % CPULimit   : 300
% 0.16/0.32  % WCLimit    : 300
% 0.16/0.32  % DateTime   : Tue May  5 01:46:41 EDT 2026
% 0.16/0.32  % CPUTime    : 
% 0.16/0.33  % start to proof: theBenchmark
% 1.30/1.73  % Version  : CSE_E---1.7
% 1.30/1.73  % Problem  : theBenchmark.p
% 1.30/1.73  % SZS status Unsatisfiable for theBenchmark.p
% 1.30/1.73  % SZS output start CNFRefutation
% See solution above
% 1.30/1.73  % Total time : 1.370s
%------------------------------------------------------------------------------