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