%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : HWV052-1.002.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 : n007.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 3.65s 1.30s
% Output : CNFRefutation 3.65s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 7
% Syntax : Number of formulae : 32 ( 20 unt; 0 def)
% Number of atoms : 45 ( 44 equ)
% Maximal formula atoms : 3 ( 1 avg)
% Number of connectives : 17 ( 4 ~; 13 |; 0 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 4 ( 3 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 : 6 ( 6 usr; 2 con; 0-3 aty)
% Number of variables : 41 ( 0 sgn 41 !; 0 ?; 28 :)
% 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,X1] : unpack1(X0,X1,pack1(X0,X1)) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unpack1) ).
fof(f5,axiom,
! [X0,X1] : unpack1(inv(X0),X1,pack1(X0,X1)) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unpack1_01) ).
fof(f7,axiom,
! [X0,X1] : unpack1(X0,X1,inv(pack1(X0,X1))) = X0,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unpack1_03) ).
fof(f8,axiom,
! [X0,X1] : unpack2(X0,X1,pack1(X0,X1)) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unpack2) ).
fof(f10,axiom,
! [X0,X1] : unpack2(X0,inv(X1),pack1(X0,X1)) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',unpack2_05) ).
tcf(c_59,plain,
! [X0: $i] :
( ( X0 = i )
| ( X0 = o ) ),
inference(cnf_transformation,[],[f2]) ).
tcf(c_60,plain,
! [X0: $i] : inv(X0) != X0,
inference(cnf_transformation,[],[f3]) ).
tcf(c_61,plain,
! [X0: $i,X1: $i] : unpack1(X0,X1,pack1(X0,X1)) = X0,
inference(cnf_transformation,[],[f4]) ).
tcf(c_62,plain,
! [X0: $i,X1: $i] : unpack1(inv(X0),X1,pack1(X0,X1)) = X0,
inference(cnf_transformation,[],[f5]) ).
tcf(c_64,plain,
! [X0: $i,X1: $i] : unpack1(X0,X1,inv(pack1(X0,X1))) = X0,
inference(cnf_transformation,[],[f7]) ).
tcf(c_65,plain,
! [X0: $i,X1: $i] : unpack2(X0,X1,pack1(X0,X1)) = X1,
inference(cnf_transformation,[],[f8]) ).
tcf(c_67,plain,
! [X0: $i,X1: $i] : unpack2(X0,inv(X1),pack1(X0,X1)) = X1,
inference(cnf_transformation,[],[f10]) ).
tcf(c_170,plain,
! [X0: $i] :
( ( inv(X0) = o )
| ( X0 != i ) ),
inference(superposition,[status(thm)],[c_59,c_60]) ).
tcf(c_179,plain,
! [X0: $i,X1: $i] :
( ( pack1(X0,X1) = o )
| ( unpack1(X0,X1,i) = X0 ) ),
inference(superposition,[status(thm)],[c_59,c_61]) ).
tcf(c_253,plain,
inv(i) = o,
inference(equality_resolution,[status(thm)],[c_170]) ).
tcf(c_628,plain,
! [X0: $i] :
( ( X0 = o )
| ( inv(X0) = o ) ),
inference(superposition,[status(thm)],[c_59,c_253]) ).
tcf(c_632,plain,
! [X0: $i] : unpack1(o,X0,pack1(i,X0)) = i,
inference(superposition,[status(thm)],[c_253,c_62]) ).
tcf(c_633,plain,
o != i,
inference(superposition,[status(thm)],[c_253,c_60]) ).
tcf(c_668,plain,
! [X0: $i,X1: $i] :
( ( pack1(X0,X1) = o )
| ( unpack1(X0,X1,o) = X0 ) ),
inference(superposition,[status(thm)],[c_628,c_64]) ).
tcf(c_753,plain,
! [X0: $i] :
( ( pack1(i,X0) = o )
| ( unpack1(o,X0,i) = i ) ),
inference(superposition,[status(thm)],[c_59,c_632]) ).
tcf(c_1710,plain,
! [X0: $i] :
( ( o = i )
| ( pack1(i,X0) = o )
| ( pack1(o,X0) = o ) ),
inference(superposition,[status(thm)],[c_753,c_179]) ).
tcf(c_1711,plain,
! [X0: $i] :
( ( pack1(i,X0) = o )
| ( pack1(o,X0) = o ) ),
inference(forward_subsumption_resolution,[status(thm)],[c_1710,c_633]) ).
tcf(c_1759,plain,
! [X0: $i] :
( ( pack1(o,X0) = o )
| ( unpack1(o,X0,o) = i ) ),
inference(superposition,[status(thm)],[c_1711,c_632]) ).
tcf(c_2224,plain,
! [X0: $i] :
( ( o = i )
| ( pack1(o,X0) = o ) ),
inference(superposition,[status(thm)],[c_1759,c_668]) ).
tcf(c_2225,plain,
! [X0: $i] : pack1(o,X0) = o,
inference(forward_subsumption_resolution,[status(thm)],[c_2224,c_633]) ).
tcf(c_2237,plain,
! [X0: $i] : unpack2(o,inv(X0),o) = X0,
inference(superposition,[status(thm)],[c_2225,c_67]) ).
tcf(c_2242,plain,
! [X0: $i] : unpack2(o,X0,o) = X0,
inference(superposition,[status(thm)],[c_2225,c_65]) ).
tcf(c_2460,plain,
! [X0: $i] : inv(X0) = X0,
inference(demodulation,[status(thm)],[c_2237,c_2242]) ).
tcf(c_2461,plain,
$false,
inference(forward_subsumption_resolution,[status(thm)],[c_2460,c_60]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : HWV052-1.002.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.11/0.37 % Computer : n007.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Wed Sep 23 16:46:37 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.11/0.41 Running first-order theorem proving
% 0.11/0.41 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.11/0.42
% 0.11/0.42 % ======== iProver multi-core TPTP/SMT =========
% 0.11/0.42
% 0.11/0.42 % Detected problem language: tptp
% 0.11/0.43 % Proving...
% 3.65/1.30 % SZS status Started for theBenchmark.p
% 3.65/1.30 % SZS status Unsatisfiable for theBenchmark.p
% 3.65/1.30
% 3.65/1.30 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 3.65/1.30
% 3.65/1.30 % ------ iProver source info
% 3.65/1.30
% 3.65/1.30 % git: date: 2026-07-19 20:42:38 +0200
% 3.65/1.30 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 3.65/1.30 % git: non_committed_changes: false
% 3.65/1.30
% 3.65/1.30 % ------ Parsing...% successful
% 3.65/1.30
% 3.65/1.30
% 3.65/1.30 % ------ Clausification by vclausify_rel & Parsing by iProver...%
% 3.65/1.30
% 3.65/1.30 % ------ Preprocessing... sup_sim: 0 sf_s rm: 0 0s sf_e pe_s pe_e %
% 3.65/1.30
% 3.65/1.30 % ------ Preprocessing... gs_s sp: 0 0s gs_e snvd_s sp: 0 0s snvd_e %
% 3.65/1.30
% 3.65/1.30 % ------ Preprocessing... sf_s rm: 0 0s sf_e
% 3.65/1.30 % ------ Proving...
% 3.65/1.30 % ------ Problem Properties
% 3.65/1.30
% 3.65/1.30 %
% 3.65/1.30 % clauses 10
% 3.65/1.30 % conjectures 0
% 3.65/1.30 % EPR 1
% 3.65/1.30 % Horn 9
% 3.65/1.30 % unary 9
% 3.65/1.30 % binary 1
% 3.65/1.30 % lits 11
% 3.65/1.30 % lits eq 11
% 3.65/1.30 % fd_pure 1
% 3.65/1.30 % fd_pseudo 0
% 3.65/1.30 % fd_cond 0
% 3.65/1.30 % fd_pseudo_cond 0
% 3.65/1.30 % AC symbols 0
% 3.65/1.30
% 3.65/1.30 % ------ Schedule dynamic 5 is on
% 3.65/1.30
% 3.65/1.30 % ------ no conjectures: strip conj schedule
% 3.65/1.30
% 3.65/1.30 % ------ Input Options "--resolution_flag false --inst_lit_sel_side none" stripped conjectures Time Limit: 10.
% 3.65/1.30
% 3.65/1.30
% 3.65/1.30 % ------
% 3.65/1.30 % Current options:
% 3.65/1.30 % ------
% 3.65/1.30
% 3.65/1.30
% 3.65/1.30 %
% 3.65/1.30
% 3.65/1.30 % ------ Proving...
% 3.65/1.30 %
% 3.65/1.30
% 3.65/1.30 % SZS status Unsatisfiable for theBenchmark.p
% 3.65/1.30
% 3.65/1.30 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 3.65/1.30
% 3.65/1.30
%------------------------------------------------------------------------------