↑ Up

Twee---2.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Twee---2.7
% Problem  : GRP704-10 : TPTP v9.3.1. Released v8.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_twee /export/starexec/sandbox/benchmark/theBenchmark.p

% Computer : n007.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Tue Sep 29 10:11:48 AM UTC 2026

% Result   : Unsatisfiable 0.13s 0.45s
% Output   : CNFRefutation 0.46s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   65 (  65 unt;   0 nHn;  21 RR)
%            Number of literals    :   65 (  64 equ;   1 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    :    8 (   8 usr;   6 con; 0-2 aty)
%            Number of variables   :   64 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(c1,negated_conjecture,
    mult(op_f,mult(x4,x5)) != mult(mult(op_f,x4),x5),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',goal) ).

cnf(c2,axiom,
    op_f = mult(A,mult(B,ld(mult(A,B),op_c))),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',f13) ).

cnf(c3,plain,
    op_f = mult(X,mult(unit,ld(mult(X,unit),op_c))),
    inference(substitution,[status(thm)],[c2]) ).

cnf(c4,axiom,
    mult(A2,unit) = A2,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',f05) ).

cnf(c5,plain,
    mult(X,unit) = X,
    inference(substitution,[status(thm)],[c4]) ).

cnf(c6,plain,
    ld(mult(X,unit),op_c) = ld(X,op_c),
    inference(congruence,[status(thm)],[c5]) ).

cnf(c7,plain,
    mult(unit,ld(mult(X,unit),op_c)) = mult(unit,ld(X,op_c)),
    inference(congruence,[status(thm)],[c6]) ).

cnf(c8,plain,
    mult(X,mult(unit,ld(mult(X,unit),op_c))) = mult(X,mult(unit,ld(X,op_c))),
    inference(congruence,[status(thm)],[c7]) ).

cnf(c9,axiom,
    mult(unit,A2) = A2,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',f06) ).

cnf(c10,plain,
    mult(unit,ld(X,op_c)) = ld(X,op_c),
    inference(substitution,[status(thm)],[c9]) ).

cnf(c11,plain,
    mult(X,mult(unit,ld(X,op_c))) = mult(X,ld(X,op_c)),
    inference(congruence,[status(thm)],[c10]) ).

cnf(c12,axiom,
    mult(A2,ld(A2,B2)) = B2,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',f01) ).

cnf(c13,plain,
    mult(X,ld(X,op_c)) = op_c,
    inference(substitution,[status(thm)],[c12]) ).

cnf(c14,axiom,
    ld(A2,mult(A2,B2)) = B2,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',f02) ).

cnf(c15,plain,
    ld(op_c,mult(op_c,op_c)) = op_c,
    inference(substitution,[status(thm)],[c14]) ).

cnf(c16,plain,
    op_c = ld(op_c,mult(op_c,op_c)),
    inference(symmetry,[status(thm)],[c15]) ).

cnf(c17,axiom,
    op_d = ld(A2,mult(op_c,A2)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',f11) ).

cnf(c18,plain,
    op_d = ld(op_c,mult(op_c,op_c)),
    inference(substitution,[status(thm)],[c17]) ).

cnf(c19,plain,
    ld(op_c,mult(op_c,op_c)) = op_d,
    inference(symmetry,[status(thm)],[c18]) ).

cnf(c20,plain,
    op_c = op_d,
    inference(transitivity,[status(thm)],[c16,c19]) ).

cnf(c21,plain,
    mult(X,ld(X,op_c)) = op_d,
    inference(transitivity,[status(thm)],[c13,c20]) ).

cnf(c22,plain,
    mult(X,mult(unit,ld(X,op_c))) = op_d,
    inference(transitivity,[status(thm)],[c11,c21]) ).

cnf(c23,plain,
    mult(X,mult(unit,ld(mult(X,unit),op_c))) = op_d,
    inference(transitivity,[status(thm)],[c8,c22]) ).

cnf(c24,plain,
    op_f = op_d,
    inference(transitivity,[status(thm)],[c3,c23]) ).

cnf(c25,plain,
    mult(op_f,mult(x4,x5)) = mult(op_d,mult(x4,x5)),
    inference(congruence,[status(thm)],[c24]) ).

cnf(c26,plain,
    op_d = op_c,
    inference(symmetry,[status(thm)],[c20]) ).

cnf(c27,plain,
    mult(op_d,X) = mult(op_c,X),
    inference(congruence,[status(thm)],[c26]) ).

cnf(c28,plain,
    mult(X,ld(X,mult(op_c,X))) = mult(op_c,X),
    inference(substitution,[status(thm)],[c12]) ).

cnf(c29,plain,
    mult(op_c,X) = mult(X,ld(X,mult(op_c,X))),
    inference(symmetry,[status(thm)],[c28]) ).

cnf(c30,plain,
    op_d = ld(X,mult(op_c,X)),
    inference(substitution,[status(thm)],[c17]) ).

cnf(c31,plain,
    ld(X,mult(op_c,X)) = op_d,
    inference(symmetry,[status(thm)],[c30]) ).

cnf(c32,plain,
    mult(X,ld(X,mult(op_c,X))) = mult(X,op_d),
    inference(congruence,[status(thm)],[c31]) ).

cnf(c33,plain,
    mult(op_c,X) = mult(X,op_d),
    inference(transitivity,[status(thm)],[c29,c32]) ).

cnf(c34,plain,
    mult(op_d,X) = mult(X,op_d),
    inference(transitivity,[status(thm)],[c27,c33]) ).

cnf(c35,plain,
    mult(op_d,mult(X,X2)) = mult(mult(X,X2),op_d),
    inference(substitution,[status(thm)],[c34]) ).

cnf(c36,plain,
    op_d = op_c,
    inference(symmetry,[status(thm)],[c20]) ).

cnf(c37,plain,
    mult(mult(X2,X),op_d) = mult(mult(X2,X),op_c),
    inference(congruence,[status(thm)],[c36]) ).

cnf(c38,axiom,
    mult(A2,mult(B2,op_c)) = mult(mult(A2,B2),op_c),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',f09) ).

cnf(c39,plain,
    mult(X2,mult(X,op_c)) = mult(mult(X2,X),op_c),
    inference(substitution,[status(thm)],[c38]) ).

cnf(c40,plain,
    mult(mult(X2,X),op_c) = mult(X2,mult(X,op_c)),
    inference(symmetry,[status(thm)],[c39]) ).

cnf(c41,plain,
    mult(X,op_c) = mult(X,op_d),
    inference(congruence,[status(thm)],[c20]) ).

cnf(c42,plain,
    mult(X2,mult(X,op_c)) = mult(X2,mult(X,op_d)),
    inference(congruence,[status(thm)],[c41]) ).

cnf(c43,plain,
    mult(mult(X2,X),op_c) = mult(X2,mult(X,op_d)),
    inference(transitivity,[status(thm)],[c40,c42]) ).

cnf(c44,plain,
    mult(mult(X2,X),op_d) = mult(X2,mult(X,op_d)),
    inference(transitivity,[status(thm)],[c37,c43]) ).

cnf(c45,plain,
    mult(op_d,mult(X2,X)) = mult(X2,mult(X,op_d)),
    inference(transitivity,[status(thm)],[c35,c44]) ).

cnf(c46,plain,
    mult(op_d,mult(x4,x5)) = mult(x4,mult(x5,op_d)),
    inference(substitution,[status(thm)],[c45]) ).

cnf(c47,plain,
    op_d = op_c,
    inference(symmetry,[status(thm)],[c20]) ).

cnf(c48,plain,
    mult(op_d,X) = mult(op_c,X),
    inference(congruence,[status(thm)],[c47]) ).

cnf(c49,plain,
    mult(mult(op_d,X2),X) = mult(mult(op_c,X2),X),
    inference(congruence,[status(thm)],[c48]) ).

cnf(c50,axiom,
    mult(op_c,mult(A2,B2)) = mult(mult(op_c,A2),B2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',f08) ).

cnf(c51,plain,
    mult(op_c,mult(X2,X)) = mult(mult(op_c,X2),X),
    inference(substitution,[status(thm)],[c50]) ).

cnf(c52,plain,
    mult(mult(op_c,X2),X) = mult(op_c,mult(X2,X)),
    inference(symmetry,[status(thm)],[c51]) ).

cnf(c53,plain,
    mult(op_c,mult(X2,X)) = mult(op_d,mult(X2,X)),
    inference(congruence,[status(thm)],[c20]) ).

cnf(c54,plain,
    mult(op_c,mult(X2,X)) = mult(X2,mult(X,op_d)),
    inference(transitivity,[status(thm)],[c53,c45]) ).

cnf(c55,plain,
    mult(mult(op_c,X2),X) = mult(X2,mult(X,op_d)),
    inference(transitivity,[status(thm)],[c52,c54]) ).

cnf(c56,plain,
    mult(mult(op_d,X2),X) = mult(X2,mult(X,op_d)),
    inference(transitivity,[status(thm)],[c49,c55]) ).

cnf(c57,plain,
    mult(mult(op_d,x4),x5) = mult(x4,mult(x5,op_d)),
    inference(substitution,[status(thm)],[c56]) ).

cnf(c58,plain,
    mult(x4,mult(x5,op_d)) = mult(mult(op_d,x4),x5),
    inference(symmetry,[status(thm)],[c57]) ).

cnf(c59,plain,
    op_d = op_f,
    inference(symmetry,[status(thm)],[c24]) ).

cnf(c60,plain,
    mult(op_d,x4) = mult(op_f,x4),
    inference(congruence,[status(thm)],[c59]) ).

cnf(c61,plain,
    mult(mult(op_d,x4),x5) = mult(mult(op_f,x4),x5),
    inference(congruence,[status(thm)],[c60]) ).

cnf(c62,plain,
    mult(x4,mult(x5,op_d)) = mult(mult(op_f,x4),x5),
    inference(transitivity,[status(thm)],[c58,c61]) ).

cnf(c63,plain,
    mult(op_d,mult(x4,x5)) = mult(mult(op_f,x4),x5),
    inference(transitivity,[status(thm)],[c46,c62]) ).

cnf(c64,plain,
    mult(op_f,mult(x4,x5)) = mult(mult(op_f,x4),x5),
    inference(transitivity,[status(thm)],[c25,c63]) ).

cnf(c65,plain,
    $false,
    inference(resolution,[status(thm)],[c1,c64]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : GRP704-10 : TPTP v9.3.1. Released v8.1.0.
% 0.00/0.04  % Command  : run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.35  % Computer : n007.cluster.edu
% 0.09/0.35  % Model    : x86_64 x86_64
% 0.09/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.35  % Memory   : 8046.5625MB
% 0.09/0.35  % OS       : Linux 6.8.0-71-generic
% 0.09/0.35  % CPULimit : 300
% 0.09/0.35  % WCLimit  : 300
% 0.09/0.35  % DateTime : Sun Sep 27 10:34:39 UTC 2026
% 0.09/0.35  % CPUTime  : 
% 0.09/0.35  Running run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.13/0.45  Command-line arguments: --no-flatten-goal
% 0.13/0.45  
% 0.13/0.45  % SZS status Unsatisfiable
% 0.13/0.45  
% 0.13/0.46  % SZS output start CNFRefutation
% See solution above
% 0.46/0.48  
% 0.46/0.48  RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------