↑ Up

Twee---2.7.UNS-CRf.s

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

% Computer : n003.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:47 AM UTC 2026

% Result   : Unsatisfiable 0.11s 0.45s
% Output   : CNFRefutation 0.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   25 (  25 unt;   0 nHn;   7 RR)
%            Number of literals    :   25 (  24 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    :    6 (   6 usr;   4 con; 0-2 aty)
%            Number of variables   :   34 (   0 sgn)

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

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

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

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

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

cnf(c6,plain,
    op_d = op_c,
    inference(transitivity,[status(thm)],[c3,c5]) ).

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

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

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

cnf(c10,plain,
    ld(mult(op_d,X2),mult(op_c,mult(X2,X))) = ld(mult(op_c,X2),mult(op_c,mult(X2,X))),
    inference(congruence,[status(thm)],[c9]) ).

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

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

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

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

cnf(c15,plain,
    ld(mult(op_c,X2),mult(op_c,mult(X2,X))) = X,
    inference(transitivity,[status(thm)],[c13,c14]) ).

cnf(c16,plain,
    ld(mult(op_d,X2),mult(op_c,mult(X2,X))) = X,
    inference(transitivity,[status(thm)],[c10,c15]) ).

cnf(c17,plain,
    ld(mult(op_d,X2),mult(op_d,mult(X2,X))) = X,
    inference(transitivity,[status(thm)],[c8,c16]) ).

cnf(c18,plain,
    X = ld(mult(op_d,X2),mult(op_d,mult(X2,X))),
    inference(symmetry,[status(thm)],[c17]) ).

cnf(c19,plain,
    mult(mult(op_d,X2),X) = mult(mult(op_d,X2),ld(mult(op_d,X2),mult(op_d,mult(X2,X)))),
    inference(congruence,[status(thm)],[c18]) ).

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

cnf(c21,plain,
    mult(mult(op_d,X2),ld(mult(op_d,X2),mult(op_d,mult(X2,X)))) = mult(op_d,mult(X2,X)),
    inference(substitution,[status(thm)],[c20]) ).

cnf(c22,plain,
    mult(mult(op_d,X2),X) = mult(op_d,mult(X2,X)),
    inference(transitivity,[status(thm)],[c19,c21]) ).

cnf(c23,plain,
    mult(mult(op_d,x0),x1) = mult(op_d,mult(x0,x1)),
    inference(substitution,[status(thm)],[c22]) ).

cnf(c24,plain,
    mult(op_d,mult(x0,x1)) = mult(mult(op_d,x0),x1),
    inference(symmetry,[status(thm)],[c23]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : GRP702-10 : TPTP v9.3.1. Released v8.1.0.
% 0.00/0.03  % Command  : run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.35  % Computer : n003.cluster.edu
% 0.08/0.35  % Model    : x86_64 x86_64
% 0.08/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35  % Memory   : 8046.5625MB
% 0.08/0.35  % OS       : Linux 6.8.0-71-generic
% 0.08/0.35  % CPULimit : 300
% 0.08/0.35  % WCLimit  : 300
% 0.08/0.35  % DateTime : Sun Sep 27 10:38:25 UTC 2026
% 0.08/0.35  % CPUTime  : 
% 0.08/0.35  Running run_twee /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.11/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.11/0.45  
% 0.11/0.45  % SZS status Unsatisfiable
% 0.11/0.45  
% 0.11/0.45  % SZS output start CNFRefutation
% See solution above
% 0.11/0.45  
% 0.11/0.45  RESULT: Unsatisfiable (the axioms are contradictory).
%------------------------------------------------------------------------------