%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : COL003-16 : TPTP v9.3.1. Released v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n006.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:29 PM UTC 2026
% Result : Unsatisfiable 16.83s 3.23s
% Output : CNFRefutation 16.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 4
% Syntax : Number of formulae : 17 ( 17 unt; 0 def)
% Number of atoms : 17 ( 16 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 4 ( 4 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 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 : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 20 ( 0 sgn 20 !; 0 ?; 15 :)
% 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(w,X0),X1) = apply(apply(X0,X1),X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',w_definition) ).
fof(f3,axiom,
strong_fixed_point = apply(apply(b,apply(apply(b,apply(apply(b,apply(w,w)),w)),b)),b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',strong_fixed_point) ).
fof(f4,negated_conjecture,
apply(strong_fixed_point,fixed_pt) != apply(fixed_pt,apply(strong_fixed_point,fixed_pt)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_strong_fixed_point) ).
tcf(c_53,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_54,plain,
! [X0: $i,X1: $i] : apply(apply(X0,X1),X1) = apply(apply(w,X0),X1),
inference(cnf_transformation,[],[f2]) ).
tcf(c_55,plain,
apply(apply(b,apply(apply(b,apply(apply(b,apply(w,w)),w)),b)),b) = strong_fixed_point,
inference(cnf_transformation,[],[f3]) ).
tcf(c_56,negated_conjecture,
apply(fixed_pt,apply(strong_fixed_point,fixed_pt)) != apply(strong_fixed_point,fixed_pt),
inference(cnf_transformation,[],[f4]) ).
tcf(c_67,plain,
apply(fixed_pt,apply(apply(apply(b,apply(apply(b,apply(apply(b,apply(w,w)),w)),b)),b),fixed_pt)) != apply(apply(apply(b,apply(apply(b,apply(apply(b,apply(w,w)),w)),b)),b),fixed_pt),
inference(demodulation,[status(thm)],[c_56,c_55]) ).
tcf(c_68,plain,
apply(fixed_pt,apply(apply(w,w),apply(w,apply(b,apply(b,fixed_pt))))) != apply(apply(w,w),apply(w,apply(b,apply(b,fixed_pt)))),
inference(demodulation,[status(thm)],[c_67,c_53]) ).
tcf(c_136,plain,
! [X0: $i,X1: $i] : apply(apply(w,apply(b,X0)),X1) = apply(X0,apply(X1,X1)),
inference(superposition,[status(thm)],[c_53,c_54]) ).
tcf(c_185,plain,
! [X0: $i,X1: $i,X2: $i] : apply(apply(apply(w,apply(b,apply(b,X0))),X1),X2) = apply(X0,apply(apply(X1,X1),X2)),
inference(superposition,[status(thm)],[c_136,c_53]) ).
tcf(c_3543,plain,
! [X0: $i] : apply(apply(X0,X0),X0) = apply(apply(w,w),X0),
inference(superposition,[status(thm)],[c_54,c_54]) ).
tcf(c_6309,plain,
! [X0: $i,X1: $i] : apply(apply(apply(w,apply(b,apply(b,X0))),X1),X1) = apply(X0,apply(apply(w,X1),X1)),
inference(superposition,[status(thm)],[c_54,c_185]) ).
tcf(c_20410,plain,
! [X0: $i] : apply(X0,apply(apply(w,apply(w,apply(b,apply(b,X0)))),apply(w,apply(b,apply(b,X0))))) = apply(apply(w,w),apply(w,apply(b,apply(b,X0)))),
inference(superposition,[status(thm)],[c_6309,c_3543]) ).
tcf(c_20439,plain,
! [X0: $i] : apply(X0,apply(apply(w,w),apply(w,apply(b,apply(b,X0))))) = apply(apply(w,w),apply(w,apply(b,apply(b,X0)))),
inference(demodulation,[status(thm)],[c_20410,c_54]) ).
tcf(c_20464,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_68,c_20439]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COL003-16 : TPTP v9.3.1. Released v2.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.37 % Computer : n006.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Fri Sep 25 07:07:56 UTC 2026
% 0.09/0.38 % CPUTime :
% 0.09/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.09/0.41 Running UEQ theorem proving
% 0.09/0.41 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.09/0.43
% 0.09/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.09/0.43
% 0.09/0.43 % Detected problem language: tptp
% 0.09/0.44 % Proving...
% 16.83/3.23 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 16.83/3.23 % SZS status Started for theBenchmark.p
% 16.83/3.23 % SZS status Unsatisfiable for theBenchmark.p
% 16.83/3.23
% 16.83/3.23 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 16.83/3.23
% 16.83/3.23 % ------ iProver source info
% 16.83/3.23
% 16.83/3.23 % git: date: 2026-07-19 20:42:38 +0200
% 16.83/3.23 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 16.83/3.23 % git: non_committed_changes: false
% 16.83/3.23
% 16.83/3.23 % ------ Parsing...% successful
% 16.83/3.23
% 16.83/3.23
% 16.83/3.23 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 16.83/3.23
% 16.83/3.23 % ------ Preprocessing... sup_sim: 2 sf_s rm: 0 0s sf_e pe_s pe_e %
% 16.83/3.23
% 16.83/3.23 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 16.83/3.23
% 16.83/3.23 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 16.83/3.23 % ------ Proving...
% 16.83/3.23 % ------ Problem Properties
% 16.83/3.23
% 16.83/3.23 %
% 16.83/3.23 % clauses 4
% 16.83/3.23 % conjectures 0
% 16.83/3.23 % EPR 0
% 16.83/3.23 % Horn 4
% 16.83/3.23 % unary 4
% 16.83/3.23 % binary 0
% 16.83/3.23 % lits 4
% 16.83/3.23 % lits eq 4
% 16.83/3.23 % fd_pure 0
% 16.83/3.23 % fd_pseudo 0
% 16.83/3.23 % fd_cond 0
% 16.83/3.23 % fd_pseudo_cond 0
% 16.83/3.23 % AC symbols 0
% 16.83/3.23
% 16.83/3.23 % ------ Input Options Time Limit: Unbounded
% 16.83/3.23
% 16.83/3.23
% 16.83/3.23 % ------
% 16.83/3.23 % Current options:
% 16.83/3.23 % ------
% 16.83/3.23
% 16.83/3.23
% 16.83/3.23 %
% 16.83/3.23
% 16.83/3.23 % ------ Proving...
% 16.83/3.23 %
% 16.83/3.23
% 16.83/3.23 % SZS status Unsatisfiable for theBenchmark.p
% 16.83/3.23
% 16.83/3.23 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 16.83/3.23
% 16.83/3.23
%------------------------------------------------------------------------------