TSTP Solution File: HWV095+1 by E-SAT---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E-SAT---3.1.00
% Problem : HWV095+1 : TPTP v8.1.2. Released v6.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n024.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 : Sat May 4 08:05:57 EDT 2024
% Result : Theorem 5.10s 1.28s
% Output : CNFRefutation 5.10s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 11
% Syntax : Number of formulae : 49 ( 14 unt; 0 def)
% Number of atoms : 119 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 121 ( 51 ~; 39 |; 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 : 44 ( 8 sgn 26 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(addAssignment_244,axiom,
! [X2] :
( v1000(X2,bitIndex1)
<=> $true ),
file('/export/starexec/sandbox/tmp/tmp.MZUgxqdIVA/E---3.1_3286.p',addAssignment_244) ).
fof(addZeroExtensionConstraint_3,axiom,
! [X2] : ~ v1007(X2,bitIndex5),
file('/export/starexec/sandbox/tmp/tmp.MZUgxqdIVA/E---3.1_3286.p',addZeroExtensionConstraint_3) ).
fof(writeBinaryOperatorShiftedRanges_80,axiom,
! [X2] :
( v1010(X2)
<=> ( v1000(X2,bitIndex0)
| v1000(X2,bitIndex1) ) ),
file('/export/starexec/sandbox/tmp/tmp.MZUgxqdIVA/E---3.1_3286.p',writeBinaryOperatorShiftedRanges_80) ).
fof(writeBinaryOperatorShiftedRanges_78,axiom,
! [X2] :
( v1001(X2)
<=> ( v1003(X2)
& v1007(X2,bitIndex5) ) ),
file('/export/starexec/sandbox/tmp/tmp.MZUgxqdIVA/E---3.1_3286.p',writeBinaryOperatorShiftedRanges_78) ).
fof(addAssertion,conjecture,
! [X2] :
( reachableState(X2)
=> v4(X2) ),
file('/export/starexec/sandbox/tmp/tmp.MZUgxqdIVA/E---3.1_3286.p',addAssertion) ).
fof(writeUnaryOperator_113,axiom,
! [X2] :
( ~ v4(X2)
<=> v995(X2) ),
file('/export/starexec/sandbox/tmp/tmp.MZUgxqdIVA/E---3.1_3286.p',writeUnaryOperator_113) ).
fof(writeBinaryOperatorEqualRangesSingleBits_170,axiom,
! [X2] :
( v996(X2)
<=> ( v998(X2)
& v1010(X2) ) ),
file('/export/starexec/sandbox/tmp/tmp.MZUgxqdIVA/E---3.1_3286.p',writeBinaryOperatorEqualRangesSingleBits_170) ).
fof(writeUnaryOperator_111,axiom,
! [X2] :
( ~ v998(X2)
<=> v999(X2) ),
file('/export/starexec/sandbox/tmp/tmp.MZUgxqdIVA/E---3.1_3286.p',writeUnaryOperator_111) ).
fof(addAssignment_245,axiom,
! [X2] :
( v1000(X2,bitIndex0)
<=> v1001(X2) ),
file('/export/starexec/sandbox/tmp/tmp.MZUgxqdIVA/E---3.1_3286.p',addAssignment_245) ).
fof(writeUnaryOperator_112,axiom,
! [X2] :
( ~ v995(X2)
<=> v996(X2) ),
file('/export/starexec/sandbox/tmp/tmp.MZUgxqdIVA/E---3.1_3286.p',writeUnaryOperator_112) ).
fof(writeBinaryOperatorShiftedRanges_79,axiom,
! [X2] :
( v999(X2)
<=> ( v1000(X2,bitIndex0)
& v1000(X2,bitIndex1) ) ),
file('/export/starexec/sandbox/tmp/tmp.MZUgxqdIVA/E---3.1_3286.p',writeBinaryOperatorShiftedRanges_79) ).
fof(c_0_11,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_12,plain,
! [X2] : ~ v1007(X2,bitIndex5),
inference(fof_simplification,[status(thm)],[addZeroExtensionConstraint_3]) ).
fof(c_0_13,plain,
! [X14] :
( ( ~ v1010(X14)
| v1000(X14,bitIndex0)
| v1000(X14,bitIndex1) )
& ( ~ v1000(X14,bitIndex0)
| v1010(X14) )
& ( ~ v1000(X14,bitIndex1)
| 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_14,plain,
( v1000(X1,bitIndex1)
| $false ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
fof(c_0_15,plain,
! [X19] :
( ( v1003(X19)
| ~ v1001(X19) )
& ( v1007(X19,bitIndex5)
| ~ v1001(X19) )
& ( ~ v1003(X19)
| ~ v1007(X19,bitIndex5)
| v1001(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_16,plain,
! [X27] : ~ v1007(X27,bitIndex5),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_12])]) ).
fof(c_0_17,negated_conjecture,
~ ! [X2] :
( reachableState(X2)
=> v4(X2) ),
inference(assume_negation,[status(cth)],[addAssertion]) ).
fof(c_0_18,plain,
! [X2] :
( ~ v4(X2)
<=> v995(X2) ),
inference(fof_simplification,[status(thm)],[writeUnaryOperator_113]) ).
fof(c_0_19,plain,
! [X13] :
( ( 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])])])]) ).
cnf(c_0_20,plain,
( v1010(X1)
| ~ v1000(X1,bitIndex1) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_21,plain,
v1000(X1,bitIndex1),
inference(cn,[status(thm)],[c_0_14]) ).
fof(c_0_22,plain,
! [X2] :
( ~ v998(X2)
<=> v999(X2) ),
inference(fof_simplification,[status(thm)],[writeUnaryOperator_111]) ).
fof(c_0_23,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_24,plain,
( v1007(X1,bitIndex5)
| ~ v1001(X1) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_25,plain,
~ v1007(X1,bitIndex5),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
fof(c_0_26,plain,
! [X2] :
( ~ v995(X2)
<=> v996(X2) ),
inference(fof_simplification,[status(thm)],[writeUnaryOperator_112]) ).
fof(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_17])])])]) ).
fof(c_0_28,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_18])])]) ).
cnf(c_0_29,plain,
( v996(X1)
| ~ v998(X1)
| ~ v1010(X1) ),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_30,plain,
v1010(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21])]) ).
fof(c_0_31,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_22])])]) ).
fof(c_0_32,plain,
! [X16] :
( ( v1000(X16,bitIndex0)
| ~ v999(X16) )
& ( v1000(X16,bitIndex1)
| ~ v999(X16) )
& ( ~ v1000(X16,bitIndex0)
| ~ v1000(X16,bitIndex1)
| v999(X16) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[writeBinaryOperatorShiftedRanges_79])])])]) ).
cnf(c_0_33,plain,
( v1001(X1)
| ~ v1000(X1,bitIndex0) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_34,plain,
~ v1001(X1),
inference(sr,[status(thm)],[c_0_24,c_0_25]) ).
fof(c_0_35,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_26])])]) ).
cnf(c_0_36,negated_conjecture,
~ v4(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_37,plain,
( v4(X1)
| v995(X1) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_38,plain,
( v996(X1)
| ~ v998(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_30])]) ).
cnf(c_0_39,plain,
( v998(X1)
| v999(X1) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_40,plain,
( v1000(X1,bitIndex0)
| ~ v999(X1) ),
inference(split_conjunct,[status(thm)],[c_0_32]) ).
cnf(c_0_41,plain,
~ v1000(X1,bitIndex0),
inference(sr,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_42,plain,
( ~ v996(X1)
| ~ v995(X1) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_43,negated_conjecture,
v995(esk1_0),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_44,plain,
( v999(X1)
| v996(X1) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_45,plain,
~ v999(X1),
inference(sr,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_46,negated_conjecture,
~ v996(esk1_0),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_47,plain,
v996(X1),
inference(sr,[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.03/0.12 % Problem : HWV095+1 : TPTP v8.1.2. Released v6.1.0.
% 0.03/0.13 % Command : run_E %s %d THM
% 0.13/0.34 % Computer : n024.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Fri May 3 17:55:53 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.39/0.57 Running first-order model finding
% 0.39/0.57 Running: /export/starexec/sandbox/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/sandbox/tmp/tmp.MZUgxqdIVA/E---3.1_3286.p
% 5.10/1.28 # Version: 3.1.0
% 5.10/1.28 # Preprocessing class: FMLLSMSLSSSNFFN.
% 5.10/1.28 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.10/1.28 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 5.10/1.28 # Starting new_bool_3 with 300s (1) cores
% 5.10/1.28 # Starting new_bool_1 with 300s (1) cores
% 5.10/1.28 # Starting sh5l with 300s (1) cores
% 5.10/1.28 # G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with pid 3363 completed with status 0
% 5.10/1.28 # Result found by G-E--_208_B07_F1_AE_CS_SP_PS_S0Y
% 5.10/1.28 # Preprocessing class: FMLLSMSLSSSNFFN.
% 5.10/1.28 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.10/1.28 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 5.10/1.28 # No SInE strategy applied
% 5.10/1.28 # Search class: FGHSS-SMLM00-SFFFFFNN
% 5.10/1.28 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 5.10/1.28 # Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 290s (1) cores
% 5.10/1.28 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 151s (1) cores
% 5.10/1.28 # Starting new_bool_3 with 266s (1) cores
% 5.10/1.28 # Starting new_bool_1 with 266s (1) cores
% 5.10/1.28 # Starting sh5l with 266s (1) cores
% 5.10/1.28 # G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with pid 3374 completed with status 0
% 5.10/1.28 # Result found by G-E--_300_C18_F1_SE_CS_SP_PS_S0Y
% 5.10/1.28 # Preprocessing class: FMLLSMSLSSSNFFN.
% 5.10/1.28 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 5.10/1.28 # Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 5.10/1.28 # No SInE strategy applied
% 5.10/1.28 # Search class: FGHSS-SMLM00-SFFFFFNN
% 5.10/1.28 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 5.10/1.28 # Starting G-E--_300_C18_F1_SE_CS_SP_PS_S0Y with 290s (1) cores
% 5.10/1.28 # Preprocessing time : 0.030 s
% 5.10/1.28 # Presaturation interreduction done
% 5.10/1.28
% 5.10/1.28 # Proof found!
% 5.10/1.28 # SZS status Theorem
% 5.10/1.28 # SZS output start CNFRefutation
% See solution above
% 5.10/1.28 # Parsed axioms : 1156
% 5.10/1.28 # Removed by relevancy pruning/SinE : 0
% 5.10/1.28 # Initial clauses : 3983
% 5.10/1.28 # Removed in clause preprocessing : 537
% 5.10/1.28 # Initial clauses in saturation : 3446
% 5.10/1.28 # Processed clauses : 5014
% 5.10/1.28 # ...of these trivial : 10
% 5.10/1.28 # ...subsumed : 11
% 5.10/1.28 # ...remaining for further processing : 4993
% 5.10/1.28 # Other redundant clauses eliminated : 182
% 5.10/1.28 # Clauses deleted for lack of memory : 0
% 5.10/1.28 # Backward-subsumed : 21
% 5.10/1.28 # Backward-rewritten : 8
% 5.10/1.28 # Generated clauses : 602
% 5.10/1.28 # ...of the previous two non-redundant : 410
% 5.10/1.28 # ...aggressively subsumed : 0
% 5.10/1.28 # Contextual simplify-reflections : 40
% 5.10/1.28 # Paramodulations : 418
% 5.10/1.28 # Factorizations : 0
% 5.10/1.28 # NegExts : 0
% 5.10/1.28 # Equation resolutions : 182
% 5.10/1.28 # Disequality decompositions : 0
% 5.10/1.28 # Total rewrite steps : 41
% 5.10/1.28 # ...of those cached : 23
% 5.10/1.28 # Propositional unsat checks : 0
% 5.10/1.28 # Propositional check models : 0
% 5.10/1.28 # Propositional check unsatisfiable : 0
% 5.10/1.28 # Propositional clauses : 0
% 5.10/1.28 # Propositional clauses after purity: 0
% 5.10/1.28 # Propositional unsat core size : 0
% 5.10/1.28 # Propositional preprocessing time : 0.000
% 5.10/1.28 # Propositional encoding time : 0.000
% 5.10/1.28 # Propositional solver time : 0.000
% 5.10/1.28 # Success case prop preproc time : 0.000
% 5.10/1.28 # Success case prop encoding time : 0.000
% 5.10/1.28 # Success case prop solver time : 0.000
% 5.10/1.28 # Current number of processed clauses : 1374
% 5.10/1.28 # Positive orientable unit clauses : 248
% 5.10/1.28 # Positive unorientable unit clauses: 0
% 5.10/1.28 # Negative unit clauses : 208
% 5.10/1.28 # Non-unit-clauses : 918
% 5.10/1.28 # Current number of unprocessed clauses: 2247
% 5.10/1.28 # ...number of literals in the above : 6918
% 5.10/1.28 # Current number of archived formulas : 0
% 5.10/1.28 # Current number of archived clauses : 3437
% 5.10/1.28 # Clause-clause subsumption calls (NU) : 3654315
% 5.10/1.28 # Rec. Clause-clause subsumption calls : 2269311
% 5.10/1.28 # Non-unit clause-clause subsumptions : 40
% 5.10/1.28 # Unit Clause-clause subsumption calls : 50660
% 5.10/1.28 # Rewrite failures with RHS unbound : 0
% 5.10/1.28 # BW rewrite match attempts : 13
% 5.10/1.28 # BW rewrite match successes : 13
% 5.10/1.28 # Condensation attempts : 0
% 5.10/1.28 # Condensation successes : 0
% 5.10/1.28 # Termbank termtop insertions : 234683
% 5.10/1.28 # Search garbage collected termcells : 40002
% 5.10/1.28
% 5.10/1.28 # -------------------------------------------------
% 5.10/1.28 # User time : 0.639 s
% 5.10/1.28 # System time : 0.025 s
% 5.10/1.28 # Total time : 0.664 s
% 5.10/1.28 # Maximum resident set size: 11136 pages
% 5.10/1.28
% 5.10/1.28 # -------------------------------------------------
% 5.10/1.28 # User time : 2.870 s
% 5.10/1.28 # System time : 0.063 s
% 5.10/1.28 # Total time : 2.933 s
% 5.10/1.28 # Maximum resident set size: 3152 pages
% 5.10/1.28 % E---3.1 exiting
%------------------------------------------------------------------------------