TSTP Solution File: HWV095+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : HWV095+1 : TPTP v8.1.0. Released v6.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n006.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 : 600s
% DateTime : Sat Jul 16 14:09:54 EDT 2022
% Result : Theorem 0.32s 1.50s
% Output : CNFRefutation 0.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 11
% Syntax : Number of formulae : 43 ( 13 unt; 0 def)
% Number of atoms : 106 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 107 ( 44 ~; 36 |; 16 &)
% ( 9 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 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 : 46 ( 14 sgn 30 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(writeBinaryOperatorShiftedRanges_80,axiom,
! [X2] :
( v1010(X2)
<=> ( v1000(X2,bitIndex0)
| v1000(X2,bitIndex1) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',writeBinaryOperatorShiftedRanges_80) ).
fof(addAssignment_244,axiom,
! [X2] :
( v1000(X2,bitIndex1)
<=> $true ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',addAssignment_244) ).
fof(addAssertion,conjecture,
! [X2] :
( reachableState(X2)
=> v4(X2) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',addAssertion) ).
fof(writeBinaryOperatorEqualRangesSingleBits_170,axiom,
! [X2] :
( v996(X2)
<=> ( v998(X2)
& v1010(X2) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',writeBinaryOperatorEqualRangesSingleBits_170) ).
fof(writeBinaryOperatorShiftedRanges_78,axiom,
! [X2] :
( v1001(X2)
<=> ( v1003(X2)
& v1007(X2,bitIndex5) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',writeBinaryOperatorShiftedRanges_78) ).
fof(addZeroExtensionConstraint_3,axiom,
! [X2] : ~ v1007(X2,bitIndex5),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',addZeroExtensionConstraint_3) ).
fof(writeUnaryOperator_113,axiom,
! [X2] :
( ~ v4(X2)
<=> v995(X2) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',writeUnaryOperator_113) ).
fof(writeUnaryOperator_111,axiom,
! [X2] :
( ~ v998(X2)
<=> v999(X2) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',writeUnaryOperator_111) ).
fof(addAssignment_245,axiom,
! [X2] :
( v1000(X2,bitIndex0)
<=> v1001(X2) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',addAssignment_245) ).
fof(writeUnaryOperator_112,axiom,
! [X2] :
( ~ v995(X2)
<=> v996(X2) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',writeUnaryOperator_112) ).
fof(writeBinaryOperatorShiftedRanges_79,axiom,
! [X2] :
( v999(X2)
<=> ( v1000(X2,bitIndex0)
& v1000(X2,bitIndex1) ) ),
file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',writeBinaryOperatorShiftedRanges_79) ).
fof(c_0_11,plain,
! [X3,X3] :
( ( ~ v1010(X3)
| v1000(X3,bitIndex0)
| v1000(X3,bitIndex1) )
& ( ~ v1000(X3,bitIndex0)
| v1010(X3) )
& ( ~ v1000(X3,bitIndex1)
| v1010(X3) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[writeBinaryOperatorShiftedRanges_80])])])])]) ).
fof(c_0_12,plain,
! [X3] : v1000(X3,bitIndex1),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[addAssignment_244])]) ).
fof(c_0_13,negated_conjecture,
~ ! [X2] :
( reachableState(X2)
=> v4(X2) ),
inference(assume_negation,[status(cth)],[addAssertion]) ).
fof(c_0_14,plain,
! [X3,X3] :
( ( v998(X3)
| ~ v996(X3) )
& ( v1010(X3)
| ~ v996(X3) )
& ( ~ v998(X3)
| ~ v1010(X3)
| v996(X3) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[writeBinaryOperatorEqualRangesSingleBits_170])])])])]) ).
cnf(c_0_15,plain,
( v1010(X1)
| ~ v1000(X1,bitIndex1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_16,plain,
v1000(X1,bitIndex1),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_17,plain,
! [X3,X3] :
( ( v1003(X3)
| ~ v1001(X3) )
& ( v1007(X3,bitIndex5)
| ~ v1001(X3) )
& ( ~ v1003(X3)
| ~ v1007(X3,bitIndex5)
| v1001(X3) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[writeBinaryOperatorShiftedRanges_78])])])])]) ).
fof(c_0_18,plain,
! [X3] : ~ v1007(X3,bitIndex5),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[addZeroExtensionConstraint_3])]) ).
fof(c_0_19,negated_conjecture,
( reachableState(esk1_0)
& ~ v4(esk1_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])]) ).
fof(c_0_20,plain,
! [X3,X3] :
( ( v4(X3)
| v995(X3) )
& ( ~ v995(X3)
| ~ v4(X3) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[writeUnaryOperator_113])])])])]) ).
cnf(c_0_21,plain,
( v996(X1)
| ~ v1010(X1)
| ~ v998(X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,plain,
v1010(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_16])]) ).
fof(c_0_23,plain,
! [X3,X3] :
( ( v998(X3)
| v999(X3) )
& ( ~ v999(X3)
| ~ v998(X3) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[writeUnaryOperator_111])])])])]) ).
cnf(c_0_24,plain,
( v1007(X1,bitIndex5)
| ~ v1001(X1) ),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
cnf(c_0_25,plain,
~ v1007(X1,bitIndex5),
inference(split_conjunct,[status(thm)],[c_0_18]) ).
fof(c_0_26,plain,
! [X3,X3] :
( ( ~ v1000(X3,bitIndex0)
| v1001(X3) )
& ( ~ v1001(X3)
| v1000(X3,bitIndex0) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[addAssignment_245])])])]) ).
fof(c_0_27,plain,
! [X3,X3] :
( ( v995(X3)
| v996(X3) )
& ( ~ v996(X3)
| ~ v995(X3) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[writeUnaryOperator_112])])])])]) ).
cnf(c_0_28,negated_conjecture,
~ v4(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_19]) ).
cnf(c_0_29,plain,
( v995(X1)
| v4(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
fof(c_0_30,plain,
! [X3,X3] :
( ( v1000(X3,bitIndex0)
| ~ v999(X3) )
& ( v1000(X3,bitIndex1)
| ~ v999(X3) )
& ( ~ v1000(X3,bitIndex0)
| ~ v1000(X3,bitIndex1)
| v999(X3) ) ),
inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[writeBinaryOperatorShiftedRanges_79])])])])]) ).
cnf(c_0_31,plain,
( v996(X1)
| ~ v998(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_22])]) ).
cnf(c_0_32,plain,
( v999(X1)
| v998(X1) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_33,plain,
~ v1001(X1),
inference(sr,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_34,plain,
( v1001(X1)
| ~ v1000(X1,bitIndex0) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_35,plain,
( ~ v995(X1)
| ~ v996(X1) ),
inference(split_conjunct,[status(thm)],[c_0_27]) ).
cnf(c_0_36,negated_conjecture,
v995(esk1_0),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_37,plain,
( v1000(X1,bitIndex0)
| ~ v999(X1) ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
cnf(c_0_38,plain,
( v999(X1)
| v996(X1) ),
inference(spm,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_39,plain,
~ v1000(X1,bitIndex0),
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_40,negated_conjecture,
~ v996(esk1_0),
inference(spm,[status(thm)],[c_0_35,c_0_36]) ).
cnf(c_0_41,plain,
v996(X1),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]) ).
cnf(c_0_42,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_41])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : HWV095+1 : TPTP v8.1.0. Released v6.1.0.
% 0.07/0.13 % Command : run_ET %s %d
% 0.12/0.34 % Computer : n006.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Fri Jun 17 09:47:26 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.32/1.50 # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.32/1.50 # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.32/1.50 # Preprocessing time : 0.043 s
% 0.32/1.50
% 0.32/1.50 # Failure: Out of unprocessed clauses!
% 0.32/1.50 # OLD status GaveUp
% 0.32/1.50 # Parsed axioms : 1156
% 0.32/1.50 # Removed by relevancy pruning/SinE : 1149
% 0.32/1.50 # Initial clauses : 16
% 0.32/1.50 # Removed in clause preprocessing : 0
% 0.32/1.50 # Initial clauses in saturation : 16
% 0.32/1.50 # Processed clauses : 18
% 0.32/1.50 # ...of these trivial : 0
% 0.32/1.50 # ...subsumed : 0
% 0.32/1.50 # ...remaining for further processing : 18
% 0.32/1.50 # Other redundant clauses eliminated : 0
% 0.32/1.50 # Clauses deleted for lack of memory : 0
% 0.32/1.50 # Backward-subsumed : 0
% 0.32/1.50 # Backward-rewritten : 0
% 0.32/1.50 # Generated clauses : 7
% 0.32/1.50 # ...of the previous two non-trivial : 2
% 0.32/1.50 # Contextual simplify-reflections : 0
% 0.32/1.50 # Paramodulations : 7
% 0.32/1.50 # Factorizations : 0
% 0.32/1.50 # Equation resolutions : 0
% 0.32/1.50 # Current number of processed clauses : 18
% 0.32/1.50 # Positive orientable unit clauses : 2
% 0.32/1.50 # Positive unorientable unit clauses: 0
% 0.32/1.50 # Negative unit clauses : 2
% 0.32/1.50 # Non-unit-clauses : 14
% 0.32/1.50 # Current number of unprocessed clauses: 0
% 0.32/1.50 # ...number of literals in the above : 0
% 0.32/1.50 # Current number of archived formulas : 0
% 0.32/1.50 # Current number of archived clauses : 0
% 0.32/1.50 # Clause-clause subsumption calls (NU) : 8
% 0.32/1.50 # Rec. Clause-clause subsumption calls : 7
% 0.32/1.50 # Non-unit clause-clause subsumptions : 0
% 0.32/1.50 # Unit Clause-clause subsumption calls : 1
% 0.32/1.50 # Rewrite failures with RHS unbound : 0
% 0.32/1.50 # BW rewrite match attempts : 0
% 0.32/1.50 # BW rewrite match successes : 0
% 0.32/1.50 # Condensation attempts : 0
% 0.32/1.50 # Condensation successes : 0
% 0.32/1.50 # Termbank termtop insertions : 14583
% 0.32/1.50
% 0.32/1.50 # -------------------------------------------------
% 0.32/1.50 # User time : 0.037 s
% 0.32/1.50 # System time : 0.006 s
% 0.32/1.50 # Total time : 0.043 s
% 0.32/1.50 # Maximum resident set size: 6468 pages
% 0.32/1.50 # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.32/1.50 # Preprocessing time : 0.115 s
% 0.32/1.50
% 0.32/1.50 # Proof found!
% 0.32/1.50 # SZS status Theorem
% 0.32/1.50 # SZS output start CNFRefutation
% See solution above
% 0.32/1.50 # Proof object total steps : 43
% 0.32/1.50 # Proof object clause steps : 20
% 0.32/1.50 # Proof object formula steps : 23
% 0.32/1.50 # Proof object conjectures : 7
% 0.32/1.50 # Proof object clause conjectures : 4
% 0.32/1.50 # Proof object formula conjectures : 3
% 0.32/1.50 # Proof object initial clauses used : 11
% 0.32/1.50 # Proof object initial formulas used : 11
% 0.32/1.50 # Proof object generating inferences : 5
% 0.32/1.50 # Proof object simplifying inferences : 8
% 0.32/1.50 # Training examples: 0 positive, 0 negative
% 0.32/1.50 # Parsed axioms : 1156
% 0.32/1.50 # Removed by relevancy pruning/SinE : 0
% 0.32/1.50 # Initial clauses : 3447
% 0.32/1.50 # Removed in clause preprocessing : 0
% 0.32/1.50 # Initial clauses in saturation : 3447
% 0.32/1.50 # Processed clauses : 3854
% 0.32/1.50 # ...of these trivial : 7
% 0.32/1.50 # ...subsumed : 14
% 0.32/1.50 # ...remaining for further processing : 3833
% 0.32/1.50 # Other redundant clauses eliminated : 0
% 0.32/1.50 # Clauses deleted for lack of memory : 0
% 0.32/1.50 # Backward-subsumed : 16
% 0.32/1.50 # Backward-rewritten : 18
% 0.32/1.50 # Generated clauses : 4713
% 0.32/1.50 # ...of the previous two non-trivial : 2699
% 0.32/1.50 # Contextual simplify-reflections : 38
% 0.32/1.50 # Paramodulations : 4025
% 0.32/1.50 # Factorizations : 688
% 0.32/1.50 # Equation resolutions : 0
% 0.32/1.50 # Current number of processed clauses : 3799
% 0.32/1.50 # Positive orientable unit clauses : 67
% 0.32/1.50 # Positive unorientable unit clauses: 0
% 0.32/1.50 # Negative unit clauses : 198
% 0.32/1.50 # Non-unit-clauses : 3534
% 0.32/1.50 # Current number of unprocessed clauses: 2249
% 0.32/1.50 # ...number of literals in the above : 19268
% 0.32/1.50 # Current number of archived formulas : 0
% 0.32/1.50 # Current number of archived clauses : 34
% 0.32/1.50 # Clause-clause subsumption calls (NU) : 4342854
% 0.32/1.50 # Rec. Clause-clause subsumption calls : 2721372
% 0.32/1.50 # Non-unit clause-clause subsumptions : 40
% 0.32/1.50 # Unit Clause-clause subsumption calls : 34056
% 0.32/1.50 # Rewrite failures with RHS unbound : 0
% 0.32/1.50 # BW rewrite match attempts : 16
% 0.32/1.50 # BW rewrite match successes : 16
% 0.32/1.50 # Condensation attempts : 0
% 0.32/1.50 # Condensation successes : 0
% 0.32/1.50 # Termbank termtop insertions : 241604
% 0.32/1.50
% 0.32/1.50 # -------------------------------------------------
% 0.32/1.50 # User time : 0.743 s
% 0.32/1.50 # System time : 0.023 s
% 0.32/1.50 # Total time : 0.766 s
% 0.32/1.50 # Maximum resident set size: 19980 pages
%------------------------------------------------------------------------------