%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : HWV095+1 : TPTP v9.3.1. Released v6.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n011.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:48:30 PM UTC 2026
% Result : Theorem 0.68s 0.72s
% Output : CNFRefutation 0.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of formulae : 49 ( 13 unt; 0 def)
% Number of atoms : 121 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 122 ( 50 ~; 41 |; 17 &)
% ( 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 : 43 ( 6 sgn 26 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(writeUnaryOperator_111,axiom,
! [X2] :
( ~ v998(X2)
<=> v999(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',writeUnaryOperator_111) ).
fof(addAssignment_244,axiom,
! [X2] :
( v1000(X2,bitIndex1)
<=> $true ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',addAssignment_244) ).
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(writeBinaryOperatorEqualRangesSingleBits_170,axiom,
! [X2] :
( v996(X2)
<=> ( v1010(X2)
& v998(X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',writeBinaryOperatorEqualRangesSingleBits_170) ).
fof(writeBinaryOperatorShiftedRanges_80,axiom,
! [X2] :
( v1010(X2)
<=> ( v1000(X2,bitIndex1)
| v1000(X2,bitIndex0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',writeBinaryOperatorShiftedRanges_80) ).
fof(writeUnaryOperator_112,axiom,
! [X2] :
( ~ v995(X2)
<=> v996(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',writeUnaryOperator_112) ).
fof(addZeroExtensionConstraint_3,axiom,
! [X2] : ~ v1007(X2,bitIndex5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',addZeroExtensionConstraint_3) ).
fof(writeBinaryOperatorShiftedRanges_79,axiom,
! [X2] :
( v999(X2)
<=> ( v1000(X2,bitIndex1)
& v1000(X2,bitIndex0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',writeBinaryOperatorShiftedRanges_79) ).
fof(writeBinaryOperatorShiftedRanges_78,axiom,
! [X2] :
( v1001(X2)
<=> ( v1007(X2,bitIndex5)
& v1003(X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',writeBinaryOperatorShiftedRanges_78) ).
fof(addAssignment_245,axiom,
! [X2] :
( v1000(X2,bitIndex0)
<=> v1001(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',addAssignment_245) ).
fof(c_0_11,plain,
! [X2] :
( ~ v998(X2)
<=> v999(X2) ),
inference(fof_simplification,[status(thm)],[writeUnaryOperator_111]) ).
fof(c_0_12,plain,
! [X18] :
( ( v1000(X18,bitIndex1)
| ~ $true )
& ( $true
| ~ v1000(X18,bitIndex1) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[addAssignment_244])])]) ).
fof(c_0_13,negated_conjecture,
~ ! [X2] :
( reachableState(X2)
=> v4(X2) ),
inference(assume_negation,[status(cth)],[addAssertion]) ).
fof(c_0_14,plain,
! [X2] :
( ~ v4(X2)
<=> v995(X2) ),
inference(fof_simplification,[status(thm)],[writeUnaryOperator_113]) ).
fof(c_0_15,plain,
! [X13] :
( ( v996(X13)
| ~ v1010(X13)
| ~ v998(X13) )
& ( ~ v996(X13)
| v1010(X13) )
& ( ~ v996(X13)
| v998(X13) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[writeBinaryOperatorEqualRangesSingleBits_170])])])]) ).
fof(c_0_16,plain,
! [X15] :
( ( ~ v998(X15)
| ~ v999(X15) )
& ( v999(X15)
| v998(X15) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])]) ).
fof(c_0_17,plain,
! [X14] :
( ( v1010(X14)
| ~ v1000(X14,bitIndex1) )
& ( v1010(X14)
| ~ v1000(X14,bitIndex0) )
& ( v1000(X14,bitIndex1)
| v1000(X14,bitIndex0)
| ~ v1010(X14) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[writeBinaryOperatorShiftedRanges_80])])])]) ).
cnf(c_0_18,plain,
( $false
| v1000(X1,bitIndex1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_19,plain,
! [X2] :
( ~ v995(X2)
<=> v996(X2) ),
inference(fof_simplification,[status(thm)],[writeUnaryOperator_112]) ).
fof(c_0_20,negated_conjecture,
( ~ v4(esk1_0)
& reachableState(esk1_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])]) ).
fof(c_0_21,plain,
! [X11] :
( ( ~ v4(X11)
| ~ v995(X11) )
& ( v995(X11)
| v4(X11) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])]) ).
cnf(c_0_22,plain,
( ~ v1010(X1)
| ~ v998(X1)
| v996(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_23,plain,
( v999(X1)
| v998(X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_24,plain,
( ~ v1000(X1,bitIndex1)
| v1010(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,plain,
v1000(X1,bitIndex1),
inference(cn,[status(thm)],[c_0_18]) ).
fof(c_0_26,plain,
! [X2] : ~ v1007(X2,bitIndex5),
inference(fof_simplification,[status(thm)],[addZeroExtensionConstraint_3]) ).
fof(c_0_27,plain,
! [X12] :
( ( ~ v995(X12)
| ~ v996(X12) )
& ( v996(X12)
| v995(X12) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_19])])]) ).
cnf(c_0_28,negated_conjecture,
~ v4(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_29,plain,
( v995(X1)
| v4(X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
fof(c_0_30,plain,
! [X16] :
( ( v999(X16)
| ~ v1000(X16,bitIndex1)
| ~ v1000(X16,bitIndex0) )
& ( ~ v999(X16)
| v1000(X16,bitIndex1) )
& ( ~ v999(X16)
| v1000(X16,bitIndex0) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[writeBinaryOperatorShiftedRanges_79])])])]) ).
cnf(c_0_31,plain,
( ~ v1010(X1)
| v996(X1)
| v999(X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_32,plain,
v1010(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_24,c_0_25])]) ).
fof(c_0_33,plain,
! [X19] :
( ( v1001(X19)
| ~ v1007(X19,bitIndex5)
| ~ v1003(X19) )
& ( ~ v1001(X19)
| v1007(X19,bitIndex5) )
& ( ~ v1001(X19)
| v1003(X19) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[writeBinaryOperatorShiftedRanges_78])])])]) ).
fof(c_0_34,plain,
! [X27] : ~ v1007(X27,bitIndex5),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_26])]) ).
cnf(c_0_35,plain,
( ~ v995(X1)
| ~ v996(X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_36,negated_conjecture,
v995(esk1_0),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_37,plain,
( ~ v999(X1)
| v1000(X1,bitIndex0) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_38,plain,
( v996(X1)
| v999(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_32])]) ).
fof(c_0_39,plain,
! [X17] :
( ( v1000(X17,bitIndex0)
| ~ v1001(X17) )
& ( v1001(X17)
| ~ v1000(X17,bitIndex0) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[addAssignment_245])])]) ).
cnf(c_0_40,plain,
( ~ v1001(X1)
| v1007(X1,bitIndex5) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_41,plain,
~ v1007(X1,bitIndex5),
inference(split_conjunct,[status(thm)],[c_0_34]) ).
cnf(c_0_42,negated_conjecture,
~ v996(esk1_0),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_43,plain,
( v996(X1)
| v1000(X1,bitIndex0) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_44,plain,
( ~ v1000(X1,bitIndex0)
| v1001(X1) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_45,plain,
~ v1001(X1),
inference(sr,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_46,negated_conjecture,
v1000(esk1_0,bitIndex0),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_47,plain,
~ v1000(X1,bitIndex0),
inference(sr,[status(thm)],[c_0_44,c_0_45]) ).
cnf(c_0_48,negated_conjecture,
$false,
inference(sr,[status(thm)],[c_0_46,c_0_47]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : HWV095+1 : TPTP v9.3.1. Released v6.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.38 % Computer : n011.cluster.edu
% 0.11/0.38 % Model : x86_64 x86_64
% 0.11/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.38 % Memory : 8046.5625MB
% 0.11/0.38 % OS : Linux 6.8.0-71-generic
% 0.11/0.38 % CPULimit : 300
% 0.11/0.38 % WCLimit : 300
% 0.11/0.38 % DateTime : Sun Sep 20 21:20:25 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.43 Running first-order theorem proving
% 0.11/0.43 Running: /export/starexec/sandbox2/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/sandbox2/benchmark/theBenchmark.p
% 0.68/0.72 % Version: 3.5.1
% 0.68/0.72 % Preprocessing class: FMLLSMSLSSSNFFN.
% 0.68/0.72 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.68/0.72 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 0.68/0.72 % Starting new_bool_3 with 300s (1) cores
% 0.68/0.72 % Starting new_bool_1 with 300s (1) cores
% 0.68/0.72 % Starting sh5l with 300s (1) cores
% 0.68/0.72 % new_bool_1 with pid 182797 completed with status 9
% 0.68/0.72 % new_bool_3 with pid 182796 completed with status 9
% 0.68/0.72 % G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with pid 182795 completed with status 0
% 0.68/0.72 % Result found by G-E--_208_B07_F1_AE_CS_SP_PS_S0Y
% 0.68/0.72 % Preprocessing class: FMLLSMSLSSSNFFN.
% 0.68/0.72 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.68/0.72 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 0.68/0.72 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.68/0.72 % No SInE strategy applied
% 0.68/0.72 % Search class: FGHSS-SMLM00-SFFFFFNN
% 0.68/0.72 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.68/0.72 % Starting SubtermCWHack with 136s (1) cores
% 0.68/0.72 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 151s (1) cores
% 0.68/0.72 % Starting G-E--_300_C18_F1_SE_CS_SP_S0Y with 266s (1) cores
% 0.68/0.72 % Starting new_bool_3 with 266s (1) cores
% 0.68/0.72 % Starting new_bool_1 with 266s (1) cores
% 0.68/0.72 % G-E--_300_C18_F1_SE_CS_SP_S0Y with pid 182861 completed with status 0
% 0.68/0.72 % Result found by G-E--_300_C18_F1_SE_CS_SP_S0Y
% 0.68/0.72 % Preprocessing class: FMLLSMSLSSSNFFN.
% 0.68/0.72 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.68/0.72 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 0.68/0.72 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.68/0.72 % No SInE strategy applied
% 0.68/0.72 % Search class: FGHSS-SMLM00-SFFFFFNN
% 0.68/0.72 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.68/0.72 % Starting SubtermCWHack with 136s (1) cores
% 0.68/0.72 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 151s (1) cores
% 0.68/0.72 % Starting G-E--_300_C18_F1_SE_CS_SP_S0Y with 266s (1) cores
% 0.68/0.72 % Preprocessing time : 0.020 s
% 0.68/0.72
% 0.68/0.72 % Proof found!
% 0.68/0.72 % SZS status Theorem
% 0.68/0.72 % SZS output start CNFRefutation
% See solution above
% 0.68/0.72 % Parsed axioms : 1156
% 0.68/0.72 % Removed by relevancy pruning/SinE : 0
% 0.68/0.72 % Initial clauses : 3983
% 0.68/0.72 % Removed in clause preprocessing : 537
% 0.68/0.72 % Initial clauses in saturation : 3446
% 0.68/0.72 % Processed clauses : 2193
% 0.68/0.72 % ...of these trivial : 5
% 0.68/0.72 % ...subsumed : 14
% 0.68/0.72 % ...remaining for further processing : 2174
% 0.68/0.72 % Other redundant clauses eliminated : 182
% 0.68/0.72 % Clauses deleted for lack of memory : 0
% 0.68/0.72 % Backward-subsumed : 18
% 0.68/0.72 % Backward-rewritten : 2
% 0.68/0.72 % Generated clauses : 1090
% 0.68/0.72 % ...of the previous two non-redundant : 734
% 0.68/0.72 % ...aggressively subsumed : 0
% 0.68/0.72 % Contextual simplify-reflections : 13
% 0.68/0.72 % Paramodulations : 906
% 0.68/0.72 % Factorizations : 0
% 0.68/0.72 % NegExts : 0
% 0.68/0.72 % Equation resolutions : 182
% 0.68/0.72 % Disequality decompositions : 0
% 0.68/0.72 % Total rewrite steps : 37
% 0.68/0.72 % ...of those cached : 16
% 0.68/0.72 % Propositional unsat checks : 0
% 0.68/0.72 % Propositional check models : 0
% 0.68/0.72 % Propositional check unsatisfiable : 0
% 0.68/0.72 % Propositional clauses : 0
% 0.68/0.72 % Propositional clauses after purity: 0
% 0.68/0.72 % Propositional unsat core size : 0
% 0.68/0.72 % Propositional preprocessing time : 0.000
% 0.68/0.72 % Propositional encoding time : 0.000
% 0.68/0.72 % Propositional solver time : 0.000
% 0.68/0.72 % Success case prop preproc time : 0.000
% 0.68/0.72 % Success case prop encoding time : 0.000
% 0.68/0.72 % Success case prop solver time : 0.000
% 0.68/0.72 % Current number of processed clauses : 1970
% 0.68/0.72 % Positive orientable unit clauses : 243
% 0.68/0.72 % Positive unorientable unit clauses: 0
% 0.68/0.72 % Negative unit clauses : 210
% 0.68/0.72 % Non-unit-clauses : 1517
% 0.68/0.72 % Current number of unprocessed clauses: 1986
% 0.68/0.72 % ...number of literals in the above : 6409
% 0.68/0.72 % Current number of archived formulas : 0
% 0.68/0.72 % Current number of archived clauses : 22
% 0.68/0.72 % Clause-clause subsumption calls (NU) : 666335
% 0.68/0.72 % Rec. Clause-clause subsumption calls : 631090
% 0.68/0.72 % Non-unit clause-clause subsumptions : 22
% 0.68/0.72 % Unit Clause-clause subsumption calls : 49463
% 0.68/0.72 % Rewrite failures with RHS unbound : 0
% 0.68/0.72 % BW rewrite match attempts : 7
% 0.68/0.72 % BW rewrite match successes : 7
% 0.68/0.72 % Condensation attempts : 0
% 0.68/0.72 % Condensation successes : 0
% 0.68/0.72 % Termbank termtop insertions : 220912
% 0.68/0.72 % Search garbage collected termcells : 40002
% 0.68/0.72
% 0.68/0.72 % -------------------------------------------------
% 0.68/0.72 % User time : 0.218 s
% 0.68/0.72 % System time : 0.029 s
% 0.68/0.72 % Total time : 0.247 s
% 0.68/0.72 % Maximum resident set size: 12804 pages
% 0.68/0.72
% 0.68/0.72 % -------------------------------------------------
% 0.68/0.72 % User time : 0.756 s
% 0.68/0.72 % System time : 0.184 s
% 0.68/0.72 % Total time : 0.940 s
% 0.68/0.72 % Maximum resident set size: 6400 pages
% 0.68/0.72 % E exiting
%------------------------------------------------------------------------------