TSTP Solution File: HWV095+1 by iProver---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.9
% Problem : HWV095+1 : TPTP v8.1.2. Released v6.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n032.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 : Fri May 3 02:27:01 EDT 2024
% Result : Theorem 7.70s 1.50s
% Output : CNFRefutation 7.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 12
% Syntax : Number of formulae : 74 ( 18 unt; 0 def)
% Number of atoms : 159 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 143 ( 58 ~; 38 |; 19 &)
% ( 18 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 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 : 70 ( 10 sgn 50 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(f35,conjecture,
! [X1] :
( reachableState(X1)
=> v4(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',addAssertion) ).
fof(f36,negated_conjecture,
~ ! [X1] :
( reachableState(X1)
=> v4(X1) ),
inference(negated_conjecture,[],[f35]) ).
fof(f37,axiom,
! [X1] :
( ~ v4(X1)
<=> v995(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',writeUnaryOperator_113) ).
fof(f38,axiom,
! [X1] :
( ~ v995(X1)
<=> v996(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',writeUnaryOperator_112) ).
fof(f39,axiom,
! [X1] :
( v996(X1)
<=> ( v1010(X1)
& v998(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',writeBinaryOperatorEqualRangesSingleBits_170) ).
fof(f40,axiom,
! [X1] :
( v1010(X1)
<=> ( v1000(X1,bitIndex1)
| v1000(X1,bitIndex0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',writeBinaryOperatorShiftedRanges_80) ).
fof(f41,axiom,
! [X1] :
( ~ v998(X1)
<=> v999(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',writeUnaryOperator_111) ).
fof(f42,axiom,
! [X1] :
( v999(X1)
<=> ( v1000(X1,bitIndex1)
& v1000(X1,bitIndex0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',writeBinaryOperatorShiftedRanges_79) ).
fof(f43,axiom,
! [X1] :
( v1000(X1,bitIndex0)
<=> v1001(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',addAssignment_245) ).
fof(f44,axiom,
! [X1] :
( v1000(X1,bitIndex1)
<=> $true ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',addAssignment_244) ).
fof(f45,axiom,
! [X1] :
( v1001(X1)
<=> ( v1007(X1,bitIndex5)
& v1003(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',writeBinaryOperatorShiftedRanges_78) ).
fof(f53,axiom,
! [X1] : ~ v1007(X1,bitIndex5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',addZeroExtensionConstraint_3) ).
fof(f1159,plain,
~ ! [X0] :
( reachableState(X0)
=> v4(X0) ),
inference(rectify,[],[f36]) ).
fof(f1160,plain,
! [X0] :
( ~ v4(X0)
<=> v995(X0) ),
inference(rectify,[],[f37]) ).
fof(f1161,plain,
! [X0] :
( ~ v995(X0)
<=> v996(X0) ),
inference(rectify,[],[f38]) ).
fof(f1162,plain,
! [X0] :
( v996(X0)
<=> ( v1010(X0)
& v998(X0) ) ),
inference(rectify,[],[f39]) ).
fof(f1163,plain,
! [X0] :
( v1010(X0)
<=> ( v1000(X0,bitIndex1)
| v1000(X0,bitIndex0) ) ),
inference(rectify,[],[f40]) ).
fof(f1164,plain,
! [X0] :
( ~ v998(X0)
<=> v999(X0) ),
inference(rectify,[],[f41]) ).
fof(f1165,plain,
! [X0] :
( v999(X0)
<=> ( v1000(X0,bitIndex1)
& v1000(X0,bitIndex0) ) ),
inference(rectify,[],[f42]) ).
fof(f1166,plain,
! [X0] :
( v1000(X0,bitIndex0)
<=> v1001(X0) ),
inference(rectify,[],[f43]) ).
fof(f1167,plain,
! [X0] :
( v1000(X0,bitIndex1)
<=> $true ),
inference(rectify,[],[f44]) ).
fof(f1168,plain,
! [X0] : v1000(X0,bitIndex1),
inference(true_and_false_elimination,[],[f1167]) ).
fof(f1169,plain,
! [X0] :
( v1001(X0)
<=> ( v1007(X0,bitIndex5)
& v1003(X0) ) ),
inference(rectify,[],[f45]) ).
fof(f1177,plain,
! [X0] : ~ v1007(X0,bitIndex5),
inference(rectify,[],[f53]) ).
fof(f2248,plain,
! [X0] :
( ~ v4(X0)
=> v995(X0) ),
inference(unused_predicate_definition_removal,[],[f1160]) ).
fof(f2249,plain,
! [X0] :
( v996(X0)
=> ~ v995(X0) ),
inference(unused_predicate_definition_removal,[],[f1161]) ).
fof(f2250,plain,
! [X0] :
( ( v1010(X0)
& v998(X0) )
=> v996(X0) ),
inference(unused_predicate_definition_removal,[],[f1162]) ).
fof(f2251,plain,
! [X0] :
( ( v1000(X0,bitIndex1)
| v1000(X0,bitIndex0) )
=> v1010(X0) ),
inference(unused_predicate_definition_removal,[],[f1163]) ).
fof(f2252,plain,
! [X0] :
( ~ v998(X0)
=> v999(X0) ),
inference(unused_predicate_definition_removal,[],[f1164]) ).
fof(f2253,plain,
! [X0] :
( v999(X0)
=> ( v1000(X0,bitIndex1)
& v1000(X0,bitIndex0) ) ),
inference(unused_predicate_definition_removal,[],[f1165]) ).
fof(f2429,plain,
? [X0] :
( ~ v4(X0)
& reachableState(X0) ),
inference(ennf_transformation,[],[f1159]) ).
fof(f2430,plain,
! [X0] :
( v995(X0)
| v4(X0) ),
inference(ennf_transformation,[],[f2248]) ).
fof(f2431,plain,
! [X0] :
( ~ v995(X0)
| ~ v996(X0) ),
inference(ennf_transformation,[],[f2249]) ).
fof(f2432,plain,
! [X0] :
( v996(X0)
| ~ v1010(X0)
| ~ v998(X0) ),
inference(ennf_transformation,[],[f2250]) ).
fof(f2433,plain,
! [X0] :
( v996(X0)
| ~ v1010(X0)
| ~ v998(X0) ),
inference(flattening,[],[f2432]) ).
fof(f2434,plain,
! [X0] :
( v1010(X0)
| ( ~ v1000(X0,bitIndex1)
& ~ v1000(X0,bitIndex0) ) ),
inference(ennf_transformation,[],[f2251]) ).
fof(f2435,plain,
! [X0] :
( v999(X0)
| v998(X0) ),
inference(ennf_transformation,[],[f2252]) ).
fof(f2436,plain,
! [X0] :
( ( v1000(X0,bitIndex1)
& v1000(X0,bitIndex0) )
| ~ v999(X0) ),
inference(ennf_transformation,[],[f2253]) ).
fof(f3108,plain,
( ? [X0] :
( ~ v4(X0)
& reachableState(X0) )
=> ( ~ v4(sK391)
& reachableState(sK391) ) ),
introduced(choice_axiom,[]) ).
fof(f3109,plain,
( ~ v4(sK391)
& reachableState(sK391) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK391])],[f2429,f3108]) ).
fof(f3110,plain,
! [X0] :
( ( v1000(X0,bitIndex0)
| ~ v1001(X0) )
& ( v1001(X0)
| ~ v1000(X0,bitIndex0) ) ),
inference(nnf_transformation,[],[f1166]) ).
fof(f3111,plain,
! [X0] :
( ( v1001(X0)
| ~ v1007(X0,bitIndex5)
| ~ v1003(X0) )
& ( ( v1007(X0,bitIndex5)
& v1003(X0) )
| ~ v1001(X0) ) ),
inference(nnf_transformation,[],[f1169]) ).
fof(f3112,plain,
! [X0] :
( ( v1001(X0)
| ~ v1007(X0,bitIndex5)
| ~ v1003(X0) )
& ( ( v1007(X0,bitIndex5)
& v1003(X0) )
| ~ v1001(X0) ) ),
inference(flattening,[],[f3111]) ).
fof(f4888,plain,
~ v4(sK391),
inference(cnf_transformation,[],[f3109]) ).
fof(f4889,plain,
! [X0] :
( v995(X0)
| v4(X0) ),
inference(cnf_transformation,[],[f2430]) ).
fof(f4890,plain,
! [X0] :
( ~ v995(X0)
| ~ v996(X0) ),
inference(cnf_transformation,[],[f2431]) ).
fof(f4891,plain,
! [X0] :
( v996(X0)
| ~ v1010(X0)
| ~ v998(X0) ),
inference(cnf_transformation,[],[f2433]) ).
fof(f4893,plain,
! [X0] :
( v1010(X0)
| ~ v1000(X0,bitIndex1) ),
inference(cnf_transformation,[],[f2434]) ).
fof(f4894,plain,
! [X0] :
( v999(X0)
| v998(X0) ),
inference(cnf_transformation,[],[f2435]) ).
fof(f4895,plain,
! [X0] :
( v1000(X0,bitIndex0)
| ~ v999(X0) ),
inference(cnf_transformation,[],[f2436]) ).
fof(f4897,plain,
! [X0] :
( v1001(X0)
| ~ v1000(X0,bitIndex0) ),
inference(cnf_transformation,[],[f3110]) ).
fof(f4899,plain,
! [X0] : v1000(X0,bitIndex1),
inference(cnf_transformation,[],[f1168]) ).
fof(f4901,plain,
! [X0] :
( v1007(X0,bitIndex5)
| ~ v1001(X0) ),
inference(cnf_transformation,[],[f3112]) ).
fof(f4921,plain,
! [X0] : ~ v1007(X0,bitIndex5),
inference(cnf_transformation,[],[f1177]) ).
cnf(c_85,negated_conjecture,
~ v4(sK391),
inference(cnf_transformation,[],[f4888]) ).
cnf(c_87,plain,
( v4(X0)
| v995(X0) ),
inference(cnf_transformation,[],[f4889]) ).
cnf(c_88,plain,
( ~ v995(X0)
| ~ v996(X0) ),
inference(cnf_transformation,[],[f4890]) ).
cnf(c_89,plain,
( ~ v1010(X0)
| ~ v998(X0)
| v996(X0) ),
inference(cnf_transformation,[],[f4891]) ).
cnf(c_90,plain,
( ~ v1000(X0,bitIndex1)
| v1010(X0) ),
inference(cnf_transformation,[],[f4893]) ).
cnf(c_92,plain,
( v998(X0)
| v999(X0) ),
inference(cnf_transformation,[],[f4894]) ).
cnf(c_94,plain,
( ~ v999(X0)
| v1000(X0,bitIndex0) ),
inference(cnf_transformation,[],[f4895]) ).
cnf(c_96,plain,
( ~ v1000(X0,bitIndex0)
| v1001(X0) ),
inference(cnf_transformation,[],[f4897]) ).
cnf(c_97,plain,
v1000(X0,bitIndex1),
inference(cnf_transformation,[],[f4899]) ).
cnf(c_99,plain,
( ~ v1001(X0)
| v1007(X0,bitIndex5) ),
inference(cnf_transformation,[],[f4901]) ).
cnf(c_119,plain,
~ v1007(X0,bitIndex5),
inference(cnf_transformation,[],[f4921]) ).
cnf(c_10008,plain,
v1010(X0),
inference(forward_subsumption_resolution,[status(thm)],[c_90,c_97]) ).
cnf(c_10021,plain,
~ v1001(X0),
inference(forward_subsumption_resolution,[status(thm)],[c_99,c_119]) ).
cnf(c_10022,plain,
~ v1000(X0,bitIndex0),
inference(backward_subsumption_resolution,[status(thm)],[c_96,c_10021]) ).
cnf(c_10023,plain,
~ v999(X0),
inference(backward_subsumption_resolution,[status(thm)],[c_94,c_10022]) ).
cnf(c_10024,plain,
v998(X0),
inference(backward_subsumption_resolution,[status(thm)],[c_92,c_10023]) ).
cnf(c_14758,plain,
v996(X0),
inference(forward_subsumption_resolution,[status(thm)],[c_89,c_10024,c_10008]) ).
cnf(c_14759,plain,
~ v995(X0),
inference(backward_subsumption_resolution,[status(thm)],[c_88,c_14758]) ).
cnf(c_14760,plain,
v4(X0),
inference(backward_subsumption_resolution,[status(thm)],[c_87,c_14759]) ).
cnf(c_14761,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_85,c_14760]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.08 % Problem : HWV095+1 : TPTP v8.1.2. Released v6.1.0.
% 0.05/0.09 % Command : run_iprover %s %d THM
% 0.09/0.27 % Computer : n032.cluster.edu
% 0.09/0.27 % Model : x86_64 x86_64
% 0.09/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.27 % Memory : 8042.1875MB
% 0.09/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.28 % CPULimit : 300
% 0.09/0.28 % WCLimit : 300
% 0.09/0.28 % DateTime : Fri May 3 01:00:39 EDT 2024
% 0.09/0.28 % CPUTime :
% 0.13/0.36 Running first-order theorem proving
% 0.13/0.36 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --heuristic_context casc_unsat --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 7.70/1.50 % SZS status Started for theBenchmark.p
% 7.70/1.50 % SZS status Theorem for theBenchmark.p
% 7.70/1.50
% 7.70/1.50 %---------------- iProver v3.9 (pre CASC 2024/SMT-COMP 2024) ----------------%
% 7.70/1.50
% 7.70/1.50 ------ iProver source info
% 7.70/1.50
% 7.70/1.50 git: date: 2024-05-02 19:28:25 +0000
% 7.70/1.50 git: sha1: a33b5eb135c74074ba803943bb12f2ebd971352f
% 7.70/1.50 git: non_committed_changes: false
% 7.70/1.50
% 7.70/1.50 ------ Parsing...
% 7.70/1.50 ------ Clausification by vclausify_rel & Parsing by iProver...------ preprocesses with Option_epr_non_horn_eq
% 7.70/1.50
% 7.70/1.50
% 7.70/1.50 ------ Preprocessing...
% 7.70/1.50
% 7.70/1.50 % SZS status Theorem for theBenchmark.p
% 7.70/1.50
% 7.70/1.50 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 7.70/1.50
% 7.70/1.50
%------------------------------------------------------------------------------