TSTP Solution File: SWV277-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWV277-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:59 EDT 2022
% Result : Unsatisfiable 7.90s 8.07s
% Output : Refutation 7.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 9 ( 6 unt; 0 nHn; 9 RR)
% Number of literals : 13 ( 0 equ; 8 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 12 ( 12 usr; 8 con; 0-1 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
c_lessequals(c_Message_Oanalz(u),c_Message_Oparts(u),tc_set(tc_Message_Omsg)),
file('SWV277-1.p',unknown),
[] ).
cnf(2,axiom,
( ~ c_lessequals(u,v,tc_set(tc_Message_Omsg))
| c_lessequals(c_Message_OkeysFor(u),c_Message_OkeysFor(v),tc_set(tc_nat)) ),
file('SWV277-1.p',unknown),
[] ).
cnf(7,axiom,
~ c_in(v_K,c_Message_OkeysFor(c_Message_Oparts(v_H)),tc_nat),
file('SWV277-1.p',unknown),
[] ).
cnf(8,axiom,
c_in(v_K,c_Message_OkeysFor(c_Message_Oanalz(v_H)),tc_nat),
file('SWV277-1.p',unknown),
[] ).
cnf(117,axiom,
( ~ c_in(u,v,w)
| ~ c_lessequals(v,x,tc_set(w))
| c_in(u,x,w) ),
file('SWV277-1.p',unknown),
[] ).
cnf(3185,plain,
( ~ c_lessequals(u,c_Message_OkeysFor(c_Message_Oparts(v_H)),tc_set(tc_nat))
| ~ c_in(v_K,u,tc_nat) ),
inference(res,[status(thm),theory(equality)],[117,7]),
[iquote('0:Res:117.2,7.0')] ).
cnf(3229,plain,
~ c_lessequals(c_Message_OkeysFor(c_Message_Oanalz(v_H)),c_Message_OkeysFor(c_Message_Oparts(v_H)),tc_set(tc_nat)),
inference(res,[status(thm),theory(equality)],[8,3185]),
[iquote('0:Res:8.0,3185.0')] ).
cnf(22691,plain,
~ c_lessequals(c_Message_Oanalz(v_H),c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)),
inference(res,[status(thm),theory(equality)],[2,3229]),
[iquote('0:Res:2.1,3229.0')] ).
cnf(22692,plain,
$false,
inference(mrr,[status(thm)],[22691,1]),
[iquote('0:MRR:22691.0,1.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV277-1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.13/0.33 % Computer : n004.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Tue Jun 14 14:19:09 EDT 2022
% 0.13/0.34 % CPUTime :
% 7.90/8.07
% 7.90/8.07 SPASS V 3.9
% 7.90/8.07 SPASS beiseite: Proof found.
% 7.90/8.07 % SZS status Theorem
% 7.90/8.07 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 7.90/8.07 SPASS derived 15973 clauses, backtracked 0 clauses, performed 1 splits and kept 5696 clauses.
% 7.90/8.07 SPASS allocated 91653 KBytes.
% 7.90/8.07 SPASS spent 0:00:07.52 on the problem.
% 7.90/8.07 0:00:00.20 for the input.
% 7.90/8.07 0:00:00.00 for the FLOTTER CNF translation.
% 7.90/8.07 0:00:00.40 for inferences.
% 7.90/8.07 0:00:00.00 for the backtracking.
% 7.90/8.07 0:00:06.23 for the reduction.
% 7.90/8.07
% 7.90/8.07
% 7.90/8.07 Here is a proof with depth 3, length 9 :
% 7.90/8.07 % SZS output start Refutation
% See solution above
% 7.90/8.07 Formulae used in the proof : cls_Message_Oanalz__subset__parts_0 cls_Message_OkeysFor__mono_0 cls_conjecture_2 cls_conjecture_3 cls_Set_OsubsetD_0
% 7.90/8.07
%------------------------------------------------------------------------------