%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : HWV052-1.002.002 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n005.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 : Thu Sep 24 12:49:17 PM UTC 2026
% Result : Unsatisfiable 81.44s 21.12s
% Output : CNFRefutation 81.44s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 11
% Syntax : Number of clauses : 121 ( 40 unt; 76 nHn; 27 RR)
% Number of literals : 234 ( 233 equ; 9 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 2 con; 0-4 aty)
% Number of variables : 186 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(bit_inverse,axiom,
inv(X1) != X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',bit_inverse) ).
cnf(bit_domain,axiom,
( X1 = i
| X1 = o ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',bit_domain) ).
cnf(unpack1,axiom,
unpack1(X1,X2,pack1(X1,X2),pack2(X1,X2)) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unpack1) ).
cnf(unpack1_04,axiom,
unpack1(X1,X2,pack1(X1,X2),inv(pack2(X1,X2))) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unpack1_04) ).
cnf(unpack2_06,axiom,
unpack2(X1,inv(X2),pack1(X1,X2),pack2(X1,X2)) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unpack2_06) ).
cnf(unpack2,axiom,
unpack2(X1,X2,pack1(X1,X2),pack2(X1,X2)) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unpack2) ).
cnf(unpack2_08,axiom,
unpack2(X1,X2,pack1(X1,X2),inv(pack2(X1,X2))) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unpack2_08) ).
cnf(unpack1_01,axiom,
unpack1(inv(X1),X2,pack1(X1,X2),pack2(X1,X2)) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unpack1_01) ).
cnf(unpack2_07,axiom,
unpack2(X1,X2,inv(pack1(X1,X2)),pack2(X1,X2)) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unpack2_07) ).
cnf(unpack1_03,axiom,
unpack1(X1,X2,inv(pack1(X1,X2)),pack2(X1,X2)) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unpack1_03) ).
cnf(unpack1_02,axiom,
unpack1(X1,inv(X2),pack1(X1,X2),pack2(X1,X2)) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unpack1_02) ).
cnf(c_0_11,plain,
inv(X1) != X1,
inference(fof_simplification,[status(thm)],[bit_inverse]) ).
cnf(c_0_12,axiom,
( X1 = i
| X1 = o ),
bit_domain ).
cnf(c_0_13,plain,
inv(X1) != X1,
c_0_11 ).
cnf(c_0_14,plain,
( X2 = X1
| X2 = o
| X1 = o ),
inference(spm,[status(thm)],[c_0_12,c_0_12]) ).
cnf(c_0_15,plain,
( X1 = o
| inv(o) = X1 ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14])]) ).
cnf(c_0_16,plain,
inv(inv(o)) = o,
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_15])]) ).
cnf(c_0_17,plain,
( X2 = X1
| X2 = o
| inv(inv(X1)) = X1 ),
inference(spm,[status(thm)],[c_0_16,c_0_14]) ).
cnf(c_0_18,plain,
( X4 = X2
| X3 = X2
| X3 = X4
| X2 = X1
| X1 = o ),
inference(spm,[status(thm)],[c_0_14,c_0_14]) ).
cnf(c_0_19,plain,
( inv(inv(X1)) = X1
| inv(inv(X1)) = o ),
inference(ef,[status(thm)],[c_0_17]) ).
cnf(c_0_20,plain,
( inv(X1) = o
| inv(inv(X1)) = X1 ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_17])]) ).
cnf(c_0_21,plain,
( X1 = X2
| X1 = X3
| X2 = X3
| X1 = o ),
inference(ef,[status(thm)],[c_0_18]) ).
cnf(c_0_22,plain,
( inv(o) = X1
| inv(inv(X1)) = X1 ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_17])]) ).
cnf(c_0_23,plain,
inv(i) = o,
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_12])]) ).
cnf(c_0_24,plain,
inv(inv(X1)) = X1,
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_19]),c_0_20]) ).
cnf(c_0_25,plain,
( X1 = X2
| inv(X1) = X2
| inv(X1) = o ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_21])]) ).
cnf(c_0_26,plain,
inv(o) = i,
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_27,plain,
( X1 = X2
| i = X1
| inv(X1) = X2 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).
cnf(c_0_28,axiom,
unpack1(X1,X2,pack1(X1,X2),pack2(X1,X2)) = X1,
unpack1 ).
cnf(c_0_29,axiom,
unpack1(X1,X2,pack1(X1,X2),inv(pack2(X1,X2))) = X1,
unpack1_04 ).
cnf(c_0_30,plain,
( X1 = X2
| X1 = inv(X2)
| inv(X1) = o ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_24]) ).
cnf(c_0_31,plain,
( X2 = X1
| inv(X1) = X2
| inv(X1) = i ),
inference(spm,[status(thm)],[c_0_24,c_0_27]) ).
cnf(c_0_32,plain,
i != o,
inference(spm,[status(thm)],[c_0_13,c_0_23]) ).
cnf(c_0_33,axiom,
unpack2(X1,inv(X2),pack1(X1,X2),pack2(X1,X2)) = X2,
unpack2_06 ).
cnf(c_0_34,plain,
( X3 = o
| X3 = pack2(X1,X2)
| unpack1(X1,X2,pack1(X1,X2),o) = X1 ),
inference(spm,[status(thm)],[c_0_28,c_0_14]) ).
cnf(c_0_35,plain,
( pack2(X1,X2) = o
| unpack1(X1,X2,pack1(X1,X2),o) = X1 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_12]),c_0_23]) ).
cnf(c_0_36,plain,
( X1 = X3
| X2 = X1
| X1 = inv(X3)
| inv(X1) = X2 ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]) ).
cnf(c_0_37,axiom,
unpack2(X1,X2,pack1(X1,X2),pack2(X1,X2)) = X2,
unpack2 ).
cnf(c_0_38,axiom,
unpack2(X1,X2,pack1(X1,X2),inv(pack2(X1,X2))) = X2,
unpack2_08 ).
cnf(c_0_39,plain,
unpack2(X1,o,pack1(X1,i),pack2(X1,i)) = i,
inference(spm,[status(thm)],[c_0_33,c_0_23]) ).
cnf(c_0_40,plain,
( X3 = o
| unpack1(X1,X2,pack1(X1,X2),o) = X1 ),
inference(csr,[status(thm)],[inference(ef,[status(thm)],[c_0_34]),c_0_35]) ).
cnf(c_0_41,plain,
( X1 = X2
| inv(X2) = X1
| inv(X1) = inv(X2) ),
inference(er,[status(thm)],[inference(ef,[status(thm)],[c_0_36])]) ).
cnf(c_0_42,plain,
( X3 = o
| X3 = pack2(X1,X2)
| unpack2(X1,X2,pack1(X1,X2),o) = X2 ),
inference(spm,[status(thm)],[c_0_37,c_0_14]) ).
cnf(c_0_43,plain,
( pack2(X1,X2) = o
| unpack2(X1,X2,pack1(X1,X2),o) = X2 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_12]),c_0_23]) ).
cnf(c_0_44,plain,
unpack1(X1,X2,pack1(X1,X2),o) = X1,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_32]) ).
cnf(c_0_45,plain,
( X2 = X1
| inv(X1) = X2 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_41]),c_0_24])]) ).
cnf(c_0_46,axiom,
unpack1(inv(X1),X2,pack1(X1,X2),pack2(X1,X2)) = X1,
unpack1_01 ).
cnf(c_0_47,plain,
( i = X2
| X1 = o
| X1 = inv(X2) ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_14]),c_0_26]) ).
cnf(c_0_48,plain,
( X3 = o
| unpack2(X1,X2,pack1(X1,X2),o) = X2 ),
inference(csr,[status(thm)],[inference(ef,[status(thm)],[c_0_42]),c_0_43]) ).
cnf(c_0_49,axiom,
unpack2(X1,X2,inv(pack1(X1,X2)),pack2(X1,X2)) = X2,
unpack2_07 ).
cnf(c_0_50,axiom,
unpack1(X1,X2,inv(pack1(X1,X2)),pack2(X1,X2)) = X1,
unpack1_03 ).
cnf(c_0_51,plain,
( pack1(X1,X2) = X3
| unpack1(X1,X2,inv(X3),o) = X1 ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_52,plain,
unpack1(o,X1,pack1(i,X1),pack2(i,X1)) = i,
inference(spm,[status(thm)],[c_0_46,c_0_23]) ).
cnf(c_0_53,plain,
( X2 = X1
| i = X2
| inv(X1) = o ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_47]),c_0_24]) ).
cnf(c_0_54,plain,
unpack2(X1,X2,pack1(X1,X2),o) = X2,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_48]),c_0_32]) ).
cnf(c_0_55,plain,
( X3 = o
| X3 = pack1(X1,X2)
| unpack2(X1,X2,o,pack2(X1,X2)) = X2 ),
inference(spm,[status(thm)],[c_0_37,c_0_14]) ).
cnf(c_0_56,plain,
( pack1(X1,X2) = X3
| unpack2(X1,X2,X3,pack2(X1,X2)) = X2 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_45]),c_0_24]) ).
cnf(c_0_57,plain,
unpack1(i,X1,pack1(o,X1),pack2(o,X1)) = o,
inference(spm,[status(thm)],[c_0_46,c_0_26]) ).
cnf(c_0_58,plain,
( X2 = X1
| X2 = o
| inv(X1) = i ),
inference(spm,[status(thm)],[c_0_26,c_0_14]) ).
cnf(c_0_59,plain,
( X3 = o
| X3 = pack2(X1,X2)
| unpack1(X1,X2,inv(pack1(X1,X2)),o) = X1 ),
inference(spm,[status(thm)],[c_0_50,c_0_14]) ).
cnf(c_0_60,plain,
( pack1(X1,X2) = inv(X3)
| unpack1(X1,X2,X3,o) = X1 ),
inference(spm,[status(thm)],[c_0_51,c_0_24]) ).
cnf(c_0_61,plain,
( inv(X2) = o
| pack2(i,X1) = i
| unpack1(o,X1,pack1(i,X1),X2) = i ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_62,plain,
( pack1(X1,X2) = X3
| unpack2(X1,X2,inv(X3),o) = X2 ),
inference(spm,[status(thm)],[c_0_54,c_0_45]) ).
cnf(c_0_63,plain,
( X3 = o
| unpack2(X1,X2,o,pack2(X1,X2)) = X2 ),
inference(csr,[status(thm)],[inference(ef,[status(thm)],[c_0_55]),c_0_56]) ).
cnf(c_0_64,plain,
( inv(X2) = i
| pack2(o,X1) = X2
| unpack1(i,X1,pack1(o,X1),o) = o ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_65,plain,
( pack2(X1,X2) = i
| unpack1(X1,X2,inv(pack1(X1,X2)),o) = X1 ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_59]),c_0_39]),c_0_32]) ).
cnf(c_0_66,plain,
( pack2(i,X1) = i
| inv(pack1(i,X1)) = pack1(o,X1) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_61]),c_0_26])]),c_0_32]) ).
cnf(c_0_67,plain,
( pack1(X1,X2) = inv(X3)
| unpack2(X1,X2,X3,o) = X2 ),
inference(spm,[status(thm)],[c_0_62,c_0_24]) ).
cnf(c_0_68,plain,
( inv(X2) = o
| pack2(X1,i) = i
| unpack2(X1,o,pack1(X1,i),X2) = i ),
inference(spm,[status(thm)],[c_0_39,c_0_53]) ).
cnf(c_0_69,plain,
( inv(X3) = o
| pack2(X1,X2) = i
| unpack1(inv(X1),X2,pack1(X1,X2),X3) = X1 ),
inference(spm,[status(thm)],[c_0_46,c_0_53]) ).
cnf(c_0_70,plain,
unpack2(X1,X2,o,pack2(X1,X2)) = X2,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_63]),c_0_32]) ).
cnf(c_0_71,plain,
unpack2(X1,i,pack1(X1,o),pack2(X1,o)) = o,
inference(spm,[status(thm)],[c_0_33,c_0_26]) ).
cnf(c_0_72,axiom,
unpack1(X1,inv(X2),pack1(X1,X2),pack2(X1,X2)) = X1,
unpack1_02 ).
cnf(c_0_73,plain,
( pack2(o,X1) = i
| unpack1(i,X1,pack1(o,X1),o) = o ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_64]),c_0_39]),c_0_23]),c_0_32]) ).
cnf(c_0_74,plain,
( pack2(i,X1) = i
| unpack1(i,X1,pack1(o,X1),o) = i ),
inference(spm,[status(thm)],[c_0_65,c_0_66]) ).
cnf(c_0_75,plain,
( pack2(X1,i) = i
| inv(pack1(X1,i)) = pack1(X1,o) ),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_68]),c_0_26])]),c_0_32]) ).
cnf(c_0_76,plain,
( pack2(X1,X2) = i
| inv(pack1(X1,X2)) = pack1(inv(X1),X2) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_60]),c_0_26]),c_0_13]),c_0_32]) ).
cnf(c_0_77,plain,
( pack2(X1,X2) = X3
| unpack2(X1,X2,o,inv(X3)) = X2 ),
inference(spm,[status(thm)],[c_0_70,c_0_45]) ).
cnf(c_0_78,plain,
( inv(X2) = i
| pack1(X1,o) = X2
| unpack2(X1,i,o,pack2(X1,o)) = o ),
inference(spm,[status(thm)],[c_0_71,c_0_58]) ).
cnf(c_0_79,plain,
unpack1(X1,o,pack1(X1,i),pack2(X1,i)) = X1,
inference(spm,[status(thm)],[c_0_72,c_0_23]) ).
cnf(c_0_80,plain,
( pack2(o,X1) = i
| pack2(i,X1) = i ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_32]) ).
cnf(c_0_81,plain,
( pack2(X1,i) = i
| pack1(inv(X1),i) = pack1(X1,o) ),
inference(spm,[status(thm)],[c_0_75,c_0_76]) ).
cnf(c_0_82,plain,
( i = X2
| inv(pack1(X1,i)) = o
| unpack2(X1,o,X2,pack2(X1,i)) = i ),
inference(spm,[status(thm)],[c_0_39,c_0_53]) ).
cnf(c_0_83,plain,
( pack2(X1,X2) = inv(X3)
| unpack2(X1,X2,o,X3) = X2 ),
inference(spm,[status(thm)],[c_0_77,c_0_24]) ).
cnf(c_0_84,plain,
( pack1(X1,o) = i
| unpack2(X1,i,o,pack2(X1,o)) = o ),
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_78]),c_0_39]),c_0_23]),c_0_32]) ).
cnf(c_0_85,plain,
( pack2(o,i) = i
| unpack1(i,o,pack1(i,i),i) = i ),
inference(spm,[status(thm)],[c_0_79,c_0_80]) ).
cnf(c_0_86,plain,
( pack2(o,i) = i
| pack1(i,i) = pack1(o,o) ),
inference(spm,[status(thm)],[c_0_81,c_0_26]) ).
cnf(c_0_87,plain,
( inv(pack1(X1,i)) = o
| inv(pack2(X1,i)) = pack2(X1,o) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_83]),c_0_32]) ).
cnf(c_0_88,plain,
( pack1(X1,o) = i
| inv(pack2(X1,o)) = pack2(X1,i) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_83]),c_0_32]) ).
cnf(c_0_89,plain,
( pack2(o,X1) = o
| unpack1(i,X1,pack1(o,X1),i) = o ),
inference(spm,[status(thm)],[c_0_57,c_0_12]) ).
cnf(c_0_90,plain,
( pack2(o,i) = i
| unpack1(i,o,pack1(o,o),i) = i ),
inference(spm,[status(thm)],[c_0_85,c_0_86]) ).
cnf(c_0_91,plain,
( inv(X3) = o
| pack1(X1,X2) = i
| unpack2(X1,inv(X2),X3,pack2(X1,X2)) = X2 ),
inference(spm,[status(thm)],[c_0_33,c_0_53]) ).
cnf(c_0_92,plain,
( X2 = o
| inv(pack2(o,X1)) = i
| unpack1(i,X1,pack1(o,X1),X2) = o ),
inference(spm,[status(thm)],[c_0_57,c_0_58]) ).
cnf(c_0_93,plain,
( pack1(X1,i) != o
| inv(pack2(X1,i)) = pack2(X1,o) ),
inference(spm,[status(thm)],[c_0_13,c_0_87]) ).
cnf(c_0_94,plain,
( i = X2
| inv(pack2(X1,o)) = o
| unpack2(X1,i,pack1(X1,o),X2) = o ),
inference(spm,[status(thm)],[c_0_71,c_0_53]) ).
cnf(c_0_95,plain,
( i = X2
| inv(pack2(o,X1)) = o
| unpack1(i,X1,pack1(o,X1),X2) = o ),
inference(spm,[status(thm)],[c_0_57,c_0_53]) ).
cnf(c_0_96,plain,
( pack1(X1,o) = i
| inv(pack2(X1,i)) = pack2(X1,o) ),
inference(spm,[status(thm)],[c_0_24,c_0_88]) ).
cnf(c_0_97,plain,
( pack2(o,o) = o
| pack2(o,i) = i ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_89,c_0_90]),c_0_32]) ).
cnf(c_0_98,plain,
( pack1(X1,X2) = i
| inv(pack2(X1,X2)) = pack2(X1,inv(X2)) ),
inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_91,c_0_83]),c_0_26]),c_0_13]),c_0_32]) ).
cnf(c_0_99,plain,
( pack2(o,i) = i
| inv(pack2(o,o)) = i ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_92,c_0_90]),c_0_32]) ).
cnf(c_0_100,plain,
( pack1(X1,i) != o
| inv(pack2(X1,o)) = pack2(X1,i) ),
inference(spm,[status(thm)],[c_0_24,c_0_93]) ).
cnf(c_0_101,plain,
( inv(pack2(X1,o)) = o
| inv(pack1(X1,o)) = pack1(X1,i) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_67,c_0_94]),c_0_32]) ).
cnf(c_0_102,plain,
( inv(pack2(o,X1)) = o
| inv(pack1(o,X1)) = pack1(i,X1) ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_60,c_0_95]),c_0_32]) ).
cnf(c_0_103,plain,
( pack2(X1,X2) = o
| unpack2(X1,X2,pack1(X1,X2),i) = X2 ),
inference(spm,[status(thm)],[c_0_37,c_0_12]) ).
cnf(c_0_104,plain,
( pack2(X1,X2) = o
| unpack2(X1,inv(X2),pack1(X1,X2),i) = X2 ),
inference(spm,[status(thm)],[c_0_33,c_0_12]) ).
cnf(c_0_105,plain,
( pack2(o,o) = o
| pack1(o,o) = i ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_97]),c_0_23])]) ).
cnf(c_0_106,plain,
( pack2(X1,i) = i
| inv(pack1(X1,o)) = pack1(X1,i) ),
inference(spm,[status(thm)],[c_0_24,c_0_75]) ).
cnf(c_0_107,plain,
( pack2(o,i) = i
| pack1(o,o) = i ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_98,c_0_99]),c_0_26])]) ).
cnf(c_0_108,plain,
( pack1(o,i) != o
| pack2(o,i) = i ),
inference(spm,[status(thm)],[c_0_100,c_0_99]) ).
cnf(c_0_109,plain,
( inv(pack2(o,o)) = o
| pack1(i,o) = pack1(o,i) ),
inference(spm,[status(thm)],[c_0_101,c_0_102]) ).
cnf(c_0_110,plain,
( pack2(X1,X2) = o
| pack1(X1,X2) = o
| unpack2(X1,X2,i,i) = X2 ),
inference(spm,[status(thm)],[c_0_103,c_0_12]) ).
cnf(c_0_111,plain,
( pack2(o,o) = o
| unpack2(o,i,i,i) = o ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_105]),c_0_26]) ).
cnf(c_0_112,plain,
pack2(o,i) = i,
inference(csr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_106,c_0_107]),c_0_23]),c_0_108]) ).
cnf(c_0_113,plain,
( pack1(o,i) != o
| pack2(o,o) = o ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_93,c_0_97]),c_0_23])]) ).
cnf(c_0_114,plain,
( pack2(o,o) != o
| pack1(i,o) = pack1(o,i) ),
inference(spm,[status(thm)],[c_0_13,c_0_109]) ).
cnf(c_0_115,plain,
pack2(o,o) = o,
inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_110,c_0_111]),c_0_112])]),c_0_32]),c_0_113]) ).
cnf(c_0_116,plain,
( pack2(i,X1) = i
| inv(pack2(o,X1)) = o ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_95,c_0_74]),c_0_32]) ).
cnf(c_0_117,plain,
pack1(i,o) = pack1(o,i),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_114,c_0_115])]) ).
cnf(c_0_118,plain,
pack2(i,o) = i,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_116,c_0_115]),c_0_26]),c_0_32]) ).
cnf(c_0_119,plain,
unpack1(i,i,pack1(o,i),i) = o,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_112]),c_0_26]) ).
cnf(c_0_120,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_117]),c_0_26]),c_0_118]),c_0_119]),c_0_32]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : HWV052-1.002.002 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.39 % Computer : n005.cluster.edu
% 0.11/0.39 % Model : x86_64 x86_64
% 0.11/0.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.39 % Memory : 8046.5625MB
% 0.11/0.39 % OS : Linux 6.8.0-71-generic
% 0.11/0.39 % CPULimit : 300
% 0.11/0.39 % WCLimit : 300
% 0.11/0.39 % DateTime : Sun Sep 20 21:03:19 UTC 2026
% 0.11/0.39 % CPUTime :
% 0.11/0.39 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.43 Running first-order theorem proving
% 0.11/0.43 Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 81.44/21.12 % Version: 3.5.1
% 81.44/21.12 % Preprocessing class: FSSSSMSSSSSNFFN.
% 81.44/21.12 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 81.44/21.12 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 81.44/21.12 % Starting new_bool_3 with 300s (1) cores
% 81.44/21.12 % Starting new_bool_1 with 300s (1) cores
% 81.44/21.12 % Starting sh5l with 300s (1) cores
% 81.44/21.12 % new_bool_3 with pid 1761148 completed with status 9
% 81.44/21.12 % sh5l with pid 1761150 completed with status 9
% 81.44/21.12 % new_bool_1 with pid 1761149 completed with status 9
% 81.44/21.12 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1761147 completed with status 0
% 81.44/21.12 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 81.44/21.12 % Preprocessing class: FSSSSMSSSSSNFFN.
% 81.44/21.12 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 81.44/21.12 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 81.44/21.12 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 81.44/21.12 % No SInE strategy applied
% 81.44/21.12 % Search class: FGUPM-FFSF32-MFFFFFNN
% 81.44/21.12 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 81.44/21.12 % Starting SubtermCWHack with 136s (1) cores
% 81.44/21.12 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 81.44/21.12 % Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 136s (1) cores
% 81.44/21.12 % Starting new_bool_3 with 136s (1) cores
% 81.44/21.12 % Starting new_bool_1 with 136s (1) cores
% 81.44/21.12 % SubtermCWHack with pid 1761152 completed with status 0
% 81.44/21.12 % Result found by SubtermCWHack
% 81.44/21.12 % Preprocessing class: FSSSSMSSSSSNFFN.
% 81.44/21.12 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 81.44/21.12 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 81.44/21.12 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 81.44/21.12 % No SInE strategy applied
% 81.44/21.12 % Search class: FGUPM-FFSF32-MFFFFFNN
% 81.44/21.12 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 81.44/21.12 % Starting SubtermCWHack with 136s (1) cores
% 81.44/21.12 % Preprocessing time : 0.002 s
% 81.44/21.12
% 81.44/21.12 % Proof found!
% 81.44/21.12 % SZS status Unsatisfiable
% 81.44/21.12 % SZS output start CNFRefutation
% See solution above
% 81.44/21.12 % Parsed axioms : 12
% 81.44/21.12 % Removed by relevancy pruning/SinE : 0
% 81.44/21.12 % Initial clauses : 12
% 81.44/21.12 % Removed in clause preprocessing : 0
% 81.44/21.12 % Initial clauses in saturation : 12
% 81.44/21.12 % Processed clauses : 10705
% 81.44/21.12 % ...of these trivial : 24
% 81.44/21.12 % ...subsumed : 9344
% 81.44/21.12 % ...remaining for further processing : 1337
% 81.44/21.12 % Other redundant clauses eliminated : 26571
% 81.44/21.12 % Clauses deleted for lack of memory : 0
% 81.44/21.12 % Backward-subsumed : 126
% 81.44/21.12 % Backward-rewritten : 90
% 81.44/21.12 % Generated clauses : 1962833
% 81.44/21.12 % ...of the previous two non-redundant : 1907139
% 81.44/21.12 % ...aggressively subsumed : 0
% 81.44/21.12 % Contextual simplify-reflections : 7
% 81.44/21.12 % Paramodulations : 1933149
% 81.44/21.12 % Factorizations : 3107
% 81.44/21.12 % NegExts : 0
% 81.44/21.12 % Equation resolutions : 26577
% 81.44/21.12 % Disequality decompositions : 0
% 81.44/21.12 % Total rewrite steps : 250442
% 81.44/21.12 % ...of those cached : 250089
% 81.44/21.12 % Propositional unsat checks : 0
% 81.44/21.12 % Propositional check models : 0
% 81.44/21.12 % Propositional check unsatisfiable : 0
% 81.44/21.12 % Propositional clauses : 0
% 81.44/21.12 % Propositional clauses after purity: 0
% 81.44/21.12 % Propositional unsat core size : 0
% 81.44/21.12 % Propositional preprocessing time : 0.000
% 81.44/21.12 % Propositional encoding time : 0.000
% 81.44/21.12 % Propositional solver time : 0.000
% 81.44/21.12 % Success case prop preproc time : 0.000
% 81.44/21.12 % Success case prop encoding time : 0.000
% 81.44/21.12 % Success case prop solver time : 0.000
% 81.44/21.12 % Current number of processed clauses : 1121
% 81.44/21.12 % Positive orientable unit clauses : 43
% 81.44/21.12 % Positive unorientable unit clauses: 0
% 81.44/21.12 % Negative unit clauses : 2
% 81.44/21.12 % Non-unit-clauses : 1076
% 81.44/21.12 % Current number of unprocessed clauses: 1891798
% 81.44/21.12 % ...number of literals in the above : 11200030
% 81.44/21.12 % Current number of archived formulas : 0
% 81.44/21.12 % Current number of archived clauses : 216
% 81.44/21.12 % Clause-clause subsumption calls (NU) : 213945
% 81.44/21.12 % Rec. Clause-clause subsumption calls : 85504
% 81.44/21.12 % Non-unit clause-clause subsumptions : 9300
% 81.44/21.12 % Unit Clause-clause subsumption calls : 2038
% 81.44/21.12 % Rewrite failures with RHS unbound : 0
% 81.44/21.12 % BW rewrite match attempts : 463
% 81.44/21.12 % BW rewrite match successes : 10
% 81.44/21.12 % Condensation attempts : 0
% 81.44/21.12 % Condensation successes : 0
% 81.44/21.12 % Termbank termtop insertions : 20751610
% 81.44/21.12 % Search garbage collected termcells : 2
% 81.44/21.12
% 81.44/21.12 % -------------------------------------------------
% 81.44/21.12 % User time : 19.091 s
% 81.44/21.12 % System time : 1.134 s
% 81.44/21.12 % Total time : 20.224 s
% 81.44/21.12 % Maximum resident set size: 3376 pages
% 81.44/21.12
% 81.44/21.12 % -------------------------------------------------
% 81.44/21.12 % User time : 97.361 s
% 81.44/21.12 % System time : 4.055 s
% 81.44/21.12 % Total time : 101.416 s
% 81.44/21.12 % Maximum resident set size: 4608 pages
% 81.44/21.12 % E exiting
%------------------------------------------------------------------------------