↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : BOO021-1 : TPTP v9.2.1. Released v2.2.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 : n002.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:09 PM UTC 2026

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

% Comments : 
%------------------------------------------------------------------------------
cnf(add_multiply,axiom,
    add(multiply(X1,X2),X2) = X2,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',add_multiply) ).

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

cnf(multiply_add_property,axiom,
    multiply(X1,add(X2,X3)) = add(multiply(X2,X1),multiply(X3,X1)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply_add_property) ).

cnf(prove_commutativity_of_multiply,negated_conjecture,
    multiply(b,a) != multiply(a,b),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_commutativity_of_multiply) ).

cnf(c_0_4,axiom,
    add(multiply(X1,X2),X2) = X2,
    add_multiply ).

cnf(c_0_5,axiom,
    multiply(add(X1,X2),X2) = X2,
    multiply_add ).

cnf(c_0_6,plain,
    add(X1,X1) = X1,
    inference(spm,[status(thm)],[c_0_4,c_0_5]) ).

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

cnf(c_0_8,negated_conjecture,
    multiply(b,a) != multiply(a,b),
    prove_commutativity_of_multiply ).

cnf(c_0_9,plain,
    multiply(X1,X2) = multiply(X2,X1),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_6]) ).

cnf(c_0_10,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_8,c_0_9])]),
    [proof] ).

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