↑ Up

Twee---2.7.UNS-CRf.s

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

% Computer : n026.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:08 AM UTC 2026

% Result   : Unsatisfiable 0.12s 0.45s
% Output   : CNFRefutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   22
%            Number of leaves      :    2
% Syntax   : Number of clauses     :   43 (  43 unt;   0 nHn;   4 RR)
%            Number of literals    :   43 (  42 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    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :  102 (   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,multiply(multiply(inverse(multiply(A,B)),C),B)) = C,
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

cnf(c20,plain,
    multiply(multiply(inverse(multiply(inverse(X3),X2)),X),X2) = multiply(X,X3),
    inference(transitivity,[status(thm)],[c17,c19]) ).

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

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

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

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

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

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

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

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

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

cnf(c30,plain,
    multiply(multiply(inverse(X),X),X) = X,
    inference(substitution,[status(thm)],[c15]) ).

cnf(c31,plain,
    X = multiply(multiply(inverse(X),X),X),
    inference(symmetry,[status(thm)],[c30]) ).

cnf(c32,plain,
    inverse(X) = inverse(multiply(multiply(inverse(X),X),X)),
    inference(congruence,[status(thm)],[c31]) ).

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

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

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

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

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

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

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

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

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

cnf(c42,plain,
    multiply(inverse(a1),a1) = multiply(inverse(b1),b1),
    inference(symmetry,[status(thm)],[c41]) ).

cnf(c43,plain,
    $false,
    inference(resolution,[status(thm)],[c1,c42]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP517-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.04  % Command  : run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.37  % Computer : n026.cluster.edu
% 0.12/0.37  % Model    : x86_64 x86_64
% 0.12/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37  % Memory   : 8046.5625MB
% 0.12/0.37  % OS       : Linux 6.8.0-71-generic
% 0.12/0.37  % CPULimit : 300
% 0.12/0.37  % WCLimit  : 300
% 0.12/0.37  % DateTime : Sun Sep 27 10:09:11 UTC 2026
% 0.12/0.38  % CPUTime  : 
% 0.12/0.38  Running run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.12/0.45  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.12/0.45  
% 0.12/0.45  % SZS status Unsatisfiable
% 0.12/0.45  
% 0.12/0.45  % SZS output start CNFRefutation
% See solution above
% 0.19/0.47  
% 0.19/0.47  RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------