%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : ALG176+1 : TPTP v9.3.1. Released v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 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 : Fri Sep 25 12:51:48 PM UTC 2026
% Result : Theorem 58.97s 8.02s
% Output : Proof 58.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 5
% Syntax : Number of formulae : 70 ( 48 unt; 0 def)
% Number of atoms : 151 ( 73 equ)
% Maximal formula atoms : 14 ( 2 avg)
% Number of connectives : 127 ( 46 ~; 35 |; 24 &)
% ( 0 <=>; 22 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 2 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 3 con; 0-4 aty)
% Number of variables : 77 ( 2 sgn 44 !; 4 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
? [U] :
( ! [V] :
( sorti1(V)
=> op1(V,U) != V )
& sorti1(U) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax3) ).
fof(f2_nnf,plain,
? [U] :
( ! [V] :
( op1(V,U) != V
| ~ sorti1(V) )
& sorti1(U) ),
inference(nnf_transformation,[status(thm)],[f2]) ).
fof(f2_sk,plain,
! [V] :
( ( op1(V,sk0) != V
| ~ sorti1(V) )
& sorti1(sk0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk0])],[f2_nnf]) ).
cnf(c3,plain,
( op1(X1,sk0) != X1
| ~ sorti1(X1) ),
inference(cnf_transformation,[status(esa)],[f2_sk]) ).
cnf(t130,plain,
ifeq(sorti1(X1),true,ifeq(op1(X1,sk0),X1,false,true),true) = true,
inference(equality_encoding,[status(esa)],[c3]) ).
cnf(t589,plain,
ifeq(sorti1(X1),true,ifeq(op1(X1,sk0),X1,false,true),true) = true,
inference(orient,[status(thm)],[t130]) ).
fof(f4,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',co1) ).
fof(f4_neg,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)],[f4]) ).
fof(f4_nnf,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(nnf_transformation,[status(thm)],[f4_neg]) ).
fof(f4_sk,plain,
! [U,V,W,X,Y,Z,X1,X2] :
( ( j(h(X2)) = X2
| ~ sorti1(X2) )
& ( h(j(X1)) = X1
| ~ sorti2(X1) )
& ( j(op2(Y,Z)) = op1(j(Y),j(Z))
| ~ sorti2(Z)
| ~ sorti2(Y) )
& ( h(op1(W,X)) = op2(h(W),h(X))
| ~ sorti1(X)
| ~ sorti1(W) )
& ( sorti1(j(V))
| ~ sorti2(V) )
& ( sorti2(h(U))
| ~ sorti1(U) ) ),
inference(skolemisation,[status(esa)],[f4_nnf]) ).
cnf(c6,plain,
( sorti2(h(X0))
| ~ sorti1(X0) ),
inference(cnf_transformation,[status(esa)],[f4_sk]) ).
cnf(hi5,negated_conjecture,
ifeq(sorti1(X0),true,sorti2(h(X0)),true) = true,
inference(equality_encoding,[status(esa)],[c6]) ).
cnf(c2,plain,
sorti1(sk0),
inference(cnf_transformation,[status(esa)],[f2_sk]) ).
cnf(hi2,axiom,
sorti1(sk0) = true,
inference(equality_encoding,[status(esa)],[c2]) ).
cnf(h2,plain,
sorti2(h(sk0)) = true,
inference(hyper_resolution,[status(thm)],[hi5,hi2]) ).
fof(f3,axiom,
~ ? [U] :
( ! [V] :
( sorti2(V)
=> op2(V,U) != V )
& sorti2(U) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax4) ).
fof(f3_nnf,plain,
! [U] :
( ? [V] :
( op2(V,U) = V
& sorti2(V) )
| ~ sorti2(U) ),
inference(nnf_transformation,[status(thm)],[f3]) ).
fof(f3_sk,plain,
! [U] :
( ( op2(sk1(U),U) = sk1(U)
& sorti2(sk1(U)) )
| ~ sorti2(U) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk1])],[f3_nnf]) ).
cnf(c4,plain,
( sorti2(sk1(X0))
| ~ sorti2(X0) ),
inference(cnf_transformation,[status(esa)],[f3_sk]) ).
cnf(hi3,axiom,
ifeq(sorti2(X0),true,sorti2(sk1(X0)),true) = true,
inference(equality_encoding,[status(esa)],[c4]) ).
cnf(h8,plain,
sorti2(sk1(h(sk0))) = true,
inference(hyper_resolution,[status(thm)],[hi3,h2]) ).
cnf(c7,plain,
( sorti1(j(X1))
| ~ sorti2(X1) ),
inference(cnf_transformation,[status(esa)],[f4_sk]) ).
cnf(hi6,negated_conjecture,
ifeq(sorti2(X0),true,sorti1(j(X0)),true) = true,
inference(equality_encoding,[status(esa)],[c7]) ).
cnf(h34,plain,
sorti1(j(sk1(h(sk0)))) = true,
inference(hyper_resolution,[status(thm)],[hi6,h8]) ).
fof(f0,axiom,
! [U] :
( sorti1(U)
=> ! [V] :
( sorti1(V)
=> sorti1(op1(U,V)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax1) ).
fof(f0_nnf,plain,
! [U] :
( ! [V] :
( sorti1(op1(U,V))
| ~ sorti1(V) )
| ~ sorti1(U) ),
inference(nnf_transformation,[status(thm)],[f0]) ).
fof(f0_sk,plain,
! [U,V] :
( sorti1(op1(U,V))
| ~ sorti1(V)
| ~ sorti1(U) ),
inference(skolemisation,[status(esa)],[f0_nnf]) ).
cnf(c0,plain,
( sorti1(op1(X0,X1))
| ~ sorti1(X1)
| ~ sorti1(X0) ),
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(hi0,axiom,
ifeq(sorti1(X0),true,ifeq(sorti1(X1),true,sorti1(op1(X0,X1)),true),true) = true,
inference(equality_encoding,[status(esa)],[c0]) ).
cnf(h181,plain,
sorti1(op1(j(sk1(h(sk0))),sk0)) = true,
inference(hyper_resolution,[status(thm)],[hi0,h34,hi2]) ).
cnf(c11,plain,
( j(h(X7)) = X7
| ~ sorti1(X7) ),
inference(cnf_transformation,[status(esa)],[f4_sk]) ).
cnf(hi10,negated_conjecture,
ifeq(sorti1(X0),true,j(h(X0)),X0) = X0,
inference(equality_encoding,[status(esa)],[c11]) ).
cnf(t155,plain,
j(h(op1(j(sk1(h(sk0))),sk0))) = op1(j(sk1(h(sk0))),sk0),
inference(hyper_resolution,[status(thm)],[hi10,h181]) ).
cnf(c8,plain,
( h(op1(X2,X3)) = op2(h(X2),h(X3))
| ~ sorti1(X3)
| ~ sorti1(X2) ),
inference(cnf_transformation,[status(esa)],[f4_sk]) ).
cnf(hi7,negated_conjecture,
ifeq(sorti1(X0),true,ifeq(sorti1(X1),true,h(op1(X0,X1)),op2(h(X0),h(X1))),op2(h(X0),h(X1))) = op2(h(X0),h(X1)),
inference(equality_encoding,[status(esa)],[c8]) ).
cnf(t161,plain,
op2(h(j(sk1(h(sk0)))),h(sk0)) = h(op1(j(sk1(h(sk0))),sk0)),
inference(hyper_resolution,[status(thm)],[hi7,h34,hi2]) ).
cnf(c10,plain,
( h(j(X6)) = X6
| ~ sorti2(X6) ),
inference(cnf_transformation,[status(esa)],[f4_sk]) ).
cnf(hi9,negated_conjecture,
ifeq(sorti2(X0),true,h(j(X0)),X0) = X0,
inference(equality_encoding,[status(esa)],[c10]) ).
cnf(t24,plain,
h(j(sk1(h(sk0)))) = sk1(h(sk0)),
inference(hyper_resolution,[status(thm)],[hi9,h8]) ).
cnf(t301,plain,
h(j(sk1(h(sk0)))) = sk1(h(sk0)),
inference(orient,[status(thm)],[t24]) ).
cnf(t645,plain,
op2(sk1(h(sk0)),h(sk0)) = h(op1(j(sk1(h(sk0))),sk0)),
inference(step,[status(thm)],[t161,t301]) ).
cnf(t353,plain,
h(op1(j(sk1(h(sk0))),sk0)) = op2(sk1(h(sk0)),h(sk0)),
inference(orient,[status(thm)],[t645]) ).
cnf(t651,plain,
j(op2(sk1(h(sk0)),h(sk0))) = op1(j(sk1(h(sk0))),sk0),
inference(step,[status(thm)],[t155,t353]) ).
cnf(t370,plain,
j(op2(sk1(h(sk0)),h(sk0))) = op1(j(sk1(h(sk0))),sk0),
inference(orient,[status(thm)],[t651]) ).
cnf(c5,plain,
( op2(sk1(X0),X0) = sk1(X0)
| ~ sorti2(X0) ),
inference(cnf_transformation,[status(esa)],[f3_sk]) ).
cnf(hi4,axiom,
ifeq(sorti2(X0),true,op2(sk1(X0),X0),sk1(X0)) = sk1(X0),
inference(equality_encoding,[status(esa)],[c5]) ).
cnf(t54,plain,
op2(sk1(h(sk0)),h(sk0)) = sk1(h(sk0)),
inference(hyper_resolution,[status(thm)],[hi4,h2]) ).
cnf(t373,plain,
op2(sk1(h(sk0)),h(sk0)) = sk1(h(sk0)),
inference(orient,[status(thm)],[t54]) ).
cnf(t654,plain,
j(sk1(h(sk0))) = op1(j(sk1(h(sk0))),sk0),
inference(step,[status(thm)],[t370,t373]) ).
cnf(t377,plain,
j(sk1(h(sk0))) = op1(j(sk1(h(sk0))),sk0),
inference(rw,[status(thm)],[t654]) ).
cnf(t628,plain,
op1(j(sk1(h(sk0))),sk0) = j(sk1(h(sk0))),
inference(orient,[status(thm)],[t377]) ).
cnf(t629,plain,
true = ifeq(sorti1(j(sk1(h(sk0)))),true,ifeq(j(sk1(h(sk0))),j(sk1(h(sk0))),false,true),true),
inference(cp,[status(thm)],[t589,t628]) ).
cnf(h168,plain,
sorti2(h(j(sk1(h(sk0))))) = true,
inference(hyper_resolution,[status(thm)],[hi5,h34]) ).
cnf(h790,plain,
sorti1(j(h(j(sk1(h(sk0)))))) = true,
inference(hyper_resolution,[status(thm)],[hi6,h168]) ).
cnf(h4752,plain,
sorti2(h(j(h(j(sk1(h(sk0))))))) = true,
inference(hyper_resolution,[status(thm)],[hi5,h790]) ).
cnf(t102,plain,
sorti1(j(h(j(h(j(sk1(h(sk0)))))))) = true,
inference(hyper_resolution,[status(thm)],[hi6,h4752]) ).
cnf(t116,plain,
h(j(h(j(sk1(h(sk0)))))) = h(j(sk1(h(sk0)))),
inference(hyper_resolution,[status(thm)],[hi9,h168]) ).
cnf(t268,plain,
h(j(h(j(sk1(h(sk0)))))) = h(j(sk1(h(sk0)))),
inference(orient,[status(thm)],[t116]) ).
cnf(t684,plain,
sorti1(j(h(j(sk1(h(sk0)))))) = true,
inference(step,[status(thm)],[t102,t268]) ).
cnf(t685,plain,
sorti1(j(sk1(h(sk0)))) = true,
inference(step,[status(thm)],[t684,t301]) ).
cnf(t511,plain,
sorti1(j(sk1(h(sk0)))) = true,
inference(orient,[status(thm)],[t685]) ).
cnf(t693,plain,
true = ifeq(true,true,ifeq(j(sk1(h(sk0))),j(sk1(h(sk0))),false,true),true),
inference(step,[status(thm)],[t629,t511]) ).
cnf(t7,plain,
ifeq(X1,X1,X2,X3) = X2,
introduced(definition) ).
cnf(t256,plain,
ifeq(X1,X1,X2,X3) = X2,
inference(orient,[status(thm)],[t7]) ).
cnf(t694,plain,
true = ifeq(j(sk1(h(sk0))),j(sk1(h(sk0))),false,true),
inference(step,[status(thm)],[t693,t256]) ).
cnf(t695,plain,
true = false,
inference(step,[status(thm)],[t694,t256]) ).
cnf(t630,plain,
false = true,
inference(orient,[status(thm)],[t695]) ).
cnf(goal_0,negated_conjecture,
true != false,
inference(equality_encoding,[status(esa)],[c3]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t630]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ALG176+1 : TPTP v9.3.1. Released v2.7.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.09/0.36 % Computer : n011.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Fri Sep 25 04:59:13 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 58.97/8.02 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 58.97/8.02 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------