TSTP Solution File: SWV257-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWV257-1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n015.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.40s 1.56s
% Output : Refutation 1.40s
% 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 ( 1 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(5,axiom,
c_lessequals(u,c_Message_Oanalz(u),tc_set(tc_Message_Omsg)),
file('SWV257-1.p',unknown),
[] ).
cnf(18,axiom,
( ~ c_lessequals(u,v,tc_set(tc_Message_Omsg))
| c_lessequals(c_Message_Oparts(u),c_Message_Oparts(v),tc_set(tc_Message_Omsg)) ),
file('SWV257-1.p',unknown),
[] ).
cnf(22,axiom,
~ c_lessequals(c_Message_Oparts(v_H),c_Message_Oparts(c_Message_Oanalz(v_H)),tc_set(tc_Message_Omsg)),
file('SWV257-1.p',unknown),
[] ).
cnf(2985,plain,
~ c_lessequals(v_H,c_Message_Oanalz(v_H),tc_set(tc_Message_Omsg)),
inference(res,[status(thm),theory(equality)],[18,22]),
[iquote('0:Res:18.1,22.0')] ).
cnf(3031,plain,
$false,
inference(mrr,[status(thm)],[2985,5]),
[iquote('0:MRR:2985.0,5.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV257-1 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.12 % Command : run_spass %d %s
% 0.13/0.33 % Computer : n015.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 : Wed Jun 15 20:49:10 EDT 2022
% 0.13/0.33 % CPUTime :
% 1.40/1.56
% 1.40/1.56 SPASS V 3.9
% 1.40/1.56 SPASS beiseite: Proof found.
% 1.40/1.56 % SZS status Theorem
% 1.40/1.56 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 1.40/1.56 SPASS derived 27 clauses, backtracked 0 clauses, performed 0 splits and kept 2660 clauses.
% 1.40/1.56 SPASS allocated 79997 KBytes.
% 1.40/1.56 SPASS spent 0:00:01.16 on the problem.
% 1.40/1.56 0:00:00.21 for the input.
% 1.40/1.56 0:00:00.00 for the FLOTTER CNF translation.
% 1.40/1.56 0:00:00.00 for inferences.
% 1.40/1.56 0:00:00.00 for the backtracking.
% 1.40/1.56 0:00:00.65 for the reduction.
% 1.40/1.56
% 1.40/1.56
% 1.40/1.56 Here is a proof with depth 1, length 5 :
% 1.40/1.56 % SZS output start Refutation
% See solution above
% 1.40/1.56 Formulae used in the proof : cls_Message_Oanalz__increasing_0 cls_Message_Oparts__mono_0 cls_conjecture_0
% 1.40/1.56
%------------------------------------------------------------------------------