%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : GRP521-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 : n017.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:35 PM UTC 2026
% Result : Unsatisfiable 0.10s 10.40s
% Output : CNFRefutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% 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 : 4 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 6 con; 0-2 aty)
% Number of variables : 35 ( 35 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [A,B,C] : divide(A,divide(B,divide(C,divide(A,B)))) = C,
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f2,axiom,
! [A,B,C] : multiply(A,B) = divide(A,divide(divide(C,C),B)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f3,axiom,
! [A,B] : inverse(A) = divide(divide(B,B),A),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f4,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f5,plain,
! [X0,X1,X2] : divide(X0,divide(X1,divide(X2,divide(X0,X1)))) = X2,
inference(cnf_transformation,[status(thm)],[f1]) ).
fof(f6,plain,
! [X0,X1,X2] : multiply(X0,X1) = divide(X0,divide(divide(X2,X2),X1)),
inference(cnf_transformation,[status(thm)],[f2]) ).
fof(f7,plain,
! [X0,X1] : inverse(X0) = divide(divide(X1,X1),X0),
inference(cnf_transformation,[status(thm)],[f3]) ).
fof(f8,plain,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
inference(cnf_transformation,[status(thm)],[f4]) ).
fof(f9,definition,
sF1_fnc = inverse(a1),
introduced(definition,[new_symbols(definition,[sF1_fnc])],[function_definition]) ).
fof(f10,definition,
sF0_fnc = multiply(sF1_fnc,a1),
introduced(definition,[new_symbols(definition,[sF0_fnc])],[function_definition]) ).
fof(f11,definition,
sF3_fnc = inverse(b1),
introduced(definition,[new_symbols(definition,[sF3_fnc])],[function_definition]) ).
fof(f12,definition,
sF2_fnc = multiply(sF3_fnc,b1),
introduced(definition,[new_symbols(definition,[sF2_fnc])],[function_definition]) ).
fof(f13,plain,
sF0_fnc != sF2_fnc,
inference(definition_folding,[],[f8,f12,f11,f10,f9]) ).
fof(f15,plain,
! [X0,X1] : multiply(X0,X1) = divide(X0,inverse(X1)),
inference(forward_demodulation,[status(thm)],[f7,f6]) ).
fof(f17,plain,
! [X0] : multiply(X0,b1) = divide(X0,sF3_fnc),
inference(paramodulation,[status(thm)],[f11,f15]) ).
fof(f18,plain,
! [X0] : multiply(X0,a1) = divide(X0,sF1_fnc),
inference(paramodulation,[status(thm)],[f9,f15]) ).
fof(f23,plain,
! [X0] : inverse(X0) = divide(multiply(sF3_fnc,b1),X0),
inference(paramodulation,[status(thm)],[f17,f7]) ).
fof(f24,plain,
! [X0] : inverse(X0) = divide(sF2_fnc,X0),
inference(forward_demodulation,[status(thm)],[f12,f23]) ).
fof(f26,plain,
! [X0] : inverse(inverse(X0)) = multiply(sF2_fnc,X0),
inference(paramodulation,[status(thm)],[f15,f24]) ).
fof(f34,plain,
! [X0] : inverse(X0) = divide(multiply(sF1_fnc,a1),X0),
inference(paramodulation,[status(thm)],[f18,f7]) ).
fof(f35,plain,
! [X0] : inverse(X0) = divide(sF0_fnc,X0),
inference(forward_demodulation,[status(thm)],[f10,f34]) ).
fof(f38,plain,
! [X0] : inverse(inverse(X0)) = multiply(sF0_fnc,X0),
inference(paramodulation,[status(thm)],[f15,f35]) ).
fof(f98,plain,
! [X0] : multiply(sF2_fnc,X0) = multiply(sF0_fnc,X0),
inference(forward_demodulation,[status(thm)],[f26,f38]) ).
fof(f157,plain,
! [X0,X1,X2] : inverse(divide(X0,divide(X1,divide(divide(X2,X2),X0)))) = X1,
inference(paramodulation,[status(thm)],[f7,f5]) ).
fof(f203,plain,
! [X0,X1] : inverse(divide(X0,divide(X1,inverse(X0)))) = X1,
inference(forward_demodulation,[status(thm)],[f7,f157]) ).
fof(f204,plain,
! [X0,X1] : inverse(divide(X0,multiply(X1,X0))) = X1,
inference(forward_demodulation,[status(thm)],[f15,f203]) ).
fof(f262,plain,
! [X0] : inverse(divide(X0,multiply(sF0_fnc,X0))) = sF2_fnc,
inference(paramodulation,[status(thm)],[f98,f204]) ).
fof(f280,plain,
sF0_fnc = sF2_fnc,
inference(forward_demodulation,[status(thm)],[f204,f262]) ).
fof(f281,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f280,f13]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP521-1 : TPTP v9.3.1. Released v2.6.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/10.38 % Computer : n017.cluster.edu
% 0.10/10.38 % Model : x86_64 x86_64
% 0.10/10.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/10.38 % Memory : 8046.5625MB
% 0.10/10.38 % OS : Linux 6.8.0-71-generic
% 0.10/10.38 % CPULimit : 300
% 0.10/10.38 % WCLimit : 300
% 0.10/10.38 % DateTime : Sun Sep 20 20:11:08 UTC 2026
% 0.10/10.38 % CPUTime :
% 0.10/10.39 % Drodi V4.1.1
% 0.10/10.40 % Refutation found
% 0.10/10.40 % SZS status Unsatisfiable for theBenchmark: Theory is unsatisfiable
% 0.10/10.40 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.14/10.41 % Elapsed time: 0.025131 seconds
% 0.14/10.41 % CPU time: 0.038480 seconds
% 0.14/10.41 % Total memory used: 1.538 MB
% 0.14/10.41 % Net memory used: 1.498 MB
%------------------------------------------------------------------------------