TSTP Solution File: SWV284-2 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWV284-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n009.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:42:02 EDT 2022
% Result : Unsatisfiable 0.20s 0.41s
% Output : Refutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 13 ( 6 unt; 1 nHn; 13 RR)
% Number of literals : 20 ( 0 equ; 10 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 16 ( 16 usr; 9 con; 0-3 aty)
% Number of variables : 0 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ c_lessequals(v_sko__upX(u),v,tc_nat)
| ~ c_in(c_Message_Omsg_ONonce(v),c_Message_Oparts(c_insert(u,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg) ),
file('SWV284-2.p',unknown),
[] ).
cnf(2,axiom,
( ~ c_lessequals(c_plus(u,v,tc_nat),w,tc_nat)
| c_lessequals(v,w,tc_nat) ),
file('SWV284-2.p',unknown),
[] ).
cnf(3,axiom,
( ~ c_lessequals(c_plus(u,v,tc_nat),w,tc_nat)
| c_lessequals(u,w,tc_nat) ),
file('SWV284-2.p',unknown),
[] ).
cnf(4,axiom,
c_lessequals(u,v_x(u),tc_nat),
file('SWV284-2.p',unknown),
[] ).
cnf(5,axiom,
( ~ c_lessequals(v_N,u,tc_nat)
| ~ c_in(c_Message_Omsg_ONonce(u),c_Event_Oused(v_list),tc_Message_Omsg) ),
file('SWV284-2.p',unknown),
[] ).
cnf(6,axiom,
( c_in(c_Message_Omsg_ONonce(v_x(u)),c_Event_Oused(v_list),tc_Message_Omsg)
| c_in(c_Message_Omsg_ONonce(v_x(u)),c_Message_Oparts(c_insert(v_msg,c_emptyset,tc_Message_Omsg)),tc_Message_Omsg) ),
file('SWV284-2.p',unknown),
[] ).
cnf(7,plain,
c_lessequals(u,v_x(c_plus(u,v,tc_nat)),tc_nat),
inference(res,[status(thm),theory(equality)],[4,3]),
[iquote('0:Res:4.0,3.0')] ).
cnf(9,plain,
c_lessequals(u,v_x(c_plus(v,u,tc_nat)),tc_nat),
inference(res,[status(thm),theory(equality)],[4,2]),
[iquote('0:Res:4.0,2.0')] ).
cnf(12,plain,
c_lessequals(u,v_x(c_plus(v,c_plus(u,w,tc_nat),tc_nat)),tc_nat),
inference(res,[status(thm),theory(equality)],[9,3]),
[iquote('0:Res:9.0,3.0')] ).
cnf(27,plain,
( ~ c_lessequals(v_sko__upX(v_msg),v_x(u),tc_nat)
| c_in(c_Message_Omsg_ONonce(v_x(u)),c_Event_Oused(v_list),tc_Message_Omsg) ),
inference(res,[status(thm),theory(equality)],[6,1]),
[iquote('0:Res:6.1,1.1')] ).
cnf(28,plain,
( ~ c_lessequals(v_sko__upX(v_msg),v_x(u),tc_nat)
| ~ c_lessequals(v_N,v_x(u),tc_nat) ),
inference(res,[status(thm),theory(equality)],[27,5]),
[iquote('0:Res:27.1,5.1')] ).
cnf(30,plain,
~ c_lessequals(v_N,v_x(c_plus(v_sko__upX(v_msg),u,tc_nat)),tc_nat),
inference(res,[status(thm),theory(equality)],[7,28]),
[iquote('0:Res:7.0,28.0')] ).
cnf(39,plain,
$false,
inference(unc,[status(thm)],[30,12]),
[iquote('0:UnC:30.0,12.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV284-2 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : run_spass %d %s
% 0.12/0.34 % Computer : n009.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 : Wed Jun 15 10:16:53 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.20/0.41
% 0.20/0.41 SPASS V 3.9
% 0.20/0.41 SPASS beiseite: Proof found.
% 0.20/0.41 % SZS status Theorem
% 0.20/0.41 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.20/0.41 SPASS derived 32 clauses, backtracked 0 clauses, performed 0 splits and kept 38 clauses.
% 0.20/0.41 SPASS allocated 63154 KBytes.
% 0.20/0.41 SPASS spent 0:00:00.06 on the problem.
% 0.20/0.41 0:00:00.04 for the input.
% 0.20/0.41 0:00:00.00 for the FLOTTER CNF translation.
% 0.20/0.41 0:00:00.00 for inferences.
% 0.20/0.41 0:00:00.00 for the backtracking.
% 0.20/0.41 0:00:00.00 for the reduction.
% 0.20/0.41
% 0.20/0.41
% 0.20/0.41 Here is a proof with depth 3, length 13 :
% 0.20/0.41 % SZS output start Refutation
% See solution above
% 0.20/0.41 Formulae used in the proof : cls_Message_Omsg__Nonce__supply_0 cls_Nat_Oadd__leE_0 cls_Nat_Oadd__leE_1 cls_conjecture_0 cls_conjecture_1 cls_conjecture_2
% 0.20/0.41
%------------------------------------------------------------------------------