TSTP Solution File: HWV027-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : HWV027-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n029.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:56 EDT 2022
% Result : Unsatisfiable 0.19s 0.43s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 6
% Syntax : Number of clauses : 9 ( 6 unt; 3 nHn; 9 RR)
% Number of literals : 17 ( 0 equ; 4 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ p_Wr(t_139),
file('HWV027-1.p',unknown),
[] ).
cnf(2,axiom,
~ p_Rd(t_139),
file('HWV027-1.p',unknown),
[] ).
cnf(3,axiom,
~ p_Reset(t_139),
file('HWV027-1.p',unknown),
[] ).
cnf(4,axiom,
~ equal(level(plus(t_139,n1)),level(t_139)),
file('HWV027-1.p',unknown),
[] ).
cnf(25,axiom,
equal(int_level(u),level(u)),
file('HWV027-1.p',unknown),
[] ).
cnf(86,axiom,
( p_Reset(u)
| p_Wr(u)
| p_Rd(u)
| equal(int_level(plus(u,n1)),int_level(u)) ),
file('HWV027-1.p',unknown),
[] ).
cnf(102,plain,
( p_Rd(u)
| p_Wr(u)
| p_Reset(u)
| equal(level(plus(u,n1)),level(u)) ),
inference(rew,[status(thm),theory(equality)],[25,86]),
[iquote('0:Rew:25.0,86.3,25.0,86.3')] ).
cnf(226,plain,
( p_Reset(t_139)
| p_Wr(t_139)
| p_Rd(t_139) ),
inference(res,[status(thm),theory(equality)],[102,4]),
[iquote('0:Res:102.3,4.0')] ).
cnf(233,plain,
$false,
inference(mrr,[status(thm)],[226,3,1,2]),
[iquote('0:MRR:226.0,226.1,226.2,3.0,1.0,2.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : HWV027-1 : TPTP v8.1.0. Released v2.5.0.
% 0.11/0.13 % Command : run_spass %d %s
% 0.13/0.34 % Computer : n029.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Fri Jun 17 08:56:28 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.19/0.43
% 0.19/0.43 SPASS V 3.9
% 0.19/0.43 SPASS beiseite: Proof found.
% 0.19/0.43 % SZS status Theorem
% 0.19/0.43 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.19/0.43 SPASS derived 53 clauses, backtracked 0 clauses, performed 0 splits and kept 93 clauses.
% 0.19/0.43 SPASS allocated 75798 KBytes.
% 0.19/0.43 SPASS spent 0:00:00.07 on the problem.
% 0.19/0.43 0:00:00.04 for the input.
% 0.19/0.43 0:00:00.00 for the FLOTTER CNF translation.
% 0.19/0.43 0:00:00.00 for inferences.
% 0.19/0.43 0:00:00.00 for the backtracking.
% 0.19/0.43 0:00:00.01 for the reduction.
% 0.19/0.43
% 0.19/0.43
% 0.19/0.43 Here is a proof with depth 1, length 9 :
% 0.19/0.43 % SZS output start Refutation
% See solution above
% 0.19/0.43 Formulae used in the proof : quest_1 quest_2 quest_3 quest_4 axiom_21 axiom_82
% 0.19/0.43
%------------------------------------------------------------------------------