%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : HWV090+1 : TPTP v9.2.1. Released v6.1.0.
% Transfm : none
% Format : tptp:raw
% Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% Computer : n010.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 92.78s 65.38s
% Output : CNFRefutation 92.88s
% 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 : 108 ( 44 ~; 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 : 37 ( 2 sgn 27 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(addAssertion,conjecture,
! [X2] :
( reachableState(X2)
=> v4(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',addAssertion) ).
fof(writeUnaryOperator_3140,axiom,
! [X2] :
( ~ v4(X2)
<=> v30850(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',writeUnaryOperator_3140) ).
fof(addZeroExtensionConstraint_11,axiom,
! [X2] : ~ v30860(X2,bitIndex5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',addZeroExtensionConstraint_11) ).
fof(writeUnaryOperator_3139,axiom,
! [X2] :
( ~ v30850(X2)
<=> v30851(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',writeUnaryOperator_3139) ).
fof(addAssignment_9321,axiom,
! [X2] :
( v30855(X2,bitIndex1)
<=> $true ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',addAssignment_9321) ).
fof(writeUnaryOperator_3138,axiom,
! [X2] :
( ~ v30853(X2)
<=> v30854(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',writeUnaryOperator_3138) ).
fof(addAssignment_9322,axiom,
! [X2] :
( v30855(X2,bitIndex0)
<=> v30856(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',addAssignment_9322) ).
fof(writeBinaryOperatorShiftedRanges_1723,axiom,
! [X2] :
( v30869(X2)
<=> ( v30855(X2,bitIndex0)
| v30855(X2,bitIndex1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',writeBinaryOperatorShiftedRanges_1723) ).
fof(writeBinaryOperatorShiftedRanges_1721,axiom,
! [X2] :
( v30856(X2)
<=> ( v30858(X2)
& v30860(X2,bitIndex5) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',writeBinaryOperatorShiftedRanges_1721) ).
fof(writeBinaryOperatorShiftedRanges_1722,axiom,
! [X2] :
( v30854(X2)
<=> ( v30855(X2,bitIndex0)
& v30855(X2,bitIndex1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',writeBinaryOperatorShiftedRanges_1722) ).
fof(writeBinaryOperatorEqualRangesSingleBits_6728,axiom,
! [X2] :
( v30851(X2)
<=> ( v30853(X2)
& v30869(X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',writeBinaryOperatorEqualRangesSingleBits_6728) ).
fof(c_0_11,negated_conjecture,
~ ! [X2] :
( reachableState(X2)
=> v4(X2) ),
inference(assume_negation,[status(cth)],[addAssertion]) ).
fof(c_0_12,plain,
! [X2] :
( ~ v4(X2)
<=> v30850(X2) ),
inference(fof_simplification,[status(thm)],[writeUnaryOperator_3140]) ).
fof(c_0_13,plain,
! [X2] : ~ v30860(X2,bitIndex5),
inference(fof_simplification,[status(thm)],[addZeroExtensionConstraint_11]) ).
fof(c_0_14,plain,
! [X2] :
( ~ v30850(X2)
<=> v30851(X2) ),
inference(fof_simplification,[status(thm)],[writeUnaryOperator_3139]) ).
fof(c_0_15,plain,
! [X2] : v30855(X2,bitIndex1),
inference(fof_simplification,[status(thm)],[addAssignment_9321]) ).
fof(c_0_16,plain,
! [X2] :
( ~ v30853(X2)
<=> v30854(X2) ),
inference(fof_simplification,[status(thm)],[writeUnaryOperator_3138]) ).
fof(c_0_17,negated_conjecture,
( reachableState(esk1_0)
& ~ v4(esk1_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])]) ).
fof(c_0_18,plain,
! [X36059] :
( ( v4(X36059)
| v30850(X36059) )
& ( ~ v30850(X36059)
| ~ v4(X36059) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])]) ).
fof(c_0_19,plain,
! [X36065] :
( ( ~ v30855(X36065,bitIndex0)
| v30856(X36065) )
& ( ~ v30856(X36065)
| v30855(X36065,bitIndex0) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[addAssignment_9322])]) ).
fof(c_0_20,plain,
! [X36062] :
( ( ~ v30869(X36062)
| v30855(X36062,bitIndex0)
| v30855(X36062,bitIndex1) )
& ( ~ v30855(X36062,bitIndex0)
| v30869(X36062) )
& ( ~ v30855(X36062,bitIndex1)
| v30869(X36062) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[writeBinaryOperatorShiftedRanges_1723])])]) ).
fof(c_0_21,plain,
! [X36080] : ~ v30860(X36080,bitIndex5),
inference(variable_rename,[status(thm)],[c_0_13]) ).
fof(c_0_22,plain,
! [X36067] :
( ( v30858(X36067)
| ~ v30856(X36067) )
& ( v30860(X36067,bitIndex5)
| ~ v30856(X36067) )
& ( ~ v30858(X36067)
| ~ v30860(X36067,bitIndex5)
| v30856(X36067) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[writeBinaryOperatorShiftedRanges_1721])])]) ).
fof(c_0_23,plain,
! [X36064] :
( ( v30855(X36064,bitIndex0)
| ~ v30854(X36064) )
& ( v30855(X36064,bitIndex1)
| ~ v30854(X36064) )
& ( ~ v30855(X36064,bitIndex0)
| ~ v30855(X36064,bitIndex1)
| v30854(X36064) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[writeBinaryOperatorShiftedRanges_1722])])]) ).
fof(c_0_24,plain,
! [X36061] :
( ( v30853(X36061)
| ~ v30851(X36061) )
& ( v30869(X36061)
| ~ v30851(X36061) )
& ( ~ v30853(X36061)
| ~ v30869(X36061)
| v30851(X36061) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[writeBinaryOperatorEqualRangesSingleBits_6728])])]) ).
fof(c_0_25,plain,
! [X36060] :
( ( v30850(X36060)
| v30851(X36060) )
& ( ~ v30851(X36060)
| ~ v30850(X36060) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])]) ).
fof(c_0_26,plain,
! [X36066] : v30855(X36066,bitIndex1),
inference(variable_rename,[status(thm)],[c_0_15]) ).
fof(c_0_27,plain,
! [X36063] :
( ( v30853(X36063)
| v30854(X36063) )
& ( ~ v30854(X36063)
| ~ v30853(X36063) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])]) ).
cnf(c_0_28,negated_conjecture,
~ v4(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_29,plain,
( v4(X1)
| v30850(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_30,plain,
( v30856(X1)
| ~ v30855(X1,bitIndex0) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_31,plain,
( v30869(X1)
| ~ v30855(X1,bitIndex1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_32,plain,
~ v30860(X1,bitIndex5),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_33,plain,
( v30860(X1,bitIndex5)
| ~ v30856(X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
cnf(c_0_34,plain,
( v30855(X1,bitIndex0)
| ~ v30854(X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_35,plain,
( v30851(X1)
| ~ v30853(X1)
| ~ v30869(X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_36,plain,
( ~ v30851(X1)
| ~ v30850(X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_37,plain,
v30855(X1,bitIndex1),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_38,plain,
( v30853(X1)
| v30854(X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_39,negated_conjecture,
v30850(esk1_0),
inference(spm,[status(thm)],[c_0_28,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 : HWV090+1 : TPTP v9.2.1. Released v6.1.0.
% 0.00/0.12 % Command : /export/starexec/sandbox2/solver/bin/lemma_parallel_prover %s --lemma-prover /export/starexec/sandbox2/solver/bin/cse --final-prover /export/starexec/sandbox2/solver/bin/eprover --proof-time %d --global-time-limit %d
% 0.13/0.32 % Computer : n010.cluster.edu
% 0.13/0.32 % Model : x86_64 x86_64
% 0.13/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.32 % Memory : 8042.1875MB
% 0.13/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.32 % CPULimit : 300
% 0.13/0.32 % WCLimit : 300
% 0.13/0.32 % DateTime : Mon May 4 19:23:21 EDT 2026
% 0.13/0.33 % CPUTime :
% 0.20/0.35 % start to proof: theBenchmark
% 92.78/65.38 % Version : CSE_E---1.7
% 92.78/65.38 % Problem : theBenchmark.p
% 92.78/65.38 % SZS status Theorem for theBenchmark.p
% 92.78/65.38 % SZS output start CNFRefutation
% See solution above
% 92.88/65.45 % Total time : 62.440s
%------------------------------------------------------------------------------