TSTP Solution File: SWV284-1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWV284-1 : 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:42:02 EDT 2022
% Result : Unsatisfiable 10.32s 10.51s
% Output : Refutation 10.32s
% 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-1.p',unknown),
[] ).
cnf(2,axiom,
( ~ c_lessequals(c_plus(u,v,tc_nat),w,tc_nat)
| c_lessequals(v,w,tc_nat) ),
file('SWV284-1.p',unknown),
[] ).
cnf(3,axiom,
( ~ c_lessequals(c_plus(u,v,tc_nat),w,tc_nat)
| c_lessequals(u,w,tc_nat) ),
file('SWV284-1.p',unknown),
[] ).
cnf(10,axiom,
c_lessequals(u,v_x(u),tc_nat),
file('SWV284-1.p',unknown),
[] ).
cnf(11,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-1.p',unknown),
[] ).
cnf(12,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-1.p',unknown),
[] ).
cnf(1638,plain,
c_lessequals(u,v_x(c_plus(u,v,tc_nat)),tc_nat),
inference(res,[status(thm),theory(equality)],[10,3]),
[iquote('0:Res:10.0,3.0')] ).
cnf(1658,plain,
c_lessequals(u,v_x(c_plus(v,u,tc_nat)),tc_nat),
inference(res,[status(thm),theory(equality)],[10,2]),
[iquote('0:Res:10.0,2.0')] ).
cnf(1672,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)],[1658,3]),
[iquote('0:Res:1658.0,3.0')] ).
cnf(4835,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)],[12,1]),
[iquote('0:Res:12.1,1.1')] ).
cnf(12175,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)],[4835,11]),
[iquote('0:Res:4835.1,11.1')] ).
cnf(12178,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)],[1638,12175]),
[iquote('0:Res:1638.0,12175.0')] ).
cnf(12184,plain,
$false,
inference(unc,[status(thm)],[12178,1672]),
[iquote('0:UnC:12178.0,1672.0')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : SWV284-1 : TPTP v8.1.0. Released v3.2.0.
% 0.04/0.15 % Command : run_spass %d %s
% 0.14/0.36 % Computer : n027.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Wed Jun 15 20:51:05 EDT 2022
% 0.14/0.37 % CPUTime :
% 10.32/10.51
% 10.32/10.51 SPASS V 3.9
% 10.32/10.51 SPASS beiseite: Proof found.
% 10.32/10.51 % SZS status Theorem
% 10.32/10.51 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 10.32/10.51 SPASS derived 9670 clauses, backtracked 0 clauses, performed 0 splits and kept 7566 clauses.
% 10.32/10.51 SPASS allocated 88743 KBytes.
% 10.32/10.51 SPASS spent 0:00:09.73 on the problem.
% 10.32/10.51 0:00:00.09 for the input.
% 10.32/10.51 0:00:00.00 for the FLOTTER CNF translation.
% 10.32/10.51 0:00:00.21 for inferences.
% 10.32/10.51 0:00:00.00 for the backtracking.
% 10.32/10.51 0:00:09.12 for the reduction.
% 10.32/10.51
% 10.32/10.51
% 10.32/10.51 Here is a proof with depth 3, length 13 :
% 10.32/10.51 % SZS output start Refutation
% See solution above
% 10.32/10.51 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
% 10.32/10.51
%------------------------------------------------------------------------------