↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : GRP750-1 : TPTP v9.2.1. Released v4.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 : 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:27:12 PM UTC 2026

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

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

cnf(f02,axiom,
    ld(X1,mult(X1,X2)) = X2,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f02) ).

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

cnf(f01,axiom,
    mult(X1,ld(X1,X2)) = X2,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',f01) ).

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

cnf(c_0_5,axiom,
    mult(mult(X1,X2),mult(X3,X3)) = mult(mult(X1,X3),mult(X2,X3)),
    f06 ).

cnf(c_0_6,axiom,
    ld(X1,mult(X1,X2)) = X2,
    f02 ).

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

cnf(c_0_8,axiom,
    mult(X1,ld(X1,X2)) = X2,
    f01 ).

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

cnf(c_0_10,plain,
    ld(mult(X1,X2),mult(mult(X1,mult(X1,X1)),mult(X2,X3))) = mult(mult(X1,X1),X3),
    inference(spm,[status(thm)],[c_0_6,c_0_7]) ).

cnf(c_0_11,plain,
    mult(mult(X1,X2),mult(ld(X1,X3),X2)) = mult(X3,mult(X2,X2)),
    inference(spm,[status(thm)],[c_0_5,c_0_8]) ).

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

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

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

cnf(c_0_15,plain,
    mult(mult(X1,X1),mult(ld(X1,X2),X3)) = mult(X2,mult(X1,X3)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_7]),c_0_13]),c_0_14]) ).

cnf(c_0_16,negated_conjecture,
    mult(mult(a,a),mult(b,c)) != mult(mult(a,b),mult(a,c)),
    goals ).

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

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.06  % Problem    : GRP750-1 : TPTP v9.2.1. Released v4.0.0.
% 0.00/0.06  % 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.06/0.24  % Computer : n024.cluster.edu
% 0.06/0.24  % Model    : x86_64 x86_64
% 0.06/0.24  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.24  % Memory   : 8042.1875MB
% 0.06/0.24  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.06/0.24  % CPULimit   : 300
% 0.06/0.24  % WCLimit    : 300
% 0.06/0.24  % DateTime   : Mon May  4 14:04:26 EDT 2026
% 0.06/0.24  % CPUTime    : 
% 0.06/0.25  % start to proof: theBenchmark
% 19.79/12.32  % Version  : CSE_E---1.7
% 19.79/12.32  % Problem  : theBenchmark.p
% 19.79/12.32  % SZS status Unsatisfiable for theBenchmark.p
% 19.79/12.32  % SZS output start CNFRefutation
% See solution above
% 19.89/12.40  % Total time : 9.367s
%------------------------------------------------------------------------------