%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : ALG201+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 : 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 : Fri Sep 25 12:51:54 PM UTC 2026
% Result : Theorem 64.96s 8.68s
% Output : Proof 64.96s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 4
% Syntax : Number of formulae : 37 ( 24 unt; 0 def)
% Number of atoms : 99 ( 46 equ)
% Maximal formula atoms : 14 ( 2 avg)
% Number of connectives : 95 ( 33 ~; 22 |; 20 &)
% ( 0 <=>; 20 =>; 0 <=; 0 <~>)
% Maximal formula depth : 16 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-4 aty)
% Number of variables : 52 ( 2 sgn 36 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f2,axiom,
! [U] :
( sorti1(U)
=> op1(U,U) != U ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax3) ).
fof(f2_nnf,plain,
! [U] :
( op1(U,U) != U
| ~ sorti1(U) ),
inference(nnf_transformation,[status(thm)],[f2]) ).
fof(f2_sk,plain,
! [U] :
( op1(U,U) != U
| ~ sorti1(U) ),
inference(skolemisation,[status(esa)],[f2_nnf]) ).
cnf(c2,plain,
( op1(X0,X0) != X0
| ~ sorti1(X0) ),
inference(cnf_transformation,[status(esa)],[f2_sk]) ).
cnf(t143,plain,
ifeq(sorti1(X1),true,ifeq(op1(X1,X1),X1,false,true),true) = true,
inference(equality_encoding,[status(esa)],[c2]) ).
cnf(t294,plain,
ifeq(sorti1(X1),true,ifeq(op1(X1,X1),X1,false,true),true) = true,
inference(orient,[status(thm)],[t143]) ).
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,
( sorti1(j(X1))
| ~ sorti2(X1) ),
inference(cnf_transformation,[status(esa)],[f4_sk]) ).
cnf(hi5,negated_conjecture,
ifeq(sorti2(X0),true,sorti1(j(X0)),true) = true,
inference(equality_encoding,[status(esa)],[c6]) ).
fof(f3,axiom,
~ ! [U] :
( sorti2(U)
=> op2(U,U) != U ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',ax4) ).
fof(f3_nnf,plain,
? [U] :
( op2(U,U) = U
& sorti2(U) ),
inference(nnf_transformation,[status(thm)],[f3]) ).
fof(f3_sk,plain,
( op2(sk0,sk0) = sk0
& sorti2(sk0) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sk0])],[f3_nnf]) ).
cnf(c3,plain,
sorti2(sk0),
inference(cnf_transformation,[status(esa)],[f3_sk]) ).
cnf(hi2,axiom,
sorti2(sk0) = true,
inference(equality_encoding,[status(esa)],[c3]) ).
cnf(t3,plain,
sorti1(j(sk0)) = true,
inference(hyper_resolution,[status(thm)],[hi5,hi2]) ).
cnf(t286,plain,
sorti1(j(sk0)) = true,
inference(orient,[status(thm)],[t3]) ).
cnf(t295,plain,
true = ifeq(true,true,ifeq(op1(j(sk0),j(sk0)),j(sk0),false,true),true),
inference(cp,[status(thm)],[t294,t286]) ).
cnf(t6,plain,
ifeq(X1,X1,X2,X3) = X2,
introduced(definition) ).
cnf(t256,plain,
ifeq(X1,X1,X2,X3) = X2,
inference(orient,[status(thm)],[t6]) ).
cnf(t306,plain,
true = ifeq(op1(j(sk0),j(sk0)),j(sk0),false,true),
inference(step,[status(thm)],[t295,t256]) ).
cnf(c8,plain,
( j(op2(X4,X5)) = op1(j(X4),j(X5))
| ~ sorti2(X5)
| ~ sorti2(X4) ),
inference(cnf_transformation,[status(esa)],[f4_sk]) ).
cnf(hi7,negated_conjecture,
ifeq(sorti2(X0),true,ifeq(sorti2(X1),true,j(op2(X0,X1)),op1(j(X0),j(X1))),op1(j(X0),j(X1))) = op1(j(X0),j(X1)),
inference(equality_encoding,[status(esa)],[c8]) ).
cnf(t30,plain,
op1(j(sk0),j(sk0)) = j(op2(sk0,sk0)),
inference(hyper_resolution,[status(thm)],[hi7,hi2,hi2]) ).
cnf(c4,plain,
op2(sk0,sk0) = sk0,
inference(cnf_transformation,[status(esa)],[f3_sk]) ).
cnf(t2,plain,
op2(sk0,sk0) = sk0,
inference(equality_encoding,[status(esa)],[c4]) ).
cnf(t262,plain,
op2(sk0,sk0) = sk0,
inference(orient,[status(thm)],[t2]) ).
cnf(t305,plain,
op1(j(sk0),j(sk0)) = j(sk0),
inference(step,[status(thm)],[t30,t262]) ).
cnf(t278,plain,
op1(j(sk0),j(sk0)) = j(sk0),
inference(orient,[status(thm)],[t305]) ).
cnf(t307,plain,
true = ifeq(j(sk0),j(sk0),false,true),
inference(step,[status(thm)],[t306,t278]) ).
cnf(t308,plain,
true = false,
inference(step,[status(thm)],[t307,t256]) ).
cnf(t303,plain,
false = true,
inference(orient,[status(thm)],[t308]) ).
cnf(goal_0,negated_conjecture,
true != false,
inference(equality_encoding,[status(esa)],[c2]) ).
cnf(g0_0,plain,
true != true,
inference(rw,[status(thm)],[goal_0,t303]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : ALG201+1 : TPTP v9.3.1. Released v2.7.0.
% 0.00/0.04 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.08/0.36 % Computer : n017.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 : Fri Sep 25 04:58:03 UTC 2026
% 0.13/0.36 % CPUTime :
% 0.13/0.36 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 64.96/8.68 % SZS status Theorem for /export/starexec/sandbox/benchmark/theBenchmark.p
% 64.96/8.68 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------