TSTP Solution File: SWV339-2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SWV339-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n023.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 : 300s
% DateTime : Wed Jul 27 13:20:32 EDT 2022
% Result : Unsatisfiable 1.91s 2.08s
% Output : Refutation 1.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 3
% Syntax : Number of clauses : 7 ( 4 unt; 3 nHn; 4 RR)
% Number of literals : 10 ( 5 equ; 1 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-1 aty)
% Number of variables : 4 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ c_in(c_Message_Omsg_OKey(v_K),c_Event_Oused(v_evs3),tc_Message_Omsg),
file('SWV339-2.p',unknown),
[] ).
cnf(3,axiom,
( v_K = c_Public_OshrK(v_B)
| v_K = c_Public_OshrK(v_A) ),
file('SWV339-2.p',unknown),
[] ).
cnf(4,plain,
( c_Public_OshrK(v_B) = v_K
| c_Public_OshrK(v_A) = v_K ),
inference(flip,[status(thm),theory(equality)],[inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[3])])]),
[iquote('copy,3,flip.1,flip.2')] ).
cnf(5,axiom,
c_in(c_Message_Omsg_OKey(c_Public_OshrK(A)),c_Event_Oused(B),tc_Message_Omsg),
file('SWV339-2.p',unknown),
[] ).
cnf(6,plain,
( c_in(c_Message_Omsg_OKey(v_K),c_Event_Oused(A),tc_Message_Omsg)
| c_Public_OshrK(v_A) = v_K ),
inference(para_from,[status(thm),theory(equality)],[4,5]),
[iquote('para_from,4.1.1,5.1.1.1')] ).
cnf(8,plain,
c_in(c_Message_Omsg_OKey(v_K),c_Event_Oused(A),tc_Message_Omsg),
inference(factor_simp,[status(thm)],[inference(para_from,[status(thm),theory(equality)],[6,5])]),
[iquote('para_from,6.2.1,5.1.1.1,factor_simp')] ).
cnf(9,plain,
$false,
inference(binary,[status(thm)],[8,1]),
[iquote('binary,8.1,1.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SWV339-2 : TPTP v8.1.0. Released v3.2.0.
% 0.04/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n023.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Wed Jul 27 06:22:33 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.91/2.08 ----- Otter 3.3f, August 2004 -----
% 1.91/2.08 The process was started by sandbox2 on n023.cluster.edu,
% 1.91/2.08 Wed Jul 27 06:22:33 2022
% 1.91/2.08 The command was "./otter". The process ID is 5780.
% 1.91/2.08
% 1.91/2.08 set(prolog_style_variables).
% 1.91/2.08 set(auto).
% 1.91/2.08 dependent: set(auto1).
% 1.91/2.08 dependent: set(process_input).
% 1.91/2.08 dependent: clear(print_kept).
% 1.91/2.08 dependent: clear(print_new_demod).
% 1.91/2.08 dependent: clear(print_back_demod).
% 1.91/2.08 dependent: clear(print_back_sub).
% 1.91/2.08 dependent: set(control_memory).
% 1.91/2.08 dependent: assign(max_mem, 12000).
% 1.91/2.08 dependent: assign(pick_given_ratio, 4).
% 1.91/2.08 dependent: assign(stats_level, 1).
% 1.91/2.08 dependent: assign(max_seconds, 10800).
% 1.91/2.08 clear(print_given).
% 1.91/2.08
% 1.91/2.08 list(usable).
% 1.91/2.08 0 [] A=A.
% 1.91/2.08 0 [] -c_in(c_Message_Omsg_OKey(v_K),c_Event_Oused(v_evs3),tc_Message_Omsg).
% 1.91/2.08 0 [] v_K=c_Public_OshrK(v_B)|v_K=c_Public_OshrK(v_A).
% 1.91/2.08 0 [] c_in(c_Message_Omsg_OKey(c_Public_OshrK(V_A)),c_Event_Oused(V_evs),tc_Message_Omsg).
% 1.91/2.08 end_of_list.
% 1.91/2.08
% 1.91/2.08 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=2.
% 1.91/2.08
% 1.91/2.08 This ia a non-Horn set with equality. The strategy will be
% 1.91/2.08 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.91/2.08 deletion, with positive clauses in sos and nonpositive
% 1.91/2.08 clauses in usable.
% 1.91/2.08
% 1.91/2.08 dependent: set(knuth_bendix).
% 1.91/2.08 dependent: set(anl_eq).
% 1.91/2.08 dependent: set(para_from).
% 1.91/2.08 dependent: set(para_into).
% 1.91/2.08 dependent: clear(para_from_right).
% 1.91/2.08 dependent: clear(para_into_right).
% 1.91/2.08 dependent: set(para_from_vars).
% 1.91/2.08 dependent: set(eq_units_both_ways).
% 1.91/2.08 dependent: set(dynamic_demod_all).
% 1.91/2.08 dependent: set(dynamic_demod).
% 1.91/2.08 dependent: set(order_eq).
% 1.91/2.08 dependent: set(back_demod).
% 1.91/2.08 dependent: set(lrpo).
% 1.91/2.08 dependent: set(hyper_res).
% 1.91/2.08 dependent: set(unit_deletion).
% 1.91/2.08 dependent: set(factor).
% 1.91/2.08
% 1.91/2.08 ------------> process usable:
% 1.91/2.08 ** KEPT (pick-wt=6): 1 [] -c_in(c_Message_Omsg_OKey(v_K),c_Event_Oused(v_evs3),tc_Message_Omsg).
% 1.91/2.08
% 1.91/2.08 ------------> process sos:
% 1.91/2.08 ** KEPT (pick-wt=3): 2 [] A=A.
% 1.91/2.08 ** KEPT (pick-wt=8): 4 [copy,3,flip.1,flip.2] c_Public_OshrK(v_B)=v_K|c_Public_OshrK(v_A)=v_K.
% 1.91/2.08 ** KEPT (pick-wt=7): 5 [] c_in(c_Message_Omsg_OKey(c_Public_OshrK(A)),c_Event_Oused(B),tc_Message_Omsg).
% 1.91/2.08 Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] A=A.
% 1.91/2.08
% 1.91/2.08 ======= end of input processing =======
% 1.91/2.08
% 1.91/2.08 =========== start of search ===========
% 1.91/2.08
% 1.91/2.08 -------- PROOF --------
% 1.91/2.08
% 1.91/2.08 ----> UNIT CONFLICT at 0.00 sec ----> 9 [binary,8.1,1.1] $F.
% 1.91/2.08
% 1.91/2.08 Length of proof is 3. Level of proof is 3.
% 1.91/2.08
% 1.91/2.08 ---------------- PROOF ----------------
% 1.91/2.08 % SZS status Unsatisfiable
% 1.91/2.08 % SZS output start Refutation
% See solution above
% 1.91/2.08 ------------ end of proof -------------
% 1.91/2.08
% 1.91/2.08
% 1.91/2.08 Search stopped by max_proofs option.
% 1.91/2.08
% 1.91/2.08
% 1.91/2.08 Search stopped by max_proofs option.
% 1.91/2.08
% 1.91/2.08 ============ end of search ============
% 1.91/2.08
% 1.91/2.08 -------------- statistics -------------
% 1.91/2.08 clauses given 4
% 1.91/2.08 clauses generated 10
% 1.91/2.08 clauses kept 7
% 1.91/2.08 clauses forward subsumed 8
% 1.91/2.08 clauses back subsumed 0
% 1.91/2.08 Kbytes malloced 976
% 1.91/2.08
% 1.91/2.08 ----------- times (seconds) -----------
% 1.91/2.08 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.91/2.08 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.91/2.08 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.91/2.08
% 1.91/2.08 That finishes the proof of the theorem.
% 1.91/2.08
% 1.91/2.08 Process 5780 finished Wed Jul 27 06:22:35 2022
% 1.91/2.08 Otter interrupted
% 1.91/2.08 PROOF FOUND
%------------------------------------------------------------------------------