TSTP Solution File: SWV268-2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SWV268-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %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 : 300s
% DateTime : Wed Jul 27 13:20:20 EDT 2022
% Result : Unsatisfiable 1.94s 2.12s
% Output : Refutation 1.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 4
% Syntax : Number of clauses : 6 ( 5 unt; 0 nHn; 5 RR)
% Number of literals : 7 ( 1 equ; 2 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-1 aty)
% Number of variables : 3 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ c_lesse_quals(c_Message_Oparts(v_G),c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)),
file('SWV268-2.p',unknown),
[] ).
cnf(2,axiom,
( ~ c_lesse_quals(A,B,tc_set(tc_Message_Omsg))
| c_lesse_quals(c_Message_Oparts(A),c_Message_Oparts(B),tc_set(tc_Message_Omsg)) ),
file('SWV268-2.p',unknown),
[] ).
cnf(4,axiom,
c_lesse_quals(v_G,c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)),
file('SWV268-2.p',unknown),
[] ).
cnf(6,axiom,
c_Message_Oparts(c_Message_Oparts(A)) = c_Message_Oparts(A),
file('SWV268-2.p',unknown),
[] ).
cnf(7,plain,
c_lesse_quals(c_Message_Oparts(v_G),c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)),
inference(demod,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[4,2]),6]),
[iquote('hyper,4,2,demod,6')] ).
cnf(8,plain,
$false,
inference(binary,[status(thm)],[7,1]),
[iquote('binary,7.1,1.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SWV268-2 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.13 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n015.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 06:35:26 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.94/2.12 ----- Otter 3.3f, August 2004 -----
% 1.94/2.12 The process was started by sandbox2 on n015.cluster.edu,
% 1.94/2.12 Wed Jul 27 06:35:27 2022
% 1.94/2.12 The command was "./otter". The process ID is 30043.
% 1.94/2.12
% 1.94/2.12 set(prolog_style_variables).
% 1.94/2.12 set(auto).
% 1.94/2.12 dependent: set(auto1).
% 1.94/2.12 dependent: set(process_input).
% 1.94/2.12 dependent: clear(print_kept).
% 1.94/2.12 dependent: clear(print_new_demod).
% 1.94/2.12 dependent: clear(print_back_demod).
% 1.94/2.12 dependent: clear(print_back_sub).
% 1.94/2.12 dependent: set(control_memory).
% 1.94/2.12 dependent: assign(max_mem, 12000).
% 1.94/2.12 dependent: assign(pick_given_ratio, 4).
% 1.94/2.12 dependent: assign(stats_level, 1).
% 1.94/2.12 dependent: assign(max_seconds, 10800).
% 1.94/2.12 clear(print_given).
% 1.94/2.12
% 1.94/2.12 list(usable).
% 1.94/2.12 0 [] A=A.
% 1.94/2.12 0 [] c_lesse_quals(v_G,c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)).
% 1.94/2.12 0 [] -c_lesse_quals(c_Message_Oparts(v_G),c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)).
% 1.94/2.12 0 [] c_Message_Oparts(c_Message_Oparts(V_H))=c_Message_Oparts(V_H).
% 1.94/2.12 0 [] -c_lesse_quals(V_G,V_H,tc_set(tc_Message_Omsg))|c_lesse_quals(c_Message_Oparts(V_G),c_Message_Oparts(V_H),tc_set(tc_Message_Omsg)).
% 1.94/2.12 end_of_list.
% 1.94/2.12
% 1.94/2.12 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=2.
% 1.94/2.12
% 1.94/2.12 This is a Horn set with equality. The strategy will be
% 1.94/2.12 Knuth-Bendix and hyper_res, with positive clauses in
% 1.94/2.12 sos and nonpositive clauses in usable.
% 1.94/2.12
% 1.94/2.12 dependent: set(knuth_bendix).
% 1.94/2.12 dependent: set(anl_eq).
% 1.94/2.12 dependent: set(para_from).
% 1.94/2.12 dependent: set(para_into).
% 1.94/2.12 dependent: clear(para_from_right).
% 1.94/2.12 dependent: clear(para_into_right).
% 1.94/2.12 dependent: set(para_from_vars).
% 1.94/2.12 dependent: set(eq_units_both_ways).
% 1.94/2.12 dependent: set(dynamic_demod_all).
% 1.94/2.12 dependent: set(dynamic_demod).
% 1.94/2.12 dependent: set(order_eq).
% 1.94/2.12 dependent: set(back_demod).
% 1.94/2.12 dependent: set(lrpo).
% 1.94/2.12 dependent: set(hyper_res).
% 1.94/2.12 dependent: clear(order_hyper).
% 1.94/2.12
% 1.94/2.12 ------------> process usable:
% 1.94/2.12 ** KEPT (pick-wt=7): 1 [] -c_lesse_quals(c_Message_Oparts(v_G),c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)).
% 1.94/2.12 ** KEPT (pick-wt=12): 2 [] -c_lesse_quals(A,B,tc_set(tc_Message_Omsg))|c_lesse_quals(c_Message_Oparts(A),c_Message_Oparts(B),tc_set(tc_Message_Omsg)).
% 1.94/2.12
% 1.94/2.12 ------------> process sos:
% 1.94/2.12 ** KEPT (pick-wt=3): 3 [] A=A.
% 1.94/2.12 ** KEPT (pick-wt=6): 4 [] c_lesse_quals(v_G,c_Message_Oparts(v_H),tc_set(tc_Message_Omsg)).
% 1.94/2.12 ** KEPT (pick-wt=6): 5 [] c_Message_Oparts(c_Message_Oparts(A))=c_Message_Oparts(A).
% 1.94/2.12 ---> New Demodulator: 6 [new_demod,5] c_Message_Oparts(c_Message_Oparts(A))=c_Message_Oparts(A).
% 1.94/2.12 Following clause subsumed by 3 during input processing: 0 [copy,3,flip.1] A=A.
% 1.94/2.12 >>>> Starting back demodulation with 6.
% 1.94/2.12
% 1.94/2.12 ======= end of input processing =======
% 1.94/2.12
% 1.94/2.12 =========== start of search ===========
% 1.94/2.12
% 1.94/2.12 -------- PROOF --------
% 1.94/2.12
% 1.94/2.12 ----> UNIT CONFLICT at 0.00 sec ----> 8 [binary,7.1,1.1] $F.
% 1.94/2.12
% 1.94/2.12 Length of proof is 1. Level of proof is 1.
% 1.94/2.12
% 1.94/2.12 ---------------- PROOF ----------------
% 1.94/2.12 % SZS status Unsatisfiable
% 1.94/2.12 % SZS output start Refutation
% See solution above
% 1.94/2.12 ------------ end of proof -------------
% 1.94/2.12
% 1.94/2.12
% 1.94/2.12 Search stopped by max_proofs option.
% 1.94/2.12
% 1.94/2.12
% 1.94/2.12 Search stopped by max_proofs option.
% 1.94/2.12
% 1.94/2.12 ============ end of search ============
% 1.94/2.12
% 1.94/2.12 -------------- statistics -------------
% 1.94/2.12 clauses given 2
% 1.94/2.12 clauses generated 1
% 1.94/2.12 clauses kept 6
% 1.94/2.12 clauses forward subsumed 1
% 1.94/2.12 clauses back subsumed 0
% 1.94/2.12 Kbytes malloced 976
% 1.94/2.12
% 1.94/2.12 ----------- times (seconds) -----------
% 1.94/2.12 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.94/2.12 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.94/2.12 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.94/2.12
% 1.94/2.12 That finishes the proof of the theorem.
% 1.94/2.12
% 1.94/2.12 Process 30043 finished Wed Jul 27 06:35:28 2022
% 1.94/2.12 Otter interrupted
% 1.94/2.12 PROOF FOUND
%------------------------------------------------------------------------------