TSTP Solution File: HWV095+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : HWV095+1 : TPTP v8.1.0. Released v6.1.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n016.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:16:01 EDT 2022
% Result : Theorem 1.90s 2.08s
% Output : Refutation 1.90s
% 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(38,axiom,
~ v4(skc1),
file('HWV095+1.p',unknown),
[] ).
cnf(49,axiom,
v1000(u,bitIndex1),
file('HWV095+1.p',unknown),
[] ).
cnf(235,axiom,
( v4(u)
| v995(u) ),
file('HWV095+1.p',unknown),
[] ).
cnf(237,axiom,
( v998(u)
| v999(u) ),
file('HWV095+1.p',unknown),
[] ).
cnf(238,axiom,
~ v1007(u,bitIndex4),
file('HWV095+1.p',unknown),
[] ).
cnf(306,axiom,
( ~ v1001(u)
| v1003(u) ),
file('HWV095+1.p',unknown),
[] ).
cnf(890,axiom,
( ~ v996(u)
| ~ v995(u) ),
file('HWV095+1.p',unknown),
[] ).
cnf(892,axiom,
( ~ v1000(u,bitIndex1)
| v1010(u) ),
file('HWV095+1.p',unknown),
[] ).
cnf(894,axiom,
( ~ v999(u)
| v1000(u,bitIndex0) ),
file('HWV095+1.p',unknown),
[] ).
cnf(896,axiom,
( ~ v1000(u,bitIndex0)
| v1001(u) ),
file('HWV095+1.p',unknown),
[] ).
cnf(899,axiom,
( ~ v1003(u)
| v1007(u,bitIndex4) ),
file('HWV095+1.p',unknown),
[] ).
cnf(2037,axiom,
( ~ v998(u)
| ~ v1010(u)
| v996(u) ),
file('HWV095+1.p',unknown),
[] ).
cnf(3430,plain,
~ v1003(u),
inference(mrr,[status(thm)],[899,238]),
[iquote('0:MRR:899.1,238.0')] ).
cnf(3431,plain,
~ v1001(u),
inference(mrr,[status(thm)],[306,3430]),
[iquote('0:MRR:306.1,3430.0')] ).
cnf(3432,plain,
~ v1000(u,bitIndex0),
inference(mrr,[status(thm)],[896,3431]),
[iquote('0:MRR:896.1,3431.0')] ).
cnf(3433,plain,
~ v999(u),
inference(mrr,[status(thm)],[894,3432]),
[iquote('0:MRR:894.1,3432.0')] ).
cnf(3434,plain,
v998(u),
inference(mrr,[status(thm)],[237,3433]),
[iquote('0:MRR:237.1,3433.0')] ).
cnf(3435,plain,
v1010(u),
inference(mrr,[status(thm)],[892,49]),
[iquote('0:MRR:892.0,49.0')] ).
cnf(3464,plain,
v996(u),
inference(mrr,[status(thm)],[2037,3434,3435]),
[iquote('0:MRR:2037.0,2037.1,3434.0,3435.0')] ).
cnf(3465,plain,
~ v995(u),
inference(mrr,[status(thm)],[890,3464]),
[iquote('0:MRR:890.0,3464.0')] ).
cnf(3466,plain,
v4(u),
inference(mrr,[status(thm)],[235,3465]),
[iquote('0:MRR:235.1,3465.0')] ).
cnf(3467,plain,
$false,
inference(unc,[status(thm)],[3466,38]),
[iquote('0:UnC:3466.0,38.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : HWV095+1 : TPTP v8.1.0. Released v6.1.0.
% 0.03/0.13 % Command : run_spass %d %s
% 0.12/0.34 % Computer : n016.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Fri Jun 17 10:09:05 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.90/2.08
% 1.90/2.08 SPASS V 3.9
% 1.90/2.08 SPASS beiseite: Proof found.
% 1.90/2.08 % SZS status Theorem
% 1.90/2.08 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.90/2.08 SPASS derived 5 clauses, backtracked 0 clauses, performed 0 splits and kept 2210 clauses.
% 1.90/2.08 SPASS allocated 104462 KBytes.
% 1.90/2.08 SPASS spent 0:00:01.66 on the problem.
% 1.90/2.08 0:00:00.05 for the input.
% 1.90/2.08 0:00:00.90 for the FLOTTER CNF translation.
% 1.90/2.08 0:00:00.00 for inferences.
% 1.90/2.08 0:00:00.00 for the backtracking.
% 1.90/2.08 0:00:00.40 for the reduction.
% 1.90/2.08
% 1.90/2.08
% 1.90/2.08 Here is a proof with depth 0, length 22 :
% 1.90/2.08 % SZS output start Refutation
% See solution above
% 1.90/2.08 Formulae used in the proof : addAssertion addAssignment_244 writeUnaryOperator_113 writeUnaryOperator_111 addZeroExtensionConstraint_4 writeBinaryOperatorShiftedRanges_78 writeUnaryOperator_112 writeBinaryOperatorShiftedRanges_80 writeBinaryOperatorShiftedRanges_79 addAssignment_245 writeBinaryOperatorShiftedRanges_77 writeBinaryOperatorEqualRangesSingleBits_170
% 1.90/2.08
%------------------------------------------------------------------------------