TSTP Solution File: HWV089+1 by iProver---3.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : iProver---3.8
% Problem : HWV089+1 : TPTP v8.1.2. Released v6.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover %s %d THM
% Computer : n003.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 : Thu Aug 31 02:23:35 EDT 2023
% Result : Theorem 18.65s 3.18s
% Output : CNFRefutation 18.65s
% 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(f321,conjecture,
! [X1] :
( reachableState(X1)
=> v4(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',addAssertion) ).
fof(f322,negated_conjecture,
~ ! [X1] :
( reachableState(X1)
=> v4(X1) ),
inference(negated_conjecture,[],[f321]) ).
fof(f323,axiom,
! [X1] :
( ~ v4(X1)
<=> v3674(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',writeUnaryOperator_347) ).
fof(f324,axiom,
! [X1] :
( ~ v3674(X1)
<=> v3675(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',writeUnaryOperator_346) ).
fof(f325,axiom,
! [X1] :
( v3675(X1)
<=> ( v3693(X1)
& v3677(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',writeBinaryOperatorEqualRangesSingleBits_740) ).
fof(f326,axiom,
! [X1] :
( v3693(X1)
<=> ( v3679(X1,bitIndex1)
| v3679(X1,bitIndex0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',writeBinaryOperatorShiftedRanges_555) ).
fof(f327,axiom,
! [X1] :
( ~ v3677(X1)
<=> v3678(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',writeUnaryOperator_345) ).
fof(f328,axiom,
! [X1] :
( v3678(X1)
<=> ( v3679(X1,bitIndex1)
& v3679(X1,bitIndex0) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',writeBinaryOperatorShiftedRanges_554) ).
fof(f329,axiom,
! [X1] :
( v3679(X1,bitIndex0)
<=> v3680(X1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',addAssignment_2619) ).
fof(f330,axiom,
! [X1] :
( v3679(X1,bitIndex1)
<=> $true ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',addAssignment_2618) ).
fof(f331,axiom,
! [X1] :
( v3680(X1)
<=> ( v3684(X1,bitIndex5)
& v3682(X1) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',writeBinaryOperatorShiftedRanges_553) ).
fof(f344,axiom,
! [X1] : ~ v3684(X1,bitIndex5),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',addZeroExtensionConstraint_5) ).
fof(f6384,plain,
~ ! [X0] :
( reachableState(X0)
=> v4(X0) ),
inference(rectify,[],[f322]) ).
fof(f6385,plain,
! [X0] :
( ~ v4(X0)
<=> v3674(X0) ),
inference(rectify,[],[f323]) ).
fof(f6386,plain,
! [X0] :
( ~ v3674(X0)
<=> v3675(X0) ),
inference(rectify,[],[f324]) ).
fof(f6387,plain,
! [X0] :
( v3675(X0)
<=> ( v3693(X0)
& v3677(X0) ) ),
inference(rectify,[],[f325]) ).
fof(f6388,plain,
! [X0] :
( v3693(X0)
<=> ( v3679(X0,bitIndex1)
| v3679(X0,bitIndex0) ) ),
inference(rectify,[],[f326]) ).
fof(f6389,plain,
! [X0] :
( ~ v3677(X0)
<=> v3678(X0) ),
inference(rectify,[],[f327]) ).
fof(f6390,plain,
! [X0] :
( v3678(X0)
<=> ( v3679(X0,bitIndex1)
& v3679(X0,bitIndex0) ) ),
inference(rectify,[],[f328]) ).
fof(f6391,plain,
! [X0] :
( v3679(X0,bitIndex0)
<=> v3680(X0) ),
inference(rectify,[],[f329]) ).
fof(f6392,plain,
! [X0] :
( v3679(X0,bitIndex1)
<=> $true ),
inference(rectify,[],[f330]) ).
fof(f6393,plain,
! [X0] : v3679(X0,bitIndex1),
inference(true_and_false_elimination,[],[f6392]) ).
fof(f6394,plain,
! [X0] :
( v3680(X0)
<=> ( v3684(X0,bitIndex5)
& v3682(X0) ) ),
inference(rectify,[],[f331]) ).
fof(f6407,plain,
! [X0] : ~ v3684(X0,bitIndex5),
inference(rectify,[],[f344]) ).
fof(f12062,plain,
! [X0] :
( ~ v4(X0)
=> v3674(X0) ),
inference(unused_predicate_definition_removal,[],[f6385]) ).
fof(f12063,plain,
! [X0] :
( v3675(X0)
=> ~ v3674(X0) ),
inference(unused_predicate_definition_removal,[],[f6386]) ).
fof(f12064,plain,
! [X0] :
( ( v3693(X0)
& v3677(X0) )
=> v3675(X0) ),
inference(unused_predicate_definition_removal,[],[f6387]) ).
fof(f12065,plain,
! [X0] :
( ( v3679(X0,bitIndex1)
| v3679(X0,bitIndex0) )
=> v3693(X0) ),
inference(unused_predicate_definition_removal,[],[f6388]) ).
fof(f12066,plain,
! [X0] :
( ~ v3677(X0)
=> v3678(X0) ),
inference(unused_predicate_definition_removal,[],[f6389]) ).
fof(f12067,plain,
! [X0] :
( v3678(X0)
=> ( v3679(X0,bitIndex1)
& v3679(X0,bitIndex0) ) ),
inference(unused_predicate_definition_removal,[],[f6390]) ).
fof(f12333,plain,
? [X0] :
( ~ v4(X0)
& reachableState(X0) ),
inference(ennf_transformation,[],[f6384]) ).
fof(f12334,plain,
! [X0] :
( v3674(X0)
| v4(X0) ),
inference(ennf_transformation,[],[f12062]) ).
fof(f12335,plain,
! [X0] :
( ~ v3674(X0)
| ~ v3675(X0) ),
inference(ennf_transformation,[],[f12063]) ).
fof(f12336,plain,
! [X0] :
( v3675(X0)
| ~ v3693(X0)
| ~ v3677(X0) ),
inference(ennf_transformation,[],[f12064]) ).
fof(f12337,plain,
! [X0] :
( v3675(X0)
| ~ v3693(X0)
| ~ v3677(X0) ),
inference(flattening,[],[f12336]) ).
fof(f12338,plain,
! [X0] :
( v3693(X0)
| ( ~ v3679(X0,bitIndex1)
& ~ v3679(X0,bitIndex0) ) ),
inference(ennf_transformation,[],[f12065]) ).
fof(f12339,plain,
! [X0] :
( v3678(X0)
| v3677(X0) ),
inference(ennf_transformation,[],[f12066]) ).
fof(f12340,plain,
! [X0] :
( ( v3679(X0,bitIndex1)
& v3679(X0,bitIndex0) )
| ~ v3678(X0) ),
inference(ennf_transformation,[],[f12067]) ).
fof(f13647,plain,
( ? [X0] :
( ~ v4(X0)
& reachableState(X0) )
=> ( ~ v4(sK165)
& reachableState(sK165) ) ),
introduced(choice_axiom,[]) ).
fof(f13648,plain,
( ~ v4(sK165)
& reachableState(sK165) ),
inference(skolemisation,[status(esa),new_symbols(skolem,[sK165])],[f12333,f13647]) ).
fof(f13649,plain,
! [X0] :
( ( v3679(X0,bitIndex0)
| ~ v3680(X0) )
& ( v3680(X0)
| ~ v3679(X0,bitIndex0) ) ),
inference(nnf_transformation,[],[f6391]) ).
fof(f13650,plain,
! [X0] :
( ( v3680(X0)
| ~ v3684(X0,bitIndex5)
| ~ v3682(X0) )
& ( ( v3684(X0,bitIndex5)
& v3682(X0) )
| ~ v3680(X0) ) ),
inference(nnf_transformation,[],[f6394]) ).
fof(f13651,plain,
! [X0] :
( ( v3680(X0)
| ~ v3684(X0,bitIndex5)
| ~ v3682(X0) )
& ( ( v3684(X0,bitIndex5)
& v3682(X0) )
| ~ v3680(X0) ) ),
inference(flattening,[],[f13650]) ).
fof(f20678,plain,
~ v4(sK165),
inference(cnf_transformation,[],[f13648]) ).
fof(f20679,plain,
! [X0] :
( v3674(X0)
| v4(X0) ),
inference(cnf_transformation,[],[f12334]) ).
fof(f20680,plain,
! [X0] :
( ~ v3674(X0)
| ~ v3675(X0) ),
inference(cnf_transformation,[],[f12335]) ).
fof(f20681,plain,
! [X0] :
( v3675(X0)
| ~ v3693(X0)
| ~ v3677(X0) ),
inference(cnf_transformation,[],[f12337]) ).
fof(f20683,plain,
! [X0] :
( v3693(X0)
| ~ v3679(X0,bitIndex1) ),
inference(cnf_transformation,[],[f12338]) ).
fof(f20684,plain,
! [X0] :
( v3678(X0)
| v3677(X0) ),
inference(cnf_transformation,[],[f12339]) ).
fof(f20685,plain,
! [X0] :
( v3679(X0,bitIndex0)
| ~ v3678(X0) ),
inference(cnf_transformation,[],[f12340]) ).
fof(f20687,plain,
! [X0] :
( v3680(X0)
| ~ v3679(X0,bitIndex0) ),
inference(cnf_transformation,[],[f13649]) ).
fof(f20689,plain,
! [X0] : v3679(X0,bitIndex1),
inference(cnf_transformation,[],[f6393]) ).
fof(f20691,plain,
! [X0] :
( v3684(X0,bitIndex5)
| ~ v3680(X0) ),
inference(cnf_transformation,[],[f13651]) ).
fof(f20722,plain,
! [X0] : ~ v3684(X0,bitIndex5),
inference(cnf_transformation,[],[f6407]) ).
cnf(c_470,negated_conjecture,
~ v4(sK165),
inference(cnf_transformation,[],[f20678]) ).
cnf(c_472,plain,
( v4(X0)
| v3674(X0) ),
inference(cnf_transformation,[],[f20679]) ).
cnf(c_473,plain,
( ~ v3674(X0)
| ~ v3675(X0) ),
inference(cnf_transformation,[],[f20680]) ).
cnf(c_474,plain,
( ~ v3693(X0)
| ~ v3677(X0)
| v3675(X0) ),
inference(cnf_transformation,[],[f20681]) ).
cnf(c_475,plain,
( ~ v3679(X0,bitIndex1)
| v3693(X0) ),
inference(cnf_transformation,[],[f20683]) ).
cnf(c_477,plain,
( v3677(X0)
| v3678(X0) ),
inference(cnf_transformation,[],[f20684]) ).
cnf(c_479,plain,
( ~ v3678(X0)
| v3679(X0,bitIndex0) ),
inference(cnf_transformation,[],[f20685]) ).
cnf(c_481,plain,
( ~ v3679(X0,bitIndex0)
| v3680(X0) ),
inference(cnf_transformation,[],[f20687]) ).
cnf(c_482,plain,
v3679(X0,bitIndex1),
inference(cnf_transformation,[],[f20689]) ).
cnf(c_484,plain,
( ~ v3680(X0)
| v3684(X0,bitIndex5) ),
inference(cnf_transformation,[],[f20691]) ).
cnf(c_515,plain,
~ v3684(X0,bitIndex5),
inference(cnf_transformation,[],[f20722]) ).
cnf(c_37344,plain,
v3693(X0),
inference(forward_subsumption_resolution,[status(thm)],[c_475,c_482]) ).
cnf(c_37357,plain,
~ v3680(X0),
inference(forward_subsumption_resolution,[status(thm)],[c_484,c_515]) ).
cnf(c_37358,plain,
~ v3679(X0,bitIndex0),
inference(backward_subsumption_resolution,[status(thm)],[c_481,c_37357]) ).
cnf(c_37359,plain,
~ v3678(X0),
inference(backward_subsumption_resolution,[status(thm)],[c_479,c_37358]) ).
cnf(c_37360,plain,
v3677(X0),
inference(backward_subsumption_resolution,[status(thm)],[c_477,c_37359]) ).
cnf(c_69832,plain,
v3675(X0),
inference(forward_subsumption_resolution,[status(thm)],[c_474,c_37360,c_37344]) ).
cnf(c_69833,plain,
~ v3674(X0),
inference(backward_subsumption_resolution,[status(thm)],[c_473,c_69832]) ).
cnf(c_69834,plain,
v4(X0),
inference(backward_subsumption_resolution,[status(thm)],[c_472,c_69833]) ).
cnf(c_69835,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_470,c_69834]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : HWV089+1 : TPTP v8.1.2. Released v6.1.0.
% 0.07/0.14 % Command : run_iprover %s %d THM
% 0.14/0.35 % Computer : n003.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Tue Aug 29 14:16:26 EDT 2023
% 0.14/0.35 % CPUTime :
% 0.21/0.48 Running first-order theorem proving
% 0.21/0.48 Running: /export/starexec/sandbox/solver/bin/run_problem --schedule fof_schedule --no_cores 8 /export/starexec/sandbox/benchmark/theBenchmark.p 300
% 18.65/3.18 % SZS status Started for theBenchmark.p
% 18.65/3.18 % SZS status Theorem for theBenchmark.p
% 18.65/3.18
% 18.65/3.18 %---------------- iProver v3.8 (pre SMT-COMP 2023/CASC 2023) ----------------%
% 18.65/3.18
% 18.65/3.18 ------ iProver source info
% 18.65/3.18
% 18.65/3.18 git: date: 2023-05-31 18:12:56 +0000
% 18.65/3.18 git: sha1: 8abddc1f627fd3ce0bcb8b4cbf113b3cc443d7b6
% 18.65/3.18 git: non_committed_changes: false
% 18.65/3.18 git: last_make_outside_of_git: false
% 18.65/3.18
% 18.65/3.18 ------ Parsing...
% 18.65/3.18 ------ Clausification by vclausify_rel & Parsing by iProver...------ preprocesses with Option_epr_non_horn_eq
% 18.65/3.18
% 18.65/3.18
% 18.65/3.18 ------ Preprocessing...
% 18.65/3.18
% 18.65/3.18 % SZS status Theorem for theBenchmark.p
% 18.65/3.18
% 18.65/3.18 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 18.65/3.18
% 18.65/3.18
%------------------------------------------------------------------------------