%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : HWV052-1.001.001 : TPTP v9.2.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n002.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 5 04:29:13 PM UTC 2026
% Result : Unsatisfiable 1.27s 1.72s
% Output : CNFRefutation 1.27s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 5
% Syntax : Number of clauses : 26 ( 17 unt; 9 nHn; 14 RR)
% Number of literals : 36 ( 35 equ; 3 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% 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)
% Comments :
%------------------------------------------------------------------------------
cnf(bit_inverse,axiom,
inv(X1) != X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',bit_inverse) ).
cnf(bit_domain,axiom,
( X1 = o
| X1 = i ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',bit_domain) ).
cnf(unpack1_01,axiom,
unpack1(inv(X1),pack1(X1)) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unpack1_01) ).
cnf(unpack1,axiom,
unpack1(X1,pack1(X1)) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unpack1) ).
cnf(unpack1_02,axiom,
unpack1(X1,inv(pack1(X1))) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',unpack1_02) ).
cnf(c_0_5,axiom,
inv(X1) != X1,
bit_inverse ).
cnf(c_0_6,axiom,
( X1 = o
| X1 = i ),
bit_domain ).
cnf(c_0_7,axiom,
unpack1(inv(X1),pack1(X1)) = X1,
unpack1_01 ).
cnf(c_0_8,plain,
inv(i) = o,
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6])]) ).
cnf(c_0_9,axiom,
unpack1(X1,pack1(X1)) = X1,
unpack1 ).
cnf(c_0_10,plain,
unpack1(o,pack1(i)) = i,
inference(spm,[status(thm)],[c_0_7,c_0_8]) ).
cnf(c_0_11,plain,
( unpack1(X1,i) = X1
| pack1(X1) = o ),
inference(spm,[status(thm)],[c_0_9,c_0_6]) ).
cnf(c_0_12,plain,
( unpack1(o,i) = i
| pack1(i) = o ),
inference(spm,[status(thm)],[c_0_10,c_0_6]) ).
cnf(c_0_13,plain,
i != o,
inference(spm,[status(thm)],[c_0_5,c_0_8]) ).
cnf(c_0_14,plain,
( X1 = o
| X2 = o
| X2 = X1 ),
inference(spm,[status(thm)],[c_0_6,c_0_6]) ).
cnf(c_0_15,axiom,
unpack1(X1,inv(pack1(X1))) = X1,
unpack1_02 ).
cnf(c_0_16,plain,
( pack1(i) = o
| pack1(o) = o ),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_13]) ).
cnf(c_0_17,plain,
( inv(o) = X1
| X1 = o ),
inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_14])]) ).
cnf(c_0_18,plain,
( unpack1(X1,o) = X1
| pack1(X1) = o ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_6]),c_0_8]) ).
cnf(c_0_19,plain,
( unpack1(o,o) = i
| pack1(o) = o ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_16]),c_0_8]) ).
cnf(c_0_20,plain,
inv(o) = i,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_17]),c_0_10]),c_0_13]) ).
cnf(c_0_21,plain,
pack1(o) = o,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_13]) ).
cnf(c_0_22,plain,
unpack1(i,o) = o,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_20]),c_0_21]) ).
cnf(c_0_23,plain,
pack1(i) = o,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_22]),c_0_13]) ).
cnf(c_0_24,plain,
unpack1(o,o) = o,
inference(spm,[status(thm)],[c_0_9,c_0_21]) ).
cnf(c_0_25,plain,
$false,
inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_23]),c_0_24]),c_0_13]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : HWV052-1.001.001 : TPTP v9.2.1. Released v4.1.0.
% 0.00/0.12 % Command : /export/starexec/sandbox/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox/solver/bin/cse --final-prover /export/starexec/sandbox/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.16/0.33 % Computer : n002.cluster.edu
% 0.16/0.33 % Model : x86_64 x86_64
% 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.33 % Memory : 8042.1875MB
% 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.16/0.33 % CPULimit : 300
% 0.16/0.33 % WCLimit : 300
% 0.16/0.33 % DateTime : Mon May 4 19:18:16 EDT 2026
% 0.16/0.33 % CPUTime :
% 0.16/0.34 % start to proof: theBenchmark
% 1.27/1.72 % Version : CSE_E---1.7
% 1.27/1.72 % Problem : theBenchmark.p
% 1.27/1.72 % SZS status Unsatisfiable for theBenchmark.p
% 1.27/1.72 % SZS output start CNFRefutation
% See solution above
% 1.27/1.72 % Total time : 1.367s
%------------------------------------------------------------------------------