%------------------------------------------------------------------------------
% File : CSE_E---1.7
% Problem : HWV095+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 : n023.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:41 PM UTC 2026
% Result : Theorem 4.17s 3.25s
% Output : CNFRefutation 4.17s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 11
% Syntax : Number of formulae : 46 ( 14 unt; 0 def)
% Number of atoms : 112 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 114 ( 48 ~; 36 |; 16 &)
% ( 12 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 3 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 : 41 ( 5 sgn 27 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(addZeroExtensionConstraint_3,axiom,
! [X2] : ~ v1007(X2,bitIndex5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',addZeroExtensionConstraint_3) ).
fof(addAssertion,conjecture,
! [X2] :
( reachableState(X2)
=> v4(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',addAssertion) ).
fof(writeUnaryOperator_113,axiom,
! [X2] :
( ~ v4(X2)
<=> v995(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',writeUnaryOperator_113) ).
fof(writeUnaryOperator_111,axiom,
! [X2] :
( ~ v998(X2)
<=> v999(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',writeUnaryOperator_111) ).
fof(writeBinaryOperatorShiftedRanges_78,axiom,
! [X2] :
( v1001(X2)
<=> ( v1003(X2)
& v1007(X2,bitIndex5) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',writeBinaryOperatorShiftedRanges_78) ).
fof(writeUnaryOperator_112,axiom,
! [X2] :
( ~ v995(X2)
<=> v996(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',writeUnaryOperator_112) ).
fof(addAssignment_244,axiom,
! [X2] :
( v1000(X2,bitIndex1)
<=> $true ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',addAssignment_244) ).
fof(writeBinaryOperatorEqualRangesSingleBits_170,axiom,
! [X2] :
( v996(X2)
<=> ( v998(X2)
& v1010(X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',writeBinaryOperatorEqualRangesSingleBits_170) ).
fof(addAssignment_245,axiom,
! [X2] :
( v1000(X2,bitIndex0)
<=> v1001(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',addAssignment_245) ).
fof(writeBinaryOperatorShiftedRanges_80,axiom,
! [X2] :
( v1010(X2)
<=> ( v1000(X2,bitIndex0)
| v1000(X2,bitIndex1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',writeBinaryOperatorShiftedRanges_80) ).
fof(writeBinaryOperatorShiftedRanges_79,axiom,
! [X2] :
( v999(X2)
<=> ( v1000(X2,bitIndex0)
& v1000(X2,bitIndex1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',writeBinaryOperatorShiftedRanges_79) ).
fof(c_0_11,plain,
! [X2] : ~ v1007(X2,bitIndex5),
inference(fof_simplification,[status(thm)],[addZeroExtensionConstraint_3]) ).
fof(c_0_12,negated_conjecture,
~ ! [X2] :
( reachableState(X2)
=> v4(X2) ),
inference(assume_negation,[status(cth)],[addAssertion]) ).
fof(c_0_13,plain,
! [X2] :
( ~ v4(X2)
<=> v995(X2) ),
inference(fof_simplification,[status(thm)],[writeUnaryOperator_113]) ).
fof(c_0_14,plain,
! [X2] :
( ~ v998(X2)
<=> v999(X2) ),
inference(fof_simplification,[status(thm)],[writeUnaryOperator_111]) ).
fof(c_0_15,plain,
! [X1115] :
( ( v1003(X1115)
| ~ v1001(X1115) )
& ( v1007(X1115,bitIndex5)
| ~ v1001(X1115) )
& ( ~ v1003(X1115)
| ~ v1007(X1115,bitIndex5)
| v1001(X1115) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[writeBinaryOperatorShiftedRanges_78])])]) ).
fof(c_0_16,plain,
! [X1123] : ~ v1007(X1123,bitIndex5),
inference(variable_rename,[status(thm)],[c_0_11]) ).
fof(c_0_17,plain,
! [X2] :
( ~ v995(X2)
<=> v996(X2) ),
inference(fof_simplification,[status(thm)],[writeUnaryOperator_112]) ).
fof(c_0_18,negated_conjecture,
( reachableState(esk1_0)
& ~ v4(esk1_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])]) ).
fof(c_0_19,plain,
! [X1107] :
( ( v4(X1107)
| v995(X1107) )
& ( ~ v995(X1107)
| ~ v4(X1107) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])]) ).
fof(c_0_20,plain,
! [X2] : v1000(X2,bitIndex1),
inference(fof_simplification,[status(thm)],[addAssignment_244]) ).
fof(c_0_21,plain,
! [X1109] :
( ( v998(X1109)
| ~ v996(X1109) )
& ( v1010(X1109)
| ~ v996(X1109) )
& ( ~ v998(X1109)
| ~ v1010(X1109)
| v996(X1109) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[writeBinaryOperatorEqualRangesSingleBits_170])])]) ).
fof(c_0_22,plain,
! [X1111] :
( ( v998(X1111)
| v999(X1111) )
& ( ~ v999(X1111)
| ~ v998(X1111) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])]) ).
cnf(c_0_23,plain,
( v1007(X1,bitIndex5)
| ~ v1001(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_24,plain,
~ v1007(X1,bitIndex5),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_25,plain,
! [X1113] :
( ( ~ v1000(X1113,bitIndex0)
| v1001(X1113) )
& ( ~ v1001(X1113)
| v1000(X1113,bitIndex0) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[addAssignment_245])]) ).
fof(c_0_26,plain,
! [X1108] :
( ( v995(X1108)
| v996(X1108) )
& ( ~ v996(X1108)
| ~ v995(X1108) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_17])]) ).
cnf(c_0_27,negated_conjecture,
~ v4(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
cnf(c_0_28,plain,
( v4(X1)
| v995(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
fof(c_0_29,plain,
! [X1110] :
( ( ~ v1010(X1110)
| v1000(X1110,bitIndex0)
| v1000(X1110,bitIndex1) )
& ( ~ v1000(X1110,bitIndex0)
| v1010(X1110) )
& ( ~ v1000(X1110,bitIndex1)
| v1010(X1110) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[writeBinaryOperatorShiftedRanges_80])])]) ).
fof(c_0_30,plain,
! [X1114] : v1000(X1114,bitIndex1),
inference(variable_rename,[status(thm)],[c_0_20]) ).
cnf(c_0_31,plain,
( v996(X1)
| ~ v998(X1)
| ~ v1010(X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_32,plain,
( v998(X1)
| v999(X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
fof(c_0_33,plain,
! [X1112] :
( ( v1000(X1112,bitIndex0)
| ~ v999(X1112) )
& ( v1000(X1112,bitIndex1)
| ~ v999(X1112) )
& ( ~ v1000(X1112,bitIndex0)
| ~ v1000(X1112,bitIndex1)
| v999(X1112) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[writeBinaryOperatorShiftedRanges_79])])]) ).
cnf(c_0_34,plain,
~ v1001(X1),
inference(sr,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_35,plain,
( v1001(X1)
| ~ v1000(X1,bitIndex0) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
cnf(c_0_36,plain,
( ~ v996(X1)
| ~ v995(X1) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_37,negated_conjecture,
v995(esk1_0),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_38,plain,
( v1010(X1)
| ~ v1000(X1,bitIndex1) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
cnf(c_0_39,plain,
v1000(X1,bitIndex1),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_40,plain,
( v996(X1)
| v999(X1)
| ~ v1010(X1) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_41,plain,
( v1000(X1,bitIndex0)
| ~ v999(X1) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_42,plain,
~ v1000(X1,bitIndex0),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_43,negated_conjecture,
~ v996(esk1_0),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_44,plain,
v1010(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_39])]) ).
cnf(c_0_45,plain,
$false,
inference(cdclpropres,[status(thm)],[c_0_40,c_0_41,c_0_42,c_0_43,c_0_44]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.09/0.23 % Problem : HWV095+1 : TPTP v9.2.1. Released v6.1.0.
% 0.09/0.23 % 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.17/0.51 % Computer : n023.cluster.edu
% 0.17/0.51 % Model : x86_64 x86_64
% 0.17/0.51 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.51 % Memory : 8042.1875MB
% 0.17/0.51 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.51 % CPULimit : 300
% 0.17/0.51 % WCLimit : 300
% 0.17/0.51 % DateTime : Mon May 4 19:26:09 EDT 2026
% 0.17/0.51 % CPUTime :
% 0.17/0.52 % start to proof: theBenchmark
% 4.17/3.25 % Version : CSE_E---1.7
% 4.17/3.25 % Problem : theBenchmark.p
% 4.17/3.25 % SZS status Theorem for theBenchmark.p
% 4.17/3.25 % SZS output start CNFRefutation
% See solution above
% 4.17/3.25 % Total time : 2.540s
%------------------------------------------------------------------------------