TSTP Solution File: SWV251-2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SWV251-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n014.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:17 EDT 2022
% Result : Unsatisfiable 1.90s 2.06s
% Output : Refutation 1.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 12
% Syntax : Number of clauses : 23 ( 14 unt; 0 nHn; 13 RR)
% Number of literals : 35 ( 5 equ; 14 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 11 ( 11 usr; 5 con; 0-3 aty)
% Number of variables : 50 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ c_lesse_quals(A,B,tc_set(tc_Message_Omsg))
| c_lesse_quals(c_Message_Oanalz(A),c_Message_Oanalz(B),tc_set(tc_Message_Omsg)) ),
file('SWV251-2.p',unknown),
[] ).
cnf(2,axiom,
( ~ c_lesse_quals(c_union(A,B,C),D,tc_set(C))
| c_lesse_quals(A,D,tc_set(C)) ),
file('SWV251-2.p',unknown),
[] ).
cnf(3,axiom,
( ~ c_lesse_quals(c_union(A,B,C),D,tc_set(C))
| c_lesse_quals(B,D,tc_set(C)) ),
file('SWV251-2.p',unknown),
[] ).
cnf(4,axiom,
( ~ c_lesse_quals(A,B,tc_set(C))
| ~ c_lesse_quals(D,B,tc_set(C))
| c_lesse_quals(c_union(D,A,C),B,tc_set(C)) ),
file('SWV251-2.p',unknown),
[] ).
cnf(5,axiom,
( ~ c_in(A,B,C)
| c_minus(c_insert(A,D,C),B,tc_set(C)) = c_minus(D,B,tc_set(C)) ),
file('SWV251-2.p',unknown),
[] ).
cnf(6,axiom,
( ~ c_in(A,B,C)
| ~ c_lesse_quals(B,D,tc_set(C))
| c_in(A,D,C) ),
file('SWV251-2.p',unknown),
[] ).
cnf(7,axiom,
( ~ c_lesse_quals(A,B,tc_set(C))
| ~ c_lesse_quals(B,A,tc_set(C))
| B = A ),
file('SWV251-2.p',unknown),
[] ).
cnf(8,axiom,
~ c_in(v_x,c_Message_Oanalz(c_union(c_Message_Osynth(c_Message_Oanalz(v_G)),v_H,tc_Message_Omsg)),tc_Message_Omsg),
file('SWV251-2.p',unknown),
[] ).
cnf(11,axiom,
c_union(c_minus(A,B,tc_set(C)),B,C) = c_union(A,B,C),
file('SWV251-2.p',unknown),
[] ).
cnf(14,axiom,
c_lesse_quals(A,A,tc_set(B)),
file('SWV251-2.p',unknown),
[] ).
cnf(15,axiom,
c_in(v_X,c_Message_Osynth(c_Message_Oanalz(v_G)),tc_Message_Omsg),
file('SWV251-2.p',unknown),
[] ).
cnf(16,axiom,
c_in(v_x,c_Message_Oanalz(c_insert(v_X,v_H,tc_Message_Omsg)),tc_Message_Omsg),
file('SWV251-2.p',unknown),
[] ).
cnf(18,plain,
c_lesse_quals(A,c_union(B,A,C),tc_set(C)),
inference(hyper,[status(thm)],[14,3]),
[iquote('hyper,14,3')] ).
cnf(19,plain,
c_lesse_quals(A,c_union(A,B,C),tc_set(C)),
inference(hyper,[status(thm)],[14,2]),
[iquote('hyper,14,2')] ).
cnf(45,plain,
( c_union(c_insert(A,B,C),D,C) = c_union(B,D,C)
| ~ c_in(A,D,C) ),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[11,5]),11])]),
[iquote('para_into,10.1.1.1,5.2.1,demod,11,flip.1')] ).
cnf(63,plain,
c_lesse_quals(c_union(A,B,C),c_union(B,A,C),tc_set(C)),
inference(hyper,[status(thm)],[19,4,18]),
[iquote('hyper,19,4,18')] ).
cnf(67,plain,
c_lesse_quals(c_Message_Oanalz(A),c_Message_Oanalz(c_union(A,B,tc_Message_Omsg)),tc_set(tc_Message_Omsg)),
inference(hyper,[status(thm)],[19,1]),
[iquote('hyper,19,1')] ).
cnf(110,plain,
c_in(v_x,c_Message_Oanalz(c_union(c_insert(v_X,v_H,tc_Message_Omsg),A,tc_Message_Omsg)),tc_Message_Omsg),
inference(hyper,[status(thm)],[67,6,16]),
[iquote('hyper,67,6,16')] ).
cnf(188,plain,
c_union(A,B,C) = c_union(B,A,C),
inference(hyper,[status(thm)],[63,7,63]),
[iquote('hyper,63,7,63')] ).
cnf(216,plain,
~ c_in(v_x,c_Message_Oanalz(c_union(v_H,c_Message_Osynth(c_Message_Oanalz(v_G)),tc_Message_Omsg)),tc_Message_Omsg),
inference(para_from,[status(thm),theory(equality)],[188,8]),
[iquote('para_from,188.1.1,8.1.2.1')] ).
cnf(511,plain,
( c_in(v_x,c_Message_Oanalz(c_union(v_H,A,tc_Message_Omsg)),tc_Message_Omsg)
| ~ c_in(v_X,A,tc_Message_Omsg) ),
inference(para_from,[status(thm),theory(equality)],[45,110]),
[iquote('para_from,45.1.1,110.1.2.1')] ).
cnf(514,plain,
c_in(v_x,c_Message_Oanalz(c_union(v_H,c_Message_Osynth(c_Message_Oanalz(v_G)),tc_Message_Omsg)),tc_Message_Omsg),
inference(hyper,[status(thm)],[511,15]),
[iquote('hyper,511,15')] ).
cnf(515,plain,
$false,
inference(binary,[status(thm)],[514,216]),
[iquote('binary,514.1,216.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SWV251-2 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.14 % Command : otter-tptp-script %s
% 0.13/0.35 % Computer : n014.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 05:53:24 EDT 2022
% 0.13/0.35 % CPUTime :
% 1.81/2.00 ----- Otter 3.3f, August 2004 -----
% 1.81/2.00 The process was started by sandbox on n014.cluster.edu,
% 1.81/2.00 Wed Jul 27 05:53:24 2022
% 1.81/2.00 The command was "./otter". The process ID is 6274.
% 1.81/2.00
% 1.81/2.00 set(prolog_style_variables).
% 1.81/2.00 set(auto).
% 1.81/2.00 dependent: set(auto1).
% 1.81/2.00 dependent: set(process_input).
% 1.81/2.00 dependent: clear(print_kept).
% 1.81/2.00 dependent: clear(print_new_demod).
% 1.81/2.00 dependent: clear(print_back_demod).
% 1.81/2.00 dependent: clear(print_back_sub).
% 1.81/2.00 dependent: set(control_memory).
% 1.81/2.00 dependent: assign(max_mem, 12000).
% 1.81/2.00 dependent: assign(pick_given_ratio, 4).
% 1.81/2.00 dependent: assign(stats_level, 1).
% 1.81/2.00 dependent: assign(max_seconds, 10800).
% 1.81/2.00 clear(print_given).
% 1.81/2.00
% 1.81/2.00 list(usable).
% 1.81/2.00 0 [] A=A.
% 1.81/2.00 0 [] -c_lesse_quals(V_G,V_H,tc_set(tc_Message_Omsg))|c_lesse_quals(c_Message_Oanalz(V_G),c_Message_Oanalz(V_H),tc_set(tc_Message_Omsg)).
% 1.81/2.00 0 [] c_union(c_minus(V_B,V_A,tc_set(T_a)),V_A,T_a)=c_union(V_B,V_A,T_a).
% 1.81/2.00 0 [] c_union(V_A,c_minus(V_B,V_A,tc_set(T_a)),T_a)=c_union(V_A,V_B,T_a).
% 1.81/2.00 0 [] -c_lesse_quals(c_union(V_A,V_B,T_a),V_C,tc_set(T_a))|c_lesse_quals(V_A,V_C,tc_set(T_a)).
% 1.81/2.00 0 [] -c_lesse_quals(c_union(V_A,V_B,T_a),V_C,tc_set(T_a))|c_lesse_quals(V_B,V_C,tc_set(T_a)).
% 1.81/2.00 0 [] -c_lesse_quals(V_B,V_C,tc_set(T_a))| -c_lesse_quals(V_A,V_C,tc_set(T_a))|c_lesse_quals(c_union(V_A,V_B,T_a),V_C,tc_set(T_a)).
% 1.81/2.00 0 [] -c_in(V_x,V_B,T_a)|c_minus(c_insert(V_x,V_A,T_a),V_B,tc_set(T_a))=c_minus(V_A,V_B,tc_set(T_a)).
% 1.81/2.00 0 [] -c_in(V_c,V_A,T_a)| -c_lesse_quals(V_A,V_B,tc_set(T_a))|c_in(V_c,V_B,T_a).
% 1.81/2.00 0 [] -c_lesse_quals(V_B,V_A,tc_set(T_a))| -c_lesse_quals(V_A,V_B,tc_set(T_a))|V_A=V_B.
% 1.81/2.00 0 [] c_lesse_quals(V_A,V_A,tc_set(T_a)).
% 1.81/2.00 0 [] c_in(v_X,c_Message_Osynth(c_Message_Oanalz(v_G)),tc_Message_Omsg).
% 1.81/2.00 0 [] c_in(v_x,c_Message_Oanalz(c_insert(v_X,v_H,tc_Message_Omsg)),tc_Message_Omsg).
% 1.81/2.00 0 [] -c_in(v_x,c_Message_Oanalz(c_union(c_Message_Osynth(c_Message_Oanalz(v_G)),v_H,tc_Message_Omsg)),tc_Message_Omsg).
% 1.81/2.00 end_of_list.
% 1.81/2.00
% 1.81/2.00 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 1.81/2.00
% 1.81/2.00 This is a Horn set with equality. The strategy will be
% 1.81/2.00 Knuth-Bendix and hyper_res, with positive clauses in
% 1.81/2.00 sos and nonpositive clauses in usable.
% 1.81/2.00
% 1.81/2.00 dependent: set(knuth_bendix).
% 1.81/2.00 dependent: set(anl_eq).
% 1.81/2.00 dependent: set(para_from).
% 1.81/2.00 dependent: set(para_into).
% 1.81/2.00 dependent: clear(para_from_right).
% 1.81/2.00 dependent: clear(para_into_right).
% 1.81/2.00 dependent: set(para_from_vars).
% 1.81/2.00 dependent: set(eq_units_both_ways).
% 1.81/2.00 dependent: set(dynamic_demod_all).
% 1.81/2.00 dependent: set(dynamic_demod).
% 1.81/2.00 dependent: set(order_eq).
% 1.81/2.00 dependent: set(back_demod).
% 1.81/2.00 dependent: set(lrpo).
% 1.81/2.00 dependent: set(hyper_res).
% 1.81/2.00 dependent: clear(order_hyper).
% 1.81/2.00
% 1.81/2.00 ------------> process usable:
% 1.81/2.00 ** KEPT (pick-wt=12): 1 [] -c_lesse_quals(A,B,tc_set(tc_Message_Omsg))|c_lesse_quals(c_Message_Oanalz(A),c_Message_Oanalz(B),tc_set(tc_Message_Omsg)).
% 1.81/2.00 ** KEPT (pick-wt=13): 2 [] -c_lesse_quals(c_union(A,B,C),D,tc_set(C))|c_lesse_quals(A,D,tc_set(C)).
% 1.81/2.00 ** KEPT (pick-wt=13): 3 [] -c_lesse_quals(c_union(A,B,C),D,tc_set(C))|c_lesse_quals(B,D,tc_set(C)).
% 1.81/2.00 ** KEPT (pick-wt=18): 4 [] -c_lesse_quals(A,B,tc_set(C))| -c_lesse_quals(D,B,tc_set(C))|c_lesse_quals(c_union(D,A,C),B,tc_set(C)).
% 1.81/2.00 ** KEPT (pick-wt=18): 5 [] -c_in(A,B,C)|c_minus(c_insert(A,D,C),B,tc_set(C))=c_minus(D,B,tc_set(C)).
% 1.81/2.00 ** KEPT (pick-wt=13): 6 [] -c_in(A,B,C)| -c_lesse_quals(B,D,tc_set(C))|c_in(A,D,C).
% 1.81/2.00 ** KEPT (pick-wt=13): 7 [] -c_lesse_quals(A,B,tc_set(C))| -c_lesse_quals(B,A,tc_set(C))|B=A.
% 1.81/2.00 ** KEPT (pick-wt=10): 8 [] -c_in(v_x,c_Message_Oanalz(c_union(c_Message_Osynth(c_Message_Oanalz(v_G)),v_H,tc_Message_Omsg)),tc_Message_Omsg).
% 1.81/2.00
% 1.81/2.00 ------------> process sos:
% 1.81/2.00 ** KEPT (pick-wt=3): 9 [] A=A.
% 1.81/2.00 ** KEPT (pick-wt=13): 10 [] c_union(c_minus(A,B,tc_set(C)),B,C)=c_union(A,B,C).
% 1.81/2.00 ---> New Demodulator: 11 [new_demod,10] c_union(c_minus(A,B,tc_set(C)),B,C)=c_union(A,B,C).
% 1.81/2.00 ** KEPT (pick-wt=13): 12 [] c_union(A,c_minus(B,A,tc_set(C)),C)=c_union(A,B,C).
% 1.81/2.00 ---> New Demodulator: 13 [new_demod,12] c_union(A,c_minus(B,A,tc_set(C)),C)=c_union(A,B,C).
% 1.81/2.00 ** KEPT (pick-wt=5): 14 [] c_lesse_quals(A,A,tc_set(B)).
% 1.81/2.00 ** KEPT (pick-wt=6): 15 [] c_in(v_X,c_Message_Osynth(c_Message_Oanalz(v_G)),tc_Message_Omsg).
% 1.81/2.00 ** KEPT (pick-wt=8): 16 [] c_in(v_x,c_Message_Oanalz(c_insert(v_X,v_H,tc_Message_Omsg)),tc_Message_Omsg).
% 1.90/2.06 Following clause subsumed by 9 during input processing: 0 [copy,9,flip.1] A=A.
% 1.90/2.06 >>>> Starting back demodulation with 11.
% 1.90/2.06 >>>> Starting back demodulation with 13.
% 1.90/2.06
% 1.90/2.06 ======= end of input processing =======
% 1.90/2.06
% 1.90/2.06 =========== start of search ===========
% 1.90/2.06
% 1.90/2.06
% 1.90/2.06 Resetting weight limit to 14.
% 1.90/2.06
% 1.90/2.06
% 1.90/2.06 Resetting weight limit to 14.
% 1.90/2.06
% 1.90/2.06 sos_size=427
% 1.90/2.06
% 1.90/2.06 -------- PROOF --------
% 1.90/2.06
% 1.90/2.06 ----> UNIT CONFLICT at 0.05 sec ----> 515 [binary,514.1,216.1] $F.
% 1.90/2.06
% 1.90/2.06 Length of proof is 10. Level of proof is 5.
% 1.90/2.06
% 1.90/2.06 ---------------- PROOF ----------------
% 1.90/2.06 % SZS status Unsatisfiable
% 1.90/2.06 % SZS output start Refutation
% See solution above
% 1.90/2.06 ------------ end of proof -------------
% 1.90/2.06
% 1.90/2.06
% 1.90/2.06 Search stopped by max_proofs option.
% 1.90/2.06
% 1.90/2.06
% 1.90/2.06 Search stopped by max_proofs option.
% 1.90/2.06
% 1.90/2.06 ============ end of search ============
% 1.90/2.06
% 1.90/2.06 -------------- statistics -------------
% 1.90/2.06 clauses given 102
% 1.90/2.06 clauses generated 4069
% 1.90/2.06 clauses kept 493
% 1.90/2.06 clauses forward subsumed 1231
% 1.90/2.06 clauses back subsumed 0
% 1.90/2.06 Kbytes malloced 4882
% 1.90/2.06
% 1.90/2.06 ----------- times (seconds) -----------
% 1.90/2.06 user CPU time 0.05 (0 hr, 0 min, 0 sec)
% 1.90/2.06 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.90/2.06 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.90/2.06
% 1.90/2.06 That finishes the proof of the theorem.
% 1.90/2.06
% 1.90/2.06 Process 6274 finished Wed Jul 27 05:53:26 2022
% 1.90/2.06 Otter interrupted
% 1.90/2.06 PROOF FOUND
%------------------------------------------------------------------------------