TSTP Solution File: HWV089_1 by E-SAT---3.1
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1
% Problem : HWV089_1 : TPTP v8.1.2. Bugfixed v6.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.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:58:37 EDT 2023
% Result : Theorem 6.90s 2.56s
% Output : CNFRefutation 6.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 26
% Syntax : Number of formulae : 55 ( 9 unt; 15 typ; 0 def)
% Number of atoms : 104 ( 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_44,type,
bitIndex5: bitindex_type ).
tff(decl_45,type,
bitIndex0: bitindex_type ).
tff(decl_46,type,
bitIndex1: bitindex_type ).
tff(decl_2748,type,
v3684: ( state_type * bitindex_type ) > $o ).
tff(decl_2758,type,
v3682: state_type > $o ).
tff(decl_2759,type,
v3680: state_type > $o ).
tff(decl_2760,type,
v3679: ( state_type * bitindex_type ) > $o ).
tff(decl_2761,type,
v3678: state_type > $o ).
tff(decl_2762,type,
v3677: state_type > $o ).
tff(decl_2763,type,
v3693: state_type > $o ).
tff(decl_2764,type,
v3675: state_type > $o ).
tff(decl_2765,type,
v3674: state_type > $o ).
tff(decl_2766,type,
v4: state_type > $o ).
tff(decl_2767,type,
reachableState: state_type > $o ).
tff(decl_2786,type,
esk1_0: state_type ).
tff(writeUnaryOperator_345,axiom,
! [X2: state_type] :
( ~ v3677(X2)
<=> v3678(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.P06GsEAYcO/E---3.1_23651.p',writeUnaryOperator_345) ).
tff(writeUnaryOperator_347,axiom,
! [X2: state_type] :
( ~ v4(X2)
<=> v3674(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.P06GsEAYcO/E---3.1_23651.p',writeUnaryOperator_347) ).
tff(writeUnaryOperator_346,axiom,
! [X2: state_type] :
( ~ v3674(X2)
<=> v3675(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.P06GsEAYcO/E---3.1_23651.p',writeUnaryOperator_346) ).
tff(addZeroExtensionConstraint_5,axiom,
! [X2: state_type] : ~ v3684(X2,bitIndex5),
file('/export/starexec/sandbox2/tmp/tmp.P06GsEAYcO/E---3.1_23651.p',addZeroExtensionConstraint_5) ).
tff(addAssertion,conjecture,
! [X2: state_type] :
( reachableState(X2)
=> v4(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.P06GsEAYcO/E---3.1_23651.p',addAssertion) ).
tff(addAssignment_2618,axiom,
! [X2: state_type] :
( v3679(X2,bitIndex1)
<=> $true ),
file('/export/starexec/sandbox2/tmp/tmp.P06GsEAYcO/E---3.1_23651.p',addAssignment_2618) ).
tff(writeBinaryOperatorShiftedRanges_555,axiom,
! [X2: state_type] :
( v3693(X2)
<=> ( v3679(X2,bitIndex0)
| v3679(X2,bitIndex1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.P06GsEAYcO/E---3.1_23651.p',writeBinaryOperatorShiftedRanges_555) ).
tff(addAssignment_2619,axiom,
! [X2: state_type] :
( v3679(X2,bitIndex0)
<=> v3680(X2) ),
file('/export/starexec/sandbox2/tmp/tmp.P06GsEAYcO/E---3.1_23651.p',addAssignment_2619) ).
tff(writeBinaryOperatorShiftedRanges_554,axiom,
! [X2: state_type] :
( v3678(X2)
<=> ( v3679(X2,bitIndex0)
& v3679(X2,bitIndex1) ) ),
file('/export/starexec/sandbox2/tmp/tmp.P06GsEAYcO/E---3.1_23651.p',writeBinaryOperatorShiftedRanges_554) ).
tff(writeBinaryOperatorShiftedRanges_553,axiom,
! [X2: state_type] :
( v3680(X2)
<=> ( v3682(X2)
& v3684(X2,bitIndex5) ) ),
file('/export/starexec/sandbox2/tmp/tmp.P06GsEAYcO/E---3.1_23651.p',writeBinaryOperatorShiftedRanges_553) ).
tff(writeBinaryOperatorEqualRangesSingleBits_740,axiom,
! [X2: state_type] :
( v3675(X2)
<=> ( v3677(X2)
& v3693(X2) ) ),
file('/export/starexec/sandbox2/tmp/tmp.P06GsEAYcO/E---3.1_23651.p',writeBinaryOperatorEqualRangesSingleBits_740) ).
tff(c_0_11,plain,
! [X2: state_type] :
( ~ v3677(X2)
<=> v3678(X2) ),
inference(fof_simplification,[status(thm)],[writeUnaryOperator_345]) ).
tff(c_0_12,plain,
! [X2: state_type] :
( ~ v4(X2)
<=> v3674(X2) ),
inference(fof_simplification,[status(thm)],[writeUnaryOperator_347]) ).
tff(c_0_13,plain,
! [X2: state_type] :
( ~ v3674(X2)
<=> v3675(X2) ),
inference(fof_simplification,[status(thm)],[writeUnaryOperator_346]) ).
tff(c_0_14,plain,
! [X2: state_type] : ~ v3684(X2,bitIndex5),
inference(fof_simplification,[status(thm)],[addZeroExtensionConstraint_5]) ).
tff(c_0_15,negated_conjecture,
~ ! [X2: state_type] :
( reachableState(X2)
=> v4(X2) ),
inference(assume_negation,[status(cth)],[addAssertion]) ).
tff(c_0_16,plain,
! [X2: state_type] : v3679(X2,bitIndex1),
inference(fof_simplification,[status(thm)],[addAssignment_2618]) ).
tff(c_0_17,plain,
! [X123: state_type] :
( ( ~ v3693(X123)
| v3679(X123,bitIndex0)
| v3679(X123,bitIndex1) )
& ( ~ v3679(X123,bitIndex0)
| v3693(X123) )
& ( ~ v3679(X123,bitIndex1)
| v3693(X123) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[writeBinaryOperatorShiftedRanges_555])])]) ).
tff(c_0_18,plain,
! [X126: state_type] :
( ( ~ v3679(X126,bitIndex0)
| v3680(X126) )
& ( ~ v3680(X126)
| v3679(X126,bitIndex0) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[addAssignment_2619])]) ).
tff(c_0_19,plain,
! [X125: state_type] :
( ( v3679(X125,bitIndex0)
| ~ v3678(X125) )
& ( v3679(X125,bitIndex1)
| ~ v3678(X125) )
& ( ~ v3679(X125,bitIndex0)
| ~ v3679(X125,bitIndex1)
| v3678(X125) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[writeBinaryOperatorShiftedRanges_554])])]) ).
tff(c_0_20,plain,
! [X128: state_type] :
( ( v3682(X128)
| ~ v3680(X128) )
& ( v3684(X128,bitIndex5)
| ~ v3680(X128) )
& ( ~ v3682(X128)
| ~ v3684(X128,bitIndex5)
| v3680(X128) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[writeBinaryOperatorShiftedRanges_553])])]) ).
tff(c_0_21,plain,
! [X122: state_type] :
( ( v3677(X122)
| ~ v3675(X122) )
& ( v3693(X122)
| ~ v3675(X122) )
& ( ~ v3677(X122)
| ~ v3693(X122)
| v3675(X122) ) ),
inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[writeBinaryOperatorEqualRangesSingleBits_740])])]) ).
tff(c_0_22,plain,
! [X124: state_type] :
( ( v3677(X124)
| v3678(X124) )
& ( ~ v3678(X124)
| ~ v3677(X124) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])]) ).
tff(c_0_23,plain,
! [X120: state_type] :
( ( v4(X120)
| v3674(X120) )
& ( ~ v3674(X120)
| ~ v4(X120) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])]) ).
tff(c_0_24,plain,
! [X121: state_type] :
( ( v3674(X121)
| v3675(X121) )
& ( ~ v3675(X121)
| ~ v3674(X121) ) ),
inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])]) ).
tff(c_0_25,plain,
! [X141: state_type] : ~ v3684(X141,bitIndex5),
inference(variable_rename,[status(thm)],[c_0_14]) ).
tff(c_0_26,negated_conjecture,
( reachableState(esk1_0)
& ~ v4(esk1_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])]) ).
tff(c_0_27,plain,
! [X127: state_type] : v3679(X127,bitIndex1),
inference(variable_rename,[status(thm)],[c_0_16]) ).
tcf(c_0_28,plain,
! [X1: state_type] :
( v3693(X1)
| ~ v3679(X1,bitIndex1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
tcf(c_0_29,plain,
! [X1: state_type] :
( v3680(X1)
| ~ v3679(X1,bitIndex0) ),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
tcf(c_0_30,plain,
! [X1: state_type] :
( v3679(X1,bitIndex0)
| ~ v3678(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
tcf(c_0_31,plain,
! [X1: state_type] :
( v3684(X1,bitIndex5)
| ~ v3680(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
tcf(c_0_32,plain,
! [X1: state_type] :
( v3675(X1)
| ~ v3677(X1)
| ~ v3693(X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
tcf(c_0_33,plain,
! [X1: state_type] :
( v3677(X1)
| v3678(X1) ),
inference(split_conjunct,[status(thm)],[c_0_22]) ).
tcf(c_0_34,plain,
! [X1: state_type] :
( v4(X1)
| v3674(X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
tcf(c_0_35,plain,
! [X1: state_type] :
( ~ v3675(X1)
| ~ v3674(X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
tcf(c_0_36,plain,
! [X1: state_type] : ~ v3684(X1,bitIndex5),
inference(split_conjunct,[status(thm)],[c_0_25]) ).
tcf(c_0_37,negated_conjecture,
~ v4(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
tcf(c_0_38,plain,
! [X1: state_type] : v3679(X1,bitIndex1),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_39,plain,
$false,
inference(cdclpropres,[status(thm)],[c_0_28,c_0_29,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]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : HWV089_1 : TPTP v8.1.2. Bugfixed v6.2.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n004.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 : 2400
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Tue Oct 3 05:13:15 EDT 2023
% 0.13/0.35 % CPUTime :
% 1.12/1.43 Running first-order model finding
% 1.12/1.43 Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.P06GsEAYcO/E---3.1_23651.p
% 6.90/2.56 # Version: 3.1pre001
% 6.90/2.56 # Preprocessing class: FMLLMMSLSSSNFFN.
% 6.90/2.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.90/2.56 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 1500s (5) cores
% 6.90/2.56 # Starting new_bool_3 with 300s (1) cores
% 6.90/2.56 # Starting new_bool_1 with 300s (1) cores
% 6.90/2.56 # Starting sh5l with 300s (1) cores
% 6.90/2.56 # G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with pid 23730 completed with status 0
% 6.90/2.56 # Result found by G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y
% 6.90/2.56 # Preprocessing class: FMLLMMSLSSSNFFN.
% 6.90/2.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.90/2.56 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 1500s (5) cores
% 6.90/2.56 # No SInE strategy applied
% 6.90/2.56 # Search class: FGHSM-SMLM00-SFFFFFNN
% 6.90/2.56 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 6.90/2.56 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 290s (1) cores
% 6.90/2.56 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 151s (1) cores
% 6.90/2.56 # Starting new_bool_1 with 290s (1) cores
% 6.90/2.56 # Starting sh5l with 290s (1) cores
% 6.90/2.56 # Starting SAT001_MinMin_p005000_rr_RG with 193s (1) cores
% 6.90/2.56 # SAT001_MinMin_p005000_rr_RG with pid 23759 completed with status 0
% 6.90/2.56 # Result found by SAT001_MinMin_p005000_rr_RG
% 6.90/2.56 # Preprocessing class: FMLLMMSLSSSNFFN.
% 6.90/2.56 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 6.90/2.56 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 1500s (5) cores
% 6.90/2.56 # No SInE strategy applied
% 6.90/2.56 # Search class: FGHSM-SMLM00-SFFFFFNN
% 6.90/2.56 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 6.90/2.56 # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 290s (1) cores
% 6.90/2.56 # Starting G-E--_301_C18_F1_URBAN_S5PRR_RG_S0Y with 151s (1) cores
% 6.90/2.56 # Starting new_bool_1 with 290s (1) cores
% 6.90/2.56 # Starting sh5l with 290s (1) cores
% 6.90/2.56 # Starting SAT001_MinMin_p005000_rr_RG with 193s (1) cores
% 6.90/2.56 # Preprocessing time : 0.087 s
% 6.90/2.56 # SatCheck found unsatisfiable ground set
% 6.90/2.56 # Presaturation interreduction done
% 6.90/2.56
% 6.90/2.56 # Proof found!
% 6.90/2.56 # SZS status Theorem
% 6.90/2.56 # SZS output start CNFRefutation
% See solution above
% 6.90/2.56 # Parsed axioms : 9041
% 6.90/2.56 # Removed by relevancy pruning/SinE : 0
% 6.90/2.56 # Initial clauses : 17498
% 6.90/2.56 # Removed in clause preprocessing : 2755
% 6.90/2.56 # Initial clauses in saturation : 14743
% 6.90/2.56 # Processed clauses : 5076
% 6.90/2.56 # ...of these trivial : 27
% 6.90/2.56 # ...subsumed : 49
% 6.90/2.56 # ...remaining for further processing : 5000
% 6.90/2.56 # Other redundant clauses eliminated : 369
% 6.90/2.56 # Clauses deleted for lack of memory : 0
% 6.90/2.56 # Backward-subsumed : 27
% 6.90/2.56 # Backward-rewritten : 8
% 6.90/2.56 # Generated clauses : 370
% 6.90/2.56 # ...of the previous two non-redundant : 378
% 6.90/2.56 # ...aggressively subsumed : 0
% 6.90/2.56 # Contextual simplify-reflections : 6
% 6.90/2.56 # Paramodulations : 0
% 6.90/2.56 # Factorizations : 0
% 6.90/2.56 # NegExts : 0
% 6.90/2.56 # Equation resolutions : 369
% 6.90/2.56 # Total rewrite steps : 37
% 6.90/2.56 # Propositional unsat checks : 1
% 6.90/2.56 # Propositional check models : 0
% 6.90/2.56 # Propositional check unsatisfiable : 1
% 6.90/2.56 # Propositional clauses : 14640
% 6.90/2.56 # Propositional clauses after purity: 11790
% 6.90/2.56 # Propositional unsat core size : 11
% 6.90/2.56 # Propositional preprocessing time : 0.000
% 6.90/2.56 # Propositional encoding time : 0.019
% 6.90/2.56 # Propositional solver time : 0.006
% 6.90/2.56 # Success case prop preproc time : 0.000
% 6.90/2.56 # Success case prop encoding time : 0.019
% 6.90/2.56 # Success case prop solver time : 0.006
% 6.90/2.56 # Current number of processed clauses : 4595
% 6.90/2.56 # Positive orientable unit clauses : 786
% 6.90/2.56 # Positive unorientable unit clauses: 0
% 6.90/2.56 # Negative unit clauses : 719
% 6.90/2.56 # Non-unit-clauses : 3090
% 6.90/2.56 # Current number of unprocessed clauses: 10045
% 6.90/2.56 # ...number of literals in the above : 24660
% 6.90/2.56 # Current number of archived formulas : 0
% 6.90/2.56 # Current number of archived clauses : 38
% 6.90/2.56 # Clause-clause subsumption calls (NU) : 2730291
% 6.90/2.56 # Rec. Clause-clause subsumption calls : 2365438
% 6.90/2.56 # Non-unit clause-clause subsumptions : 6
% 6.90/2.56 # Unit Clause-clause subsumption calls : 189380
% 6.90/2.56 # Rewrite failures with RHS unbound : 0
% 6.90/2.56 # BW rewrite match attempts : 14
% 6.90/2.56 # BW rewrite match successes : 14
% 6.90/2.56 # Condensation attempts : 0
% 6.90/2.56 # Condensation successes : 0
% 6.90/2.56 # Termbank termtop insertions : 662262
% 6.90/2.56
% 6.90/2.56 # -------------------------------------------------
% 6.90/2.56 # User time : 0.866 s
% 6.90/2.56 # System time : 0.067 s
% 6.90/2.56 # Total time : 0.933 s
% 6.90/2.56 # Maximum resident set size: 36472 pages
% 6.90/2.56
% 6.90/2.56 # -------------------------------------------------
% 6.90/2.56 # User time : 2.897 s
% 6.90/2.56 # System time : 0.196 s
% 6.90/2.56 # Total time : 3.092 s
% 6.90/2.56 # Maximum resident set size: 8220 pages
% 6.90/2.56 % E---3.1 exiting
%------------------------------------------------------------------------------