↑ Up

CSE_E---1.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : CSE_E---1.7
% Problem  : GRP715-10 : TPTP v9.2.1. Released v8.1.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 : n011.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:09 PM UTC 2026

% Result   : Unsatisfiable 3.54s 3.10s
% Output   : CNFRefutation 3.54s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   20 (  20 unt;   0 nHn;   8 RR)
%            Number of literals    :   20 (  19 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;   4 con; 0-2 aty)
%            Number of variables   :   20 (   0 sgn)

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

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

cnf(f11,axiom,
    mult(op_b,op_a) = unit,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',f11) ).

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

cnf(f10,axiom,
    mult(op_a,op_b) = unit,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',f10) ).

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

cnf(goal,negated_conjecture,
    mult(mult(x0,op_a),op_b) != x0,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal) ).

cnf(c_0_7,axiom,
    mult(X1,mult(X2,X2)) = mult(mult(X1,X2),X2),
    f07 ).

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

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

cnf(c_0_10,axiom,
    mult(op_b,op_a) = unit,
    f11 ).

cnf(c_0_11,axiom,
    mult(unit,X1) = X1,
    f09 ).

cnf(c_0_12,axiom,
    mult(op_a,op_b) = unit,
    f10 ).

cnf(c_0_13,plain,
    mult(mult(mult(X1,op_b),op_a),mult(op_b,op_b)) = mult(X1,mult(op_b,op_b)),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_11]),c_0_7]) ).

cnf(c_0_14,plain,
    mult(op_a,mult(op_b,op_b)) = op_b,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_12]),c_0_11]) ).

cnf(c_0_15,axiom,
    mult(X1,unit) = X1,
    f08 ).

cnf(c_0_16,plain,
    mult(mult(X1,mult(op_b,op_b)),op_a) = mult(X1,op_b),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_13]),c_0_14]),c_0_10]),c_0_15]) ).

cnf(c_0_17,negated_conjecture,
    mult(mult(x0,op_a),op_b) != x0,
    goal ).

cnf(c_0_18,plain,
    mult(mult(X1,op_a),op_b) = X1,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_8,c_0_16]),c_0_14]),c_0_10]),c_0_15]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem    : GRP715-10 : TPTP v9.2.1. Released v8.1.0.
% 0.00/0.12  % 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.15/0.33  % Computer : n011.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   : Mon May  4 19:03:17 EDT 2026
% 0.15/0.33  % CPUTime    : 
% 0.15/0.34  % start to proof: theBenchmark
% 3.54/3.10  % Version  : CSE_E---1.7
% 3.54/3.10  % Problem  : theBenchmark.p
% 3.54/3.10  % SZS status Unsatisfiable for theBenchmark.p
% 3.54/3.10  % SZS output start CNFRefutation
% See solution above
% 3.54/3.11  % Total time : 2.369s
%------------------------------------------------------------------------------