TSTP Solution File: HWV089+1 by ET---2.0
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : ET---2.0
% Problem : HWV089+1 : TPTP v8.1.0. Released v6.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_ET %s %d
% Computer : n010.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:49 EDT 2022
% Result : Theorem 0.93s 7.12s
% Output : CNFRefutation 0.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 11
% Syntax : Number of formulae : 44 ( 15 unt; 0 def)
% Number of atoms : 106 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 107 ( 45 ~; 35 |; 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 : 49 ( 18 sgn 30 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(writeBinaryOperatorShiftedRanges_553,axiom,
! [X2] :
( v3680(X2)
<=> ( v3682(X2)
& v3684(X2,bitIndex5) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',writeBinaryOperatorShiftedRanges_553) ).
fof(addZeroExtensionConstraint_5,axiom,
! [X2] : ~ v3684(X2,bitIndex5),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',addZeroExtensionConstraint_5) ).
fof(addAssignment_2619,axiom,
! [X2] :
( v3679(X2,bitIndex0)
<=> v3680(X2) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',addAssignment_2619) ).
fof(writeBinaryOperatorShiftedRanges_555,axiom,
! [X2] :
( v3693(X2)
<=> ( v3679(X2,bitIndex0)
| v3679(X2,bitIndex1) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',writeBinaryOperatorShiftedRanges_555) ).
fof(addAssignment_2618,axiom,
! [X2] :
( v3679(X2,bitIndex1)
<=> $true ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',addAssignment_2618) ).
fof(writeBinaryOperatorShiftedRanges_554,axiom,
! [X2] :
( v3678(X2)
<=> ( v3679(X2,bitIndex0)
& v3679(X2,bitIndex1) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',writeBinaryOperatorShiftedRanges_554) ).
fof(writeBinaryOperatorEqualRangesSingleBits_740,axiom,
! [X2] :
( v3675(X2)
<=> ( v3677(X2)
& v3693(X2) ) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',writeBinaryOperatorEqualRangesSingleBits_740) ).
fof(writeUnaryOperator_345,axiom,
! [X2] :
( ~ v3677(X2)
<=> v3678(X2) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',writeUnaryOperator_345) ).
fof(writeUnaryOperator_346,axiom,
! [X2] :
( ~ v3674(X2)
<=> v3675(X2) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',writeUnaryOperator_346) ).
fof(addAssertion,conjecture,
! [X2] :
( reachableState(X2)
=> v4(X2) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',addAssertion) ).
fof(writeUnaryOperator_347,axiom,
! [X2] :
( ~ v4(X2)
<=> v3674(X2) ),
file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',writeUnaryOperator_347) ).
fof(c_0_11,plain,
! [X3,X3] :
( ( v3682(X3)
| ~ v3680(X3) )
& ( v3684(X3,bitIndex5)
| ~ v3680(X3) )
& ( ~ v3682(X3)
| ~ v3684(X3,bitIndex5)
| v3680(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_553])])])])]) ).
fof(c_0_12,plain,
! [X3] : ~ v3684(X3,bitIndex5),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[addZeroExtensionConstraint_5])]) ).
fof(c_0_13,plain,
! [X3,X3] :
( ( ~ v3679(X3,bitIndex0)
| v3680(X3) )
& ( ~ v3680(X3)
| v3679(X3,bitIndex0) ) ),
inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[addAssignment_2619])])])]) ).
cnf(c_0_14,plain,
( v3684(X1,bitIndex5)
| ~ v3680(X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_15,plain,
~ v3684(X1,bitIndex5),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
fof(c_0_16,plain,
! [X3,X3] :
( ( ~ v3693(X3)
| v3679(X3,bitIndex0)
| v3679(X3,bitIndex1) )
& ( ~ v3679(X3,bitIndex0)
| v3693(X3) )
& ( ~ v3679(X3,bitIndex1)
| v3693(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_555])])])])]) ).
fof(c_0_17,plain,
! [X3] : v3679(X3,bitIndex1),
inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[addAssignment_2618])]) ).
cnf(c_0_18,plain,
( v3680(X1)
| ~ v3679(X1,bitIndex0) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
~ v3680(X1),
inference(sr,[status(thm)],[c_0_14,c_0_15]) ).
fof(c_0_20,plain,
! [X3,X3] :
( ( v3679(X3,bitIndex0)
| ~ v3678(X3) )
& ( v3679(X3,bitIndex1)
| ~ v3678(X3) )
& ( ~ v3679(X3,bitIndex0)
| ~ v3679(X3,bitIndex1)
| v3678(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_554])])])])]) ).
fof(c_0_21,plain,
! [X3,X3] :
( ( v3677(X3)
| ~ v3675(X3) )
& ( v3693(X3)
| ~ v3675(X3) )
& ( ~ v3677(X3)
| ~ v3693(X3)
| v3675(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_740])])])])]) ).
cnf(c_0_22,plain,
( v3693(X1)
| ~ v3679(X1,bitIndex1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_23,plain,
v3679(X1,bitIndex1),
inference(split_conjunct,[status(thm)],[c_0_17]) ).
fof(c_0_24,plain,
! [X3,X3] :
( ( v3677(X3)
| v3678(X3) )
& ( ~ v3678(X3)
| ~ v3677(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_345])])])])]) ).
cnf(c_0_25,plain,
~ v3679(X1,bitIndex0),
inference(sr,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_26,plain,
( v3679(X1,bitIndex0)
| ~ v3678(X1) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_27,plain,
( v3675(X1)
| ~ v3693(X1)
| ~ v3677(X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_28,plain,
v3693(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_22,c_0_23])]) ).
cnf(c_0_29,plain,
( v3678(X1)
| v3677(X1) ),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_30,plain,
~ v3678(X1),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
fof(c_0_31,plain,
! [X3,X3] :
( ( v3674(X3)
| v3675(X3) )
& ( ~ v3675(X3)
| ~ v3674(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_346])])])])]) ).
cnf(c_0_32,plain,
( v3675(X1)
| ~ v3677(X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_27,c_0_28])]) ).
cnf(c_0_33,plain,
v3677(X1),
inference(sr,[status(thm)],[c_0_29,c_0_30]) ).
fof(c_0_34,negated_conjecture,
~ ! [X2] :
( reachableState(X2)
=> v4(X2) ),
inference(assume_negation,[status(cth)],[addAssertion]) ).
fof(c_0_35,plain,
! [X3,X3] :
( ( v4(X3)
| v3674(X3) )
& ( ~ v3674(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_347])])])])]) ).
cnf(c_0_36,plain,
( ~ v3674(X1)
| ~ v3675(X1) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_37,plain,
v3675(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_32,c_0_33])]) ).
fof(c_0_38,negated_conjecture,
( reachableState(esk1_0)
& ~ v4(esk1_0) ),
inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_34])])]) ).
cnf(c_0_39,plain,
( v3674(X1)
| v4(X1) ),
inference(split_conjunct,[status(thm)],[c_0_35]) ).
cnf(c_0_40,plain,
~ v3674(X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_37])]) ).
cnf(c_0_41,negated_conjecture,
~ v4(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_38]) ).
cnf(c_0_42,plain,
v4(X1),
inference(sr,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_43,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_42])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : HWV089+1 : TPTP v8.1.0. Released v6.1.0.
% 0.03/0.13 % Command : run_ET %s %d
% 0.13/0.34 % Computer : n010.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 : 600
% 0.13/0.34 % DateTime : Thu Jun 16 22:09:08 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.93/7.12 # Running protocol protocol_eprover_29fa5c60d0ee03ec4f64b055553dc135fbe4ee3a for 23 seconds:
% 0.93/7.12 # Preprocessing time : 0.464 s
% 0.93/7.12
% 0.93/7.12 # Proof found!
% 0.93/7.12 # SZS status Theorem
% 0.93/7.12 # SZS output start CNFRefutation
% See solution above
% 0.93/7.12 # Proof object total steps : 44
% 0.93/7.12 # Proof object clause steps : 21
% 0.93/7.12 # Proof object formula steps : 23
% 0.93/7.12 # Proof object conjectures : 5
% 0.93/7.12 # Proof object clause conjectures : 2
% 0.93/7.12 # Proof object formula conjectures : 3
% 0.93/7.12 # Proof object initial clauses used : 11
% 0.93/7.12 # Proof object initial formulas used : 11
% 0.93/7.12 # Proof object generating inferences : 1
% 0.93/7.12 # Proof object simplifying inferences : 14
% 0.93/7.12 # Training examples: 0 positive, 0 negative
% 0.93/7.12 # Parsed axioms : 6279
% 0.93/7.12 # Removed by relevancy pruning/SinE : 0
% 0.93/7.12 # Initial clauses : 14733
% 0.93/7.12 # Removed in clause preprocessing : 4
% 0.93/7.12 # Initial clauses in saturation : 14729
% 0.93/7.12 # Processed clauses : 14910
% 0.93/7.12 # ...of these trivial : 40
% 0.93/7.12 # ...subsumed : 97
% 0.93/7.12 # ...remaining for further processing : 14773
% 0.93/7.12 # Other redundant clauses eliminated : 8
% 0.93/7.12 # Clauses deleted for lack of memory : 0
% 0.93/7.12 # Backward-subsumed : 20
% 0.93/7.12 # Backward-rewritten : 47
% 0.93/7.12 # Generated clauses : 16282
% 0.93/7.12 # ...of the previous two non-trivial : 9934
% 0.93/7.12 # Contextual simplify-reflections : 108
% 0.93/7.12 # Paramodulations : 16267
% 0.93/7.12 # Factorizations : 0
% 0.93/7.12 # Equation resolutions : 8
% 0.93/7.12 # Current number of processed clauses : 14691
% 0.93/7.12 # Positive orientable unit clauses : 438
% 0.93/7.12 # Positive unorientable unit clauses: 0
% 0.93/7.12 # Negative unit clauses : 821
% 0.93/7.12 # Non-unit-clauses : 13432
% 0.93/7.12 # Current number of unprocessed clauses: 9736
% 0.93/7.12 # ...number of literals in the above : 26661
% 0.93/7.12 # Current number of archived formulas : 0
% 0.93/7.12 # Current number of archived clauses : 76
% 0.93/7.12 # Clause-clause subsumption calls (NU) : 53652704
% 0.93/7.12 # Rec. Clause-clause subsumption calls : 40046853
% 0.93/7.12 # Non-unit clause-clause subsumptions : 112
% 0.93/7.12 # Unit Clause-clause subsumption calls : 1183863
% 0.93/7.12 # Rewrite failures with RHS unbound : 0
% 0.93/7.12 # BW rewrite match attempts : 26
% 0.93/7.12 # BW rewrite match successes : 26
% 0.93/7.12 # Condensation attempts : 0
% 0.93/7.12 # Condensation successes : 0
% 0.93/7.12 # Termbank termtop insertions : 867044
% 0.93/7.12
% 0.93/7.12 # -------------------------------------------------
% 0.93/7.12 # User time : 5.590 s
% 0.93/7.12 # System time : 0.049 s
% 0.93/7.12 # Total time : 5.639 s
% 0.93/7.12 # Maximum resident set size: 67356 pages
%------------------------------------------------------------------------------