%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : SYN080+1 : TPTP v9.3.1. Released v2.0.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n010.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 03:15:10 PM UTC 2026
% Result : Theorem 0.09s 0.51s
% Output : CNFRefutation 0.09s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 6
% Syntax : Number of formulae : 16 ( 16 unt; 4 def)
% Number of atoms : 16 ( 15 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 5 ( 5 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 6 con; 0-1 aty)
% Number of variables : 12 ( 10 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X,Y] : f(X) = g(Y),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f2,conjecture,
! [X,Y] : f(f(X)) = f(g(Y)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f3,negated_conjecture,
~ ! [X,Y] : f(f(X)) = f(g(Y)),
inference(negated_conjecture,[status(cth)],[f2]) ).
fof(f4,plain,
! [X0,X1] : f(X0) = g(X1),
inference(cnf_transformation,[status(thm)],[f1]) ).
fof(f5,plain,
? [X,Y] : f(f(X)) != f(g(Y)),
inference(pre_NNF_transformation,[status(thm)],[f3]) ).
fof(f6,plain,
f(f(sK0_skl)) != f(g(sK1_skl)),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl,sK1_skl]),skolemize(X,sK0_skl),skolemize(Y,sK1_skl)],[f5]) ).
fof(f7,plain,
f(f(sK0_skl)) != f(g(sK1_skl)),
inference(cnf_transformation,[status(thm)],[f6]) ).
fof(f8,definition,
sF1_fnc = f(sK0_skl),
introduced(definition,[new_symbols(definition,[sF1_fnc])],[function_definition]) ).
fof(f9,definition,
sF0_fnc = f(sF1_fnc),
introduced(definition,[new_symbols(definition,[sF0_fnc])],[function_definition]) ).
fof(f10,definition,
sF3_fnc = g(sK1_skl),
introduced(definition,[new_symbols(definition,[sF3_fnc])],[function_definition]) ).
fof(f11,definition,
sF2_fnc = f(sF3_fnc),
introduced(definition,[new_symbols(definition,[sF2_fnc])],[function_definition]) ).
fof(f12,plain,
sF0_fnc != sF2_fnc,
inference(definition_folding,[],[f7,f11,f10,f9,f8]) ).
fof(f13,plain,
! [X0] : sF2_fnc = g(X0),
inference(paramodulation,[status(thm)],[f11,f4]) ).
fof(f14,plain,
! [X0] : sF0_fnc = g(X0),
inference(paramodulation,[status(thm)],[f9,f4]) ).
fof(f24,plain,
sF0_fnc = sF2_fnc,
inference(forward_demodulation,[status(thm)],[f13,f14]) ).
fof(f25,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[f24,f12]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : SYN080+1 : TPTP v9.3.1. Released v2.0.0.
% 0.00/0.04 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.09/0.50 % Computer : n010.cluster.edu
% 0.09/0.50 % Model : x86_64 x86_64
% 0.09/0.50 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.50 % Memory : 8046.5625MB
% 0.09/0.50 % OS : Linux 6.8.0-71-generic
% 0.09/0.50 % CPULimit : 300
% 0.09/0.50 % WCLimit : 300
% 0.09/0.50 % DateTime : Mon Sep 21 10:42:57 UTC 2026
% 0.09/0.50 % CPUTime :
% 0.09/0.51 % Drodi V4.1.1
% 0.09/0.51 % Refutation found
% 0.09/0.51 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.09/0.51 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.09/0.54 % Elapsed time: 0.025247 seconds
% 0.09/0.54 % CPU time: 0.026212 seconds
% 0.09/0.54 % Total memory used: 198.112 KB
% 0.09/0.54 % Net memory used: 184.192 KB
%------------------------------------------------------------------------------