TSTP Solution File: HWV010-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : HWV010-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n007.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:44 EDT 2022
% Result : Unsatisfiable 0.19s 0.43s
% Output : Refutation 0.19s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 5
% Syntax : Number of clauses : 12 ( 5 unt; 1 nHn; 12 RR)
% Number of literals : 19 ( 0 equ; 9 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ p_Empty(t_139)
| ~ equal(level(t_139),n0) ),
file('HWV010-1.p',unknown),
[] ).
cnf(2,axiom,
( p_Empty(t_139)
| equal(level(t_139),n0) ),
file('HWV010-1.p',unknown),
[] ).
cnf(23,axiom,
equal(int_level(u),level(u)),
file('HWV010-1.p',unknown),
[] ).
cnf(26,axiom,
( ~ equal(int_level(u),n0)
| p_Empty(u) ),
file('HWV010-1.p',unknown),
[] ).
cnf(27,axiom,
( ~ p_Empty(u)
| equal(int_level(u),n0) ),
file('HWV010-1.p',unknown),
[] ).
cnf(93,plain,
( ~ p_Empty(u)
| equal(level(u),n0) ),
inference(rew,[status(thm),theory(equality)],[23,27]),
[iquote('0:Rew:23.0,27.1')] ).
cnf(94,plain,
equal(level(t_139),n0),
inference(mrr,[status(thm)],[2,93]),
[iquote('0:MRR:2.0,93.0')] ).
cnf(95,plain,
( ~ equal(level(u),n0)
| p_Empty(u) ),
inference(rew,[status(thm),theory(equality)],[23,26]),
[iquote('0:Rew:23.0,26.0')] ).
cnf(98,plain,
( ~ p_Empty(t_139)
| ~ equal(n0,n0) ),
inference(rew,[status(thm),theory(equality)],[94,1]),
[iquote('0:Rew:94.0,1.1')] ).
cnf(99,plain,
~ p_Empty(t_139),
inference(obv,[status(thm),theory(equality)],[98]),
[iquote('0:Obv:98.1')] ).
cnf(179,plain,
p_Empty(t_139),
inference(res,[status(thm),theory(equality)],[94,95]),
[iquote('0:Res:94.0,95.0')] ).
cnf(182,plain,
$false,
inference(mrr,[status(thm)],[179,99]),
[iquote('0:MRR:179.0,99.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : HWV010-1 : TPTP v8.1.0. Released v2.5.0.
% 0.11/0.13 % Command : run_spass %d %s
% 0.12/0.34 % Computer : n007.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 07:29:42 EDT 2022
% 0.12/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/sandbox2/benchmark/theBenchmark.p
% 0.19/0.43 SPASS derived 5 clauses, backtracked 0 clauses, performed 0 splits and kept 92 clauses.
% 0.19/0.43 SPASS allocated 75746 KBytes.
% 0.19/0.43 SPASS spent 0:00:00.08 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 12 :
% 0.19/0.43 % SZS output start Refutation
% See solution above
% 0.19/0.43 Formulae used in the proof : quest_1 quest_2 axiom_21 axiom_24 axiom_25
% 0.19/0.43
%------------------------------------------------------------------------------