↑ Up

Drodi---4.1.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Drodi---4.1.1
% Problem  : GRP513-1 : TPTP v9.3.1. Released v2.6.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p

% Computer : n013.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 : Thu Sep 24 12:34:34 PM UTC 2026

% Result   : Unsatisfiable 0.14s 5.40s
% Output   : CNFRefutation 0.14s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    2
% Syntax   : Number of formulae    :   20 (  20 unt;   0 def)
%            Number of atoms       :   20 (  19 equ)
%            Maximal formula atoms :    1 (   1 avg)
%            Number of connectives :    4 (   4   ~;   0   |;   0   &)
%                                         (   0 <=>;   0  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   3 avg)
%            Maximal term depth    :    8 (   2 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   :   43 (  43   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(f1,axiom,
    ! [A,B,C] : multiply(A,multiply(multiply(B,C),inverse(multiply(A,C)))) = B,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f2,negated_conjecture,
    multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f3,plain,
    ! [X0,X1,X2] : multiply(X0,multiply(multiply(X1,X2),inverse(multiply(X0,X2)))) = X1,
    inference(cnf_transformation,[status(thm)],[f1]) ).

fof(f4,plain,
    multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
    inference(cnf_transformation,[status(thm)],[f2]) ).

fof(f10,plain,
    ! [X0,X1,X2,X3] : multiply(X0,multiply(X1,inverse(multiply(X0,multiply(multiply(X1,X2),inverse(multiply(X3,X2))))))) = X3,
    inference(paramodulation,[status(thm)],[f3,f3]) ).

fof(f11,plain,
    ! [X0,X1,X2,X3] : multiply(X0,multiply(multiply(X1,multiply(multiply(X2,X3),inverse(multiply(X0,X3)))),inverse(X2))) = X1,
    inference(paramodulation,[status(thm)],[f3,f3]) ).

fof(f12,plain,
    ! [X0,X1] : multiply(X0,multiply(X1,inverse(X1))) = X0,
    inference(paramodulation,[status(thm)],[f3,f10]) ).

fof(f20,plain,
    ! [X0,X1] : multiply(X0,multiply(X1,inverse(X0))) = X1,
    inference(paramodulation,[status(thm)],[f12,f10]) ).

fof(f31,plain,
    ! [X0,X1,X2] : multiply(multiply(X0,X1),multiply(X2,inverse(multiply(X2,X1)))) = X0,
    inference(paramodulation,[status(thm)],[f20,f10]) ).

fof(f39,plain,
    ! [X0,X1,X2] : multiply(X0,multiply(multiply(X1,X2),inverse(X1))) = multiply(X0,X2),
    inference(paramodulation,[status(thm)],[f20,f11]) ).

fof(f124,plain,
    ! [X0,X1,X2,X3] : multiply(multiply(X0,multiply(X1,inverse(multiply(X1,X2)))),multiply(multiply(X3,X2),inverse(X3))) = X0,
    inference(paramodulation,[status(thm)],[f31,f31]) ).

fof(f132,plain,
    ! [X0,X1,X2] : multiply(multiply(X0,multiply(X1,inverse(multiply(X1,X2)))),X2) = X0,
    inference(forward_demodulation,[status(thm)],[f39,f124]) ).

fof(f145,plain,
    ! [X0,X1,X2] : multiply(X0,X1) = multiply(X0,multiply(X2,inverse(multiply(X2,inverse(X1))))),
    inference(paramodulation,[status(thm)],[f132,f39]) ).

fof(f146,plain,
    ! [X0,X1,X2] : multiply(X0,X1) = multiply(X1,multiply(X2,inverse(multiply(X2,inverse(X0))))),
    inference(paramodulation,[status(thm)],[f132,f20]) ).

fof(f160,plain,
    multiply(inverse(a1),a1) != multiply(b1,inverse(b1)),
    inference(backward_demodulation,[status(thm)],[f163,f4]) ).

fof(f163,plain,
    ! [X0,X1] : multiply(X0,X1) = multiply(X1,X0),
    inference(forward_demodulation,[status(thm)],[f145,f146]) ).

fof(f168,plain,
    multiply(a1,inverse(a1)) != multiply(b1,inverse(b1)),
    inference(forward_demodulation,[status(thm)],[f163,f160]) ).

fof(f178,plain,
    ! [X0,X1] : multiply(X0,multiply(inverse(X0),X1)) = X1,
    inference(paramodulation,[status(thm)],[f163,f20]) ).

fof(f192,plain,
    ! [X0,X1] : multiply(X0,inverse(X0)) = multiply(X1,inverse(X1)),
    inference(paramodulation,[status(thm)],[f12,f178]) ).

fof(f203,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[f168,f192]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04  % Problem  : GRP513-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.05  % Command  : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.11/5.38  % Computer : n013.cluster.edu
% 0.11/5.38  % Model    : x86_64 x86_64
% 0.11/5.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.38  % Memory   : 8046.5625MB
% 0.11/5.38  % OS       : Linux 6.8.0-71-generic
% 0.11/5.38  % CPULimit : 300
% 0.11/5.38  % WCLimit  : 300
% 0.11/5.38  % DateTime : Sun Sep 20 20:14:43 UTC 2026
% 0.11/5.38  % CPUTime  : 
% 0.11/5.39  % Drodi V4.1.1
% 0.14/5.40  % Refutation found
% 0.14/5.40  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.14/5.40  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.14/5.42  % Elapsed time: 0.026943 seconds
% 0.14/5.42  % CPU time: 0.059946 seconds
% 0.14/5.42  % Total memory used: 2.794 MB
% 0.14/5.42  % Net memory used: 2.753 MB
%------------------------------------------------------------------------------