%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : HWV095_1 : TPTP v9.3.1. Bugfixed v6.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n009.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.31s 0.60s
% Output : CNFRefutation 0.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of formulae : 48 ( 13 unt; 0 typ; 0 def)
% Number of atoms : 118 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 121 ( 51 ~; 39 |; 17 &)
% ( 12 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 3 ( 2 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% 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 : 42 ( 0 sgn 42 !; 0 ?; 42 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
bitindex_type: $tType ).
tff(decl_sort2,type,
state_type: $tType ).
tff(decl_48,type,
bitIndex5: bitindex_type ).
tff(decl_49,type,
bitIndex0: bitindex_type ).
tff(decl_50,type,
bitIndex1: bitindex_type ).
tff(decl_1104,type,
v1007: ( bitindex_type * state_type ) > $o ).
tff(decl_1110,type,
v1003: state_type > $o ).
tff(decl_1111,type,
v1001: state_type > $o ).
tff(decl_1112,type,
v1000: ( bitindex_type * state_type ) > $o ).
tff(decl_1113,type,
v999: state_type > $o ).
tff(decl_1114,type,
v998: state_type > $o ).
tff(decl_1115,type,
v1010: state_type > $o ).
tff(decl_1116,type,
v996: state_type > $o ).
tff(decl_1117,type,
v995: state_type > $o ).
tff(decl_1118,type,
v4: state_type > $o ).
tff(decl_1119,type,
reachableState: state_type > $o ).
tff(decl_1127,type,
esk1_0: state_type ).
tff(addAssignment_244,axiom,
! [X2: state_type] :
( v1000(X2,bitIndex1)
<=> $true ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',addAssignment_244) ).
tff(addAssertion,conjecture,
! [X2: state_type] :
( reachableState(X2)
=> v4(X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',addAssertion) ).
tff(writeUnaryOperator_113,axiom,
! [X2: state_type] :
( ~ v4(X2)
<=> v995(X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',writeUnaryOperator_113) ).
tff(writeBinaryOperatorShiftedRanges_80,axiom,
! [X2: state_type] :
( v1010(X2)
<=> ( v1000(X2,bitIndex1)
| v1000(X2,bitIndex0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',writeBinaryOperatorShiftedRanges_80) ).
tff(writeUnaryOperator_112,axiom,
! [X2: state_type] :
( ~ v995(X2)
<=> v996(X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',writeUnaryOperator_112) ).
tff(writeBinaryOperatorEqualRangesSingleBits_170,axiom,
! [X2: state_type] :
( v996(X2)
<=> ( v1010(X2)
& v998(X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',writeBinaryOperatorEqualRangesSingleBits_170) ).
tff(writeUnaryOperator_111,axiom,
! [X2: state_type] :
( ~ v998(X2)
<=> v999(X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',writeUnaryOperator_111) ).
tff(addZeroExtensionConstraint_3,axiom,
! [X2: state_type] : ~ v1007(X2,bitIndex5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',addZeroExtensionConstraint_3) ).
tff(writeBinaryOperatorShiftedRanges_78,axiom,
! [X2: state_type] :
( v1001(X2)
<=> ( v1007(X2,bitIndex5)
& v1003(X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',writeBinaryOperatorShiftedRanges_78) ).
tff(addAssignment_245,axiom,
! [X2: state_type] :
( v1000(X2,bitIndex0)
<=> v1001(X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',addAssignment_245) ).
tff(writeBinaryOperatorShiftedRanges_79,axiom,
! [X2: state_type] :
( v999(X2)
<=> ( v1000(X2,bitIndex1)
& v1000(X2,bitIndex0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',writeBinaryOperatorShiftedRanges_79) ).
tff(c_0_11,plain,
! [X77: state_type] :
( ( v1000(X77,bitIndex1)
| ~ $true )
& ( $true
| ~ v1000(X77,bitIndex1) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[addAssignment_244])])]) ).
tff(c_0_12,negated_conjecture,
~ ! [X2: state_type] :
( reachableState(X2)
=> v4(X2) ),
inference(assume_negation,[status(cth)],[addAssertion]) ).
tff(c_0_13,plain,
! [X2: state_type] :
( ~ v4(X2)
<=> v995(X2) ),
inference(fof_simplification,[status(thm)],[writeUnaryOperator_113]) ).
tff(c_0_14,plain,
! [X34: state_type] :
( ( v1010(X34)
| ~ v1000(X34,bitIndex1) )
& ( v1010(X34)
| ~ v1000(X34,bitIndex0) )
& ( v1000(X34,bitIndex1)
| v1000(X34,bitIndex0)
| ~ v1010(X34) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[writeBinaryOperatorShiftedRanges_80])])])]) ).
tcf(c_0_15,plain,
! [X1: state_type] :
( ~ $true
| v1000(X1,bitIndex1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
tff(c_0_16,plain,
! [X2: state_type] :
( ~ v995(X2)
<=> v996(X2) ),
inference(fof_simplification,[status(thm)],[writeUnaryOperator_112]) ).
tff(c_0_17,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_12])])])]) ).
tff(c_0_18,plain,
! [X6: state_type] :
( ( ~ v4(X6)
| ~ v995(X6) )
& ( v995(X6)
| v4(X6) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])]) ).
tff(c_0_19,plain,
! [X13: state_type] :
( ( 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])])])]) ).
tcf(c_0_20,plain,
! [X1: state_type] :
( ~ v1000(X1,bitIndex1)
| v1010(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
tcf(c_0_21,plain,
! [X1: state_type] : v1000(X1,bitIndex1),
inference(cn,[status(thm)],[c_0_15]) ).
tff(c_0_22,plain,
! [X2: state_type] :
( ~ v998(X2)
<=> v999(X2) ),
inference(fof_simplification,[status(thm)],[writeUnaryOperator_111]) ).
tff(c_0_23,plain,
! [X2: state_type] : ~ v1007(X2,bitIndex5),
inference(fof_simplification,[status(thm)],[addZeroExtensionConstraint_3]) ).
tff(c_0_24,plain,
! [X9: state_type] :
( ( ~ v995(X9)
| ~ v996(X9) )
& ( v996(X9)
| v995(X9) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])]) ).
tcf(c_0_25,negated_conjecture,
~ v4(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
tcf(c_0_26,plain,
! [X1: state_type] :
( v995(X1)
| v4(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
tcf(c_0_27,plain,
! [X1: state_type] :
( ~ v1010(X1)
| ~ v998(X1)
| v996(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
tcf(c_0_28,plain,
! [X1: state_type] : v1010(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21])]) ).
tff(c_0_29,plain,
! [X35: state_type] :
( ( ~ v998(X35)
| ~ v999(X35) )
& ( v999(X35)
| v998(X35) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_22])])]) ).
tff(c_0_30,plain,
! [X96: state_type] :
( ( v1001(X96)
| ~ v1007(X96,bitIndex5)
| ~ v1003(X96) )
& ( ~ v1001(X96)
| v1007(X96,bitIndex5) )
& ( ~ v1001(X96)
| v1003(X96) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[writeBinaryOperatorShiftedRanges_78])])])]) ).
tff(c_0_31,plain,
! [X103: state_type] : ~ v1007(X103,bitIndex5),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_23])]) ).
tcf(c_0_32,plain,
! [X1: state_type] :
( ~ v995(X1)
| ~ v996(X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
tcf(c_0_33,negated_conjecture,
v995(esk1_0),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
tcf(c_0_34,plain,
! [X1: state_type] :
( ~ v998(X1)
| v996(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28])]) ).
tcf(c_0_35,plain,
! [X1: state_type] :
( v999(X1)
| v998(X1) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
tff(c_0_36,plain,
! [X76: state_type] :
( ( v1000(X76,bitIndex0)
| ~ v1001(X76) )
& ( v1001(X76)
| ~ v1000(X76,bitIndex0) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[addAssignment_245])])]) ).
tcf(c_0_37,plain,
! [X1: state_type] :
( ~ v1001(X1)
| v1007(X1,bitIndex5) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
tcf(c_0_38,plain,
! [X1: state_type] : ~ v1007(X1,bitIndex5),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
tff(c_0_39,plain,
! [X75: state_type] :
( ( v999(X75)
| ~ v1000(X75,bitIndex1)
| ~ v1000(X75,bitIndex0) )
& ( ~ v999(X75)
| v1000(X75,bitIndex1) )
& ( ~ v999(X75)
| v1000(X75,bitIndex0) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[writeBinaryOperatorShiftedRanges_79])])])]) ).
tcf(c_0_40,negated_conjecture,
~ v996(esk1_0),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
tcf(c_0_41,plain,
! [X1: state_type] :
( v999(X1)
| v996(X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
tcf(c_0_42,plain,
! [X1: state_type] :
( ~ v1000(X1,bitIndex0)
| v1001(X1) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
tcf(c_0_43,plain,
! [X1: state_type] : ~ v1001(X1),
inference(sr,[status(thm)],[c_0_37,c_0_38]) ).
tcf(c_0_44,plain,
! [X1: state_type] :
( ~ v999(X1)
| v1000(X1,bitIndex0) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
tcf(c_0_45,negated_conjecture,
v999(esk1_0),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
tcf(c_0_46,plain,
! [X1: state_type] : ~ v1000(X1,bitIndex0),
inference(sr,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_47,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : HWV095_1 : TPTP v9.3.1. Bugfixed v6.2.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.44 % Computer : n009.cluster.edu
% 0.09/0.44 % Model : x86_64 x86_64
% 0.09/0.44 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.44 % Memory : 8046.5625MB
% 0.09/0.44 % OS : Linux 6.8.0-71-generic
% 0.09/0.44 % CPULimit : 300
% 0.09/0.44 % WCLimit : 300
% 0.09/0.44 % DateTime : Sun Sep 20 21:20:44 UTC 2026
% 0.09/0.44 % CPUTime :
% 0.09/0.44 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.48 Running first-order theorem proving
% 0.15/0.48 Running: /export/starexec/sandbox/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/sandbox/benchmark/theBenchmark.p
% 0.31/0.60 % Version: 3.5.1
% 0.31/0.60 % Preprocessing class: FMLLSMSLSSSNFFN.
% 0.31/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.31/0.60 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 0.31/0.60 % Starting new_bool_3 with 300s (1) cores
% 0.31/0.60 % Starting new_bool_1 with 300s (1) cores
% 0.31/0.60 % Starting sh5l with 300s (1) cores
% 0.31/0.60 % G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with pid 60204 completed with status 0
% 0.31/0.60 % Result found by G-E--_208_B07_F1_AE_CS_SP_PS_S0Y
% 0.31/0.60 % Preprocessing class: FMLLSMSLSSSNFFN.
% 0.31/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.31/0.60 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 0.31/0.60 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.31/0.60 % SinE strategy is gf600_h_gu_R05_F100_L20000
% 0.31/0.60 % Search class: FGHSF-SSLM00-SFFFFFNN
% 0.31/0.60 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.31/0.60 % Starting SubtermCWHack with 136s (1) cores
% 0.31/0.60 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 151s (1) cores
% 0.31/0.60 % Starting sh3 with 271s (1) cores
% 0.31/0.60 % Starting ho_unfolding_3 with 271s (1) cores
% 0.31/0.60 % Starting new_ho_10_cnf2 with 271s (1) cores
% 0.31/0.60 % SubtermCWHack with pid 60226 completed with status 0
% 0.31/0.60 % Result found by SubtermCWHack
% 0.31/0.60 % Preprocessing class: FMLLSMSLSSSNFFN.
% 0.31/0.60 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.31/0.60 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 0.31/0.60 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.31/0.60 % SinE strategy is gf600_h_gu_R05_F100_L20000
% 0.31/0.60 % Search class: FGHSF-SSLM00-SFFFFFNN
% 0.31/0.60 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.31/0.60 % Starting SubtermCWHack with 136s (1) cores
% 0.31/0.60 % Preprocessing time : 0.007 s
% 0.31/0.60
% 0.31/0.60 % Proof found!
% 0.31/0.60 % SZS status Theorem
% 0.31/0.60 % SZS output start CNFRefutation
% See solution above
% 0.31/0.60 % Parsed axioms : 2266
% 0.31/0.60 % Removed by relevancy pruning/SinE : 1958
% 0.31/0.60 % Initial clauses : 1240
% 0.31/0.60 % Removed in clause preprocessing : 25
% 0.31/0.60 % Initial clauses in saturation : 1215
% 0.31/0.60 % Processed clauses : 652
% 0.31/0.60 % ...of these trivial : 1
% 0.31/0.60 % ...subsumed : 2
% 0.31/0.60 % ...remaining for further processing : 649
% 0.31/0.60 % Other redundant clauses eliminated : 164
% 0.31/0.60 % Clauses deleted for lack of memory : 0
% 0.31/0.60 % Backward-subsumed : 3
% 0.31/0.60 % Backward-rewritten : 0
% 0.31/0.60 % Generated clauses : 302
% 0.31/0.60 % ...of the previous two non-redundant : 195
% 0.31/0.60 % ...aggressively subsumed : 0
% 0.31/0.60 % Contextual simplify-reflections : 8
% 0.31/0.60 % Paramodulations : 138
% 0.31/0.60 % Factorizations : 0
% 0.31/0.60 % NegExts : 0
% 0.31/0.60 % Equation resolutions : 164
% 0.31/0.60 % Disequality decompositions : 0
% 0.31/0.60 % Total rewrite steps : 43
% 0.31/0.60 % ...of those cached : 20
% 0.31/0.60 % Propositional unsat checks : 0
% 0.31/0.60 % Propositional check models : 0
% 0.31/0.60 % Propositional check unsatisfiable : 0
% 0.31/0.60 % Propositional clauses : 0
% 0.31/0.60 % Propositional clauses after purity: 0
% 0.31/0.60 % Propositional unsat core size : 0
% 0.31/0.60 % Propositional preprocessing time : 0.000
% 0.31/0.60 % Propositional encoding time : 0.000
% 0.31/0.60 % Propositional solver time : 0.000
% 0.31/0.60 % Success case prop preproc time : 0.000
% 0.31/0.60 % Success case prop encoding time : 0.000
% 0.31/0.60 % Success case prop solver time : 0.000
% 0.31/0.60 % Current number of processed clauses : 482
% 0.31/0.60 % Positive orientable unit clauses : 212
% 0.31/0.60 % Positive unorientable unit clauses: 0
% 0.31/0.60 % Negative unit clauses : 85
% 0.31/0.60 % Non-unit-clauses : 185
% 0.31/0.60 % Current number of unprocessed clauses: 758
% 0.31/0.60 % ...number of literals in the above : 2247
% 0.31/0.60 % Current number of archived formulas : 0
% 0.31/0.60 % Current number of archived clauses : 3
% 0.31/0.60 % Clause-clause subsumption calls (NU) : 9031
% 0.31/0.60 % Rec. Clause-clause subsumption calls : 7858
% 0.31/0.60 % Non-unit clause-clause subsumptions : 8
% 0.31/0.60 % Unit Clause-clause subsumption calls : 4699
% 0.31/0.60 % Rewrite failures with RHS unbound : 0
% 0.31/0.60 % BW rewrite match attempts : 1
% 0.31/0.60 % BW rewrite match successes : 1
% 0.31/0.60 % Condensation attempts : 0
% 0.31/0.60 % Condensation successes : 0
% 0.31/0.60 % Termbank termtop insertions : 74384
% 0.31/0.60 % Search garbage collected termcells : 17277
% 0.31/0.60
% 0.31/0.60 % -------------------------------------------------
% 0.31/0.60 % User time : 0.057 s
% 0.31/0.60 % System time : 0.014 s
% 0.31/0.60 % Total time : 0.070 s
% 0.31/0.60 % Maximum resident set size: 9208 pages
% 0.31/0.60
% 0.31/0.60 % -------------------------------------------------
% 0.31/0.60 % User time : 0.138 s
% 0.31/0.60 % System time : 0.040 s
% 0.31/0.60 % Total time : 0.178 s
% 0.31/0.60 % Maximum resident set size: 6400 pages
% 0.31/0.60 % E exiting
%------------------------------------------------------------------------------