%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : COL061-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/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:42 PM UTC 2026
% Result : Unsatisfiable 0.83s 1.21s
% Output : CNFRefutation 0.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 3
% Syntax : Number of formulae : 12 ( 12 unt; 0 def)
% Number of atoms : 12 ( 11 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 7 ( 7 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 3 avg)
% Maximal term depth : 10 ( 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 : 6 ( 6 usr; 2 con; 0-2 aty)
% Number of variables : 22 ( 0 sgn 22 !; 0 ?; 16 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X2,X0,X1] : apply(apply(apply(b,X0),X1),X2) = apply(X0,apply(X1,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',b_definition) ).
fof(f2,axiom,
! [X0,X1] : apply(apply(t,X0),X1) = apply(X1,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t_definition) ).
fof(f3,negated_conjecture,
! [X0] : apply(apply(apply(X0,f(X0)),g(X0)),h(X0)) != apply(f(X0),apply(h(X0),g(X0))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_q1_combinator) ).
tcf(c_52,plain,
! [X0: $i,X1: $i,X2: $i] : apply(apply(apply(b,X0),X1),X2) = apply(X0,apply(X1,X2)),
inference(cnf_transformation,[],[f1]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i] : apply(apply(t,X0),X1) = apply(X1,X0),
inference(cnf_transformation,[],[f2]) ).
tcf(c_54,negated_conjecture,
! [X0: $i] : apply(apply(apply(X0,f(X0)),g(X0)),h(X0)) != apply(f(X0),apply(h(X0),g(X0))),
inference(cnf_transformation,[],[f3]) ).
tcf(c_95,plain,
! [X0: $i,X1: $i] : apply(apply(apply(X0,apply(X1,f(apply(apply(b,X0),X1)))),g(apply(apply(b,X0),X1))),h(apply(apply(b,X0),X1))) != apply(f(apply(apply(b,X0),X1)),apply(h(apply(apply(b,X0),X1)),g(apply(apply(b,X0),X1)))),
inference(superposition,[status(thm)],[c_52,c_54]) ).
tcf(c_117,plain,
! [X0: $i,X1: $i] : apply(apply(apply(apply(X0,f(apply(apply(b,apply(t,X1)),X0))),X1),g(apply(apply(b,apply(t,X1)),X0))),h(apply(apply(b,apply(t,X1)),X0))) != apply(f(apply(apply(b,apply(t,X1)),X0)),apply(h(apply(apply(b,apply(t,X1)),X0)),g(apply(apply(b,apply(t,X1)),X0)))),
inference(superposition,[status(thm)],[c_53,c_95]) ).
tcf(c_164,plain,
! [X0: $i,X1: $i,X2: $i] : apply(apply(apply(apply(X0,apply(X1,f(apply(apply(b,apply(t,X2)),apply(apply(b,X0),X1))))),X2),g(apply(apply(b,apply(t,X2)),apply(apply(b,X0),X1)))),h(apply(apply(b,apply(t,X2)),apply(apply(b,X0),X1)))) != apply(f(apply(apply(b,apply(t,X2)),apply(apply(b,X0),X1))),apply(h(apply(apply(b,apply(t,X2)),apply(apply(b,X0),X1))),g(apply(apply(b,apply(t,X2)),apply(apply(b,X0),X1))))),
inference(superposition,[status(thm)],[c_52,c_117]) ).
tcf(c_729,plain,
! [X0: $i,X1: $i] : apply(apply(apply(X0,f(apply(apply(b,apply(t,X1)),apply(apply(b,b),X0)))),apply(X1,g(apply(apply(b,apply(t,X1)),apply(apply(b,b),X0))))),h(apply(apply(b,apply(t,X1)),apply(apply(b,b),X0)))) != apply(f(apply(apply(b,apply(t,X1)),apply(apply(b,b),X0))),apply(h(apply(apply(b,apply(t,X1)),apply(apply(b,b),X0))),g(apply(apply(b,apply(t,X1)),apply(apply(b,b),X0))))),
inference(superposition,[status(thm)],[c_52,c_164]) ).
tcf(c_915,plain,
! [X0: $i] : apply(f(apply(apply(b,apply(t,X0)),apply(apply(b,b),b))),apply(apply(X0,g(apply(apply(b,apply(t,X0)),apply(apply(b,b),b)))),h(apply(apply(b,apply(t,X0)),apply(apply(b,b),b))))) != apply(f(apply(apply(b,apply(t,X0)),apply(apply(b,b),b))),apply(h(apply(apply(b,apply(t,X0)),apply(apply(b,b),b))),g(apply(apply(b,apply(t,X0)),apply(apply(b,b),b))))),
inference(superposition,[status(thm)],[c_52,c_729]) ).
tcf(c_930,plain,
$false,
inference(superposition,[status(thm)],[c_53,c_915]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COL061-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.13/0.39 % Computer : n011.cluster.edu
% 0.13/0.39 % Model : x86_64 x86_64
% 0.13/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.39 % Memory : 8046.5625MB
% 0.13/0.39 % OS : Linux 6.8.0-71-generic
% 0.13/0.39 % CPULimit : 300
% 0.13/0.39 % WCLimit : 300
% 0.13/0.39 % DateTime : Fri Sep 25 07:23:13 UTC 2026
% 0.13/0.39 % CPUTime :
% 0.13/0.39 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.13/0.43 Running UEQ theorem proving
% 0.13/0.43 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s ueq_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.13/0.44
% 0.13/0.44 % ======== iProver multi-core TPTP/SMT =========
% 0.13/0.44
% 0.13/0.44 % Detected problem language: tptp
% 0.13/0.45 % Proving...
% 0.83/1.21 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 0.83/1.21 % SZS status Started for theBenchmark.p
% 0.83/1.21 % SZS status Unsatisfiable for theBenchmark.p
% 0.83/1.21
% 0.83/1.21 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 0.83/1.21
% 0.83/1.21 % ------ iProver source info
% 0.83/1.21
% 0.83/1.21 % git: date: 2026-07-19 20:42:38 +0200
% 0.83/1.21 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 0.83/1.21 % git: non_committed_changes: false
% 0.83/1.21
% 0.83/1.21 % ------ Parsing...% successful
% 0.83/1.21
% 0.83/1.21
% 0.83/1.21 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 0.83/1.21
% 0.83/1.21 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 0.83/1.21
% 0.83/1.21 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 0.83/1.21
% 0.83/1.21 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 0.83/1.21 % ------ Proving...
% 0.83/1.21 % ------ Problem Properties
% 0.83/1.21
% 0.83/1.21 %
% 0.83/1.21 % clauses 3
% 0.83/1.21 % conjectures 1
% 0.83/1.21 % EPR 0
% 0.83/1.21 % Horn 3
% 0.83/1.21 % unary 3
% 0.83/1.21 % binary 0
% 0.83/1.21 % lits 3
% 0.83/1.21 % lits eq 3
% 0.83/1.21 % fd_pure 0
% 0.83/1.21 % fd_pseudo 0
% 0.83/1.21 % fd_cond 0
% 0.83/1.21 % fd_pseudo_cond 0
% 0.83/1.21 % AC symbols 0
% 0.83/1.21
% 0.83/1.21 % ------ Input Options Time Limit: Unbounded
% 0.83/1.21
% 0.83/1.21
% 0.83/1.21 % ------
% 0.83/1.21 % Current options:
% 0.83/1.21 % ------
% 0.83/1.21
% 0.83/1.21
% 0.83/1.21 %
% 0.83/1.21
% 0.83/1.21 % ------ Proving...
% 0.83/1.21 %
% 0.83/1.21
% 0.83/1.21 % SZS status Unsatisfiable for theBenchmark.p
% 0.83/1.21
% 0.83/1.21 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 0.83/1.21
% 0.83/1.21
%------------------------------------------------------------------------------