%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : HWV052-1.001.001 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n002.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:41:14 PM UTC 2026
% Result : Unsatisfiable 1.87s 6.19s
% Output : CNFRefutation 1.87s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 5
% Syntax : Number of formulae : 33 ( 19 unt; 0 def)
% Number of atoms : 48 ( 47 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 19 ( 4 ~; 15 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 2 avg)
% Maximal term depth : 4 ( 1 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 : 15 ( 0 sgn 15 !; 0 ?; 9 :)
% Comments :
%------------------------------------------------------------------------------
fof(f1,axiom,
! [X0] :
( X0 = i
| X0 = o ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',bit_domain) ).
fof(f2,plain,
! [X0] :
( i = X0
| o = X0 ),
inference(reorient_equations,[],[f1]) ).
fof(f3,axiom,
! [X0] : inv(X0) != X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',bit_inverse) ).
fof(f4,axiom,
! [X0] : unpack1(X0,pack1(X0)) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unpack1) ).
fof(f5,axiom,
! [X0] : unpack1(inv(X0),pack1(X0)) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unpack1_01) ).
fof(f6,axiom,
! [X0] : unpack1(X0,inv(pack1(X0))) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unpack1_02) ).
tcf(c_54,plain,
! [X0: $i] :
( ( X0 = i )
| ( X0 = o ) ),
inference(cnf_transformation,[],[f2]) ).
tcf(c_55,plain,
! [X0: $i] : inv(X0) != X0,
inference(cnf_transformation,[],[f3]) ).
tcf(c_56,plain,
! [X0: $i] : unpack1(X0,pack1(X0)) = X0,
inference(cnf_transformation,[],[f4]) ).
tcf(c_57,plain,
! [X0: $i] : unpack1(inv(X0),pack1(X0)) = X0,
inference(cnf_transformation,[],[f5]) ).
tcf(c_58,plain,
! [X0: $i] : unpack1(X0,inv(pack1(X0))) = X0,
inference(cnf_transformation,[],[f6]) ).
tcf(c_123,plain,
! [X0: $i] :
( ( pack1(X0) = o )
| ( unpack1(X0,i) = X0 ) ),
inference(superposition,[status(thm)],[c_54,c_56]) ).
tcf(c_124,plain,
! [X0: $i] :
( ( inv(X0) = o )
| ( X0 != i ) ),
inference(superposition,[status(thm)],[c_54,c_55]) ).
tcf(c_160,plain,
inv(i) = o,
inference(equality_resolution,[status(thm)],[c_124]) ).
tcf(c_165,plain,
! [X0: $i] :
( ( X0 = o )
| ( inv(X0) = o ) ),
inference(superposition,[status(thm)],[c_54,c_160]) ).
tcf(c_166,plain,
unpack1(o,pack1(i)) = i,
inference(superposition,[status(thm)],[c_160,c_57]) ).
tcf(c_167,plain,
o != i,
inference(superposition,[status(thm)],[c_160,c_55]) ).
tcf(c_187,plain,
( ( pack1(i) = o )
| ( unpack1(o,i) = i ) ),
inference(superposition,[status(thm)],[c_54,c_166]) ).
tcf(c_227,plain,
! [X0: $i] :
( ( pack1(X0) = o )
| ( unpack1(X0,o) = X0 ) ),
inference(superposition,[status(thm)],[c_165,c_58]) ).
tcf(c_237,plain,
( ( o = i )
| ( pack1(i) = o )
| ( pack1(o) = o ) ),
inference(superposition,[status(thm)],[c_187,c_123]) ).
tcf(c_238,plain,
( ( pack1(i) = o )
| ( pack1(o) = o ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_237,c_167]) ).
tcf(c_263,plain,
( ( pack1(o) = o )
| ( unpack1(o,o) = i ) ),
inference(superposition,[status(thm)],[c_238,c_166]) ).
tcf(c_295,plain,
( ( o = i )
| ( pack1(o) = o ) ),
inference(superposition,[status(thm)],[c_227,c_263]) ).
tcf(c_297,plain,
pack1(o) = o,
inference(forward_subsumption_resolution,[status(thm)],[c_295,c_167]) ).
tcf(c_300,plain,
unpack1(o,inv(o)) = o,
inference(superposition,[status(thm)],[c_297,c_58]) ).
tcf(c_302,plain,
unpack1(o,o) = o,
inference(superposition,[status(thm)],[c_297,c_56]) ).
tcf(c_316,plain,
( ( inv(o) = o )
| ( unpack1(o,i) = o ) ),
inference(superposition,[status(thm)],[c_54,c_300]) ).
tcf(c_318,plain,
unpack1(o,i) = o,
inference(forward_subsumption_resolution,[status(thm)],[c_316,c_55]) ).
tcf(c_319,plain,
( ( o = i )
| ( pack1(i) = o ) ),
inference(demodulation,[status(thm)],[c_187,c_318]) ).
tcf(c_320,plain,
pack1(i) = o,
inference(forward_subsumption_resolution,[status(thm)],[c_319,c_167]) ).
tcf(c_321,plain,
unpack1(o,o) = i,
inference(demodulation,[status(thm)],[c_166,c_320]) ).
tcf(c_322,plain,
o = i,
inference(light_normalisation,[status(thm)],[c_321,c_302]) ).
tcf(c_323,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_322,c_167]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : HWV052-1.001.001 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/5.38 % Computer : n002.cluster.edu
% 0.10/5.38 % Model : x86_64 x86_64
% 0.10/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.38 % Memory : 8046.5625MB
% 0.10/5.38 % OS : Linux 6.8.0-71-generic
% 0.10/5.38 % CPULimit : 300
% 0.10/5.38 % WCLimit : 300
% 0.10/5.38 % DateTime : Wed Sep 23 16:51:11 UTC 2026
% 0.10/5.39 % CPUTime :
% 0.10/5.39 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.15/5.42 Running first-order theorem proving
% 0.15/5.42 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.15/5.43
% 0.15/5.43 % ======== iProver multi-core TPTP/SMT =========
% 0.15/5.43
% 0.15/5.43 % Detected problem language: tptp
% 0.15/5.45 % Proving...
% 1.87/6.19 % SZS status Started for theBenchmark.p
% 1.87/6.19 % SZS status Unsatisfiable for theBenchmark.p
% 1.87/6.19
% 1.87/6.19 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 1.87/6.19
% 1.87/6.19 % ------ iProver source info
% 1.87/6.19
% 1.87/6.19 % git: date: 2026-07-19 20:42:38 +0200
% 1.87/6.19 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 1.87/6.19 % git: non_committed_changes: false
% 1.87/6.19
% 1.87/6.19 % ------ Parsing...% successful
% 1.87/6.19
% 1.87/6.19
% 1.87/6.19 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 1.87/6.19
% 1.87/6.19 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 1.87/6.19
% 1.87/6.19 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 1.87/6.19
% 1.87/6.19 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 1.87/6.19 % ------ Proving...
% 1.87/6.19 % ------ Problem Properties
% 1.87/6.19
% 1.87/6.19 %
% 1.87/6.19 % clauses 5
% 1.87/6.19 % conjectures 0
% 1.87/6.19 % EPR 1
% 1.87/6.19 % Horn 4
% 1.87/6.19 % unary 4
% 1.87/6.19 % binary 1
% 1.87/6.19 % lits 6
% 1.87/6.19 % lits eq 6
% 1.87/6.19 % fd_pure 1
% 1.87/6.19 % fd_pseudo 0
% 1.87/6.19 % fd_cond 0
% 1.87/6.19 % fd_pseudo_cond 0
% 1.87/6.19 % AC symbols 0
% 1.87/6.19
% 1.87/6.19 % ------ Schedule dynamic 5 is on
% 1.87/6.19
% 1.87/6.19 % ------ no conjectures: strip conj schedule
% 1.87/6.19
% 1.87/6.19 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 1.87/6.19
% 1.87/6.19
% 1.87/6.19 % ------
% 1.87/6.19 % Current options:
% 1.87/6.19 % ------
% 1.87/6.19
% 1.87/6.19
% 1.87/6.19 %
% 1.87/6.19
% 1.87/6.19 % ------ Proving...
% 1.87/6.19 %
% 1.87/6.19
% 1.87/6.19 % SZS status Unsatisfiable for theBenchmark.p
% 1.87/6.19
% 1.87/6.19 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 1.87/6.19
% 1.87/6.19
%------------------------------------------------------------------------------