↑ Up

Twee---2.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Twee---2.7
% Problem  : GRP553-1 : TPTP v9.3.1. Released v2.6.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p

% Computer : n011.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:13 AM UTC 2026

% Result   : Unsatisfiable 0.15s 0.46s
% Output   : CNFRefutation 0.50s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   29
%            Number of leaves      :    3
% Syntax   : Number of clauses     :   61 (  61 unt;   0 nHn;   3 RR)
%            Number of literals    :   61 (  60 equ;   1 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :   10 (   3 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    5 (   5 usr;   2 con; 0-2 aty)
%            Number of variables   :  129 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(c1,negated_conjecture,
    multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_these_axioms_1) ).

cnf(c2,axiom,
    divide(divide(A,inverse(divide(B,divide(A,C)))),C) = B,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',single_axiom) ).

cnf(c3,plain,
    divide(divide(X,inverse(divide(X3,divide(X,inverse(divide(X2,X3)))))),inverse(divide(X2,X3))) = X3,
    inference(substitution,[status(thm)],[c2]) ).

cnf(c4,plain,
    X3 = divide(divide(X,inverse(divide(X3,divide(X,inverse(divide(X2,X3)))))),inverse(divide(X2,X3))),
    inference(symmetry,[status(thm)],[c3]) ).

cnf(c5,plain,
    divide(X3,inverse(divide(X2,X3))) = divide(divide(divide(X,inverse(divide(X3,divide(X,inverse(divide(X2,X3)))))),inverse(divide(X2,X3))),inverse(divide(X2,X3))),
    inference(congruence,[status(thm)],[c4]) ).

cnf(c6,plain,
    divide(divide(X3,inverse(divide(X2,divide(X3,X)))),X) = X2,
    inference(substitution,[status(thm)],[c2]) ).

cnf(c7,plain,
    X2 = divide(divide(X3,inverse(divide(X2,divide(X3,X)))),X),
    inference(symmetry,[status(thm)],[c6]) ).

cnf(c8,plain,
    divide(X4,X2) = divide(X4,divide(divide(X3,inverse(divide(X2,divide(X3,X)))),X)),
    inference(congruence,[status(thm)],[c7]) ).

cnf(c9,plain,
    inverse(divide(X,X3)) = inverse(divide(X,divide(divide(X4,inverse(divide(X3,divide(X4,X2)))),X2))),
    inference(congruence,[status(thm)],[c8]) ).

cnf(c10,plain,
    divide(divide(X4,inverse(divide(X3,divide(X4,X2)))),inverse(divide(X,X3))) = divide(divide(X4,inverse(divide(X3,divide(X4,X2)))),inverse(divide(X,divide(divide(X4,inverse(divide(X3,divide(X4,X2)))),X2)))),
    inference(congruence,[status(thm)],[c9]) ).

cnf(c11,plain,
    divide(divide(divide(X4,inverse(divide(X3,divide(X4,X2)))),inverse(divide(X,X3))),X2) = divide(divide(divide(X4,inverse(divide(X3,divide(X4,X2)))),inverse(divide(X,divide(divide(X4,inverse(divide(X3,divide(X4,X2)))),X2)))),X2),
    inference(congruence,[status(thm)],[c10]) ).

cnf(c12,plain,
    divide(divide(divide(X4,inverse(divide(X3,divide(X4,X2)))),inverse(divide(X,divide(divide(X4,inverse(divide(X3,divide(X4,X2)))),X2)))),X2) = X,
    inference(substitution,[status(thm)],[c2]) ).

cnf(c13,plain,
    divide(divide(divide(X4,inverse(divide(X3,divide(X4,X2)))),inverse(divide(X,X3))),X2) = X,
    inference(transitivity,[status(thm)],[c11,c12]) ).

cnf(c14,plain,
    divide(divide(divide(X,inverse(divide(X3,divide(X,inverse(divide(X2,X3)))))),inverse(divide(X2,X3))),inverse(divide(X2,X3))) = X2,
    inference(substitution,[status(thm)],[c13]) ).

cnf(c15,plain,
    divide(X2,inverse(divide(X,X2))) = X,
    inference(transitivity,[status(thm)],[c5,c14]) ).

cnf(c16,plain,
    divide(X,inverse(divide(X2,X))) = X2,
    inference(substitution,[status(thm)],[c15]) ).

cnf(c17,plain,
    X2 = divide(X,inverse(divide(X2,X))),
    inference(symmetry,[status(thm)],[c16]) ).

cnf(c18,plain,
    inverse(X2) = inverse(divide(X,inverse(divide(X2,X)))),
    inference(congruence,[status(thm)],[c17]) ).

cnf(c19,plain,
    divide(inverse(divide(X2,X)),inverse(X2)) = divide(inverse(divide(X2,X)),inverse(divide(X,inverse(divide(X2,X))))),
    inference(congruence,[status(thm)],[c18]) ).

cnf(c20,plain,
    divide(inverse(divide(X2,X)),inverse(divide(X,inverse(divide(X2,X))))) = X,
    inference(substitution,[status(thm)],[c15]) ).

cnf(c21,plain,
    divide(inverse(divide(X2,X)),inverse(X2)) = X,
    inference(transitivity,[status(thm)],[c19,c20]) ).

cnf(c22,plain,
    divide(inverse(divide(X,inverse(multiply(inverse(X2),X2)))),inverse(X)) = inverse(multiply(inverse(X2),X2)),
    inference(substitution,[status(thm)],[c21]) ).

cnf(c23,plain,
    inverse(multiply(inverse(X2),X2)) = divide(inverse(divide(X,inverse(multiply(inverse(X2),X2)))),inverse(X)),
    inference(symmetry,[status(thm)],[c22]) ).

cnf(c24,plain,
    divide(inverse(X),inverse(divide(X2,inverse(X)))) = X2,
    inference(substitution,[status(thm)],[c15]) ).

cnf(c25,plain,
    X2 = divide(inverse(X),inverse(divide(X2,inverse(X)))),
    inference(symmetry,[status(thm)],[c24]) ).

cnf(c26,plain,
    divide(X2,inverse(multiply(inverse(X),X))) = divide(divide(inverse(X),inverse(divide(X2,inverse(X)))),inverse(multiply(inverse(X),X))),
    inference(congruence,[status(thm)],[c25]) ).

cnf(c27,axiom,
    multiply(A2,B2) = divide(A2,inverse(B2)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',multiply) ).

cnf(c28,plain,
    multiply(X,X2) = divide(X,inverse(X2)),
    inference(substitution,[status(thm)],[c27]) ).

cnf(c29,plain,
    inverse(multiply(X,X2)) = inverse(divide(X,inverse(X2))),
    inference(congruence,[status(thm)],[c28]) ).

cnf(c30,plain,
    divide(inverse(X2),inverse(multiply(X,X2))) = divide(inverse(X2),inverse(divide(X,inverse(X2)))),
    inference(congruence,[status(thm)],[c29]) ).

cnf(c31,plain,
    divide(inverse(X2),inverse(divide(X,inverse(X2)))) = X,
    inference(substitution,[status(thm)],[c15]) ).

cnf(c32,plain,
    divide(inverse(X2),inverse(multiply(X,X2))) = X,
    inference(transitivity,[status(thm)],[c30,c31]) ).

cnf(c33,plain,
    divide(inverse(X),inverse(multiply(inverse(X),X))) = inverse(X),
    inference(substitution,[status(thm)],[c32]) ).

cnf(c34,plain,
    inverse(X) = divide(inverse(X),inverse(multiply(inverse(X),X))),
    inference(symmetry,[status(thm)],[c33]) ).

cnf(c35,plain,
    divide(X2,inverse(X)) = divide(X2,divide(inverse(X),inverse(multiply(inverse(X),X)))),
    inference(congruence,[status(thm)],[c34]) ).

cnf(c36,plain,
    inverse(divide(X2,inverse(X))) = inverse(divide(X2,divide(inverse(X),inverse(multiply(inverse(X),X))))),
    inference(congruence,[status(thm)],[c35]) ).

cnf(c37,plain,
    divide(inverse(X),inverse(divide(X2,inverse(X)))) = divide(inverse(X),inverse(divide(X2,divide(inverse(X),inverse(multiply(inverse(X),X)))))),
    inference(congruence,[status(thm)],[c36]) ).

cnf(c38,plain,
    divide(divide(inverse(X),inverse(divide(X2,inverse(X)))),inverse(multiply(inverse(X),X))) = divide(divide(inverse(X),inverse(divide(X2,divide(inverse(X),inverse(multiply(inverse(X),X)))))),inverse(multiply(inverse(X),X))),
    inference(congruence,[status(thm)],[c37]) ).

cnf(c39,plain,
    divide(divide(inverse(X),inverse(divide(X2,divide(inverse(X),inverse(multiply(inverse(X),X)))))),inverse(multiply(inverse(X),X))) = X2,
    inference(substitution,[status(thm)],[c2]) ).

cnf(c40,plain,
    divide(divide(inverse(X),inverse(divide(X2,inverse(X)))),inverse(multiply(inverse(X),X))) = X2,
    inference(transitivity,[status(thm)],[c38,c39]) ).

cnf(c41,plain,
    divide(X2,inverse(multiply(inverse(X),X))) = X2,
    inference(transitivity,[status(thm)],[c26,c40]) ).

cnf(c42,plain,
    divide(X,inverse(multiply(inverse(X2),X2))) = X,
    inference(substitution,[status(thm)],[c41]) ).

cnf(c43,plain,
    inverse(divide(X,inverse(multiply(inverse(X2),X2)))) = inverse(X),
    inference(congruence,[status(thm)],[c42]) ).

cnf(c44,plain,
    divide(inverse(divide(X,inverse(multiply(inverse(X2),X2)))),inverse(X)) = divide(inverse(X),inverse(X)),
    inference(congruence,[status(thm)],[c43]) ).

cnf(c45,plain,
    multiply(inverse(X),X) = divide(inverse(X),inverse(X)),
    inference(substitution,[status(thm)],[c27]) ).

cnf(c46,plain,
    divide(inverse(X),inverse(X)) = multiply(inverse(X),X),
    inference(symmetry,[status(thm)],[c45]) ).

cnf(c47,plain,
    divide(inverse(divide(X,inverse(multiply(inverse(X2),X2)))),inverse(X)) = multiply(inverse(X),X),
    inference(transitivity,[status(thm)],[c44,c46]) ).

cnf(c48,plain,
    inverse(multiply(inverse(X2),X2)) = multiply(inverse(X),X),
    inference(transitivity,[status(thm)],[c23,c47]) ).

cnf(c49,plain,
    inverse(multiply(inverse(X),X)) = multiply(inverse(X2),X2),
    inference(substitution,[status(thm)],[c48]) ).

cnf(c50,plain,
    multiply(inverse(X2),X2) = inverse(multiply(inverse(X),X)),
    inference(symmetry,[status(thm)],[c49]) ).

cnf(c51,plain,
    divide(inverse(divide(X2,inverse(multiply(inverse(X),X)))),inverse(X2)) = inverse(multiply(inverse(X),X)),
    inference(substitution,[status(thm)],[c21]) ).

cnf(c52,plain,
    inverse(multiply(inverse(X),X)) = divide(inverse(divide(X2,inverse(multiply(inverse(X),X)))),inverse(X2)),
    inference(symmetry,[status(thm)],[c51]) ).

cnf(c53,plain,
    inverse(divide(X2,inverse(multiply(inverse(X),X)))) = inverse(X2),
    inference(congruence,[status(thm)],[c41]) ).

cnf(c54,plain,
    divide(inverse(divide(X2,inverse(multiply(inverse(X),X)))),inverse(X2)) = divide(inverse(X2),inverse(X2)),
    inference(congruence,[status(thm)],[c53]) ).

cnf(c55,plain,
    multiply(inverse(X),X) = divide(inverse(X),inverse(X)),
    inference(substitution,[status(thm)],[c27]) ).

cnf(c56,plain,
    divide(inverse(X),inverse(X)) = multiply(inverse(X),X),
    inference(symmetry,[status(thm)],[c55]) ).

cnf(c57,plain,
    divide(inverse(divide(X2,inverse(multiply(inverse(X),X)))),inverse(X2)) = multiply(inverse(X2),X2),
    inference(transitivity,[status(thm)],[c54,c56]) ).

cnf(c58,plain,
    inverse(multiply(inverse(X),X)) = multiply(inverse(X2),X2),
    inference(transitivity,[status(thm)],[c52,c57]) ).

cnf(c59,plain,
    multiply(inverse(X),X) = multiply(inverse(X2),X2),
    inference(transitivity,[status(thm)],[c50,c58]) ).

cnf(c60,plain,
    multiply(inverse(a1),a1) = multiply(inverse(b1),b1),
    inference(substitution,[status(thm)],[c59]) ).

cnf(c61,plain,
    $false,
    inference(resolution,[status(thm)],[c1,c60]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP553-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.04  % Command  : run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.09/0.37  % Computer : n011.cluster.edu
% 0.09/0.37  % Model    : x86_64 x86_64
% 0.09/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37  % Memory   : 8046.5625MB
% 0.09/0.37  % OS       : Linux 6.8.0-71-generic
% 0.09/0.37  % CPULimit : 300
% 0.09/0.37  % WCLimit  : 300
% 0.09/0.37  % DateTime : Sun Sep 27 10:06:59 UTC 2026
% 0.09/0.37  % CPUTime  : 
% 0.09/0.37  Running run_twee /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/0.46  Command-line arguments: --lhs-weight 1 --flip-ordering --normalise-queue-percent 10 --cp-renormalise-threshold 10 --complete-subsets --ground-joining-incomplete-limit 15 --flatten-every 2
% 0.15/0.46  
% 0.15/0.46  % SZS status Unsatisfiable
% 0.15/0.46  
% 0.15/0.47  % SZS output start CNFRefutation
% See solution above
% 0.50/0.51  
% 0.50/0.51  RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------