%------------------------------------------------------------------------------
% File : iProver---3.9.4
% Problem : HWV093+1 : TPTP v9.3.1. Released v6.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% Computer : n007.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8046.5625MB
% OS : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Fri Sep 25 01:42:57 PM UTC 2026
% Result : Theorem 2.47s 1.73s
% Output : CNFRefutation 2.47s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 11
% Syntax : Number of formulae : 62 ( 17 unt; 0 def)
% Number of atoms : 130 ( 0 equ)
% Maximal formula atoms : 6 ( 2 avg)
% Number of connectives : 119 ( 51 ~; 37 |; 14 &)
% ( 9 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 6 ( 4 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of types : 1 ( 0 usr)
% Number of type conns : 0 ( 0 >; 0 *; 0 +; 0 <<)
% 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 ( 0 sgn 57 !; 1 ?; 18 :)
% Comments :
%------------------------------------------------------------------------------
fof(f35,conjecture,
! [X0] :
( reachableState(X0)
=> v4(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',addAssertion) ).
fof(f36,negated_conjecture,
~ ! [X0] :
( reachableState(X0)
=> v4(X0) ),
inference(negated_conjecture,[status(cth)],[f35]) ).
fof(f37,axiom,
! [X0] :
( ~ v4(X0)
<=> v995(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',writeUnaryOperator_113) ).
fof(f38,axiom,
! [X0] :
( ~ v995(X0)
<=> v996(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',writeUnaryOperator_112) ).
fof(f39,axiom,
! [X0] :
( v996(X0)
<=> ( v1010(X0)
& v998(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',writeBinaryOperatorEqualRangesSingleBits_170) ).
fof(f40,axiom,
! [X0] :
( v1010(X0)
<=> ( v1000(X0,bitIndex1)
| v1000(X0,bitIndex0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',writeBinaryOperatorShiftedRanges_80) ).
fof(f41,axiom,
! [X0] :
( ~ v998(X0)
<=> v999(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',writeUnaryOperator_111) ).
fof(f42,axiom,
! [X0] :
( v999(X0)
<=> ( v1000(X0,bitIndex1)
& v1000(X0,bitIndex0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',writeBinaryOperatorShiftedRanges_79) ).
fof(f43,axiom,
! [X0] :
( v1000(X0,bitIndex0)
<=> v1001(X0) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',addAssignment_245) ).
fof(f44,axiom,
! [X0] :
( v1000(X0,bitIndex1)
<=> $true ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',addAssignment_244) ).
fof(f45,axiom,
! [X0] :
( v1001(X0)
<=> ( v1007(X0,bitIndex5)
& v1003(X0) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',writeBinaryOperatorShiftedRanges_78) ).
fof(f53,axiom,
! [X0] : ~ v1007(X0,bitIndex5),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',addZeroExtensionConstraint_3) ).
fof(f1158,plain,
! [X0] : v1000(X0,bitIndex1),
inference(true_and_false_elimination,[],[f44]) ).
fof(f1381,plain,
! [X0] :
( ~ v4(X0)
=> v995(X0) ),
inference(unused_predicate_definition_removal,[],[f37]) ).
fof(f1382,plain,
! [X0] :
( v996(X0)
=> ~ v995(X0) ),
inference(unused_predicate_definition_removal,[],[f38]) ).
fof(f1383,plain,
! [X0] :
( ( v1010(X0)
& v998(X0) )
=> v996(X0) ),
inference(unused_predicate_definition_removal,[],[f39]) ).
fof(f1384,plain,
! [X0] :
( ~ v998(X0)
=> v999(X0) ),
inference(unused_predicate_definition_removal,[],[f41]) ).
fof(f1385,plain,
! [X0] :
( v999(X0)
=> ( v1000(X0,bitIndex1)
& v1000(X0,bitIndex0) ) ),
inference(unused_predicate_definition_removal,[],[f42]) ).
fof(f1386,plain,
! [X0] :
( ( v1000(X0,bitIndex1)
| v1000(X0,bitIndex0) )
=> v1010(X0) ),
inference(unused_predicate_definition_removal,[],[f40]) ).
fof(f1562,plain,
? [X0] :
( reachableState(X0)
& ~ v4(X0) ),
inference(ennf_transformation,[],[f36]) ).
fof(f1563,plain,
! [X0] :
( v4(X0)
| v995(X0) ),
inference(ennf_transformation,[],[f1381]) ).
fof(f1564,plain,
! [X0] :
( ~ v996(X0)
| ~ v995(X0) ),
inference(ennf_transformation,[],[f1382]) ).
fof(f1565,plain,
! [X0] :
( ~ v1010(X0)
| ~ v998(X0)
| v996(X0) ),
inference(ennf_transformation,[],[f1383]) ).
fof(f1566,plain,
! [X0] :
( ~ v1010(X0)
| ~ v998(X0)
| v996(X0) ),
inference(flattening,[],[f1565]) ).
fof(f1567,plain,
! [X0] :
( ( ~ v1000(X0,bitIndex1)
& ~ v1000(X0,bitIndex0) )
| v1010(X0) ),
inference(ennf_transformation,[],[f1386]) ).
fof(f1568,plain,
! [X0] :
( v998(X0)
| v999(X0) ),
inference(ennf_transformation,[],[f1384]) ).
fof(f1569,plain,
! [X0] :
( ~ v999(X0)
| ( v1000(X0,bitIndex1)
& v1000(X0,bitIndex0) ) ),
inference(ennf_transformation,[],[f1385]) ).
fof(f2241,plain,
( reachableState(sK391)
& ~ v4(sK391) ),
inference(skolemize,[status(esa),new_symbols(skolem,[sK391]),skolemize(X0,sK391)],[f1562]) ).
fof(f2242,plain,
! [X0] :
( ( ~ v1000(X0,bitIndex0)
| v1001(X0) )
& ( ~ v1001(X0)
| v1000(X0,bitIndex0) ) ),
inference(nnf_transformation,[],[f43]) ).
fof(f2243,plain,
! [X0] :
( ( ~ v1001(X0)
| ( v1007(X0,bitIndex5)
& v1003(X0) ) )
& ( ~ v1007(X0,bitIndex5)
| ~ v1003(X0)
| v1001(X0) ) ),
inference(nnf_transformation,[],[f45]) ).
fof(f2244,plain,
! [X0] :
( ( ~ v1001(X0)
| ( v1007(X0,bitIndex5)
& v1003(X0) ) )
& ( ~ v1007(X0,bitIndex5)
| ~ v1003(X0)
| v1001(X0) ) ),
inference(flattening,[],[f2243]) ).
fof(f4020,plain,
~ v4(sK391),
inference(cnf_transformation,[],[f2241]) ).
fof(f4021,plain,
! [X0] :
( v4(X0)
| v995(X0) ),
inference(cnf_transformation,[],[f1563]) ).
fof(f4022,plain,
! [X0] :
( ~ v996(X0)
| ~ v995(X0) ),
inference(cnf_transformation,[],[f1564]) ).
fof(f4023,plain,
! [X0] :
( ~ v1010(X0)
| ~ v998(X0)
| v996(X0) ),
inference(cnf_transformation,[],[f1566]) ).
fof(f4024,plain,
! [X0] :
( ~ v1000(X0,bitIndex1)
| v1010(X0) ),
inference(cnf_transformation,[],[f1567]) ).
fof(f4026,plain,
! [X0] :
( v998(X0)
| v999(X0) ),
inference(cnf_transformation,[],[f1568]) ).
fof(f4028,plain,
! [X0] :
( ~ v999(X0)
| v1000(X0,bitIndex0) ),
inference(cnf_transformation,[],[f1569]) ).
fof(f4029,plain,
! [X0] :
( ~ v1000(X0,bitIndex0)
| v1001(X0) ),
inference(cnf_transformation,[],[f2242]) ).
fof(f4031,plain,
! [X0] : v1000(X0,bitIndex1),
inference(cnf_transformation,[],[f1158]) ).
fof(f4032,plain,
! [X0] :
( ~ v1001(X0)
| v1007(X0,bitIndex5) ),
inference(cnf_transformation,[],[f2244]) ).
fof(f4053,plain,
! [X0] : ~ v1007(X0,bitIndex5),
inference(cnf_transformation,[],[f53]) ).
tcf(c_85,negated_conjecture,
~ v4(sK391),
inference(cnf_transformation,[],[f4020]) ).
tcf(c_87,plain,
! [X0: $i] :
( v995(X0)
| v4(X0) ),
inference(cnf_transformation,[],[f4021]) ).
tcf(c_88,plain,
! [X0: $i] :
( ~ v996(X0)
| ~ v995(X0) ),
inference(cnf_transformation,[],[f4022]) ).
tcf(c_89,plain,
! [X0: $i] :
( v996(X0)
| ~ v1010(X0)
| ~ v998(X0) ),
inference(cnf_transformation,[],[f4023]) ).
tcf(c_91,plain,
! [X0: $i] :
( v1010(X0)
| ~ v1000(X0,bitIndex1) ),
inference(cnf_transformation,[],[f4024]) ).
tcf(c_92,plain,
! [X0: $i] :
( v999(X0)
| v998(X0) ),
inference(cnf_transformation,[],[f4026]) ).
tcf(c_93,plain,
! [X0: $i] :
( v1000(X0,bitIndex0)
| ~ v999(X0) ),
inference(cnf_transformation,[],[f4028]) ).
tcf(c_96,plain,
! [X0: $i] :
( v1001(X0)
| ~ v1000(X0,bitIndex0) ),
inference(cnf_transformation,[],[f4029]) ).
tcf(c_97,plain,
! [X0: $i] : v1000(X0,bitIndex1),
inference(cnf_transformation,[],[f4031]) ).
tcf(c_100,plain,
! [X0: $i] :
( v1007(X0,bitIndex5)
| ~ v1001(X0) ),
inference(cnf_transformation,[],[f4032]) ).
tcf(c_119,plain,
! [X0: $i] : ~ v1007(X0,bitIndex5),
inference(cnf_transformation,[],[f4053]) ).
tcf(c_10012,plain,
! [X0: $i] : v1010(X0),
inference(forward_subsumption_resolution,[status(thm)],[c_91,c_97]) ).
tcf(c_10025,plain,
! [X0: $i] : ~ v1001(X0),
inference(forward_subsumption_resolution,[status(thm)],[c_100,c_119]) ).
tcf(c_10026,plain,
! [X0: $i] : ~ v1000(X0,bitIndex0),
inference(backward_subsumption_resolution,[status(thm)],[c_96,c_10025]) ).
tcf(c_10027,plain,
! [X0: $i] : ~ v999(X0),
inference(backward_subsumption_resolution,[status(thm)],[c_93,c_10026]) ).
tcf(c_10028,plain,
! [X0: $i] : v998(X0),
inference(backward_subsumption_resolution,[status(thm)],[c_92,c_10027]) ).
tcf(c_14782,plain,
! [X0: $i] : v996(X0),
inference(forward_subsumption_resolution,[status(thm)],[c_89,c_10012,c_10028]) ).
tcf(c_14783,plain,
! [X0: $i] : ~ v995(X0),
inference(backward_subsumption_resolution,[status(thm)],[c_88,c_14782]) ).
tcf(c_14784,plain,
! [X0: $i] : v4(X0),
inference(backward_subsumption_resolution,[status(thm)],[c_87,c_14783]) ).
tcf(c_14785,plain,
$false,
inference(backward_subsumption_resolution,[status(thm)],[c_85,c_14784]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : HWV093+1 : TPTP v9.3.1. Released v6.1.0.
% 0.00/0.04 % Command : run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.38 % Computer : n007.cluster.edu
% 0.10/0.38 % Model : x86_64 x86_64
% 0.10/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.38 % Memory : 8046.5625MB
% 0.10/0.38 % OS : Linux 6.8.0-71-generic
% 0.10/0.38 % CPULimit : 300
% 0.10/0.38 % WCLimit : 300
% 0.10/0.38 % DateTime : Wed Sep 23 17:02:16 UTC 2026
% 0.10/0.38 % CPUTime :
% 0.10/0.38 Running run_iprover 300 /export/starexec/sandbox2/benchmark/theBenchmark.p THM
% 0.10/0.42 Running first-order theorem proving
% 0.10/0.42 Running: /export/starexec/sandbox2/solver/bin/iproveropt-multi-core.sh -d -n -l tptp -s fof_schedule -t 300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.10/0.43
% 0.10/0.43 % ======== iProver multi-core TPTP/SMT =========
% 0.10/0.43
% 0.10/0.43 % Detected problem language: tptp
% 0.10/0.44 % Proving...
% 2.47/1.73 % SZS status Started for theBenchmark.p
% 2.47/1.73 % SZS status Theorem for theBenchmark.p
% 2.47/1.73
% 2.47/1.73 %---------------- iProver v3.9.4 (pre CASC 2026/SMT-COMP 2026) ----------------%
% 2.47/1.73
% 2.47/1.73 % ------ iProver source info
% 2.47/1.73
% 2.47/1.73 % git: date: 2026-07-19 20:42:38 +0200
% 2.47/1.73 % git: sha1: 804e7d636a263075307957e923b7a22a4035de61
% 2.47/1.73 % git: non_committed_changes: false
% 2.47/1.73
% 2.47/1.73 % ------ Parsing...
% 2.47/1.73 % ------ Clausification by vclausify_rel & Parsing by iProver...% ------ preprocesses with Option_epr_non_horn_eq
% 2.47/1.73 %
% 2.47/1.73
% 2.47/1.73 % ------ Preprocessing...%
% 2.47/1.73
% 2.47/1.73 % SZS status Theorem for theBenchmark.p
% 2.47/1.73
% 2.47/1.73 % SZS output start CNFRefutation for theBenchmark.p
% See solution above
% 2.47/1.73
% 2.47/1.73
%------------------------------------------------------------------------------