%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : COL075-2 : TPTP v9.3.1. Released v1.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 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 01:02:46 PM UTC 2026
% Result : Unsatisfiable 2.38s 1.29s
% Output : CNFRefutation 2.38s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of formulae : 10 ( 10 unt; 0 def)
% Number of atoms : 10 ( 9 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 20 ( 0 sgn 20 !; 0 ?; 14 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0,X1] : apply(apply(k,X0),X1) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',k_definition) ).
fof(f2,axiom,
! [X2,X0,X1] : apply(apply(apply(abstraction,X0),X1),X2) = apply(apply(X0,apply(k,X2)),apply(X1,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',abstraction) ).
fof(f3,negated_conjecture,
! [X0] : apply(apply(X0,b(X0)),c(X0)) != apply(b(X0),b(X0)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_diagonal_combinator) ).
tcf(c_52,plain,
! [X0: $i,X1: $i] : apply(apply(k,X0),X1) = X0,
inference(cnf_transformation,[],[f1]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i,X2: $i] : apply(apply(X0,apply(k,X1)),apply(X2,X1)) = apply(apply(apply(abstraction,X0),X2),X1),
inference(cnf_transformation,[],[f2]) ).
tcf(c_54,negated_conjecture,
! [X0: $i] : apply(apply(X0,b(X0)),c(X0)) != apply(b(X0),b(X0)),
inference(cnf_transformation,[],[f3]) ).
tcf(c_96,plain,
! [X0: $i,X1: $i,X2: $i] : apply(apply(apply(abstraction,apply(k,X0)),X1),X2) = apply(X0,apply(X1,X2)),
inference(superposition,[status(thm)],[c_52,c_53]) ).
tcf(c_132,plain,
! [X0: $i,X1: $i,X2: $i] : apply(apply(apply(apply(abstraction,abstraction),X0),X1),X2) = apply(X1,apply(apply(X0,X1),X2)),
inference(superposition,[status(thm)],[c_53,c_96]) ).
tcf(c_211,plain,
! [X0: $i,X1: $i] : apply(apply(apply(apply(abstraction,abstraction),k),X0),X1) = apply(X0,X0),
inference(superposition,[status(thm)],[c_52,c_132]) ).
tcf(c_414,plain,
$false,
inference(superposition,[status(thm)],[c_211,c_54]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : COL075-2 : TPTP v9.3.1. Released v1.2.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.08/0.37 % Computer : n011.cluster.edu
% 0.08/0.37 % Model : x86_64 x86_64
% 0.08/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.37 % Memory : 8046.5625MB
% 0.08/0.37 % OS : Linux 6.8.0-71-generic
% 0.08/0.37 % CPULimit : 300
% 0.08/0.37 % WCLimit : 300
% 0.08/0.37 % DateTime : Fri Sep 25 07:29:29 UTC 2026
% 0.02/0.38 % CPUTime :
% 0.02/0.38 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.02/0.41 Running UEQ theorem proving
% 0.02/0.41 Running: /export/starexec/sandbox/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s ueq_schedule -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.02/0.42
% 0.02/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.02/0.42
% 0.02/0.42 % Detected problem language: tptp
% 0.02/0.44 % Proving...
% 2.38/1.29 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 2.38/1.29 % SZS status Started for theBenchmark.p
% 2.38/1.29 % SZS status Unsatisfiable for theBenchmark.p
% 2.38/1.29
% 2.38/1.29 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.38/1.29
% 2.38/1.29 % ------ iProver source info
% 2.38/1.29
% 2.38/1.29 % git: date: 2026-07-19 20:42:38 +0200
% 2.38/1.29 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.38/1.29 % git: non_committed_changes: false
% 2.38/1.29
% 2.38/1.29 % ------ Parsing...% successful
% 2.38/1.29
% 2.38/1.29
% 2.38/1.29 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 2.38/1.29
% 2.38/1.29 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 2.38/1.29
% 2.38/1.29 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 2.38/1.29
% 2.38/1.29 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 2.38/1.29 % ------ Proving...
% 2.38/1.29 % ------ Problem Properties
% 2.38/1.29
% 2.38/1.29 %
% 2.38/1.29 % clauses 3
% 2.38/1.29 % conjectures 1
% 2.38/1.29 % EPR 0
% 2.38/1.29 % Horn 3
% 2.38/1.29 % unary 3
% 2.38/1.29 % binary 0
% 2.38/1.29 % lits 3
% 2.38/1.29 % lits eq 3
% 2.38/1.29 % fd_pure 0
% 2.38/1.29 % fd_pseudo 0
% 2.38/1.29 % fd_cond 0
% 2.38/1.29 % fd_pseudo_cond 0
% 2.38/1.29 % AC symbols 0
% 2.38/1.29
% 2.38/1.29 % ------ Input Options Time Limit: Unbounded
% 2.38/1.29
% 2.38/1.29
% 2.38/1.29 % ------
% 2.38/1.29 % Current options:
% 2.38/1.29 % ------
% 2.38/1.29
% 2.38/1.29
% 2.38/1.29 %
% 2.38/1.29
% 2.38/1.29 % ------ Proving...
% 2.38/1.29 %
% 2.38/1.29
% 2.38/1.29 % SZS status Unsatisfiable for theBenchmark.p
% 2.38/1.29
% 2.38/1.29 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.38/1.29
% 2.38/1.29
%------------------------------------------------------------------------------