%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : COL032-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 : n010.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:35 PM UTC 2026
% Result : Unsatisfiable 1.23s 1.27s
% Output : CNFRefutation 1.23s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% 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 : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 avg)
% Maximal term depth : 7 ( 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 : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 15 ( 0 sgn 15 !; 0 ?; 10 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] : apply(m,X0) = apply(X0,X0),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m_definition) ).
fof(f2,axiom,
! [X2,X0,X1] : apply(apply(apply(q,X0),X1),X2) = apply(X1,apply(X0,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',q_definition) ).
fof(f3,negated_conjecture,
! [X0] : apply(X0,f(X0)) != apply(f(X0),apply(X0,f(X0))),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_fixed_point) ).
tcf(c_52,plain,
! [X0: $i] : apply(X0,X0) = apply(m,X0),
inference(cnf_transformation,[],[f1]) ).
tcf(c_53,plain,
! [X0: $i,X1: $i,X2: $i] : apply(apply(apply(q,X0),X1),X2) = apply(X1,apply(X0,X2)),
inference(cnf_transformation,[],[f2]) ).
tcf(c_54,negated_conjecture,
! [X0: $i] : apply(f(X0),apply(X0,f(X0))) != apply(X0,f(X0)),
inference(cnf_transformation,[],[f3]) ).
tcf(c_94,plain,
! [X0: $i,X1: $i] : apply(X0,apply(X1,apply(apply(q,X1),X0))) = apply(m,apply(apply(q,X1),X0)),
inference(superposition,[status(thm)],[c_53,c_52]) ).
tcf(c_95,plain,
! [X0: $i,X1: $i] : apply(f(apply(apply(q,X0),X1)),apply(X1,apply(X0,f(apply(apply(q,X0),X1))))) != apply(X1,apply(X0,f(apply(apply(q,X0),X1)))),
inference(superposition,[status(thm)],[c_53,c_54]) ).
tcf(c_586,plain,
! [X0: $i] : apply(X0,apply(apply(q,X0),f(apply(apply(q,apply(q,X0)),X0)))) != apply(m,apply(apply(q,X0),f(apply(apply(q,apply(q,X0)),X0)))),
inference(superposition,[status(thm)],[c_94,c_95]) ).
tcf(c_1077,plain,
$false,
inference(equality_resolution,[status(thm)],[c_586]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : COL032-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.03 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.36 % Computer : n010.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Fri Sep 25 07:15:17 UTC 2026
% 0.10/0.37 % CPUTime :
% 0.10/0.37 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.40 Running UEQ theorem proving
% 0.10/0.40 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.10/0.41
% 0.10/0.41 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.41
% 0.10/0.41 % Detected problem language: tptp
% 0.10/0.42 % Proving...
% 1.23/1.27 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 1.23/1.27 % SZS status Started for theBenchmark.p
% 1.23/1.27 % SZS status Unsatisfiable for theBenchmark.p
% 1.23/1.27
% 1.23/1.27 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.23/1.27
% 1.23/1.27 % ------ iProver source info
% 1.23/1.27
% 1.23/1.27 % git: date: 2026-07-19 20:42:38 +0200
% 1.23/1.27 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.23/1.27 % git: non_committed_changes: false
% 1.23/1.27
% 1.23/1.27 % ------ Parsing...% successful
% 1.23/1.27
% 1.23/1.27
% 1.23/1.27 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.23/1.27
% 1.23/1.27 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.23/1.27
% 1.23/1.27 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.23/1.27
% 1.23/1.27 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 1.23/1.27 % ------ Proving...
% 1.23/1.27 % ------ Problem Properties
% 1.23/1.27
% 1.23/1.27 %
% 1.23/1.27 % clauses 3
% 1.23/1.27 % conjectures 1
% 1.23/1.27 % EPR 0
% 1.23/1.27 % Horn 3
% 1.23/1.27 % unary 3
% 1.23/1.27 % binary 0
% 1.23/1.27 % lits 3
% 1.23/1.27 % lits eq 3
% 1.23/1.27 % fd_pure 0
% 1.23/1.27 % fd_pseudo 0
% 1.23/1.27 % fd_cond 0
% 1.23/1.27 % fd_pseudo_cond 0
% 1.23/1.27 % AC symbols 0
% 1.23/1.27
% 1.23/1.27 % ------ Input Options Time Limit: Unbounded
% 1.23/1.27
% 1.23/1.27
% 1.23/1.27 % ------
% 1.23/1.27 % Current options:
% 1.23/1.27 % ------
% 1.23/1.27
% 1.23/1.27
% 1.23/1.27 %
% 1.23/1.27
% 1.23/1.27 % ------ Proving...
% 1.23/1.27 %
% 1.23/1.27
% 1.23/1.27 % SZS status Unsatisfiable for theBenchmark.p
% 1.23/1.27
% 1.23/1.27 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.23/1.27
% 1.23/1.27
%------------------------------------------------------------------------------