TSTP Solution File: SWV274-2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SWV274-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n021.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:21 EDT 2022
% Result : Unsatisfiable 2.67s 2.85s
% Output : Refutation 2.67s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 8
% Syntax : Number of clauses : 17 ( 9 unt; 5 nHn; 15 RR)
% Number of literals : 27 ( 2 equ; 6 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-3 aty)
% Number of variables : 16 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ c_in(A,B,tc_Message_Omsg)
| c_in(A,c_Message_Osynth(B),tc_Message_Omsg) ),
file('SWV274-2.p',unknown),
[] ).
cnf(2,axiom,
( ~ c_in(A,c_Message_Osynth(B),tc_Message_Omsg)
| ~ c_lesse_quals(B,c_Message_Osynth(C),tc_set(tc_Message_Omsg))
| c_in(A,c_Message_Osynth(C),tc_Message_Omsg) ),
file('SWV274-2.p',unknown),
[] ).
cnf(3,axiom,
( ~ c_in(A,c_insert(B,C,D),D)
| c_in(A,C,D)
| A = B ),
file('SWV274-2.p',unknown),
[] ).
cnf(4,axiom,
( ~ c_in(c_Main_OsubsetI__1(A,B,C),B,C)
| c_lesse_quals(A,B,tc_set(C)) ),
file('SWV274-2.p',unknown),
[] ).
cnf(5,axiom,
~ c_in(v_Y,c_Message_Osynth(v_H),tc_Message_Omsg),
file('SWV274-2.p',unknown),
[] ).
cnf(7,axiom,
( c_in(c_Main_OsubsetI__1(A,B,C),A,C)
| c_lesse_quals(A,B,tc_set(C)) ),
file('SWV274-2.p',unknown),
[] ).
cnf(8,axiom,
c_in(v_Y,c_Message_Osynth(c_insert(v_X,v_H,tc_Message_Omsg)),tc_Message_Omsg),
file('SWV274-2.p',unknown),
[] ).
cnf(9,axiom,
c_in(v_X,c_Message_Osynth(v_H),tc_Message_Omsg),
file('SWV274-2.p',unknown),
[] ).
cnf(39,plain,
( c_in(c_Main_OsubsetI__1(c_insert(v_X,v_H,tc_Message_Omsg),c_Message_Osynth(A),tc_Message_Omsg),c_insert(v_X,v_H,tc_Message_Omsg),tc_Message_Omsg)
| c_in(v_Y,c_Message_Osynth(A),tc_Message_Omsg) ),
inference(hyper,[status(thm)],[7,2,8]),
[iquote('hyper,7,2,8')] ).
cnf(1084,plain,
c_in(c_Main_OsubsetI__1(c_insert(v_X,v_H,tc_Message_Omsg),c_Message_Osynth(v_H),tc_Message_Omsg),c_insert(v_X,v_H,tc_Message_Omsg),tc_Message_Omsg),
inference(hyper,[status(thm)],[39,5]),
[iquote('hyper,39,5')] ).
cnf(1102,plain,
( c_in(c_Main_OsubsetI__1(c_insert(v_X,v_H,tc_Message_Omsg),c_Message_Osynth(v_H),tc_Message_Omsg),v_H,tc_Message_Omsg)
| c_Main_OsubsetI__1(c_insert(v_X,v_H,tc_Message_Omsg),c_Message_Osynth(v_H),tc_Message_Omsg) = v_X ),
inference(hyper,[status(thm)],[1084,3]),
[iquote('hyper,1084,3')] ).
cnf(2764,plain,
( c_lesse_quals(c_insert(v_X,v_H,tc_Message_Omsg),c_Message_Osynth(v_H),tc_set(tc_Message_Omsg))
| c_in(c_Main_OsubsetI__1(c_insert(v_X,v_H,tc_Message_Omsg),c_Message_Osynth(v_H),tc_Message_Omsg),v_H,tc_Message_Omsg) ),
inference(unit_del,[status(thm)],[inference(para_from,[status(thm),theory(equality)],[1102,4]),9]),
[iquote('para_from,1102.2.1,4.1.1,unit_del,9')] ).
cnf(3233,plain,
c_in(c_Main_OsubsetI__1(c_insert(v_X,v_H,tc_Message_Omsg),c_Message_Osynth(v_H),tc_Message_Omsg),v_H,tc_Message_Omsg),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[2764,2,8]),5]),
[iquote('hyper,2764,2,8,unit_del,5')] ).
cnf(3234,plain,
c_in(c_Main_OsubsetI__1(c_insert(v_X,v_H,tc_Message_Omsg),c_Message_Osynth(v_H),tc_Message_Omsg),c_Message_Osynth(v_H),tc_Message_Omsg),
inference(hyper,[status(thm)],[3233,1]),
[iquote('hyper,3233,1')] ).
cnf(3243,plain,
c_lesse_quals(c_insert(v_X,v_H,tc_Message_Omsg),c_Message_Osynth(v_H),tc_set(tc_Message_Omsg)),
inference(hyper,[status(thm)],[3234,4]),
[iquote('hyper,3234,4')] ).
cnf(3262,plain,
c_in(v_Y,c_Message_Osynth(v_H),tc_Message_Omsg),
inference(hyper,[status(thm)],[3243,2,8]),
[iquote('hyper,3243,2,8')] ).
cnf(3263,plain,
$false,
inference(binary,[status(thm)],[3262,5]),
[iquote('binary,3262.1,5.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13 % Problem : SWV274-2 : TPTP v8.1.0. Released v3.2.0.
% 0.12/0.13 % Command : otter-tptp-script %s
% 0.13/0.35 % Computer : n021.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Wed Jul 27 06:03:23 EDT 2022
% 0.13/0.35 % CPUTime :
% 2.67/2.85 ----- Otter 3.3f, August 2004 -----
% 2.67/2.85 The process was started by sandbox on n021.cluster.edu,
% 2.67/2.85 Wed Jul 27 06:03:23 2022
% 2.67/2.85 The command was "./otter". The process ID is 16707.
% 2.67/2.85
% 2.67/2.85 set(prolog_style_variables).
% 2.67/2.85 set(auto).
% 2.67/2.85 dependent: set(auto1).
% 2.67/2.85 dependent: set(process_input).
% 2.67/2.85 dependent: clear(print_kept).
% 2.67/2.85 dependent: clear(print_new_demod).
% 2.67/2.85 dependent: clear(print_back_demod).
% 2.67/2.85 dependent: clear(print_back_sub).
% 2.67/2.85 dependent: set(control_memory).
% 2.67/2.85 dependent: assign(max_mem, 12000).
% 2.67/2.85 dependent: assign(pick_given_ratio, 4).
% 2.67/2.85 dependent: assign(stats_level, 1).
% 2.67/2.85 dependent: assign(max_seconds, 10800).
% 2.67/2.85 clear(print_given).
% 2.67/2.85
% 2.67/2.85 list(usable).
% 2.67/2.85 0 [] A=A.
% 2.67/2.85 0 [] -c_in(V_X,V_H,tc_Message_Omsg)|c_in(V_X,c_Message_Osynth(V_H),tc_Message_Omsg).
% 2.67/2.85 0 [] -c_in(V_X,c_Message_Osynth(V_G),tc_Message_Omsg)| -c_lesse_quals(V_G,c_Message_Osynth(V_H),tc_set(tc_Message_Omsg))|c_in(V_X,c_Message_Osynth(V_H),tc_Message_Omsg).
% 2.67/2.85 0 [] -c_in(V_a,c_insert(V_b,V_A,T_a),T_a)|c_in(V_a,V_A,T_a)|V_a=V_b.
% 2.67/2.85 0 [] c_in(c_Main_OsubsetI__1(V_A,V_B,T_a),V_A,T_a)|c_lesse_quals(V_A,V_B,tc_set(T_a)).
% 2.67/2.85 0 [] -c_in(c_Main_OsubsetI__1(V_A,V_B,T_a),V_B,T_a)|c_lesse_quals(V_A,V_B,tc_set(T_a)).
% 2.67/2.85 0 [] c_in(v_Y,c_Message_Osynth(c_insert(v_X,v_H,tc_Message_Omsg)),tc_Message_Omsg).
% 2.67/2.85 0 [] c_in(v_X,c_Message_Osynth(v_H),tc_Message_Omsg).
% 2.67/2.85 0 [] -c_in(v_Y,c_Message_Osynth(v_H),tc_Message_Omsg).
% 2.67/2.85 end_of_list.
% 2.67/2.85
% 2.67/2.85 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 2.67/2.85
% 2.67/2.85 This ia a non-Horn set with equality. The strategy will be
% 2.67/2.85 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 2.67/2.85 deletion, with positive clauses in sos and nonpositive
% 2.67/2.85 clauses in usable.
% 2.67/2.85
% 2.67/2.85 dependent: set(knuth_bendix).
% 2.67/2.85 dependent: set(anl_eq).
% 2.67/2.85 dependent: set(para_from).
% 2.67/2.85 dependent: set(para_into).
% 2.67/2.85 dependent: clear(para_from_right).
% 2.67/2.85 dependent: clear(para_into_right).
% 2.67/2.85 dependent: set(para_from_vars).
% 2.67/2.85 dependent: set(eq_units_both_ways).
% 2.67/2.85 dependent: set(dynamic_demod_all).
% 2.67/2.85 dependent: set(dynamic_demod).
% 2.67/2.85 dependent: set(order_eq).
% 2.67/2.85 dependent: set(back_demod).
% 2.67/2.85 dependent: set(lrpo).
% 2.67/2.85 dependent: set(hyper_res).
% 2.67/2.85 dependent: set(unit_deletion).
% 2.67/2.85 dependent: set(factor).
% 2.67/2.85
% 2.67/2.85 ------------> process usable:
% 2.67/2.85 ** KEPT (pick-wt=9): 1 [] -c_in(A,B,tc_Message_Omsg)|c_in(A,c_Message_Osynth(B),tc_Message_Omsg).
% 2.67/2.85 ** KEPT (pick-wt=16): 2 [] -c_in(A,c_Message_Osynth(B),tc_Message_Omsg)| -c_lesse_quals(B,c_Message_Osynth(C),tc_set(tc_Message_Omsg))|c_in(A,c_Message_Osynth(C),tc_Message_Omsg).
% 2.67/2.85 ** KEPT (pick-wt=14): 3 [] -c_in(A,c_insert(B,C,D),D)|c_in(A,C,D)|A=B.
% 2.67/2.85 ** KEPT (pick-wt=12): 4 [] -c_in(c_Main_OsubsetI__1(A,B,C),B,C)|c_lesse_quals(A,B,tc_set(C)).
% 2.67/2.85 ** KEPT (pick-wt=5): 5 [] -c_in(v_Y,c_Message_Osynth(v_H),tc_Message_Omsg).
% 2.67/2.85
% 2.67/2.85 ------------> process sos:
% 2.67/2.85 ** KEPT (pick-wt=3): 6 [] A=A.
% 2.67/2.85 ** KEPT (pick-wt=12): 7 [] c_in(c_Main_OsubsetI__1(A,B,C),A,C)|c_lesse_quals(A,B,tc_set(C)).
% 2.67/2.85 ** KEPT (pick-wt=8): 8 [] c_in(v_Y,c_Message_Osynth(c_insert(v_X,v_H,tc_Message_Omsg)),tc_Message_Omsg).
% 2.67/2.85 ** KEPT (pick-wt=5): 9 [] c_in(v_X,c_Message_Osynth(v_H),tc_Message_Omsg).
% 2.67/2.85 Following clause subsumed by 6 during input processing: 0 [copy,6,flip.1] A=A.
% 2.67/2.85
% 2.67/2.85 ======= end of input processing =======
% 2.67/2.85
% 2.67/2.85 =========== start of search ===========
% 2.67/2.85
% 2.67/2.85
% 2.67/2.85 Resetting weight limit to 24.
% 2.67/2.85
% 2.67/2.85
% 2.67/2.85 Resetting weight limit to 24.
% 2.67/2.85
% 2.67/2.85 sos_size=2929
% 2.67/2.85
% 2.67/2.85 -------- PROOF --------
% 2.67/2.85
% 2.67/2.85 ----> UNIT CONFLICT at 0.93 sec ----> 3263 [binary,3262.1,5.1] $F.
% 2.67/2.85
% 2.67/2.85 Length of proof is 8. Level of proof is 8.
% 2.67/2.85
% 2.67/2.85 ---------------- PROOF ----------------
% 2.67/2.85 % SZS status Unsatisfiable
% 2.67/2.85 % SZS output start Refutation
% See solution above
% 2.67/2.85 ------------ end of proof -------------
% 2.67/2.85
% 2.67/2.85
% 2.67/2.85 Search stopped by max_proofs option.
% 2.67/2.85
% 2.67/2.85
% 2.67/2.85 Search stopped by max_proofs option.
% 2.67/2.85
% 2.67/2.85 ============ end of search ============
% 2.67/2.85
% 2.67/2.85 -------------- statistics -------------
% 2.67/2.85 clauses given 227
% 2.67/2.85 clauses generated 4797
% 2.67/2.85 clauses kept 3262
% 2.67/2.85 clauses forward subsumed 1383
% 2.67/2.85 clauses back subsumed 106
% 2.67/2.85 Kbytes malloced 4882
% 2.67/2.85
% 2.67/2.85 ----------- times (seconds) -----------
% 2.67/2.85 user CPU time 0.93 (0 hr, 0 min, 0 sec)
% 2.67/2.85 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.67/2.85 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.67/2.85
% 2.67/2.85 That finishes the proof of the theorem.
% 2.67/2.85
% 2.67/2.85 Process 16707 finished Wed Jul 27 06:03:25 2022
% 2.67/2.85 Otter interrupted
% 2.67/2.85 PROOF FOUND
%------------------------------------------------------------------------------