TSTP Solution File: HWV095+1 by SInE---0.4
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SInE---0.4
% Problem : HWV095+1 : TPTP v6.1.0. Released v6.1.0.
% Transfm : none
% Format : tptp:raw
% Command : Source/sine.py -e eprover -t %d %s
% Computer : art11.cs.miami.edu
% Model : i686 i686
% CPU : Intel(R) Pentium(R) 4 CPU 3.00GHz
% Memory : 2005MB
% OS : Linux 2.6.32.26-175.fc12.i686.PAE
% CPULimit : 300s
% DateTime : Sat Apr 5 10:59:05 EDT 2014
% Result : Theorem 4.69s
% Output : CNFRefutation 4.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 11
% Syntax : Number of formulae : 66 ( 14 unt; 0 def)
% Number of atoms : 196 ( 0 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 217 ( 87 ~; 76 |; 40 &)
% ( 12 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 7 ( 4 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 : 58 ( 6 sgn 39 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(83,axiom,
! [X1] :
( v1010(X1)
<=> ( v1000(X1,bitIndex0)
| v1000(X1,bitIndex1) ) ),
file('/tmp/tmph5DfIG/sel_HWV095+1.p_1',writeBinaryOperatorShiftedRanges_80) ).
fof(363,axiom,
! [X1] : ~ v1007(X1,bitIndex5),
file('/tmp/tmph5DfIG/sel_HWV095+1.p_1',addZeroExtensionConstraint_3) ).
fof(681,conjecture,
! [X1] :
( reachableState(X1)
=> v4(X1) ),
file('/tmp/tmph5DfIG/sel_HWV095+1.p_1',addAssertion) ).
fof(748,axiom,
! [X1] :
( v1001(X1)
<=> ( v1003(X1)
& v1007(X1,bitIndex5) ) ),
file('/tmp/tmph5DfIG/sel_HWV095+1.p_1',writeBinaryOperatorShiftedRanges_78) ).
fof(749,axiom,
! [X1] :
( v999(X1)
<=> ( v1000(X1,bitIndex0)
& v1000(X1,bitIndex1) ) ),
file('/tmp/tmph5DfIG/sel_HWV095+1.p_1',writeBinaryOperatorShiftedRanges_79) ).
fof(755,axiom,
! [X1] :
( v1000(X1,bitIndex1)
<=> $true ),
file('/tmp/tmph5DfIG/sel_HWV095+1.p_1',addAssignment_244) ).
fof(756,axiom,
! [X1] :
( v1000(X1,bitIndex0)
<=> v1001(X1) ),
file('/tmp/tmph5DfIG/sel_HWV095+1.p_1',addAssignment_245) ).
fof(780,axiom,
! [X1] :
( v996(X1)
<=> ( v998(X1)
& v1010(X1) ) ),
file('/tmp/tmph5DfIG/sel_HWV095+1.p_1',writeBinaryOperatorEqualRangesSingleBits_170) ).
fof(1051,axiom,
! [X1] :
( ~ v4(X1)
<=> v995(X1) ),
file('/tmp/tmph5DfIG/sel_HWV095+1.p_1',writeUnaryOperator_113) ).
fof(1052,axiom,
! [X1] :
( ~ v995(X1)
<=> v996(X1) ),
file('/tmp/tmph5DfIG/sel_HWV095+1.p_1',writeUnaryOperator_112) ).
fof(1053,axiom,
! [X1] :
( ~ v998(X1)
<=> v999(X1) ),
file('/tmp/tmph5DfIG/sel_HWV095+1.p_1',writeUnaryOperator_111) ).
fof(1157,negated_conjecture,
~ ! [X1] :
( reachableState(X1)
=> v4(X1) ),
inference(assume_negation,[status(cth)],[681]) ).
fof(1260,plain,
! [X1] : ~ v1007(X1,bitIndex5),
inference(fof_simplification,[status(thm)],[363,theory(equality)]) ).
fof(1513,plain,
! [X1] :
( ~ v4(X1)
<=> v995(X1) ),
inference(fof_simplification,[status(thm)],[1051,theory(equality)]) ).
fof(1514,plain,
! [X1] :
( ~ v995(X1)
<=> v996(X1) ),
inference(fof_simplification,[status(thm)],[1052,theory(equality)]) ).
fof(1515,plain,
! [X1] :
( ~ v998(X1)
<=> v999(X1) ),
inference(fof_simplification,[status(thm)],[1053,theory(equality)]) ).
fof(1998,plain,
! [X1] :
( ( ~ v1010(X1)
| v1000(X1,bitIndex0)
| v1000(X1,bitIndex1) )
& ( ( ~ v1000(X1,bitIndex0)
& ~ v1000(X1,bitIndex1) )
| v1010(X1) ) ),
inference(fof_nnf,[status(thm)],[83]) ).
fof(1999,plain,
! [X2] :
( ( ~ v1010(X2)
| v1000(X2,bitIndex0)
| v1000(X2,bitIndex1) )
& ( ( ~ v1000(X2,bitIndex0)
& ~ v1000(X2,bitIndex1) )
| v1010(X2) ) ),
inference(variable_rename,[status(thm)],[1998]) ).
fof(2000,plain,
! [X2] :
( ( ~ v1010(X2)
| v1000(X2,bitIndex0)
| v1000(X2,bitIndex1) )
& ( ~ v1000(X2,bitIndex0)
| v1010(X2) )
& ( ~ v1000(X2,bitIndex1)
| v1010(X2) ) ),
inference(distribute,[status(thm)],[1999]) ).
cnf(2001,plain,
( v1010(X1)
| ~ v1000(X1,bitIndex1) ),
inference(split_conjunct,[status(thm)],[2000]) ).
fof(3186,plain,
! [X2] : ~ v1007(X2,bitIndex5),
inference(variable_rename,[status(thm)],[1260]) ).
cnf(3187,plain,
~ v1007(X1,bitIndex5),
inference(split_conjunct,[status(thm)],[3186]) ).
fof(4529,negated_conjecture,
? [X1] :
( reachableState(X1)
& ~ v4(X1) ),
inference(fof_nnf,[status(thm)],[1157]) ).
fof(4530,negated_conjecture,
? [X2] :
( reachableState(X2)
& ~ v4(X2) ),
inference(variable_rename,[status(thm)],[4529]) ).
fof(4531,negated_conjecture,
( reachableState(esk1_0)
& ~ v4(esk1_0) ),
inference(skolemize,[status(esa)],[4530]) ).
cnf(4532,negated_conjecture,
~ v4(esk1_0),
inference(split_conjunct,[status(thm)],[4531]) ).
fof(4856,plain,
! [X1] :
( ( ~ v1001(X1)
| ( v1003(X1)
& v1007(X1,bitIndex5) ) )
& ( ~ v1003(X1)
| ~ v1007(X1,bitIndex5)
| v1001(X1) ) ),
inference(fof_nnf,[status(thm)],[748]) ).
fof(4857,plain,
! [X2] :
( ( ~ v1001(X2)
| ( v1003(X2)
& v1007(X2,bitIndex5) ) )
& ( ~ v1003(X2)
| ~ v1007(X2,bitIndex5)
| v1001(X2) ) ),
inference(variable_rename,[status(thm)],[4856]) ).
fof(4858,plain,
! [X2] :
( ( v1003(X2)
| ~ v1001(X2) )
& ( v1007(X2,bitIndex5)
| ~ v1001(X2) )
& ( ~ v1003(X2)
| ~ v1007(X2,bitIndex5)
| v1001(X2) ) ),
inference(distribute,[status(thm)],[4857]) ).
cnf(4860,plain,
( v1007(X1,bitIndex5)
| ~ v1001(X1) ),
inference(split_conjunct,[status(thm)],[4858]) ).
fof(4862,plain,
! [X1] :
( ( ~ v999(X1)
| ( v1000(X1,bitIndex0)
& v1000(X1,bitIndex1) ) )
& ( ~ v1000(X1,bitIndex0)
| ~ v1000(X1,bitIndex1)
| v999(X1) ) ),
inference(fof_nnf,[status(thm)],[749]) ).
fof(4863,plain,
! [X2] :
( ( ~ v999(X2)
| ( v1000(X2,bitIndex0)
& v1000(X2,bitIndex1) ) )
& ( ~ v1000(X2,bitIndex0)
| ~ v1000(X2,bitIndex1)
| v999(X2) ) ),
inference(variable_rename,[status(thm)],[4862]) ).
fof(4864,plain,
! [X2] :
( ( v1000(X2,bitIndex0)
| ~ v999(X2) )
& ( v1000(X2,bitIndex1)
| ~ v999(X2) )
& ( ~ v1000(X2,bitIndex0)
| ~ v1000(X2,bitIndex1)
| v999(X2) ) ),
inference(distribute,[status(thm)],[4863]) ).
cnf(4867,plain,
( v1000(X1,bitIndex0)
| ~ v999(X1) ),
inference(split_conjunct,[status(thm)],[4864]) ).
fof(4897,plain,
! [X1] :
( ( ~ v1000(X1,bitIndex1)
| $true )
& ( ~ $true
| v1000(X1,bitIndex1) ) ),
inference(fof_nnf,[status(thm)],[755]) ).
fof(4898,plain,
! [X2] :
( ( ~ v1000(X2,bitIndex1)
| $true )
& ( ~ $true
| v1000(X2,bitIndex1) ) ),
inference(variable_rename,[status(thm)],[4897]) ).
cnf(4899,plain,
( v1000(X1,bitIndex1)
| $false ),
inference(split_conjunct,[status(thm)],[4898]) ).
fof(4901,plain,
! [X1] :
( ( ~ v1000(X1,bitIndex0)
| v1001(X1) )
& ( ~ v1001(X1)
| v1000(X1,bitIndex0) ) ),
inference(fof_nnf,[status(thm)],[756]) ).
fof(4902,plain,
! [X2] :
( ( ~ v1000(X2,bitIndex0)
| v1001(X2) )
& ( ~ v1001(X2)
| v1000(X2,bitIndex0) ) ),
inference(variable_rename,[status(thm)],[4901]) ).
cnf(4904,plain,
( v1001(X1)
| ~ v1000(X1,bitIndex0) ),
inference(split_conjunct,[status(thm)],[4902]) ).
fof(5109,plain,
! [X1] :
( ( ~ v996(X1)
| ( v998(X1)
& v1010(X1) ) )
& ( ~ v998(X1)
| ~ v1010(X1)
| v996(X1) ) ),
inference(fof_nnf,[status(thm)],[780]) ).
fof(5110,plain,
! [X2] :
( ( ~ v996(X2)
| ( v998(X2)
& v1010(X2) ) )
& ( ~ v998(X2)
| ~ v1010(X2)
| v996(X2) ) ),
inference(variable_rename,[status(thm)],[5109]) ).
fof(5111,plain,
! [X2] :
( ( v998(X2)
| ~ v996(X2) )
& ( v1010(X2)
| ~ v996(X2) )
& ( ~ v998(X2)
| ~ v1010(X2)
| v996(X2) ) ),
inference(distribute,[status(thm)],[5110]) ).
cnf(5112,plain,
( v996(X1)
| ~ v1010(X1)
| ~ v998(X1) ),
inference(split_conjunct,[status(thm)],[5111]) ).
fof(6244,plain,
! [X1] :
( ( v4(X1)
| v995(X1) )
& ( ~ v995(X1)
| ~ v4(X1) ) ),
inference(fof_nnf,[status(thm)],[1513]) ).
fof(6245,plain,
! [X2] :
( ( v4(X2)
| v995(X2) )
& ( ~ v995(X2)
| ~ v4(X2) ) ),
inference(variable_rename,[status(thm)],[6244]) ).
cnf(6247,plain,
( v995(X1)
| v4(X1) ),
inference(split_conjunct,[status(thm)],[6245]) ).
fof(6248,plain,
! [X1] :
( ( v995(X1)
| v996(X1) )
& ( ~ v996(X1)
| ~ v995(X1) ) ),
inference(fof_nnf,[status(thm)],[1514]) ).
fof(6249,plain,
! [X2] :
( ( v995(X2)
| v996(X2) )
& ( ~ v996(X2)
| ~ v995(X2) ) ),
inference(variable_rename,[status(thm)],[6248]) ).
cnf(6250,plain,
( ~ v995(X1)
| ~ v996(X1) ),
inference(split_conjunct,[status(thm)],[6249]) ).
fof(6252,plain,
! [X1] :
( ( v998(X1)
| v999(X1) )
& ( ~ v999(X1)
| ~ v998(X1) ) ),
inference(fof_nnf,[status(thm)],[1515]) ).
fof(6253,plain,
! [X2] :
( ( v998(X2)
| v999(X2) )
& ( ~ v999(X2)
| ~ v998(X2) ) ),
inference(variable_rename,[status(thm)],[6252]) ).
cnf(6255,plain,
( v999(X1)
| v998(X1) ),
inference(split_conjunct,[status(thm)],[6253]) ).
cnf(7976,negated_conjecture,
v995(esk1_0),
inference(spm,[status(thm)],[4532,6247,theory(equality)]) ).
cnf(8345,plain,
~ v1001(X1),
inference(sr,[status(thm)],[4860,3187,theory(equality)]) ).
cnf(8386,plain,
( v1010(X1)
| $false ),
inference(rw,[status(thm)],[2001,4899,theory(equality)]) ).
cnf(8387,plain,
v1010(X1),
inference(cn,[status(thm)],[8386,theory(equality)]) ).
cnf(8552,plain,
~ v1000(X1,bitIndex0),
inference(sr,[status(thm)],[4904,8345,theory(equality)]) ).
cnf(8977,plain,
( v996(X1)
| $false
| ~ v998(X1) ),
inference(rw,[status(thm)],[5112,8387,theory(equality)]) ).
cnf(8978,plain,
( v996(X1)
| ~ v998(X1) ),
inference(cn,[status(thm)],[8977,theory(equality)]) ).
cnf(8979,plain,
( v996(X1)
| v999(X1) ),
inference(spm,[status(thm)],[8978,6255,theory(equality)]) ).
cnf(11837,negated_conjecture,
~ v996(esk1_0),
inference(spm,[status(thm)],[6250,7976,theory(equality)]) ).
cnf(11921,negated_conjecture,
v999(esk1_0),
inference(spm,[status(thm)],[11837,8979,theory(equality)]) ).
cnf(11923,negated_conjecture,
v1000(esk1_0,bitIndex0),
inference(spm,[status(thm)],[4867,11921,theory(equality)]) ).
cnf(11924,negated_conjecture,
$false,
inference(sr,[status(thm)],[11923,8552,theory(equality)]) ).
cnf(11925,negated_conjecture,
$false,
11924,
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% /home/tptp/Systems/SInE---0.4/Source/sine.py:10: DeprecationWarning: the sets module is deprecated
% from sets import Set
% % SZS status Started for /home/tptp/TPTP/Problems/HWV/HWV095+1.p
% --creating new selector for []
% -running prover on /tmp/tmph5DfIG/sel_HWV095+1.p_1 with time limit 29
% -running prover with command ['/home/tptp/Systems/SInE---0.4/Source/./Source/PROVER/eproof.working', '-s', '-tLPO4', '-xAuto', '-tAuto', '--memory-limit=768', '--tptp3-format', '--cpu-limit=29', '/tmp/tmph5DfIG/sel_HWV095+1.p_1']
% -prover status Theorem
% Problem HWV095+1.p solved in phase 0.
% % SZS status Theorem for /home/tptp/TPTP/Problems/HWV/HWV095+1.p
% % SZS status Ended for /home/tptp/TPTP/Problems/HWV/HWV095+1.p
% Solved 1 out of 1.
% # Problem is unsatisfiable (or provable), constructing proof object
% # SZS status Theorem
% # SZS output start CNFRefutation.
% See solution above
% # SZS output end CNFRefutation
%
%------------------------------------------------------------------------------