%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWV259-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n027.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:52 EDT 2022
% Result : Unsatisfiable 0.14s 0.42s
% Output : Refutation 0.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of clauses : 9 ( 6 unt; 0 nHn; 9 RR)
% Number of literals : 12 ( 0 equ; 5 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 10 ( 10 usr; 7 con; 0-3 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ c_lessequals(c_Message_Oparts(u),c_Message_Oparts(v),tc_set(tc_Message_Omsg))
| c_lessequals(u,c_Message_Oparts(v),tc_set(tc_Message_Omsg)) ),
file('SWV259-2.p',unknown),
[] ).
cnf(2,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('SWV259-2.p',unknown),
[] ).
cnf(3,axiom,
( ~ c_lessequals(c_insert(u,v,w),x,tc_set(w))
| c_lessequals(v,x,tc_set(w)) ),
file('SWV259-2.p',unknown),
[] ).
cnf(4,axiom,
c_lessequals(u,u,tc_set(v)),
file('SWV259-2.p',unknown),
[] ).
cnf(5,axiom,
~ c_lessequals(c_Message_Oparts(v_H),c_Message_Oparts(c_insert(v_X,v_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)),
file('SWV259-2.p',unknown),
[] ).
cnf(7,plain,
~ c_lessequals(v_H,c_Message_Oparts(c_insert(v_X,v_H,tc_Message_Omsg)),tc_set(tc_Message_Omsg)),
inference(res,[status(thm),theory(equality)],[2,5]),
[iquote('0:Res:2.1,5.0')] ).
cnf(11,plain,
c_lessequals(u,c_Message_Oparts(u),tc_set(tc_Message_Omsg)),
inference(res,[status(thm),theory(equality)],[4,1]),
[iquote('0:Res:4.0,1.0')] ).
cnf(16,plain,
c_lessequals(u,c_Message_Oparts(c_insert(v,u,tc_Message_Omsg)),tc_set(tc_Message_Omsg)),
inference(res,[status(thm),theory(equality)],[11,3]),
[iquote('0:Res:11.0,3.0')] ).
cnf(18,plain,
$false,
inference(unc,[status(thm)],[16,7]),
[iquote('0:UnC:16.0,7.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SWV259-2 : TPTP v8.1.0. Released v3.2.0.
% 0.12/0.14 % Command : run_spass %d %s
% 0.14/0.35 % Computer : n027.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 11:13:19 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.14/0.42
% 0.14/0.42 SPASS V 3.9
% 0.14/0.42 SPASS beiseite: Proof found.
% 0.14/0.42 % SZS status Theorem
% 0.14/0.42 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.14/0.42 SPASS derived 12 clauses, backtracked 0 clauses, performed 0 splits and kept 14 clauses.
% 0.14/0.42 SPASS allocated 63097 KBytes.
% 0.14/0.42 SPASS spent 0:00:00.06 on the problem.
% 0.14/0.42 0:00:00.03 for the input.
% 0.14/0.42 0:00:00.00 for the FLOTTER CNF translation.
% 0.14/0.42 0:00:00.00 for inferences.
% 0.14/0.42 0:00:00.00 for the backtracking.
% 0.14/0.42 0:00:00.00 for the reduction.
% 0.14/0.42
% 0.14/0.42
% 0.14/0.42 Here is a proof with depth 2, length 9 :
% 0.14/0.42 % SZS output start Refutation
% See solution above
% 0.14/0.42 Formulae used in the proof : cls_Message_Oparts__subset__iff_0 cls_Message_Oparts__subset__iff_1 cls_Set_Oinsert__subset_1 cls_Set_Osubset__refl_0 cls_conjecture_1
% 0.14/0.42
%------------------------------------------------------------------------------