TSTP Solution File: HWV093_1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : HWV093_1 : TPTP v8.2.0. Bugfixed v6.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n015.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 : Mon May 20 21:36:29 EDT 2024
% Result : Theorem 1.13s 0.68s
% Output : CNFRefutation 1.13s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 28
% Syntax : Number of formulae : 66 ( 15 unt; 17 typ; 0 def)
% Number of atoms : 118 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 121 ( 52 ~; 38 |; 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 : 13 ( 11 >; 2 *; 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 : 44 ( 0 sgn 44 !; 0 ?; 44 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_sort1,type,
bitindex_type: $tType ).
tff(decl_sort2,type,
state_type: $tType ).
tff(decl_46,type,
bitIndex5: bitindex_type ).
tff(decl_47,type,
bitIndex0: bitindex_type ).
tff(decl_48,type,
bitIndex1: bitindex_type ).
tff(decl_1103,type,
v1007: ( state_type * bitindex_type ) > $o ).
tff(decl_1109,type,
v1003: state_type > $o ).
tff(decl_1110,type,
v1001: state_type > $o ).
tff(decl_1111,type,
v1000: ( state_type * bitindex_type ) > $o ).
tff(decl_1112,type,
v999: state_type > $o ).
tff(decl_1113,type,
v998: state_type > $o ).
tff(decl_1114,type,
v1010: state_type > $o ).
tff(decl_1115,type,
v996: state_type > $o ).
tff(decl_1116,type,
v995: state_type > $o ).
tff(decl_1117,type,
v4: state_type > $o ).
tff(decl_1118,type,
reachableState: state_type > $o ).
tff(decl_1126,type,
esk1_0: state_type ).
tff(addZeroExtensionConstraint_3,axiom,
! [X2: state_type] : ~ v1007(X2,bitIndex5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',addZeroExtensionConstraint_3) ).
tff(writeBinaryOperatorShiftedRanges_78,axiom,
! [X2: state_type] :
( v1001(X2)
<=> ( v1003(X2)
& v1007(X2,bitIndex5) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',writeBinaryOperatorShiftedRanges_78) ).
tff(addAssignment_244,axiom,
! [X2: state_type] :
( v1000(X2,bitIndex1)
<=> $true ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',addAssignment_244) ).
tff(addAssignment_245,axiom,
! [X2: state_type] :
( v1000(X2,bitIndex0)
<=> v1001(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',addAssignment_245) ).
tff(addAssertion,conjecture,
! [X2: state_type] :
( reachableState(X2)
=> v4(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',addAssertion) ).
tff(writeUnaryOperator_113,axiom,
! [X2: state_type] :
( ~ v4(X2)
<=> v995(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',writeUnaryOperator_113) ).
tff(writeBinaryOperatorShiftedRanges_80,axiom,
! [X2: state_type] :
( v1010(X2)
<=> ( v1000(X2,bitIndex0)
| v1000(X2,bitIndex1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',writeBinaryOperatorShiftedRanges_80) ).
tff(writeUnaryOperator_111,axiom,
! [X2: state_type] :
( ~ v998(X2)
<=> v999(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',writeUnaryOperator_111) ).
tff(writeBinaryOperatorShiftedRanges_79,axiom,
! [X2: state_type] :
( v999(X2)
<=> ( v1000(X2,bitIndex0)
& v1000(X2,bitIndex1) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',writeBinaryOperatorShiftedRanges_79) ).
tff(writeUnaryOperator_112,axiom,
! [X2: state_type] :
( ~ v995(X2)
<=> v996(X2) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',writeUnaryOperator_112) ).
tff(writeBinaryOperatorEqualRangesSingleBits_170,axiom,
! [X2: state_type] :
( v996(X2)
<=> ( v998(X2)
& v1010(X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',writeBinaryOperatorEqualRangesSingleBits_170) ).
tff(c_0_11,plain,
! [X2: state_type] : ~ v1007(X2,bitIndex5),
inference(fof_simplification,[status(thm)],[addZeroExtensionConstraint_3]) ).
tff(c_0_12,plain,
! [X96: state_type] :
( ( v1003(X96)
| ~ v1001(X96) )
& ( v1007(X96,bitIndex5)
| ~ v1001(X96) )
& ( ~ v1003(X96)
| ~ v1007(X96,bitIndex5)
| v1001(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_13,plain,
! [X103: state_type] : ~ v1007(X103,bitIndex5),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_11])]) ).
tff(c_0_14,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_15,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_16,plain,
! [X1: state_type] :
( v1007(X1,bitIndex5)
| ~ v1001(X1) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
tcf(c_0_17,plain,
! [X1: state_type] : ~ v1007(X1,bitIndex5),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
tff(c_0_18,negated_conjecture,
~ ! [X2: state_type] :
( reachableState(X2)
=> v4(X2) ),
inference(assume_negation,[status(cth)],[addAssertion]) ).
tff(c_0_19,plain,
! [X2: state_type] :
( ~ v4(X2)
<=> v995(X2) ),
inference(fof_simplification,[status(thm)],[writeUnaryOperator_113]) ).
tff(c_0_20,plain,
! [X34: state_type] :
( ( ~ v1010(X34)
| v1000(X34,bitIndex0)
| v1000(X34,bitIndex1) )
& ( ~ v1000(X34,bitIndex0)
| v1010(X34) )
& ( ~ v1000(X34,bitIndex1)
| 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_21,plain,
! [X1: state_type] :
( v1000(X1,bitIndex1)
| ~ $true ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
tff(c_0_22,plain,
! [X2: state_type] :
( ~ v998(X2)
<=> v999(X2) ),
inference(fof_simplification,[status(thm)],[writeUnaryOperator_111]) ).
tff(c_0_23,plain,
! [X75: state_type] :
( ( v1000(X75,bitIndex0)
| ~ v999(X75) )
& ( v1000(X75,bitIndex1)
| ~ v999(X75) )
& ( ~ v1000(X75,bitIndex0)
| ~ v1000(X75,bitIndex1)
| v999(X75) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[writeBinaryOperatorShiftedRanges_79])])])]) ).
tcf(c_0_24,plain,
! [X1: state_type] :
( v1001(X1)
| ~ v1000(X1,bitIndex0) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
tcf(c_0_25,plain,
! [X1: state_type] : ~ v1001(X1),
inference(sr,[status(thm)],[c_0_16,c_0_17]) ).
tff(c_0_26,plain,
! [X2: state_type] :
( ~ v995(X2)
<=> v996(X2) ),
inference(fof_simplification,[status(thm)],[writeUnaryOperator_112]) ).
tff(c_0_27,negated_conjecture,
( reachableState(esk1_0)
& ~ v4(esk1_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])])]) ).
tff(c_0_28,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_19])])]) ).
tff(c_0_29,plain,
! [X13: state_type] :
( ( v998(X13)
| ~ v996(X13) )
& ( v1010(X13)
| ~ v996(X13) )
& ( ~ v998(X13)
| ~ v1010(X13)
| v996(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_30,plain,
! [X1: state_type] :
( v1010(X1)
| ~ v1000(X1,bitIndex1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
tcf(c_0_31,plain,
! [X1: state_type] : v1000(X1,bitIndex1),
inference(cn,[status(thm)],[c_0_21]) ).
tff(c_0_32,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])])]) ).
tcf(c_0_33,plain,
! [X1: state_type] :
( v1000(X1,bitIndex0)
| ~ v999(X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
tcf(c_0_34,plain,
! [X1: state_type] : ~ v1000(X1,bitIndex0),
inference(sr,[status(thm)],[c_0_24,c_0_25]) ).
tff(c_0_35,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_26])])]) ).
tcf(c_0_36,negated_conjecture,
~ v4(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
tcf(c_0_37,plain,
! [X1: state_type] :
( v4(X1)
| v995(X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
tcf(c_0_38,plain,
! [X1: state_type] :
( v996(X1)
| ~ v998(X1)
| ~ v1010(X1) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
tcf(c_0_39,plain,
! [X1: state_type] : v1010(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_30,c_0_31])]) ).
tcf(c_0_40,plain,
! [X1: state_type] :
( v998(X1)
| v999(X1) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
tcf(c_0_41,plain,
! [X1: state_type] : ~ v999(X1),
inference(sr,[status(thm)],[c_0_33,c_0_34]) ).
tcf(c_0_42,plain,
! [X1: state_type] :
( ~ v996(X1)
| ~ v995(X1) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
tcf(c_0_43,negated_conjecture,
v995(esk1_0),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
tcf(c_0_44,plain,
! [X1: state_type] :
( v996(X1)
| ~ v998(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_38,c_0_39])]) ).
tcf(c_0_45,plain,
! [X1: state_type] : v998(X1),
inference(sr,[status(thm)],[c_0_40,c_0_41]) ).
tcf(c_0_46,negated_conjecture,
~ v996(esk1_0),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
tcf(c_0_47,plain,
! [X1: state_type] : v996(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_45])]) ).
cnf(c_0_48,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_47])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : HWV093_1 : TPTP v8.2.0. Bugfixed v6.2.0.
% 0.12/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n015.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sun May 19 11:34:38 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.20/0.47 Running first-order theorem proving
% 0.20/0.47 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
% 1.13/0.68 # Version: 3.1.0
% 1.13/0.68 # Preprocessing class: FMLLSMSLSSSNFFN.
% 1.13/0.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.13/0.68 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 1.13/0.68 # Starting new_bool_3 with 300s (1) cores
% 1.13/0.68 # Starting new_bool_1 with 300s (1) cores
% 1.13/0.68 # Starting sh5l with 300s (1) cores
% 1.13/0.68 # G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with pid 21729 completed with status 0
% 1.13/0.68 # Result found by G-E--_208_B07_F1_AE_CS_SP_PS_S0Y
% 1.13/0.68 # Preprocessing class: FMLLSMSLSSSNFFN.
% 1.13/0.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.13/0.68 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 1.13/0.68 # SinE strategy is gf600_h_gu_R05_F100_L20000
% 1.13/0.68 # Search class: FGHSF-SSLM00-SFFFFFNN
% 1.13/0.68 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.13/0.68 # Starting new_ho_10 with 271s (1) cores
% 1.13/0.68 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 151s (1) cores
% 1.13/0.68 # Starting ho_unfolding_3 with 271s (1) cores
% 1.13/0.68 # Starting new_ho_10_cnf2 with 271s (1) cores
% 1.13/0.68 # Starting pre_casc_2 with 271s (1) cores
% 1.13/0.68 # new_ho_10 with pid 21740 completed with status 0
% 1.13/0.68 # Result found by new_ho_10
% 1.13/0.68 # Preprocessing class: FMLLSMSLSSSNFFN.
% 1.13/0.68 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 1.13/0.68 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 1.13/0.68 # SinE strategy is gf600_h_gu_R05_F100_L20000
% 1.13/0.68 # Search class: FGHSF-SSLM00-SFFFFFNN
% 1.13/0.68 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 1.13/0.68 # Starting new_ho_10 with 271s (1) cores
% 1.13/0.68 # Preprocessing time : 0.011 s
% 1.13/0.68 # Presaturation interreduction done
% 1.13/0.68
% 1.13/0.68 # Proof found!
% 1.13/0.68 # SZS status Theorem
% 1.13/0.68 # SZS output start CNFRefutation
% See solution above
% 1.13/0.68 # Parsed axioms : 2266
% 1.13/0.68 # Removed by relevancy pruning/SinE : 1958
% 1.13/0.68 # Initial clauses : 1240
% 1.13/0.68 # Removed in clause preprocessing : 25
% 1.13/0.68 # Initial clauses in saturation : 1215
% 1.13/0.68 # Processed clauses : 1748
% 1.13/0.68 # ...of these trivial : 2
% 1.13/0.68 # ...subsumed : 6
% 1.13/0.68 # ...remaining for further processing : 1740
% 1.13/0.68 # Other redundant clauses eliminated : 164
% 1.13/0.68 # Clauses deleted for lack of memory : 0
% 1.13/0.68 # Backward-subsumed : 6
% 1.13/0.68 # Backward-rewritten : 3
% 1.13/0.68 # Generated clauses : 254
% 1.13/0.68 # ...of the previous two non-redundant : 199
% 1.13/0.68 # ...aggressively subsumed : 0
% 1.13/0.68 # Contextual simplify-reflections : 10
% 1.13/0.68 # Paramodulations : 90
% 1.13/0.68 # Factorizations : 0
% 1.13/0.68 # NegExts : 0
% 1.13/0.68 # Equation resolutions : 164
% 1.13/0.68 # Disequality decompositions : 0
% 1.13/0.68 # Total rewrite steps : 49
% 1.13/0.68 # ...of those cached : 23
% 1.13/0.68 # Propositional unsat checks : 0
% 1.13/0.68 # Propositional check models : 0
% 1.13/0.68 # Propositional check unsatisfiable : 0
% 1.13/0.68 # Propositional clauses : 0
% 1.13/0.68 # Propositional clauses after purity: 0
% 1.13/0.68 # Propositional unsat core size : 0
% 1.13/0.68 # Propositional preprocessing time : 0.000
% 1.13/0.68 # Propositional encoding time : 0.000
% 1.13/0.68 # Propositional solver time : 0.000
% 1.13/0.68 # Success case prop preproc time : 0.000
% 1.13/0.68 # Success case prop encoding time : 0.000
% 1.13/0.68 # Success case prop solver time : 0.000
% 1.13/0.68 # Current number of processed clauses : 362
% 1.13/0.68 # Positive orientable unit clauses : 142
% 1.13/0.68 # Positive unorientable unit clauses: 0
% 1.13/0.68 # Negative unit clauses : 75
% 1.13/0.68 # Non-unit-clauses : 145
% 1.13/0.68 # Current number of unprocessed clauses: 870
% 1.13/0.68 # ...number of literals in the above : 2428
% 1.13/0.68 # Current number of archived formulas : 0
% 1.13/0.68 # Current number of archived clauses : 1214
% 1.13/0.68 # Clause-clause subsumption calls (NU) : 162790
% 1.13/0.68 # Rec. Clause-clause subsumption calls : 132157
% 1.13/0.68 # Non-unit clause-clause subsumptions : 10
% 1.13/0.68 # Unit Clause-clause subsumption calls : 6379
% 1.13/0.68 # Rewrite failures with RHS unbound : 0
% 1.13/0.68 # BW rewrite match attempts : 4
% 1.13/0.68 # BW rewrite match successes : 4
% 1.13/0.68 # Condensation attempts : 1750
% 1.13/0.68 # Condensation successes : 0
% 1.13/0.68 # Termbank termtop insertions : 79847
% 1.13/0.68 # Search garbage collected termcells : 17277
% 1.13/0.68
% 1.13/0.68 # -------------------------------------------------
% 1.13/0.68 # User time : 0.146 s
% 1.13/0.68 # System time : 0.019 s
% 1.13/0.68 # Total time : 0.165 s
% 1.13/0.68 # Maximum resident set size: 7300 pages
% 1.13/0.68
% 1.13/0.68 # -------------------------------------------------
% 1.13/0.68 # User time : 0.618 s
% 1.13/0.68 # System time : 0.053 s
% 1.13/0.68 # Total time : 0.671 s
% 1.13/0.68 # Maximum resident set size: 3404 pages
% 1.13/0.68 % E---3.1 exiting
% 1.13/0.68 % E exiting
%------------------------------------------------------------------------------