TSTP Solution File: HWV089+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : HWV089+1 : TPTP v8.1.0. Released v6.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% 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 19:15:56 EDT 2022
% Result : Theorem 22.32s 22.49s
% Output : Refutation 22.32s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 12
% Syntax : Number of clauses : 22 ( 13 unt; 2 nHn; 22 RR)
% Number of literals : 32 ( 0 equ; 16 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 11 ( 10 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 5 con; 0-0 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(314,axiom,
~ v4(skc1),
file('HWV089+1.p',unknown),
[] ).
cnf(409,axiom,
v3679(u,bitIndex1),
file('HWV089+1.p',unknown),
[] ).
cnf(885,axiom,
( v4(u)
| v3674(u) ),
file('HWV089+1.p',unknown),
[] ).
cnf(887,axiom,
( v3677(u)
| v3678(u) ),
file('HWV089+1.p',unknown),
[] ).
cnf(889,axiom,
~ v3684(u,bitIndex4),
file('HWV089+1.p',unknown),
[] ).
cnf(1207,axiom,
( ~ v3680(u)
| v3682(u) ),
file('HWV089+1.p',unknown),
[] ).
cnf(3464,axiom,
( ~ v3675(u)
| ~ v3674(u) ),
file('HWV089+1.p',unknown),
[] ).
cnf(3466,axiom,
( ~ v3679(u,bitIndex1)
| v3693(u) ),
file('HWV089+1.p',unknown),
[] ).
cnf(3468,axiom,
( ~ v3678(u)
| v3679(u,bitIndex0) ),
file('HWV089+1.p',unknown),
[] ).
cnf(3470,axiom,
( ~ v3679(u,bitIndex0)
| v3680(u) ),
file('HWV089+1.p',unknown),
[] ).
cnf(3473,axiom,
( ~ v3682(u)
| v3684(u,bitIndex4) ),
file('HWV089+1.p',unknown),
[] ).
cnf(12051,axiom,
( ~ v3677(u)
| ~ v3693(u)
| v3675(u) ),
file('HWV089+1.p',unknown),
[] ).
cnf(15026,plain,
~ v3682(u),
inference(mrr,[status(thm)],[3473,889]),
[iquote('0:MRR:3473.1,889.0')] ).
cnf(15027,plain,
~ v3680(u),
inference(mrr,[status(thm)],[1207,15026]),
[iquote('0:MRR:1207.1,15026.0')] ).
cnf(15028,plain,
~ v3679(u,bitIndex0),
inference(mrr,[status(thm)],[3470,15027]),
[iquote('0:MRR:3470.1,15027.0')] ).
cnf(15029,plain,
~ v3678(u),
inference(mrr,[status(thm)],[3468,15028]),
[iquote('0:MRR:3468.1,15028.0')] ).
cnf(15030,plain,
v3677(u),
inference(mrr,[status(thm)],[887,15029]),
[iquote('0:MRR:887.1,15029.0')] ).
cnf(15031,plain,
v3693(u),
inference(mrr,[status(thm)],[3466,409]),
[iquote('0:MRR:3466.0,409.0')] ).
cnf(15097,plain,
v3675(u),
inference(mrr,[status(thm)],[12051,15030,15031]),
[iquote('0:MRR:12051.0,12051.1,15030.0,15031.0')] ).
cnf(15098,plain,
~ v3674(u),
inference(mrr,[status(thm)],[3464,15097]),
[iquote('0:MRR:3464.0,15097.0')] ).
cnf(15099,plain,
v4(u),
inference(mrr,[status(thm)],[885,15098]),
[iquote('0:MRR:885.1,15098.0')] ).
cnf(15100,plain,
$false,
inference(unc,[status(thm)],[15099,314]),
[iquote('0:UnC:15099.0,314.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : HWV089+1 : TPTP v8.1.0. Released v6.1.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.13/0.33 % Computer : n010.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Thu Jun 16 22:09:53 EDT 2022
% 0.13/0.34 % CPUTime :
% 22.32/22.49
% 22.32/22.49 SPASS V 3.9
% 22.32/22.49 SPASS beiseite: Proof found.
% 22.32/22.49 % SZS status Theorem
% 22.32/22.49 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 22.32/22.49 SPASS derived 15 clauses, backtracked 0 clauses, performed 0 splits and kept 12514 clauses.
% 22.32/22.49 SPASS allocated 125492 KBytes.
% 22.32/22.49 SPASS spent 0:0:21.14 on the problem.
% 22.32/22.49 0:00:00.09 for the input.
% 22.32/22.49 0:00:06.77 for the FLOTTER CNF translation.
% 22.32/22.49 0:00:00.00 for inferences.
% 22.32/22.49 0:00:00.00 for the backtracking.
% 22.32/22.49 0:0:10.12 for the reduction.
% 22.32/22.49
% 22.32/22.49
% 22.32/22.49 Here is a proof with depth 0, length 22 :
% 22.32/22.49 % SZS output start Refutation
% See solution above
% 22.32/22.49 Formulae used in the proof : addAssertion addAssignment_2618 writeUnaryOperator_347 writeUnaryOperator_345 addZeroExtensionConstraint_6 writeBinaryOperatorShiftedRanges_553 writeUnaryOperator_346 writeBinaryOperatorShiftedRanges_555 writeBinaryOperatorShiftedRanges_554 addAssignment_2619 writeBinaryOperatorShiftedRanges_552 writeBinaryOperatorEqualRangesSingleBits_740
% 22.32/22.49
%------------------------------------------------------------------------------