TSTP Solution File: HWV020-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : HWV020-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n022.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:14:51 EDT 2022
% Result : Unsatisfiable 0.19s 0.42s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 13
% Syntax : Number of clauses : 32 ( 12 unt; 14 nHn; 32 RR)
% Number of literals : 82 ( 0 equ; 20 neg)
% Maximal clause size : 5 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 8 ( 7 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
p_Rd(t_139),
file('HWV020-1.p',unknown),
[] ).
cnf(2,axiom,
p_Empty(t_139),
file('HWV020-1.p',unknown),
[] ).
cnf(3,axiom,
~ p_Wr(t_139),
file('HWV020-1.p',unknown),
[] ).
cnf(4,axiom,
~ p_Reset(t_139),
file('HWV020-1.p',unknown),
[] ).
cnf(5,axiom,
( ~ p_Empty(plus(t_139,n1))
| ~ p_Rd_error(plus(t_139,n1)) ),
file('HWV020-1.p',unknown),
[] ).
cnf(22,axiom,
~ gt(u,u),
file('HWV020-1.p',unknown),
[] ).
cnf(26,axiom,
equal(int_level(u),level(u)),
file('HWV020-1.p',unknown),
[] ).
cnf(29,axiom,
( ~ equal(int_level(u),n0)
| p_Empty(u) ),
file('HWV020-1.p',unknown),
[] ).
cnf(30,axiom,
( ~ p_Empty(u)
| equal(int_level(u),n0) ),
file('HWV020-1.p',unknown),
[] ).
cnf(63,axiom,
( ~ p_Wr(u)
| ~ p_Rd(u)
| p_Reset(u)
| gt(int_level(u),n0)
| p_Rd_error(plus(u,n1)) ),
file('HWV020-1.p',unknown),
[] ).
cnf(81,axiom,
( ~ p_Rd(u)
| p_Reset(u)
| p_Wr(u)
| gt(int_level(u),n0)
| p_Rd_error(plus(u,n1)) ),
file('HWV020-1.p',unknown),
[] ).
cnf(83,axiom,
( ~ p_Rd(u)
| p_Reset(u)
| p_Wr(u)
| gt(int_level(u),n0)
| equal(int_level(plus(u,n1)),int_level(u)) ),
file('HWV020-1.p',unknown),
[] ).
cnf(87,axiom,
( p_Reset(u)
| p_Wr(u)
| p_Rd(u)
| equal(int_level(plus(u,n1)),int_level(u)) ),
file('HWV020-1.p',unknown),
[] ).
cnf(96,plain,
( ~ p_Empty(u)
| equal(level(u),n0) ),
inference(rew,[status(thm),theory(equality)],[26,30]),
[iquote('0:Rew:26.0,30.1')] ).
cnf(97,plain,
( ~ equal(level(u),n0)
| p_Empty(u) ),
inference(rew,[status(thm),theory(equality)],[26,29]),
[iquote('0:Rew:26.0,29.0')] ).
cnf(103,plain,
( p_Rd(u)
| p_Wr(u)
| p_Reset(u)
| equal(level(plus(u,n1)),level(u)) ),
inference(rew,[status(thm),theory(equality)],[26,87]),
[iquote('0:Rew:26.0,87.3,26.0,87.3')] ).
cnf(114,plain,
( ~ p_Rd(u)
| p_Reset(u)
| p_Wr(u)
| gt(level(u),n0)
| p_Rd_error(plus(u,n1)) ),
inference(rew,[status(thm),theory(equality)],[26,81]),
[iquote('0:Rew:26.0,81.3')] ).
cnf(115,plain,
( ~ p_Wr(u)
| ~ p_Rd(u)
| p_Reset(u)
| gt(level(u),n0)
| p_Rd_error(plus(u,n1)) ),
inference(rew,[status(thm),theory(equality)],[26,63]),
[iquote('0:Rew:26.0,63.3')] ).
cnf(116,plain,
( ~ p_Rd(u)
| p_Reset(u)
| p_Rd_error(plus(u,n1))
| gt(level(u),n0) ),
inference(mrr,[status(thm)],[115,114]),
[iquote('0:MRR:115.0,114.2')] ).
cnf(131,plain,
( ~ p_Rd(u)
| p_Reset(u)
| p_Wr(u)
| gt(level(u),n0)
| equal(level(plus(u,n1)),level(u)) ),
inference(rew,[status(thm),theory(equality)],[26,83]),
[iquote('0:Rew:26.0,83.4,26.0,83.4,26.0,83.3')] ).
cnf(132,plain,
( p_Wr(u)
| p_Reset(u)
| gt(level(u),n0)
| equal(level(plus(u,n1)),level(u)) ),
inference(mrr,[status(thm)],[131,103]),
[iquote('0:MRR:131.0,103.2')] ).
cnf(178,plain,
equal(level(t_139),n0),
inference(res,[status(thm),theory(equality)],[2,96]),
[iquote('0:Res:2.0,96.0')] ).
cnf(189,plain,
( p_Reset(t_139)
| gt(level(t_139),n0)
| p_Rd_error(plus(t_139,n1)) ),
inference(res,[status(thm),theory(equality)],[1,116]),
[iquote('0:Res:1.0,116.0')] ).
cnf(203,plain,
( p_Wr(t_139)
| gt(level(t_139),n0)
| equal(level(plus(t_139,n1)),level(t_139)) ),
inference(res,[status(thm),theory(equality)],[132,4]),
[iquote('0:Res:132.0,4.0')] ).
cnf(231,plain,
( p_Reset(t_139)
| gt(n0,n0)
| p_Rd_error(plus(t_139,n1)) ),
inference(rew,[status(thm),theory(equality)],[178,189]),
[iquote('0:Rew:178.0,189.1')] ).
cnf(232,plain,
p_Rd_error(plus(t_139,n1)),
inference(mrr,[status(thm)],[231,4,22]),
[iquote('0:MRR:231.0,231.1,4.0,22.0')] ).
cnf(233,plain,
~ p_Empty(plus(t_139,n1)),
inference(mrr,[status(thm)],[5,232]),
[iquote('0:MRR:5.1,232.0')] ).
cnf(237,plain,
( p_Wr(t_139)
| gt(n0,n0)
| equal(level(plus(t_139,n1)),n0) ),
inference(rew,[status(thm),theory(equality)],[178,203]),
[iquote('0:Rew:178.0,203.2,178.0,203.1')] ).
cnf(238,plain,
equal(level(plus(t_139,n1)),n0),
inference(mrr,[status(thm)],[237,3,22]),
[iquote('0:MRR:237.0,237.1,3.0,22.0')] ).
cnf(285,plain,
( ~ equal(n0,n0)
| p_Empty(plus(t_139,n1)) ),
inference(spl,[status(thm),theory(equality)],[238,97]),
[iquote('0:SpL:238.0,97.0')] ).
cnf(287,plain,
p_Empty(plus(t_139,n1)),
inference(obv,[status(thm),theory(equality)],[285]),
[iquote('0:Obv:285.0')] ).
cnf(288,plain,
$false,
inference(mrr,[status(thm)],[287,233]),
[iquote('0:MRR:287.0,233.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : HWV020-1 : TPTP v8.1.0. Released v2.5.0.
% 0.07/0.12 % Command : run_spass %d %s
% 0.12/0.33 % Computer : n022.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Fri Jun 17 03:21:17 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.19/0.42
% 0.19/0.42 SPASS V 3.9
% 0.19/0.42 SPASS beiseite: Proof found.
% 0.19/0.42 % SZS status Theorem
% 0.19/0.42 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.42 SPASS derived 75 clauses, backtracked 0 clauses, performed 0 splits and kept 121 clauses.
% 0.19/0.42 SPASS allocated 75822 KBytes.
% 0.19/0.42 SPASS spent 0:00:00.08 on the problem.
% 0.19/0.42 0:00:00.04 for the input.
% 0.19/0.42 0:00:00.00 for the FLOTTER CNF translation.
% 0.19/0.42 0:00:00.00 for inferences.
% 0.19/0.42 0:00:00.00 for the backtracking.
% 0.19/0.42 0:00:00.01 for the reduction.
% 0.19/0.42
% 0.19/0.42
% 0.19/0.42 Here is a proof with depth 2, length 32 :
% 0.19/0.42 % SZS output start Refutation
% See solution above
% 0.19/0.42 Formulae used in the proof : quest_1 quest_2 quest_3 quest_4 quest_5 axiom_17 axiom_21 axiom_24 axiom_25 axiom_58 axiom_76 axiom_78 axiom_82
% 0.19/0.42
%------------------------------------------------------------------------------