↑ Up

Twee---2.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Twee---2.7
% Problem  : GRP466-1 : TPTP v9.3.1. Released v2.6.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_twee /export/starexec/sandbox/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:10:33 AM UTC 2026

% Result   : Unsatisfiable 0.14s 0.43s
% Output   : CNFRefutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   18
%            Number of leaves      :    3
% Syntax   : Number of clauses     :   32 (  32 unt;   0 nHn;   3 RR)
%            Number of literals    :   32 (  31 equ;   1 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    9 (   2 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   :  101 (   0 sgn)

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

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

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

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

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

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

cnf(c7,axiom,
    divide(divide(A2,A2),divide(B2,divide(divide(C,divide(D,B2)),inverse(D)))) = C,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).

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

cnf(c9,plain,
    divide(divide(X4,X4),divide(X3,multiply(divide(X2,divide(X,X3)),X))) = X2,
    inference(transitivity,[status(thm)],[c6,c8]) ).

cnf(c10,plain,
    divide(divide(X2,X2),divide(multiply(divide(X,divide(X5,X4)),X5),multiply(divide(divide(X3,X3),divide(X4,multiply(divide(X,divide(X5,X4)),X5))),X4))) = divide(X3,X3),
    inference(substitution,[status(thm)],[c9]) ).

cnf(c11,plain,
    divide(X5,X5) = divide(divide(X4,X4),divide(multiply(divide(X3,divide(X2,X)),X2),multiply(divide(divide(X5,X5),divide(X,multiply(divide(X3,divide(X2,X)),X2))),X))),
    inference(symmetry,[status(thm)],[c10]) ).

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

cnf(c13,plain,
    multiply(divide(divide(X4,X4),divide(X,multiply(divide(X3,divide(X2,X)),X2))),X) = multiply(X3,X),
    inference(congruence,[status(thm)],[c12]) ).

cnf(c14,plain,
    divide(multiply(divide(X3,divide(X2,X)),X2),multiply(divide(divide(X4,X4),divide(X,multiply(divide(X3,divide(X2,X)),X2))),X)) = divide(multiply(divide(X3,divide(X2,X)),X2),multiply(X3,X)),
    inference(congruence,[status(thm)],[c13]) ).

cnf(c15,plain,
    divide(divide(X4,X4),divide(multiply(divide(X3,divide(X2,X)),X2),multiply(divide(divide(X5,X5),divide(X,multiply(divide(X3,divide(X2,X)),X2))),X))) = divide(divide(X4,X4),divide(multiply(divide(X3,divide(X2,X)),X2),multiply(X3,X))),
    inference(congruence,[status(thm)],[c14]) ).

cnf(c16,plain,
    divide(divide(X4,X4),divide(X,multiply(divide(X3,divide(X2,X)),X2))) = X3,
    inference(substitution,[status(thm)],[c9]) ).

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

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

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

cnf(c20,plain,
    divide(divide(X4,X4),divide(multiply(divide(X3,divide(X2,X)),X2),multiply(X3,X))) = divide(divide(X4,X4),divide(multiply(divide(X3,divide(X2,X)),X2),multiply(divide(divide(X5,X5),divide(X,multiply(divide(X3,divide(X2,X)),X2))),X))),
    inference(congruence,[status(thm)],[c19]) ).

cnf(c21,plain,
    divide(divide(X4,X4),divide(multiply(divide(X3,divide(X2,X)),X2),multiply(divide(divide(X5,X5),divide(X,multiply(divide(X3,divide(X2,X)),X2))),X))) = divide(X5,X5),
    inference(substitution,[status(thm)],[c9]) ).

cnf(c22,plain,
    divide(divide(X4,X4),divide(multiply(divide(X3,divide(X2,X)),X2),multiply(X3,X))) = divide(X5,X5),
    inference(transitivity,[status(thm)],[c20,c21]) ).

cnf(c23,plain,
    divide(divide(X4,X4),divide(multiply(divide(X3,divide(X2,X)),X2),multiply(divide(divide(X5,X5),divide(X,multiply(divide(X3,divide(X2,X)),X2))),X))) = divide(X6,X6),
    inference(transitivity,[status(thm)],[c15,c22]) ).

cnf(c24,plain,
    divide(X,X) = divide(X2,X2),
    inference(transitivity,[status(thm)],[c11,c23]) ).

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

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

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

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

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

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

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

cnf(c32,plain,
    $false,
    inference(resolution,[status(thm)],[c1,c31]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP466-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.04  % Command  : run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.36  % Computer : n011.cluster.edu
% 0.08/0.36  % Model    : x86_64 x86_64
% 0.08/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36  % Memory   : 8046.5625MB
% 0.08/0.36  % OS       : Linux 6.8.0-71-generic
% 0.08/0.36  % CPULimit : 300
% 0.08/0.36  % WCLimit  : 300
% 0.08/0.36  % DateTime : Sun Sep 27 10:05:31 UTC 2026
% 0.08/0.36  % CPUTime  : 
% 0.08/0.36  Running run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.43  Command-line arguments: --no-flatten-goal
% 0.14/0.43  
% 0.14/0.43  % SZS status Unsatisfiable
% 0.14/0.43  
% 0.14/0.44  % SZS output start CNFRefutation
% See solution above
% 0.14/0.46  
% 0.14/0.46  RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------