%------------------------------------------------------------------------------
% File : Prover9---2026-6A
% Problem : COL076-1 : TPTP v9.3.1. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 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 : Sun Sep 27 06:57:38 AM UTC 2026
% Result : Unsatisfiable 5.23s 6.14s
% Output : CNFRefutation 5.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 6
% Syntax : Number of formulae : 36 ( 30 unt; 0 def)
% Number of atoms : 42 ( 41 equ)
% Maximal formula atoms : 2 ( 1 avg)
% Number of connectives : 22 ( 16 ~; 6 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 2 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 71 ( 2 sgn 13 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(k_definition,axiom,
! [VAR_0,VAR_1] : apply(apply(k,VAR_0),VAR_1) = VAR_0,
file('theBenchmark.p',k_definition) ).
cnf(c_1,plain,
apply(apply(k,A),B) = A,
inference(clausify,[status(thm)],[k_definition]) ).
fof(pairwise_application,axiom,
! [VAR_0,VAR_1,VAR_2] : apply(pair(VAR_0,VAR_1),VAR_2) = pair(apply(VAR_0,VAR_2),apply(VAR_1,VAR_2)),
file('theBenchmark.p',pairwise_application) ).
cnf(c_5,plain,
apply(pair(A,B),C) = pair(apply(A,C),apply(B,C)),
inference(clausify,[status(thm)],[pairwise_application]) ).
cnf(c_6,plain,
pair(apply(A,B),apply(C,B)) = apply(pair(A,C),B),
inference(copy,[status(thm)],[c_5]) ).
fof(abstraction,axiom,
! [VAR_0,VAR_1,VAR_2] : apply(apply(apply(abstraction,VAR_0),VAR_1),VAR_2) = apply(apply(VAR_0,apply(k,VAR_2)),apply(VAR_1,VAR_2)),
file('theBenchmark.p',abstraction) ).
cnf(c_7,plain,
apply(apply(apply(abstraction,A),B),C) = apply(apply(A,apply(k,C)),apply(B,C)),
inference(clausify,[status(thm)],[abstraction]) ).
fof(extensionality2,axiom,
! [VAR_0,VAR_1] :
( apply(VAR_0,n(VAR_0,VAR_1)) != apply(VAR_1,n(VAR_0,VAR_1))
| VAR_0 = VAR_1 ),
file('theBenchmark.p',extensionality2) ).
cnf(c_10,plain,
( apply(A,n(A,B)) != apply(B,n(A,B))
| A = B ),
inference(clausify,[status(thm)],[extensionality2]) ).
cnf(c_11,plain,
( apply(B,n(A,B)) != apply(A,n(A,B))
| A = B ),
inference(copy,[status(thm)],[c_10]) ).
fof(diagonal_combinator,axiom,
! [VAR_0,VAR_1] : apply(apply(f,VAR_0),VAR_1) = apply(VAR_0,VAR_0),
file('theBenchmark.p',diagonal_combinator) ).
cnf(c_14,plain,
apply(apply(f,A),B) = apply(A,A),
inference(clausify,[status(thm)],[diagonal_combinator]) ).
fof(prove_self_referential,axiom,
! [VAR_0] : VAR_0 != apply(eq,pair(apply(k,VAR_0),apply(k,projection2))),
file('theBenchmark.p',prove_self_referential) ).
cnf(c_15,plain,
A != apply(eq,pair(apply(k,A),apply(k,projection2))),
inference(clausify,[status(thm)],[prove_self_referential]) ).
cnf(c_16,plain,
apply(eq,pair(apply(k,A),apply(k,projection2))) != A,
inference(copy,[status(thm)],[c_15]) ).
cnf(c_18,plain,
pair(A,apply(B,C)) = apply(pair(apply(k,A),B),C),
inference(paramod,[status(thm)],[c_1,c_6]) ).
cnf(c_19,plain,
pair(apply(A,B),C) = apply(pair(A,apply(k,C)),B),
inference(paramod,[status(thm)],[c_1,c_6]) ).
cnf(c_27,plain,
pair(A,apply(B,C)) = apply(apply(pair(k,apply(k,B)),A),C),
inference(paramod,[status(thm)],[c_19,c_18]) ).
cnf(c_28,plain,
apply(eq,apply(pair(k,apply(k,apply(k,projection2))),A)) != A,
inference(paramod,[status(thm)],[c_19,c_16]) ).
cnf(c_31,plain,
apply(apply(apply(abstraction,apply(k,A)),B),C) = apply(A,apply(B,C)),
inference(paramod,[status(thm)],[c_1,c_7]) ).
cnf(c_32,plain,
apply(apply(apply(abstraction,A),apply(k,B)),C) = apply(apply(A,apply(k,C)),B),
inference(paramod,[status(thm)],[c_1,c_7]) ).
cnf(c_1878,plain,
( B != apply(A,n(A,apply(k,B)))
| A = apply(k,B) ),
inference(paramod,[status(thm)],[c_1,c_11]) ).
cnf(c_1879,plain,
( B != apply(A,n(A,apply(k,B)))
| apply(k,B) = A ),
inference(copy,[status(thm)],[c_1878]) ).
cnf(c_43,plain,
( apply(B,n(B,apply(k,A))) != A
| apply(k,A) = B ),
inference(copy,[status(thm)],[c_1879]) ).
cnf(c_1880,plain,
apply(k,apply(A,A)) = apply(f,A),
inference(resolve,[status(thm)],[c_43,c_14]) ).
cnf(c_1589,plain,
apply(f,A) = apply(k,apply(A,A)),
inference(copy,[status(thm)],[c_1880]) ).
cnf(c_1881,plain,
pair(apply(k,A),apply(B,C)) = apply(apply(apply(abstraction,pair(k,apply(k,B))),apply(k,C)),A),
inference(paramod,[status(thm)],[c_32,c_27]) ).
cnf(c_1631,plain,
apply(pair(k,apply(k,apply(A,B))),C) = apply(apply(apply(abstraction,pair(k,apply(k,A))),apply(k,B)),C),
inference(paramod,[status(thm)],[c_19,c_1881]) ).
cnf(c_1716,plain,
apply(eq,apply(apply(apply(abstraction,pair(k,apply(k,k))),apply(k,projection2)),A)) != A,
inference(paramod,[status(thm)],[c_1631,c_28]) ).
cnf(c_1882,plain,
apply(eq,apply(apply(pair(k,apply(k,k)),apply(k,A)),apply(apply(k,projection2),A))) != A,
inference(paramod,[status(thm)],[c_7,c_1716]) ).
cnf(c_1717,plain,
apply(eq,apply(apply(pair(k,apply(k,k)),apply(k,A)),projection2)) != A,
inference(paramod,[status(thm)],[c_1,c_1882]) ).
cnf(c_1804,plain,
apply(eq,apply(apply(pair(k,apply(k,k)),apply(f,A)),projection2)) != apply(A,A),
inference(paramod,[status(thm)],[c_1589,c_1717]) ).
cnf(c_1883,plain,
apply(eq,pair(apply(f,A),apply(k,projection2))) != apply(A,A),
inference(paramod,[status(thm)],[c_27,c_1804]) ).
cnf(c_1876,plain,
apply(eq,apply(pair(f,apply(k,apply(k,projection2))),A)) != apply(A,A),
inference(paramod,[status(thm)],[c_19,c_1883]) ).
cnf(c_1884,plain,
apply(A,apply(B,C)) = apply(apply(apply(abstraction,apply(k,A)),B),C),
inference(copy,[status(thm)],[c_31]) ).
cnf(c_1877,plain,
$false,
inference(resolve,[status(thm)],[c_1876,c_1884]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : COL076-1 : TPTP v9.3.1. Released v1.2.0.
% 0.00/0.07 % Command : prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.18/5.45 % Computer : n017.cluster.edu
% 0.18/5.45 % Model : x86_64 x86_64
% 0.18/5.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/5.45 % Memory : 8046.5625MB
% 0.18/5.45 % OS : Linux 6.8.0-71-generic
% 0.18/5.45 % CPULimit : 300
% 0.18/5.45 % WCLimit : 300
% 0.18/5.45 % DateTime : Sat Sep 26 23:06:55 UTC 2026
% 0.18/5.46 % CPUTime :
% 0.18/5.46 % Prover9 (64) version 2026-6A, July 2026, CASC-J13.
% 0.18/5.46 % Process 1892568 was started by sandbox2 on n017,
% 0.18/5.46 % Sat Sep 26 23:06:55 2026
% 0.18/5.46 % The command was "/export/starexec/sandbox2/solver/bin/prover9 -casc 300 -f /export/starexec/sandbox2/benchmark/theBenchmark.p".
% 0.18/5.46
% 0.18/5.46 % From the command line: assign(max_seconds, 300).
% 5.23/6.14
% 5.23/6.14 % SZS status Unsatisfiable for theBenchmark
% 5.23/6.14
% 5.23/6.14 % Proof 1 at 0.52 (+ 0.13) seconds.
% 5.23/6.14 % Length of proof is 23.
% 5.23/6.14 % Level of proof is 9.
% 5.23/6.14 % Maximum clause weight is 23.000.
% 5.23/6.14 % Given clauses 103.
% 5.23/6.14
% 5.23/6.14 % SZS output start CNFRefutation for theBenchmark
% See solution above
%------------------------------------------------------------------------------