%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : GRP517-1 : TPTP v9.3.1. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /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 : Thu Sep 24 12:34:34 PM UTC 2026
% Result : Unsatisfiable 0.08s 0.38s
% Output : CNFRefutation 0.08s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of formulae : 29 ( 29 unt; 4 def)
% Number of atoms : 29 ( 28 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 3 ( 3 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-2 aty)
% Number of variables : 33 ( 33 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [A,B,C] : multiply(A,multiply(multiply(inverse(multiply(A,B)),C),B)) = C,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f2,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f3,plain,
! [X0,X1,X2] : multiply(X0,multiply(multiply(inverse(multiply(X0,X1)),X2),X1)) = X2,
inference(cnf_transformation,[status(thm)],[f1]) ).
fof(f4,plain,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
inference(cnf_transformation,[status(thm)],[f2]) ).
fof(f5,definition,
sF1_fnc = inverse(a1),
introduced(definition,[new_symbols(definition,[sF1_fnc])],[function_definition]) ).
fof(f6,definition,
sF0_fnc = multiply(sF1_fnc,a1),
introduced(definition,[new_symbols(definition,[sF0_fnc])],[function_definition]) ).
fof(f7,definition,
sF3_fnc = inverse(b1),
introduced(definition,[new_symbols(definition,[sF3_fnc])],[function_definition]) ).
fof(f8,definition,
sF2_fnc = multiply(sF3_fnc,b1),
introduced(definition,[new_symbols(definition,[sF2_fnc])],[function_definition]) ).
fof(f9,plain,
sF0_fnc != sF2_fnc,
inference(definition_folding,[],[f4,f8,f7,f6,f5]) ).
fof(f10,plain,
! [X0,X1,X2,X3] : multiply(X0,multiply(X1,X2)) = multiply(multiply(inverse(multiply(inverse(multiply(X0,X2)),X3)),X1),X3),
inference(paramodulation,[status(thm)],[f3,f3]) ).
fof(f13,plain,
! [X0,X1,X2,X3] : multiply(X0,multiply(multiply(inverse(X1),X2),multiply(multiply(inverse(multiply(X0,X3)),X1),X3))) = X2,
inference(paramodulation,[status(thm)],[f3,f3]) ).
fof(f26,plain,
! [X0,X1,X2] : multiply(inverse(multiply(X0,X1)),multiply(X0,multiply(X2,X1))) = X2,
inference(paramodulation,[status(thm)],[f10,f3]) ).
fof(f34,plain,
! [X0] : multiply(inverse(sF2_fnc),multiply(sF3_fnc,multiply(X0,b1))) = X0,
inference(paramodulation,[status(thm)],[f8,f26]) ).
fof(f171,plain,
! [X0,X1] : multiply(multiply(inverse(X0),X1),X0) = X1,
inference(paramodulation,[status(thm)],[f3,f13]) ).
fof(f277,plain,
! [X0] : multiply(multiply(sF3_fnc,X0),b1) = X0,
inference(paramodulation,[status(thm)],[f7,f171]) ).
fof(f278,plain,
! [X0] : multiply(multiply(sF1_fnc,X0),a1) = X0,
inference(paramodulation,[status(thm)],[f5,f171]) ).
fof(f298,plain,
multiply(sF2_fnc,b1) = b1,
inference(paramodulation,[status(thm)],[f8,f277]) ).
fof(f311,plain,
multiply(inverse(sF2_fnc),multiply(sF3_fnc,b1)) = sF2_fnc,
inference(paramodulation,[status(thm)],[f298,f34]) ).
fof(f320,plain,
multiply(inverse(sF2_fnc),sF2_fnc) = sF2_fnc,
inference(forward_demodulation,[status(thm)],[f8,f311]) ).
fof(f391,plain,
multiply(sF0_fnc,a1) = a1,
inference(paramodulation,[status(thm)],[f6,f278]) ).
fof(f405,plain,
! [X0,X1] : multiply(sF0_fnc,multiply(multiply(inverse(X0),X1),multiply(multiply(inverse(a1),X0),a1))) = X1,
inference(paramodulation,[status(thm)],[f391,f13]) ).
fof(f414,plain,
! [X0,X1] : multiply(sF0_fnc,multiply(multiply(inverse(X0),X1),X0)) = X1,
inference(forward_demodulation,[status(thm)],[f171,f405]) ).
fof(f415,plain,
! [X0] : multiply(sF0_fnc,X0) = X0,
inference(forward_demodulation,[status(thm)],[f171,f414]) ).
fof(f467,plain,
! [X0,X1] : multiply(inverse(sF2_fnc),multiply(multiply(inverse(X0),X1),multiply(multiply(inverse(sF2_fnc),X0),sF2_fnc))) = X1,
inference(paramodulation,[status(thm)],[f320,f13]) ).
fof(f477,plain,
! [X0,X1] : multiply(inverse(sF2_fnc),multiply(multiply(inverse(X0),X1),X0)) = X1,
inference(forward_demodulation,[status(thm)],[f171,f467]) ).
fof(f478,plain,
! [X0] : multiply(inverse(sF2_fnc),X0) = X0,
inference(forward_demodulation,[status(thm)],[f171,f477]) ).
fof(f487,plain,
! [X0] : multiply(X0,sF2_fnc) = X0,
inference(paramodulation,[status(thm)],[f478,f171]) ).
fof(f528,plain,
sF2_fnc = sF0_fnc,
inference(paramodulation,[status(thm)],[f415,f487]) ).
fof(f558,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f528,f9]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP517-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.08/0.36 % Computer : n003.cluster.edu
% 0.08/0.36 % Model : x86_64 x86_64
% 0.08/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.36 % Memory : 8046.5625MB
% 0.08/0.36 % OS : Linux 6.8.0-71-generic
% 0.08/0.36 % CPULimit : 300
% 0.08/0.36 % WCLimit : 300
% 0.08/0.36 % DateTime : Sun Sep 20 20:17:00 UTC 2026
% 0.08/0.36 % CPUTime :
% 0.08/0.37 % Drodi V4.1.1
% 0.08/0.38 % Refutation found
% 0.08/0.38 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.08/0.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.08/0.40 % Elapsed time: 0.024637 seconds
% 0.08/0.40 % CPU time: 0.048695 seconds
% 0.08/0.40 % Total memory used: 2.076 MB
% 0.08/0.40 % Net memory used: 2.028 MB
%------------------------------------------------------------------------------