↑ Up

CSE_E---1.7.UNS-CRf.s

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

% Computer : n024.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:08:21 PM UTC 2026

% Result   : Unsatisfiable 8.95s 5.86s
% Output   : CNFRefutation 9.05s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   11
%            Number of leaves      :    4
% Syntax   : Number of clauses     :   28 (  28 unt;   0 nHn;   4 RR)
%            Number of literals    :   28 (  27 equ;   3 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    :    6 (   6 usr;   5 con; 0-2 aty)
%            Number of variables   :   93 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(c02,axiom,
    mult(X1,mult(X2,mult(X3,X4))) = mult(X3,mult(X2,mult(X1,X4))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',c02) ).

cnf(c01,axiom,
    mult(X1,mult(X2,mult(X1,X2))) = mult(X1,X2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',c01) ).

cnf(c03,axiom,
    mult(mult(X1,mult(X2,mult(X3,X2))),X4) = mult(X1,mult(X4,mult(mult(X3,X2),X4))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',c03) ).

cnf(goals,negated_conjecture,
    mult(mult(a,b),mult(c,mult(d,e))) != mult(a,mult(c,mult(mult(d,b),e))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).

cnf(c_0_4,axiom,
    mult(X1,mult(X2,mult(X3,X4))) = mult(X3,mult(X2,mult(X1,X4))),
    c02 ).

cnf(c_0_5,axiom,
    mult(X1,mult(X2,mult(X1,X2))) = mult(X1,X2),
    c01 ).

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

cnf(c_0_7,axiom,
    mult(mult(X1,mult(X2,mult(X3,X2))),X4) = mult(X1,mult(X4,mult(mult(X3,X2),X4))),
    c03 ).

cnf(c_0_8,plain,
    mult(X1,mult(X2,mult(mult(X1,X2),X2))) = mult(X1,X2),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_6]),c_0_5]),c_0_4]) ).

cnf(c_0_9,plain,
    mult(X1,mult(X2,mult(mult(X1,X3),X2))) = mult(mult(X1,X3),X2),
    inference(spm,[status(thm)],[c_0_7,c_0_5]) ).

cnf(c_0_10,plain,
    mult(X1,mult(X2,mult(X3,mult(X4,X5)))) = mult(X3,mult(X4,mult(X1,mult(X2,X5)))),
    inference(spm,[status(thm)],[c_0_4,c_0_4]) ).

cnf(c_0_11,plain,
    mult(mult(X1,X2),X2) = mult(X1,X2),
    inference(rw,[status(thm)],[c_0_8,c_0_9]) ).

cnf(c_0_12,plain,
    mult(X1,mult(X2,mult(X1,mult(X2,X3)))) = mult(X1,mult(X2,X3)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_6]),c_0_10]),c_0_11]) ).

cnf(c_0_13,plain,
    mult(X1,mult(X2,mult(X3,mult(X4,mult(X1,X2))))) = mult(X3,mult(X4,mult(X1,X2))),
    inference(spm,[status(thm)],[c_0_10,c_0_5]) ).

cnf(c_0_14,plain,
    mult(mult(X1,X2),mult(X3,mult(X4,X2))) = mult(X4,mult(X3,mult(X1,X2))),
    inference(spm,[status(thm)],[c_0_4,c_0_11]) ).

cnf(c_0_15,plain,
    mult(X1,mult(X2,mult(mult(X1,X3),mult(X2,X4)))) = mult(mult(X1,X3),mult(X2,X4)),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_12]),c_0_11]) ).

cnf(c_0_16,plain,
    mult(mult(X1,mult(X2,mult(X3,X2))),X4) = mult(mult(X3,X2),mult(X4,mult(X1,X4))),
    inference(spm,[status(thm)],[c_0_4,c_0_7]) ).

cnf(c_0_17,plain,
    mult(mult(X1,mult(X2,mult(X3,X2))),X4) = mult(X3,mult(X4,mult(mult(X1,X2),X4))),
    inference(spm,[status(thm)],[c_0_7,c_0_4]) ).

cnf(c_0_18,plain,
    mult(X1,mult(X2,mult(X3,mult(X2,mult(X4,mult(X5,X1)))))) = mult(X3,mult(X2,mult(X4,mult(X5,X1)))),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_13]),c_0_14]) ).

cnf(c_0_19,plain,
    mult(X1,mult(X2,mult(mult(X1,X3),mult(X4,mult(X5,X2))))) = mult(mult(X1,X3),mult(X4,mult(X5,X2))),
    inference(spm,[status(thm)],[c_0_15,c_0_6]) ).

cnf(c_0_20,plain,
    mult(X1,mult(X2,mult(X3,mult(X4,mult(X5,X6))))) = mult(X5,mult(X4,mult(X1,mult(X2,mult(X3,X6))))),
    inference(spm,[status(thm)],[c_0_4,c_0_10]) ).

cnf(c_0_21,plain,
    mult(mult(X1,X2),mult(X3,mult(X4,X3))) = mult(X1,mult(X3,mult(mult(X4,X2),X3))),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_22,plain,
    mult(X1,mult(X2,mult(X3,mult(X4,mult(mult(X1,X5),X4))))) = mult(mult(X3,X5),mult(X2,mult(X1,X4))),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_14]),c_0_21]) ).

cnf(c_0_23,negated_conjecture,
    mult(mult(a,b),mult(c,mult(d,e))) != mult(a,mult(c,mult(mult(d,b),e))),
    goals ).

cnf(c_0_24,plain,
    mult(mult(X1,X2),mult(X3,mult(X4,X5))) = mult(X1,mult(X3,mult(mult(X4,X2),X5))),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_22]),c_0_9]) ).

cnf(c_0_25,negated_conjecture,
    mult(d,mult(c,mult(mult(a,b),e))) != mult(a,mult(c,mult(mult(d,b),e))),
    inference(rw,[status(thm)],[c_0_23,c_0_4]) ).

cnf(c_0_26,plain,
    mult(X1,mult(X2,mult(mult(X3,X4),X5))) = mult(X3,mult(X2,mult(mult(X1,X4),X5))),
    inference(spm,[status(thm)],[c_0_4,c_0_24]) ).

cnf(c_0_27,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_26])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.06  % Problem    : ALG236-1 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.06  % Command    : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.08/0.25  % Computer : n024.cluster.edu
% 0.08/0.25  % Model    : x86_64 x86_64
% 0.08/0.25  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.25  % Memory   : 8042.1875MB
% 0.08/0.25  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.08/0.25  % CPULimit   : 300
% 0.08/0.25  % WCLimit    : 300
% 0.08/0.25  % DateTime   : Tue May  5 05:29:41 EDT 2026
% 0.08/0.25  % CPUTime    : 
% 0.08/0.25  % start to proof: theBenchmark
% 8.95/5.86  % Version  : CSE_E---1.7
% 8.95/5.86  % Problem  : theBenchmark.p
% 8.95/5.86  % SZS status Unsatisfiable for theBenchmark.p
% 8.95/5.86  % SZS output start CNFRefutation
% See solution above
% 9.05/5.90  % Total time : 4.363s
%------------------------------------------------------------------------------