%------------------------------------------------------------------------------
% File : Drodi---4.1.1
% Problem : ALG203+1 : TPTP v9.3.1. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% Computer : n011.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 11:48:54 AM UTC 2026
% Result : Theorem 0.12s 0.38s
% Output : CNFRefutation 0.12s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 42 ( 15 unt; 2 def)
% Number of atoms : 123 ( 41 equ)
% Maximal formula atoms : 14 ( 2 avg)
% Number of connectives : 131 ( 50 ~; 37 |; 22 &)
% ( 2 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 10 ( 4 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 3 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 46 ( 42 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [U] :
( sorti1(U)
=> ! [V] :
( sorti1(V)
=> sorti1(op1(U,V)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f3,axiom,
( ? [V] :
( op1(V,V) != V
& sorti1(V) )
& ? [U] :
( op1(U,U) = U
& sorti1(U) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f4,axiom,
~ ( ? [V] :
( op2(V,V) != V
& sorti2(V) )
& ? [U] :
( op2(U,U) = U
& sorti2(U) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f5,conjecture,
( ( ! [V] :
( sorti2(V)
=> sorti1(j(V)) )
& ! [U] :
( sorti1(U)
=> sorti2(h(U)) ) )
=> ~ ( ! [X2] :
( sorti1(X2)
=> j(h(X2)) = X2 )
& ! [X1] :
( sorti2(X1)
=> h(j(X1)) = X1 )
& ! [Y] :
( sorti2(Y)
=> ! [Z] :
( sorti2(Z)
=> j(op2(Y,Z)) = op1(j(Y),j(Z)) ) )
& ! [W] :
( sorti1(W)
=> ! [X] :
( sorti1(X)
=> h(op1(W,X)) = op2(h(W),h(X)) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p') ).
fof(f6,negated_conjecture,
~ ( ( ! [V] :
( sorti2(V)
=> sorti1(j(V)) )
& ! [U] :
( sorti1(U)
=> sorti2(h(U)) ) )
=> ~ ( ! [X2] :
( sorti1(X2)
=> j(h(X2)) = X2 )
& ! [X1] :
( sorti2(X1)
=> h(j(X1)) = X1 )
& ! [Y] :
( sorti2(Y)
=> ! [Z] :
( sorti2(Z)
=> j(op2(Y,Z)) = op1(j(Y),j(Z)) ) )
& ! [W] :
( sorti1(W)
=> ! [X] :
( sorti1(X)
=> h(op1(W,X)) = op2(h(W),h(X)) ) ) ) ),
inference(negated_conjecture,[status(cth)],[f5]) ).
fof(f7,plain,
! [U] :
( ! [V] :
( sorti1(op1(U,V))
| ~ sorti1(V) )
| ~ sorti1(U) ),
inference(pre_NNF_transformation,[status(thm)],[f1]) ).
fof(f8,plain,
! [X0,X1] :
( sorti1(op1(X0,X1))
| ~ sorti1(X1)
| ~ sorti1(X0) ),
inference(cnf_transformation,[status(thm)],[f7]) ).
fof(f11,plain,
( op1(sK1_skl,sK1_skl) != sK1_skl
& sorti1(sK1_skl)
& op1(sK0_skl,sK0_skl) = sK0_skl
& sorti1(sK0_skl) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK0_skl,sK1_skl]),skolemize(U,sK0_skl),skolemize(V,sK1_skl)],[f3]) ).
fof(f12,plain,
sorti1(sK0_skl),
inference(cnf_transformation,[status(thm)],[f11]) ).
fof(f13,plain,
op1(sK0_skl,sK0_skl) = sK0_skl,
inference(cnf_transformation,[status(thm)],[f11]) ).
fof(f14,plain,
sorti1(sK1_skl),
inference(cnf_transformation,[status(thm)],[f11]) ).
fof(f15,plain,
op1(sK1_skl,sK1_skl) != sK1_skl,
inference(cnf_transformation,[status(thm)],[f11]) ).
fof(f16,plain,
( ! [V] :
( op2(V,V) = V
| ~ sorti2(V) )
| ! [U] :
( op2(U,U) != U
| ~ sorti2(U) ) ),
inference(pre_NNF_transformation,[status(thm)],[f4]) ).
fof(f17,plain,
! [X0,X1] :
( op2(X1,X1) = X1
| ~ sorti2(X1)
| op2(X0,X0) != X0
| ~ sorti2(X0) ),
inference(cnf_transformation,[status(thm)],[f16]) ).
fof(f18,plain,
( ! [X2] :
( j(h(X2)) = X2
| ~ sorti1(X2) )
& ! [X1] :
( h(j(X1)) = X1
| ~ sorti2(X1) )
& ! [Y] :
( ! [Z] :
( j(op2(Y,Z)) = op1(j(Y),j(Z))
| ~ sorti2(Z) )
| ~ sorti2(Y) )
& ! [W] :
( ! [X] :
( h(op1(W,X)) = op2(h(W),h(X))
| ~ sorti1(X) )
| ~ sorti1(W) )
& ! [V] :
( sorti1(j(V))
| ~ sorti2(V) )
& ! [U] :
( sorti2(h(U))
| ~ sorti1(U) ) ),
inference(pre_NNF_transformation,[status(thm)],[f6]) ).
fof(f19,plain,
! [X0] :
( sorti2(h(X0))
| ~ sorti1(X0) ),
inference(cnf_transformation,[status(thm)],[f18]) ).
fof(f21,plain,
! [X0,X1] :
( h(op1(X0,X1)) = op2(h(X0),h(X1))
| ~ sorti1(X1)
| ~ sorti1(X0) ),
inference(cnf_transformation,[status(thm)],[f18]) ).
fof(f24,plain,
! [X0] :
( j(h(X0)) = X0
| ~ sorti1(X0) ),
inference(cnf_transformation,[status(thm)],[f18]) ).
fof(f25,definition,
! [X0] :
( sQ0_spl
<=> ( op2(X0,X0) != X0
| ~ sorti2(X0) ) ),
introduced(definition,[new_symbols(definition,[sQ0_spl])],[split_symbol_definition]) ).
fof(f26,plain,
! [X0] :
( ~ sQ0_spl
| op2(X0,X0) != X0
| ~ sorti2(X0) ),
inference(component_clause,[status(thm)],[f25]) ).
fof(f28,definition,
! [X1] :
( sQ1_spl
<=> ( op2(X1,X1) = X1
| ~ sorti2(X1) ) ),
introduced(definition,[new_symbols(definition,[sQ1_spl])],[split_symbol_definition]) ).
fof(f29,plain,
! [X0] :
( ~ sQ1_spl
| op2(X0,X0) = X0
| ~ sorti2(X0) ),
inference(component_clause,[status(thm)],[f28]) ).
fof(f31,plain,
( sQ1_spl
| sQ0_spl ),
inference(split_clause,[status(thm)],[f17,f25,f28]) ).
fof(f36,plain,
sorti1(op1(sK1_skl,sK1_skl)),
inference(resolution,[status(thm)],[f14,f8]) ).
fof(f40,plain,
sorti2(h(sK1_skl)),
inference(resolution,[status(thm)],[f19,f14]) ).
fof(f41,plain,
sorti2(h(sK0_skl)),
inference(resolution,[status(thm)],[f19,f12]) ).
fof(f47,plain,
h(op1(sK1_skl,sK1_skl)) = op2(h(sK1_skl),h(sK1_skl)),
inference(resolution,[status(thm)],[f21,f14]) ).
fof(f49,plain,
h(op1(sK0_skl,sK0_skl)) = op2(h(sK0_skl),h(sK0_skl)),
inference(resolution,[status(thm)],[f21,f12]) ).
fof(f54,plain,
h(sK0_skl) = op2(h(sK0_skl),h(sK0_skl)),
inference(forward_demodulation,[status(thm)],[f13,f49]) ).
fof(f70,plain,
( ~ sQ0_spl
| op2(h(sK0_skl),h(sK0_skl)) != h(sK0_skl) ),
inference(resolution,[status(thm)],[f26,f41]) ).
fof(f72,plain,
( ~ sQ0_spl
| h(sK0_skl) != h(sK0_skl) ),
inference(forward_demodulation,[status(thm)],[f54,f70]) ).
fof(f73,plain,
( ~ sQ0_spl
| $false ),
inference(trivial_equality_resolution,[status(thm)],[f72]) ).
fof(f74,plain,
~ sQ0_spl,
inference(contradiction_clause,[status(thm)],[f73]) ).
fof(f86,plain,
j(h(op1(sK1_skl,sK1_skl))) = op1(sK1_skl,sK1_skl),
inference(resolution,[status(thm)],[f24,f36]) ).
fof(f87,plain,
j(h(sK1_skl)) = sK1_skl,
inference(resolution,[status(thm)],[f24,f14]) ).
fof(f103,plain,
( ~ sQ1_spl
| op2(h(sK1_skl),h(sK1_skl)) = h(sK1_skl) ),
inference(resolution,[status(thm)],[f29,f40]) ).
fof(f104,plain,
( ~ sQ1_spl
| h(op1(sK1_skl,sK1_skl)) = h(sK1_skl) ),
inference(backward_demodulation,[status(thm)],[f103,f47]) ).
fof(f105,plain,
( ~ sQ1_spl
| j(h(sK1_skl)) = op1(sK1_skl,sK1_skl) ),
inference(backward_demodulation,[status(thm)],[f104,f86]) ).
fof(f110,plain,
( ~ sQ1_spl
| sK1_skl = op1(sK1_skl,sK1_skl) ),
inference(forward_demodulation,[status(thm)],[f87,f105]) ).
fof(f111,plain,
( ~ sQ1_spl
| $false ),
inference(forward_subsumption_resolution,[status(thm)],[f110,f15]) ).
fof(f112,plain,
~ sQ1_spl,
inference(contradiction_clause,[status(thm)],[f111]) ).
fof(f113,plain,
$false,
inference(sat_refutation,[status(thm)],[f31,f74,f112]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : ALG203+1 : TPTP v9.3.1. Released v2.7.0.
% 0.00/0.03 % Command : drodi -timeout(300) /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.10/0.35 % Computer : n011.cluster.edu
% 0.10/0.35 % Model : x86_64 x86_64
% 0.10/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.35 % Memory : 8046.5625MB
% 0.10/0.35 % OS : Linux 6.8.0-71-generic
% 0.10/0.35 % CPULimit : 300
% 0.10/0.35 % WCLimit : 300
% 0.10/0.35 % DateTime : Mon Sep 21 13:01:41 UTC 2026
% 0.10/0.35 % CPUTime :
% 0.12/0.36 % Drodi V4.1.1
% 0.12/0.38 % Refutation found
% 0.12/0.38 % SZS status Theorem for theBenchmark: Theorem is valid
% 0.12/0.38 % SZS output start CNFRefutation for theBenchmark
% See solution above
% 0.12/0.41 % Elapsed time: 0.051225 seconds
% 0.12/0.41 % CPU time: 0.146659 seconds
% 0.12/0.41 % Total memory used: 66.972 MB
% 0.12/0.41 % Net memory used: 66.399 MB
%------------------------------------------------------------------------------