↑ Up

Twee---2.7.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Twee---2.7
% Problem  : GRP533-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:11:10 AM UTC 2026

% Result   : Unsatisfiable 0.02s 0.44s
% Output   : CNFRefutation 0.02s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    4
% Syntax   : Number of clauses     :   26 (  26 unt;   0 nHn;   6 RR)
%            Number of literals    :   26 (  25 equ;   1 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of predicates  :    2 (   0 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   35 (   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,divide(divide(C,C),B)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',multiply) ).

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

cnf(c4,axiom,
    identity = divide(A2,A2),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',identity) ).

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

cnf(c6,plain,
    divide(X,X) = identity,
    inference(symmetry,[status(thm)],[c5]) ).

cnf(c7,plain,
    divide(divide(X,X),X2) = divide(identity,X2),
    inference(congruence,[status(thm)],[c6]) ).

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

cnf(c9,plain,
    identity = divide(X,X),
    inference(substitution,[status(thm)],[c4]) ).

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

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

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

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

cnf(c14,plain,
    divide(identity,X) = inverse(X),
    inference(transitivity,[status(thm)],[c10,c13]) ).

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

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

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

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

cnf(c19,plain,
    identity = divide(inverse(X),inverse(X)),
    inference(substitution,[status(thm)],[c4]) ).

cnf(c20,plain,
    divide(inverse(X),inverse(X)) = identity,
    inference(symmetry,[status(thm)],[c19]) ).

cnf(c21,plain,
    multiply(inverse(X),X) = identity,
    inference(transitivity,[status(thm)],[c18,c20]) ).

cnf(c22,plain,
    multiply(inverse(a1),a1) = identity,
    inference(substitution,[status(thm)],[c21]) ).

cnf(c23,plain,
    multiply(inverse(b1),b1) = identity,
    inference(substitution,[status(thm)],[c21]) ).

cnf(c24,plain,
    identity = multiply(inverse(b1),b1),
    inference(symmetry,[status(thm)],[c23]) ).

cnf(c25,plain,
    multiply(inverse(a1),a1) = multiply(inverse(b1),b1),
    inference(transitivity,[status(thm)],[c22,c24]) ).

cnf(c26,plain,
    $false,
    inference(resolution,[status(thm)],[c1,c25]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : GRP533-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.04  % Command  : run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.36  % Computer : n011.cluster.edu
% 0.10/0.36  % Model    : x86_64 x86_64
% 0.10/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36  % Memory   : 8046.5625MB
% 0.10/0.36  % OS       : Linux 6.8.0-71-generic
% 0.10/0.36  % CPULimit : 300
% 0.10/0.36  % WCLimit  : 300
% 0.02/0.36  % DateTime : Sun Sep 27 10:06:44 UTC 2026
% 0.02/0.36  % CPUTime  : 
% 0.02/0.36  Running run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.02/0.44  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.02/0.44  
% 0.02/0.44  % SZS status Unsatisfiable
% 0.02/0.44  
% 0.02/0.44  % SZS output start CNFRefutation
% See solution above
% 0.02/0.46  
% 0.02/0.46  RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------