%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : HWV089+1 : TPTP v9.2.1. Released v6.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 : n025.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:30:38 PM UTC 2026
% Result : Theorem 5.17s 4.00s
% Output : CNFRefutation 5.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 11
% Syntax : Number of formulae : 41 ( 10 unt; 0 def)
% Number of atoms : 105 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 109 ( 45 ~; 34 |; 16 &)
% ( 12 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 2 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 38 ( 3 sgn 27 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(addZeroExtensionConstraint_5,axiom,
! [X2] : ~ v3684(X2,bitIndex5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',addZeroExtensionConstraint_5) ).
fof(writeUnaryOperator_345,axiom,
! [X2] :
( ~ v3677(X2)
<=> v3678(X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',writeUnaryOperator_345) ).
fof(writeUnaryOperator_347,axiom,
! [X2] :
( ~ v4(X2)
<=> v3674(X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',writeUnaryOperator_347) ).
fof(writeUnaryOperator_346,axiom,
! [X2] :
( ~ v3674(X2)
<=> v3675(X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',writeUnaryOperator_346) ).
fof(writeBinaryOperatorShiftedRanges_553,axiom,
! [X2] :
( v3680(X2)
<=> ( v3682(X2)
& v3684(X2,bitIndex5) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',writeBinaryOperatorShiftedRanges_553) ).
fof(addAssertion,conjecture,
! [X2] :
( reachableState(X2)
=> v4(X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',addAssertion) ).
fof(addAssignment_2618,axiom,
! [X2] :
( v3679(X2,bitIndex1)
<=> $true ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',addAssignment_2618) ).
fof(addAssignment_2619,axiom,
! [X2] :
( v3679(X2,bitIndex0)
<=> v3680(X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',addAssignment_2619) ).
fof(writeBinaryOperatorShiftedRanges_555,axiom,
! [X2] :
( v3693(X2)
<=> ( v3679(X2,bitIndex0)
| v3679(X2,bitIndex1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',writeBinaryOperatorShiftedRanges_555) ).
fof(writeBinaryOperatorEqualRangesSingleBits_740,axiom,
! [X2] :
( v3675(X2)
<=> ( v3677(X2)
& v3693(X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',writeBinaryOperatorEqualRangesSingleBits_740) ).
fof(writeBinaryOperatorShiftedRanges_554,axiom,
! [X2] :
( v3678(X2)
<=> ( v3679(X2,bitIndex0)
& v3679(X2,bitIndex1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',writeBinaryOperatorShiftedRanges_554) ).
fof(c_0_11,plain,
! [X2] : ~ v3684(X2,bitIndex5),
inference(fof_simplification,[status(thm)],[addZeroExtensionConstraint_5]) ).
fof(c_0_12,plain,
! [X2] :
( ~ v3677(X2)
<=> v3678(X2) ),
inference(fof_simplification,[status(thm)],[writeUnaryOperator_345]) ).
fof(c_0_13,plain,
! [X2] :
( ~ v4(X2)
<=> v3674(X2) ),
inference(fof_simplification,[status(thm)],[writeUnaryOperator_347]) ).
fof(c_0_14,plain,
! [X2] :
( ~ v3674(X2)
<=> v3675(X2) ),
inference(fof_simplification,[status(thm)],[writeUnaryOperator_346]) ).
fof(c_0_15,plain,
! [X6174] :
( ( v3682(X6174)
| ~ v3680(X6174) )
& ( v3684(X6174,bitIndex5)
| ~ v3680(X6174) )
& ( ~ v3682(X6174)
| ~ v3684(X6174,bitIndex5)
| v3680(X6174) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[writeBinaryOperatorShiftedRanges_553])])]) ).
fof(c_0_16,plain,
! [X6187] : ~ v3684(X6187,bitIndex5),
inference(variable_rename,[status(thm)],[c_0_11]) ).
fof(c_0_17,negated_conjecture,
~ ! [X2] :
( reachableState(X2)
=> v4(X2) ),
inference(assume_negation,[status(cth)],[addAssertion]) ).
fof(c_0_18,plain,
! [X2] : v3679(X2,bitIndex1),
inference(fof_simplification,[status(thm)],[addAssignment_2618]) ).
fof(c_0_19,plain,
! [X6172] :
( ( ~ v3679(X6172,bitIndex0)
| v3680(X6172) )
& ( ~ v3680(X6172)
| v3679(X6172,bitIndex0) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[addAssignment_2619])]) ).
fof(c_0_20,plain,
! [X6169] :
( ( ~ v3693(X6169)
| v3679(X6169,bitIndex0)
| v3679(X6169,bitIndex1) )
& ( ~ v3679(X6169,bitIndex0)
| v3693(X6169) )
& ( ~ v3679(X6169,bitIndex1)
| v3693(X6169) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[writeBinaryOperatorShiftedRanges_555])])]) ).
fof(c_0_21,plain,
! [X6168] :
( ( v3677(X6168)
| ~ v3675(X6168) )
& ( v3693(X6168)
| ~ v3675(X6168) )
& ( ~ v3677(X6168)
| ~ v3693(X6168)
| v3675(X6168) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[writeBinaryOperatorEqualRangesSingleBits_740])])]) ).
fof(c_0_22,plain,
! [X6171] :
( ( v3679(X6171,bitIndex0)
| ~ v3678(X6171) )
& ( v3679(X6171,bitIndex1)
| ~ v3678(X6171) )
& ( ~ v3679(X6171,bitIndex0)
| ~ v3679(X6171,bitIndex1)
| v3678(X6171) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[writeBinaryOperatorShiftedRanges_554])])]) ).
fof(c_0_23,plain,
! [X6170] :
( ( v3677(X6170)
| v3678(X6170) )
& ( ~ v3678(X6170)
| ~ v3677(X6170) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])]) ).
fof(c_0_24,plain,
! [X6166] :
( ( v4(X6166)
| v3674(X6166) )
& ( ~ v3674(X6166)
| ~ v4(X6166) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])]) ).
fof(c_0_25,plain,
! [X6167] :
( ( v3674(X6167)
| v3675(X6167) )
& ( ~ v3675(X6167)
| ~ v3674(X6167) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])]) ).
cnf(c_0_26,plain,
( v3684(X1,bitIndex5)
| ~ v3680(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_27,plain,
~ v3684(X1,bitIndex5),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_28,negated_conjecture,
( reachableState(esk1_0)
& ~ v4(esk1_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])])]) ).
fof(c_0_29,plain,
! [X6173] : v3679(X6173,bitIndex1),
inference(variable_rename,[status(thm)],[c_0_18]) ).
cnf(c_0_30,plain,
( v3680(X1)
| ~ v3679(X1,bitIndex0) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_31,plain,
( v3693(X1)
| ~ v3679(X1,bitIndex1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_32,plain,
( v3675(X1)
| ~ v3677(X1)
| ~ v3693(X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_33,plain,
( v3679(X1,bitIndex0)
| ~ v3678(X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_34,plain,
( v3677(X1)
| v3678(X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_35,plain,
( v4(X1)
| v3674(X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_36,plain,
( ~ v3675(X1)
| ~ v3674(X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_37,plain,
~ v3680(X1),
inference(sr,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_38,negated_conjecture,
~ v4(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_39,plain,
v3679(X1,bitIndex1),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_40,plain,
$false,
inference(cdclpropres,[status(thm)],[c_0_30,c_0_31,c_0_32,c_0_33,c_0_34,c_0_35,c_0_36,c_0_37,c_0_38,c_0_39]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : HWV089+1 : TPTP v9.2.1. Released v6.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.14/0.33 % Computer : n025.cluster.edu
% 0.14/0.33 % Model : x86_64 x86_64
% 0.14/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.33 % Memory : 8042.1875MB
% 0.14/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.33 % CPULimit : 300
% 0.14/0.33 % WCLimit : 300
% 0.14/0.33 % DateTime : Mon May 4 19:22:43 EDT 2026
% 0.14/0.33 % CPUTime :
% 0.14/0.34 % start to proof: theBenchmark
% 5.17/4.00 % Version : CSE_E---1.7
% 5.17/4.00 % Problem : theBenchmark.p
% 5.17/4.00 % SZS status Theorem for theBenchmark.p
% 5.17/4.00 % SZS output start CNFRefutation
% See solution above
% 5.17/4.01 % Total time : 3.287s
%------------------------------------------------------------------------------