↑ Up

Drodi---4.1.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : Drodi---4.1.1
% Problem  : GRP555-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 : n019.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:39 PM UTC 2026

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

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

fof(f2,axiom,
    ! [A,B] : multiply(A,B) = divide(A,inverse(B)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

fof(f3,negated_conjecture,
    multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p') ).

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

fof(f5,plain,
    ! [X0,X1] : multiply(X0,X1) = divide(X0,inverse(X1)),
    inference(cnf_transformation,[status(thm)],[f2]) ).

fof(f6,plain,
    multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)),
    inference(cnf_transformation,[status(thm)],[f3]) ).

fof(f12,plain,
    ! [X0,X1,X2] : divide(multiply(X0,divide(X1,divide(X0,X2))),X2) = X1,
    inference(backward_demodulation,[status(thm)],[f5,f4]) ).

fof(f13,plain,
    ! [X0,X1,X2] : multiply(multiply(X0,divide(X1,divide(X0,inverse(X2)))),X2) = X1,
    inference(paramodulation,[status(thm)],[f5,f12]) ).

fof(f14,plain,
    ! [X0,X1,X2,X3] : divide(multiply(X0,X1),X2) = multiply(X3,divide(X1,divide(X3,divide(X0,X2)))),
    inference(paramodulation,[status(thm)],[f12,f12]) ).

fof(f15,plain,
    ! [X0,X1,X2,X3] : divide(multiply(multiply(X0,divide(X1,divide(X0,X2))),divide(X3,X1)),X2) = X3,
    inference(paramodulation,[status(thm)],[f12,f12]) ).

fof(f18,plain,
    ! [X0,X1,X2] : multiply(multiply(X0,divide(X1,multiply(X0,X2))),X2) = X1,
    inference(forward_demodulation,[status(thm)],[f5,f13]) ).

fof(f22,plain,
    ! [X0,X1,X2,X3] : multiply(multiply(multiply(X0,divide(X1,multiply(X0,X2))),divide(X3,X1)),X2) = X3,
    inference(paramodulation,[status(thm)],[f18,f18]) ).

fof(f47,plain,
    ! [X0,X1,X2,X3,X4,X5] : divide(multiply(multiply(multiply(X0,divide(X1,divide(X0,X2))),divide(X3,X1)),X4),X2) = multiply(X5,divide(X4,divide(X5,X3))),
    inference(paramodulation,[status(thm)],[f15,f14]) ).

fof(f107,plain,
    ! [X0,X1] : multiply(X0,divide(X1,X0)) = X1,
    inference(paramodulation,[status(thm)],[f18,f22]) ).

fof(f125,plain,
    ! [X0,X1,X2,X3] : multiply(X0,X1) = multiply(multiply(X2,divide(X3,divide(X2,X0))),divide(X1,X3)),
    inference(paramodulation,[status(thm)],[f15,f107]) ).

fof(f126,plain,
    ! [X0,X1,X2] : multiply(X0,X1) = multiply(X2,divide(X1,divide(X2,X0))),
    inference(paramodulation,[status(thm)],[f12,f107]) ).

fof(f138,plain,
    ! [X0,X1,X2,X3] : divide(multiply(multiply(X0,X1),X2),X0) = multiply(X3,divide(X2,divide(X3,X1))),
    inference(backward_demodulation,[status(thm)],[f125,f47]) ).

fof(f167,plain,
    ! [X0,X1,X2] : divide(multiply(multiply(X0,X1),X2),X0) = multiply(X1,X2),
    inference(forward_demodulation,[status(thm)],[f126,f138]) ).

fof(f208,plain,
    ! [X0,X1,X2] : multiply(X0,multiply(X1,X2)) = multiply(multiply(X0,X1),X2),
    inference(paramodulation,[status(thm)],[f167,f107]) ).

fof(f213,plain,
    $false,
    inference(backward_subsumption_resolution,[status(thm)],[f6,f208]) ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : GRP555-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.04  % Command  : drodi -timeout(300) /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.12/0.37  % Computer : n019.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 20 20:16:50 UTC 2026
% 0.12/0.37  % CPUTime  : 
% 0.12/0.38  % Drodi V4.1.1
% 0.12/0.41  % Refutation found
% 0.12/0.41  % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.12/0.41  % SZS output start CNFRefutation for theBenchmark
% See solution above
% 1.47/1.62  % Elapsed time: 1.029846 seconds
% 1.47/1.62  % CPU time: 0.156170 seconds
% 1.47/1.62  % Total memory used: 7.397 MB
% 1.47/1.62  % Net memory used: 7.262 MB
%------------------------------------------------------------------------------