TSTP Solution File: SWV256-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWV256-1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n004.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 : Wed Jul 20 21:41:51 EDT 2022
% Result : Unsatisfiable 1.35s 1.53s
% Output : Refutation 1.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 3
% Syntax : Number of clauses : 5 ( 4 unt; 0 nHn; 5 RR)
% Number of literals : 6 ( 0 equ; 3 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(6,axiom,
c_lessequals(c_Message_Oanalz(u),c_Message_Oparts(u),tc_set(tc_Message_Omsg)),
file('SWV256-1.p',unknown),
[] ).
cnf(21,axiom,
( ~ c_lessequals(u,c_Message_Oparts(v),tc_set(tc_Message_Omsg))
| c_lessequals(c_Message_Oparts(u),c_Message_Oparts(v),tc_set(tc_Message_Omsg)) ),
file('SWV256-1.p',unknown),
[] ).
cnf(22,axiom,
~ c_lessequals(c_Message_Oparts(c_Message_Oanalz(v_H)),c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)),
file('SWV256-1.p',unknown),
[] ).
cnf(2984,plain,
~ c_lessequals(c_Message_Oanalz(v_H),c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)),
inference(res,[status(thm),theory(equality)],[21,22]),
[iquote('0:Res:21.1,22.0')] ).
cnf(3031,plain,
$false,
inference(mrr,[status(thm)],[2984,6]),
[iquote('0:MRR:2984.0,6.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SWV256-1 : TPTP v8.1.0. Released v3.2.0.
% 0.08/0.14 % Command : run_spass %d %s
% 0.14/0.35 % Computer : n004.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Wed Jun 15 09:58:54 EDT 2022
% 0.14/0.35 % CPUTime :
% 1.35/1.53
% 1.35/1.53 SPASS V 3.9
% 1.35/1.53 SPASS beiseite: Proof found.
% 1.35/1.53 % SZS status Theorem
% 1.35/1.53 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.35/1.53 SPASS derived 26 clauses, backtracked 0 clauses, performed 0 splits and kept 2661 clauses.
% 1.35/1.53 SPASS allocated 79996 KBytes.
% 1.35/1.53 SPASS spent 0:00:01.11 on the problem.
% 1.35/1.53 0:00:00.18 for the input.
% 1.35/1.53 0:00:00.00 for the FLOTTER CNF translation.
% 1.35/1.53 0:00:00.00 for inferences.
% 1.35/1.53 0:00:00.00 for the backtracking.
% 1.35/1.53 0:00:00.62 for the reduction.
% 1.35/1.53
% 1.35/1.53
% 1.35/1.53 Here is a proof with depth 1, length 5 :
% 1.35/1.53 % SZS output start Refutation
% See solution above
% 1.35/1.53 Formulae used in the proof : cls_Message_Oanalz__subset__parts_0 cls_Message_Oparts__subset__iff_1 cls_conjecture_0
% 1.35/1.53
%------------------------------------------------------------------------------