%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : COM010-2 : TPTP v9.3.1. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% Computer : n018.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:04:17 PM UTC 2026
% Result : Unsatisfiable 1.83s 1.31s
% Output : CNFRefutation 1.83s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of formulae : 14 ( 14 unt; 0 def)
% Number of atoms : 14 ( 13 equ)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 2 ( 2 ~; 0 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 3 ( 1 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 : 10 ( 10 usr; 3 con; 0-4 aty)
% Number of variables : 4 ( 0 sgn 4 !; 0 ?; 2 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,negated_conjecture,
c_UNITY_OInit(v_F,t_a) = c_UNITY_OInit(v_G,t_a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_0) ).
fof(f2,negated_conjecture,
c_UNITY_OActs(v_F,t_a) = c_UNITY_OActs(v_G,t_a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_1) ).
fof(f3,negated_conjecture,
c_UNITY_OAllowedActs(v_F,t_a) = c_UNITY_OAllowedActs(v_G,t_a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_2) ).
fof(f4,negated_conjecture,
v_F != v_G,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_conjecture_3) ).
fof(f5,axiom,
! [X0,X1] : c_UNITY_Omk__program(c_Pair(c_UNITY_OInit(X0,X1),c_Pair(c_UNITY_OActs(X0,X1),c_UNITY_OAllowedActs(X0,X1),tc_set(tc_set(tc_prod(X1,X1))),tc_set(tc_set(tc_prod(X1,X1)))),tc_set(X1),tc_prod(tc_set(tc_set(tc_prod(X1,X1))),tc_set(tc_set(tc_prod(X1,X1))))),X1) = X0,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_UNITY_Osurjective__mk__program_0) ).
tcf(c_54,negated_conjecture,
c_UNITY_OInit(v_F,t_a) = c_UNITY_OInit(v_G,t_a),
inference(cnf_transformation,[],[f1]) ).
tcf(c_55,negated_conjecture,
c_UNITY_OActs(v_F,t_a) = c_UNITY_OActs(v_G,t_a),
inference(cnf_transformation,[],[f2]) ).
tcf(c_56,negated_conjecture,
c_UNITY_OAllowedActs(v_F,t_a) = c_UNITY_OAllowedActs(v_G,t_a),
inference(cnf_transformation,[],[f3]) ).
tcf(c_57,negated_conjecture,
v_F != v_G,
inference(cnf_transformation,[],[f4]) ).
tcf(c_58,plain,
! [X0: $i,X1: $i] : c_UNITY_Omk__program(c_Pair(c_UNITY_OInit(X0,X1),c_Pair(c_UNITY_OActs(X0,X1),c_UNITY_OAllowedActs(X0,X1),tc_set(tc_set(tc_prod(X1,X1))),tc_set(tc_set(tc_prod(X1,X1)))),tc_set(X1),tc_prod(tc_set(tc_set(tc_prod(X1,X1))),tc_set(tc_set(tc_prod(X1,X1))))),X1) = X0,
inference(cnf_transformation,[],[f5]) ).
tcf(c_158,plain,
c_UNITY_Omk__program(c_Pair(c_UNITY_OInit(v_G,t_a),c_Pair(c_UNITY_OActs(v_G,t_a),c_UNITY_OAllowedActs(v_F,t_a),tc_set(tc_set(tc_prod(t_a,t_a))),tc_set(tc_set(tc_prod(t_a,t_a)))),tc_set(t_a),tc_prod(tc_set(tc_set(tc_prod(t_a,t_a))),tc_set(tc_set(tc_prod(t_a,t_a))))),t_a) = v_G,
inference(superposition,[status(thm)],[c_56,c_58]) ).
tcf(c_159,plain,
c_UNITY_Omk__program(c_Pair(c_UNITY_OInit(v_F,t_a),c_Pair(c_UNITY_OActs(v_F,t_a),c_UNITY_OAllowedActs(v_F,t_a),tc_set(tc_set(tc_prod(t_a,t_a))),tc_set(tc_set(tc_prod(t_a,t_a)))),tc_set(t_a),tc_prod(tc_set(tc_set(tc_prod(t_a,t_a))),tc_set(tc_set(tc_prod(t_a,t_a))))),t_a) = v_G,
inference(light_normalisation,[status(thm)],[c_158,c_54,c_55]) ).
tcf(c_162,plain,
v_F = v_G,
inference(demodulation,[status(thm)],[c_159,c_58]) ).
tcf(c_163,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_162,c_57]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : COM010-2 : TPTP v9.3.1. Released v3.2.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.13/0.39 % Computer : n018.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:48:05 UTC 2026
% 0.13/0.39 % CPUTime :
% 0.13/0.39 Running run_iprover 300 /export/starexec/sandbox/benchmark/theBenchmark.p THM
% 0.13/0.43 Running UEQ theorem proving
% 0.13/0.43 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.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.46 % Proving...
% 1.83/1.31 WARNING - Clausifier option not provided in the heuristic config "heur/vip2_118404", setting default options.
% 1.83/1.31 % SZS status Started for theBenchmark.p
% 1.83/1.31 % SZS status Unsatisfiable for theBenchmark.p
% 1.83/1.31
% 1.83/1.31 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.83/1.31
% 1.83/1.31 % ------ iProver source info
% 1.83/1.31
% 1.83/1.31 % git: date: 2026-07-19 20:42:38 +0200
% 1.83/1.31 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.83/1.31 % git: non_committed_changes: false
% 1.83/1.31
% 1.83/1.31 % ------ Parsing...% successful
% 1.83/1.31
% 1.83/1.31
% 1.83/1.31 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.83/1.31
% 1.83/1.31 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.83/1.31
% 1.83/1.31 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.83/1.31
% 1.83/1.31 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 1.83/1.31 % ------ Proving...
% 1.83/1.31 % ------ Problem Properties
% 1.83/1.31
% 1.83/1.31 %
% 1.83/1.31 % clauses 5
% 1.83/1.31 % conjectures 4
% 1.83/1.31 % EPR 1
% 1.83/1.31 % Horn 5
% 1.83/1.31 % unary 5
% 1.83/1.31 % binary 0
% 1.83/1.31 % lits 5
% 1.83/1.31 % lits eq 5
% 1.83/1.31 % fd_pure 0
% 1.83/1.31 % fd_pseudo 0
% 1.83/1.31 % fd_cond 0
% 1.83/1.31 % fd_pseudo_cond 0
% 1.83/1.31 % AC symbols 0
% 1.83/1.31
% 1.83/1.31 % ------ Input Options Time Limit: Unbounded
% 1.83/1.31
% 1.83/1.31
% 1.83/1.31 % ------
% 1.83/1.31 % Current options:
% 1.83/1.31 % ------
% 1.83/1.31
% 1.83/1.31
% 1.83/1.31 %
% 1.83/1.31
% 1.83/1.31 % ------ Proving...
% 1.83/1.31 %
% 1.83/1.31
% 1.83/1.31 % SZS status Unsatisfiable for theBenchmark.p
% 1.83/1.31
% 1.83/1.31 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.83/1.31
% 1.83/1.31
%------------------------------------------------------------------------------