TSTP Solution File: HWV090_1 by E---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1
% Problem : HWV090_1 : TPTP v8.1.2. Bugfixed v6.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n002.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 : 2400s
% WCLimit : 300s
% DateTime : Tue Oct 10 17:54:40 EDT 2023
% Result : Theorem 139.80s 88.06s
% Output : CNFRefutation 139.80s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 26
% Syntax : Number of formulae : 56 ( 10 unt; 15 typ; 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 types : 1 ( 0 usr)
% Number of type conns : 13 ( 11 >; 2 *; 0 +; 0 <<)
% Number of predicates : 15 ( 13 usr; 4 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 4 con; 0-0 aty)
% Number of variables : 37 ( 0 sgn; 37 !; 0 ?; 37 :)
% Comments :
%------------------------------------------------------------------------------
tff(decl_43,type,
bitIndex5: bitindex_type ).
tff(decl_44,type,
bitIndex0: bitindex_type ).
tff(decl_45,type,
bitIndex1: bitindex_type ).
tff(decl_23809,type,
v30860: ( state_type * bitindex_type ) > $o ).
tff(decl_23819,type,
v30858: state_type > $o ).
tff(decl_23820,type,
v30856: state_type > $o ).
tff(decl_23821,type,
v30855: ( state_type * bitindex_type ) > $o ).
tff(decl_23822,type,
v30854: state_type > $o ).
tff(decl_23823,type,
v30853: state_type > $o ).
tff(decl_23824,type,
v30869: state_type > $o ).
tff(decl_23825,type,
v30851: state_type > $o ).
tff(decl_23826,type,
v30850: state_type > $o ).
tff(decl_23827,type,
v4: state_type > $o ).
tff(decl_23828,type,
reachableState: state_type > $o ).
tff(decl_24489,type,
esk1_0: state_type ).
tff(addAssertion,conjecture,
! [X2: state_type] :
( reachableState(X2)
=> v4(X2) ),
file('/export/starexec/sandbox/tmp/tmp.CG0XL4c6bS/E---3.1_22858.p',addAssertion) ).
tff(writeUnaryOperator_3140,axiom,
! [X2: state_type] :
( ~ v4(X2)
<=> v30850(X2) ),
file('/export/starexec/sandbox/tmp/tmp.CG0XL4c6bS/E---3.1_22858.p',writeUnaryOperator_3140) ).
tff(addZeroExtensionConstraint_11,axiom,
! [X2: state_type] : ~ v30860(X2,bitIndex5),
file('/export/starexec/sandbox/tmp/tmp.CG0XL4c6bS/E---3.1_22858.p',addZeroExtensionConstraint_11) ).
tff(writeUnaryOperator_3139,axiom,
! [X2: state_type] :
( ~ v30850(X2)
<=> v30851(X2) ),
file('/export/starexec/sandbox/tmp/tmp.CG0XL4c6bS/E---3.1_22858.p',writeUnaryOperator_3139) ).
tff(addAssignment_9321,axiom,
! [X2: state_type] :
( v30855(X2,bitIndex1)
<=> $true ),
file('/export/starexec/sandbox/tmp/tmp.CG0XL4c6bS/E---3.1_22858.p',addAssignment_9321) ).
tff(writeUnaryOperator_3138,axiom,
! [X2: state_type] :
( ~ v30853(X2)
<=> v30854(X2) ),
file('/export/starexec/sandbox/tmp/tmp.CG0XL4c6bS/E---3.1_22858.p',writeUnaryOperator_3138) ).
tff(writeBinaryOperatorShiftedRanges_1723,axiom,
! [X2: state_type] :
( v30869(X2)
<=> ( v30855(X2,bitIndex0)
| v30855(X2,bitIndex1) ) ),
file('/export/starexec/sandbox/tmp/tmp.CG0XL4c6bS/E---3.1_22858.p',writeBinaryOperatorShiftedRanges_1723) ).
tff(addAssignment_9322,axiom,
! [X2: state_type] :
( v30855(X2,bitIndex0)
<=> v30856(X2) ),
file('/export/starexec/sandbox/tmp/tmp.CG0XL4c6bS/E---3.1_22858.p',addAssignment_9322) ).
tff(writeBinaryOperatorShiftedRanges_1722,axiom,
! [X2: state_type] :
( v30854(X2)
<=> ( v30855(X2,bitIndex0)
& v30855(X2,bitIndex1) ) ),
file('/export/starexec/sandbox/tmp/tmp.CG0XL4c6bS/E---3.1_22858.p',writeBinaryOperatorShiftedRanges_1722) ).
tff(writeBinaryOperatorShiftedRanges_1721,axiom,
! [X2: state_type] :
( v30856(X2)
<=> ( v30858(X2)
& v30860(X2,bitIndex5) ) ),
file('/export/starexec/sandbox/tmp/tmp.CG0XL4c6bS/E---3.1_22858.p',writeBinaryOperatorShiftedRanges_1721) ).
tff(writeBinaryOperatorEqualRangesSingleBits_6728,axiom,
! [X2: state_type] :
( v30851(X2)
<=> ( v30853(X2)
& v30869(X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.CG0XL4c6bS/E---3.1_22858.p',writeBinaryOperatorEqualRangesSingleBits_6728) ).
tff(c_0_11,negated_conjecture,
~ ! [X2: state_type] :
( reachableState(X2)
=> v4(X2) ),
inference(assume_negation,[status(cth)],[addAssertion]) ).
tff(c_0_12,plain,
! [X2: state_type] :
( ~ v4(X2)
<=> v30850(X2) ),
inference(fof_simplification,[status(thm)],[writeUnaryOperator_3140]) ).
tff(c_0_13,plain,
! [X2: state_type] : ~ v30860(X2,bitIndex5),
inference(fof_simplification,[status(thm)],[addZeroExtensionConstraint_11]) ).
tff(c_0_14,plain,
! [X2: state_type] :
( ~ v30850(X2)
<=> v30851(X2) ),
inference(fof_simplification,[status(thm)],[writeUnaryOperator_3139]) ).
tff(c_0_15,plain,
! [X2: state_type] : v30855(X2,bitIndex1),
inference(fof_simplification,[status(thm)],[addAssignment_9321]) ).
tff(c_0_16,plain,
! [X2: state_type] :
( ~ v30853(X2)
<=> v30854(X2) ),
inference(fof_simplification,[status(thm)],[writeUnaryOperator_3138]) ).
tff(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])])]) ).
tff(c_0_18,plain,
! [X152: state_type] :
( ( v4(X152)
| v30850(X152) )
& ( ~ v30850(X152)
| ~ v4(X152) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])]) ).
tff(c_0_19,plain,
! [X155: state_type] :
( ( ~ v30869(X155)
| v30855(X155,bitIndex0)
| v30855(X155,bitIndex1) )
& ( ~ v30855(X155,bitIndex0)
| v30869(X155) )
& ( ~ v30855(X155,bitIndex1)
| v30869(X155) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[writeBinaryOperatorShiftedRanges_1723])])]) ).
tff(c_0_20,plain,
! [X158: state_type] :
( ( ~ v30855(X158,bitIndex0)
| v30856(X158) )
& ( ~ v30856(X158)
| v30855(X158,bitIndex0) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[addAssignment_9322])]) ).
tff(c_0_21,plain,
! [X173: state_type] : ~ v30860(X173,bitIndex5),
inference(variable_rename,[status(thm)],[c_0_13]) ).
tff(c_0_22,plain,
! [X157: state_type] :
( ( v30855(X157,bitIndex0)
| ~ v30854(X157) )
& ( v30855(X157,bitIndex1)
| ~ v30854(X157) )
& ( ~ v30855(X157,bitIndex0)
| ~ v30855(X157,bitIndex1)
| v30854(X157) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[writeBinaryOperatorShiftedRanges_1722])])]) ).
tff(c_0_23,plain,
! [X160: state_type] :
( ( v30858(X160)
| ~ v30856(X160) )
& ( v30860(X160,bitIndex5)
| ~ v30856(X160) )
& ( ~ v30858(X160)
| ~ v30860(X160,bitIndex5)
| v30856(X160) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[writeBinaryOperatorShiftedRanges_1721])])]) ).
tff(c_0_24,plain,
! [X154: state_type] :
( ( v30853(X154)
| ~ v30851(X154) )
& ( v30869(X154)
| ~ v30851(X154) )
& ( ~ v30853(X154)
| ~ v30869(X154)
| v30851(X154) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[writeBinaryOperatorEqualRangesSingleBits_6728])])]) ).
tff(c_0_25,plain,
! [X153: state_type] :
( ( v30850(X153)
| v30851(X153) )
& ( ~ v30851(X153)
| ~ v30850(X153) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])]) ).
tff(c_0_26,plain,
! [X159: state_type] : v30855(X159,bitIndex1),
inference(variable_rename,[status(thm)],[c_0_15]) ).
tff(c_0_27,plain,
! [X156: state_type] :
( ( v30853(X156)
| v30854(X156) )
& ( ~ v30854(X156)
| ~ v30853(X156) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])]) ).
tcf(c_0_28,negated_conjecture,
~ v4(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
tcf(c_0_29,plain,
! [X1: state_type] :
( v4(X1)
| v30850(X1) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
tcf(c_0_30,plain,
! [X1: state_type] :
( v30869(X1)
| ~ v30855(X1,bitIndex1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
tcf(c_0_31,plain,
! [X1: state_type] :
( v30856(X1)
| ~ v30855(X1,bitIndex0) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
tcf(c_0_32,plain,
! [X1: state_type] : ~ v30860(X1,bitIndex5),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
tcf(c_0_33,plain,
! [X1: state_type] :
( v30855(X1,bitIndex0)
| ~ v30854(X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
tcf(c_0_34,plain,
! [X1: state_type] :
( v30860(X1,bitIndex5)
| ~ v30856(X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
tcf(c_0_35,plain,
! [X1: state_type] :
( v30851(X1)
| ~ v30853(X1)
| ~ v30869(X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
tcf(c_0_36,plain,
! [X1: state_type] :
( ~ v30851(X1)
| ~ v30850(X1) ),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
tcf(c_0_37,plain,
! [X1: state_type] : v30855(X1,bitIndex1),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
tcf(c_0_38,plain,
! [X1: state_type] :
( v30853(X1)
| v30854(X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
tcf(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
% 36.04/36.16 % Problem : HWV090_1 : TPTP v8.1.2. Bugfixed v6.2.0.
% 36.04/36.18 % Command : run_E %s %d THM
% 36.21/36.39 % Computer : n002.cluster.edu
% 36.21/36.39 % Model : x86_64 x86_64
% 36.21/36.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 36.21/36.39 % Memory : 8042.1875MB
% 36.21/36.39 % OS : Linux 3.10.0-693.el7.x86_64
% 36.21/36.39 % CPULimit : 2400
% 36.21/36.39 % WCLimit : 300
% 36.21/36.39 % DateTime : Tue Oct 3 05:20:36 EDT 2023
% 36.21/36.39 % CPUTime :
% 72.93/73.12 Running first-order theorem proving
% 72.93/73.12 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/tmp/tmp.CG0XL4c6bS/E---3.1_22858.p
% 139.80/88.06 # Version: 3.1pre001
% 139.80/88.06 # Preprocessing class: FMLLLMSLSSSNFFN.
% 139.80/88.06 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 139.80/88.06 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 1500s (5) cores
% 139.80/88.06 # Starting new_bool_3 with 300s (1) cores
% 139.80/88.06 # Starting new_bool_1 with 300s (1) cores
% 139.80/88.06 # Starting sh5l with 300s (1) cores
% 139.80/88.06 # G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with pid 22952 completed with status 0
% 139.80/88.06 # Result found by G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN
% 139.80/88.06 # Preprocessing class: FMLLLMSLSSSNFFN.
% 139.80/88.06 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 139.80/88.06 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 1500s (5) cores
% 139.80/88.06 # No SInE strategy applied
% 139.80/88.06 # Search class: FGHSM-MMLM00-SFFFFFNN
% 139.80/88.06 # Scheduled 6 strats onto 5 cores with 1489 seconds (1489 total)
% 139.80/88.06 # Starting G----_0021_C18_F1_SE_CS_SP_S5PRR_S0Y with 805s (1) cores
% 139.80/88.06 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 149s (1) cores
% 139.80/88.06 # Starting new_bool_3 with 135s (1) cores
% 139.80/88.06 # Starting new_bool_1 with 135s (1) cores
% 139.80/88.06 # Starting sh5l with 135s (1) cores
% 139.80/88.06 # G----_0021_C18_F1_SE_CS_SP_S5PRR_S0Y with pid 22960 completed with status 0
% 139.80/88.06 # Result found by G----_0021_C18_F1_SE_CS_SP_S5PRR_S0Y
% 139.80/88.06 # Preprocessing class: FMLLLMSLSSSNFFN.
% 139.80/88.06 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 139.80/88.06 # Starting G-E--_302_C18_F1_URBAN_S5PRR_RG_S04BN with 1500s (5) cores
% 139.80/88.06 # No SInE strategy applied
% 139.80/88.06 # Search class: FGHSM-MMLM00-SFFFFFNN
% 139.80/88.06 # Scheduled 6 strats onto 5 cores with 1489 seconds (1489 total)
% 139.80/88.06 # Starting G----_0021_C18_F1_SE_CS_SP_S5PRR_S0Y with 805s (1) cores
% 139.80/88.06 # Preprocessing time : 1.351 s
% 139.80/88.06 # SatCheck found unsatisfiable ground set
% 139.80/88.06
% 139.80/88.06 # Proof found!
% 139.80/88.06 # SZS status Theorem
% 139.80/88.06 # SZS output start CNFRefutation
% See solution above
% 139.80/88.06 # Parsed axioms : 64314
% 139.80/88.06 # Removed by relevancy pruning/SinE : 0
% 139.80/88.06 # Initial clauses : 143518
% 139.80/88.06 # Removed in clause preprocessing : 23813
% 139.80/88.06 # Initial clauses in saturation : 119705
% 139.80/88.06 # Processed clauses : 5000
% 139.80/88.06 # ...of these trivial : 0
% 139.80/88.06 # ...subsumed : 0
% 139.80/88.06 # ...remaining for further processing : 5000
% 139.80/88.06 # Other redundant clauses eliminated : 0
% 139.80/88.06 # Clauses deleted for lack of memory : 0
% 139.80/88.06 # Backward-subsumed : 0
% 139.80/88.06 # Backward-rewritten : 0
% 139.80/88.06 # Generated clauses : 2
% 139.80/88.06 # ...of the previous two non-redundant : 1
% 139.80/88.06 # ...aggressively subsumed : 0
% 139.80/88.06 # Contextual simplify-reflections : 0
% 139.80/88.06 # Paramodulations : 2
% 139.80/88.06 # Factorizations : 0
% 139.80/88.06 # NegExts : 0
% 139.80/88.06 # Equation resolutions : 0
% 139.80/88.06 # Total rewrite steps : 0
% 139.80/88.06 # Propositional unsat checks : 1
% 139.80/88.06 # Propositional check models : 0
% 139.80/88.06 # Propositional check unsatisfiable : 1
% 139.80/88.06 # Propositional clauses : 119706
% 139.80/88.06 # Propositional clauses after purity: 101925
% 139.80/88.06 # Propositional unsat core size : 10
% 139.80/88.06 # Propositional preprocessing time : 0.000
% 139.80/88.06 # Propositional encoding time : 0.287
% 139.80/88.06 # Propositional solver time : 0.073
% 139.80/88.06 # Success case prop preproc time : 0.000
% 139.80/88.06 # Success case prop encoding time : 0.287
% 139.80/88.06 # Success case prop solver time : 0.073
% 139.80/88.06 # Current number of processed clauses : 5000
% 139.80/88.06 # Positive orientable unit clauses : 2687
% 139.80/88.06 # Positive unorientable unit clauses: 0
% 139.80/88.06 # Negative unit clauses : 2309
% 139.80/88.06 # Non-unit-clauses : 4
% 139.80/88.06 # Current number of unprocessed clauses: 114706
% 139.80/88.06 # ...number of literals in the above : 412953
% 139.80/88.06 # Current number of archived formulas : 0
% 139.80/88.06 # Current number of archived clauses : 0
% 139.80/88.06 # Clause-clause subsumption calls (NU) : 4
% 139.80/88.06 # Rec. Clause-clause subsumption calls : 4
% 139.80/88.06 # Non-unit clause-clause subsumptions : 0
% 139.80/88.06 # Unit Clause-clause subsumption calls : 2432183
% 139.80/88.06 # Rewrite failures with RHS unbound : 0
% 139.80/88.06 # BW rewrite match attempts : 0
% 139.80/88.06 # BW rewrite match successes : 0
% 139.80/88.06 # Condensation attempts : 0
% 139.80/88.06 # Condensation successes : 0
% 139.80/88.06 # Termbank termtop insertions : 6167808
% 139.80/88.06
% 139.80/88.06 # -------------------------------------------------
% 139.80/88.06 # User time : 13.331 s
% 139.80/88.06 # System time : 0.625 s
% 139.80/88.06 # Total time : 13.956 s
% 139.80/88.06 # Maximum resident set size: 299708 pages
% 139.80/88.06
% 139.80/88.06 # -------------------------------------------------
% 139.80/88.06 # User time : 22.970 s
% 139.80/88.06 # System time : 1.393 s
% 139.80/88.06 # Total time : 24.363 s
% 139.80/88.06 # Maximum resident set size: 50544 pages
% 139.80/88.06 % E---3.1 exiting
% 139.80/88.07 % E---3.1 exiting
%------------------------------------------------------------------------------