%------------------------------------------------------------------------------
% File : FindProof---0.1
% Problem : COL080-2 : TPTP v9.3.1. Released v1.2.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 01:02:00 PM UTC 2026
% Result : Unsatisfiable 15.32s 2.47s
% Output : Proof 15.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 5
% Syntax : Number of formulae : 42 ( 38 unt; 0 def)
% Number of atoms : 46 ( 45 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 14 ( 10 ~; 4 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 2 con; 0-4 aty)
% Number of variables : 83 ( 10 sgn 14 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
cnf(f2,axiom,
( apply(X,n(X,Y)) != apply(Y,n(X,Y))
| X = Y ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',extensionality2) ).
fof(f2_nnf,plain,
! [X,Y] :
( apply(X,n(X,Y)) != apply(Y,n(X,Y))
| X = Y ),
inference(nnf_transformation,[status(thm)],[f2]) ).
fof(f2_sk,plain,
! [X,Y] :
( apply(X,n(X,Y)) != apply(Y,n(X,Y))
| X = Y ),
inference(skolemisation,[status(esa)],[f2_nnf]) ).
cnf(c2,plain,
( apply(X0,n(X0,X1)) != apply(X1,n(X0,X1))
| X0 = X1 ),
inference(cnf_transformation,[status(esa)],[f2_sk]) ).
cnf(t3,plain,
ifeq(apply(X1,n(X1,X2)),apply(X2,n(X1,X2)),X1,X2) = X2,
inference(equality_encoding,[status(esa)],[c2]) ).
cnf(t39,plain,
ifeq(apply(X1,n(X1,X2)),apply(X2,n(X1,X2)),X1,X2) = X2,
inference(orient,[status(thm)],[t3]) ).
cnf(f0,axiom,
apply(k(X),Y) = X,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',k_definition) ).
fof(f0_nnf,plain,
! [X,Y] : apply(k(X),Y) = X,
inference(nnf_transformation,[status(thm)],[f0]) ).
fof(f0_sk,plain,
! [X,Y] : apply(k(X),Y) = X,
inference(skolemisation,[status(esa)],[f0_nnf]) ).
cnf(c0,plain,
apply(k(X0),X1) = X0,
inference(cnf_transformation,[status(esa)],[f0_sk]) ).
cnf(t1,plain,
apply(k(X1),X2) = X1,
inference(equality_encoding,[status(esa)],[c0]) ).
cnf(t6,plain,
apply(k(X1),X2) = X1,
inference(orient,[status(thm)],[t1]) ).
cnf(t42,plain,
X1 = ifeq(X2,apply(X1,n(k(X2),X1)),k(X2),X1),
inference(cp,[status(thm)],[t39,t6]) ).
cnf(t117,plain,
ifeq(X1,apply(X2,n(k(X1),X2)),k(X1),X2) = X2,
inference(orient,[status(thm)],[t42]) ).
cnf(f1,axiom,
apply(apply(apply(abstraction,X),Y),Z) = apply(apply(X,k(Z)),apply(Y,Z)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',abstraction) ).
fof(f1_nnf,plain,
! [X,Y,Z] : apply(apply(apply(abstraction,X),Y),Z) = apply(apply(X,k(Z)),apply(Y,Z)),
inference(nnf_transformation,[status(thm)],[f1]) ).
fof(f1_sk,plain,
! [X,Y,Z] : apply(apply(apply(abstraction,X),Y),Z) = apply(apply(X,k(Z)),apply(Y,Z)),
inference(skolemisation,[status(esa)],[f1_nnf]) ).
cnf(c1,plain,
apply(apply(apply(abstraction,X0),X1),X2) = apply(apply(X0,k(X2)),apply(X1,X2)),
inference(cnf_transformation,[status(esa)],[f1_sk]) ).
cnf(t4,plain,
apply(apply(X1,k(X2)),apply(X3,X2)) = apply(apply(apply(abstraction,X1),X3),X2),
inference(equality_encoding,[status(esa)],[c1]) ).
cnf(t8,plain,
apply(apply(X1,k(X2)),apply(X3,X2)) = apply(apply(apply(abstraction,X1),X3),X2),
inference(orient,[status(thm)],[t4]) ).
cnf(t11,plain,
apply(apply(apply(abstraction,k(X1)),X2),X3) = apply(X1,apply(X2,X3)),
inference(cp,[status(thm)],[t8,t6]) ).
cnf(t18,plain,
apply(apply(apply(abstraction,k(X1)),X2),X3) = apply(X1,apply(X2,X3)),
inference(orient,[status(thm)],[t11]) ).
cnf(t19,plain,
apply(X1,apply(k(X2),apply(X3,X2))) = apply(apply(apply(abstraction,apply(abstraction,k(X1))),X3),X2),
inference(cp,[status(thm)],[t18,t8]) ).
cnf(t1944,plain,
apply(X1,X2) = apply(apply(apply(abstraction,apply(abstraction,k(X1))),X3),X2),
inference(step,[status(thm)],[t19,t6]) ).
cnf(t31,plain,
apply(apply(apply(abstraction,apply(abstraction,k(X1))),X2),X3) = apply(X1,X3),
inference(orient,[status(thm)],[t1944]) ).
cnf(t52,plain,
X1 = ifeq(apply(X2,n(apply(apply(abstraction,apply(abstraction,k(X2))),X3),X1)),apply(X1,n(apply(apply(abstraction,apply(abstraction,k(X2))),X3),X1)),apply(apply(abstraction,apply(abstraction,k(X2))),X3),X1),
inference(cp,[status(thm)],[t39,t31]) ).
cnf(t1848,plain,
ifeq(apply(X1,n(apply(apply(abstraction,apply(abstraction,k(X1))),X2),X3)),apply(X3,n(apply(apply(abstraction,apply(abstraction,k(X1))),X2),X3)),apply(apply(abstraction,apply(abstraction,k(X1))),X2),X3) = X3,
inference(orient,[status(thm)],[t52]) ).
cnf(t2,plain,
ifeq(X1,X1,X2,X3) = X2,
introduced(definition) ).
cnf(t7,plain,
ifeq(X1,X1,X2,X3) = X2,
inference(orient,[status(thm)],[t2]) ).
cnf(t1849,plain,
X1 = apply(apply(abstraction,apply(abstraction,k(X1))),X2),
inference(cp,[status(thm)],[t1848,t7]) ).
cnf(t1890,plain,
apply(apply(abstraction,apply(abstraction,k(X1))),X2) = X1,
inference(orient,[status(thm)],[t1849]) ).
cnf(t1901,plain,
apply(abstraction,apply(abstraction,k(X1))) = ifeq(X2,X1,k(X2),apply(abstraction,apply(abstraction,k(X1)))),
inference(cp,[status(thm)],[t117,t1890]) ).
cnf(t1924,plain,
ifeq(X1,X2,k(X1),apply(abstraction,apply(abstraction,k(X2)))) = apply(abstraction,apply(abstraction,k(X2))),
inference(orient,[status(thm)],[t1901]) ).
cnf(t1925,plain,
apply(abstraction,apply(abstraction,k(X1))) = k(X1),
inference(cp,[status(thm)],[t1924,t7]) ).
cnf(t1926,plain,
apply(abstraction,apply(abstraction,k(X1))) = k(X1),
inference(orient,[status(thm)],[t1925]) ).
cnf(f4,negated_conjecture,
k(b) != apply(abstraction,apply(abstraction,k(b))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_TRC2b) ).
fof(f4_nnf,plain,
k(b) != apply(abstraction,apply(abstraction,k(b))),
inference(nnf_transformation,[status(thm)],[f4]) ).
fof(f4_sk,plain,
k(b) != apply(abstraction,apply(abstraction,k(b))),
inference(skolemisation,[status(esa)],[f4_nnf]) ).
cnf(c4,plain,
k(b) != apply(abstraction,apply(abstraction,k(b))),
inference(cnf_transformation,[status(esa)],[f4_sk]) ).
cnf(goal_0,negated_conjecture,
apply(abstraction,apply(abstraction,k(b))) != k(b),
inference(equality_encoding,[status(esa)],[c4]) ).
cnf(g0_0,plain,
k(b) != k(b),
inference(rw,[status(thm)],[goal_0,t1926]) ).
cnf(contradiction_0,plain,
$false,
inference(trivial_inequality_removal,[status(thm)],[g0_0]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : COL080-2 : TPTP v9.3.1. Released v1.2.0.
% 0.00/0.03 % Command : run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 0.10/0.37 % Computer : n017.cluster.edu
% 0.10/0.37 % Model : x86_64 x86_64
% 0.10/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.37 % Memory : 8046.5625MB
% 0.10/0.37 % OS : Linux 6.8.0-71-generic
% 0.10/0.37 % CPULimit : 300
% 0.10/0.37 % WCLimit : 300
% 0.10/0.37 % DateTime : Fri Sep 25 07:26:02 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_findproof /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 15.32/2.47 % SZS status Unsatisfiable for /export/starexec/sandbox/benchmark/theBenchmark.p
% 15.32/2.47 % SZS output start Proof for /export/starexec/sandbox/benchmark/theBenchmark.p
% See solution above
%------------------------------------------------------------------------------