TSTP Solution File: SWV864-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SWV864-1 : TPTP v8.1.0. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n020.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:21:41 EDT 2022
% Result : Unsatisfiable 2.02s 2.21s
% Output : Refutation 2.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 12 ( 7 unt; 1 nHn; 11 RR)
% Number of literals : 18 ( 9 equ; 8 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 2 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-1 aty)
% Number of variables : 8 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(12,axiom,
( A = B
| ~ c_Natural_Oevalc(C,D,A)
| ~ c_Natural_Oevalc(C,D,B) ),
file('SWV864-1.p',unknown),
[] ).
cnf(15,axiom,
( v_sko__Hoare__Mirabelle__Xsingle__stateE__1(A) != A
| ~ c_Hoare__Mirabelle_Ostate__not__singleton ),
file('SWV864-1.p',unknown),
[] ).
cnf(21,axiom,
~ c_Natural_Oevalc(v_c,v_x,v_xa),
file('SWV864-1.p',unknown),
[] ).
cnf(22,axiom,
( A != v_xb(A)
| A = v_xa ),
file('SWV864-1.p',unknown),
[] ).
cnf(23,plain,
( v_xb(A) != A
| A = v_xa ),
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[22])]),
[iquote('copy,22,flip.1')] ).
cnf(33,axiom,
c_Hoare__Mirabelle_Ostate__not__singleton,
file('SWV864-1.p',unknown),
[] ).
cnf(34,axiom,
( A = v_xa
| c_Natural_Oevalc(v_c,v_x,v_xb(A)) ),
file('SWV864-1.p',unknown),
[] ).
cnf(54,plain,
c_Natural_Oevalc(v_c,v_x,v_xb(v_sko__Hoare__Mirabelle__Xsingle__stateE__1(v_xa))),
inference(hyper,[status(thm)],[34,15,33]),
[iquote('hyper,34,15,33')] ).
cnf(160,plain,
c_Natural_Oevalc(v_c,v_x,v_xb(v_xb(v_sko__Hoare__Mirabelle__Xsingle__stateE__1(v_xa)))),
inference(unit_del,[status(thm)],[inference(para_into,[status(thm),theory(equality)],[54,34]),21]),
[iquote('para_into,54.1.3,34.1.1,unit_del,21')] ).
cnf(161,plain,
v_xb(v_xb(v_sko__Hoare__Mirabelle__Xsingle__stateE__1(v_xa))) != v_xb(v_sko__Hoare__Mirabelle__Xsingle__stateE__1(v_xa)),
inference(unit_del,[status(thm)],[inference(para_into,[status(thm),theory(equality)],[54,23]),21]),
[iquote('para_into,54.1.3,23.2.1,unit_del,21')] ).
cnf(289,plain,
v_xb(v_xb(v_sko__Hoare__Mirabelle__Xsingle__stateE__1(v_xa))) = v_xb(v_sko__Hoare__Mirabelle__Xsingle__stateE__1(v_xa)),
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[160,12,54])]),
[iquote('hyper,160,12,54,flip.1')] ).
cnf(291,plain,
$false,
inference(binary,[status(thm)],[289,161]),
[iquote('binary,289.1,161.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SWV864-1 : TPTP v8.1.0. Released v4.1.0.
% 0.07/0.13 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n020.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:02:38 EDT 2022
% 0.13/0.34 % CPUTime :
% 2.02/2.20 ----- Otter 3.3f, August 2004 -----
% 2.02/2.20 The process was started by sandbox2 on n020.cluster.edu,
% 2.02/2.20 Wed Jul 27 06:02:38 2022
% 2.02/2.20 The command was "./otter". The process ID is 31921.
% 2.02/2.20
% 2.02/2.20 set(prolog_style_variables).
% 2.02/2.20 set(auto).
% 2.02/2.20 dependent: set(auto1).
% 2.02/2.20 dependent: set(process_input).
% 2.02/2.20 dependent: clear(print_kept).
% 2.02/2.20 dependent: clear(print_new_demod).
% 2.02/2.20 dependent: clear(print_back_demod).
% 2.02/2.20 dependent: clear(print_back_sub).
% 2.02/2.20 dependent: set(control_memory).
% 2.02/2.20 dependent: assign(max_mem, 12000).
% 2.02/2.20 dependent: assign(pick_given_ratio, 4).
% 2.02/2.20 dependent: assign(stats_level, 1).
% 2.02/2.20 dependent: assign(max_seconds, 10800).
% 2.02/2.20 clear(print_given).
% 2.02/2.20
% 2.02/2.20 list(usable).
% 2.02/2.20 0 [] A=A.
% 2.02/2.20 0 [] c_Fun_Oid(V_x,T_a)=V_x.
% 2.02/2.20 0 [] V_t=V_s| -c_Natural_Oevaln(c_Com_Ocom_OSKIP,V_s,V_n,V_t).
% 2.02/2.20 0 [] c_Natural_Oevalc(V_c2,c_Natural_Osko__Natural__Xevalc__elim__cases__4__1(V_c1,V_c2,V_s,V_t),V_t)| -c_Natural_Oevalc(c_Com_Ocom_OSemi(V_c1,V_c2),V_s,V_t).
% 2.02/2.20 0 [] c_Natural_Oevalc(V_c1,V_s,c_Natural_Osko__Natural__Xevalc__elim__cases__4__1(V_c1,V_c2,V_s,V_t))| -c_Natural_Oevalc(c_Com_Ocom_OSemi(V_c1,V_c2),V_s,V_t).
% 2.02/2.20 0 [] c_Natural_Oevaln(c_Com_Ocom_OSemi(V_c0,V_c1),V_s0,V_n,V_s2)| -c_Natural_Oevaln(V_c1,V_s1,V_n,V_s2)| -c_Natural_Oevaln(V_c0,V_s0,V_n,V_s1).
% 2.02/2.20 0 [] c_Natural_Oevaln(V_c,V_s,c_Natural_Osko__Natural__Xeval__e_q__1__1(V_c,V_s,V_t),V_t)| -c_Natural_Oevalc(V_c,V_s,V_t).
% 2.02/2.20 0 [] c_Com_Ocom_OSemi(V_com1,V_com2)!=c_Com_Ocom_OSemi(V_com1_H,V_com2_H)|V_com2=V_com2_H.
% 2.02/2.20 0 [] c_Com_Ocom_OSemi(V_com1,V_com2)!=c_Com_Ocom_OSemi(V_com1_H,V_com2_H)|V_com1=V_com1_H.
% 2.02/2.20 0 [] c_Natural_Oevaln(V_c2,c_Natural_Osko__Natural__Xevaln__elim__cases__4__1(V_c1,V_c2,V_n,V_s,V_t),V_n,V_t)| -c_Natural_Oevaln(c_Com_Ocom_OSemi(V_c1,V_c2),V_s,V_n,V_t).
% 2.02/2.20 0 [] c_Natural_Oevaln(V_c1,V_s,V_n,c_Natural_Osko__Natural__Xevaln__elim__cases__4__1(V_c1,V_c2,V_n,V_s,V_t))| -c_Natural_Oevaln(c_Com_Ocom_OSemi(V_c1,V_c2),V_s,V_n,V_t).
% 2.02/2.20 0 [] c_Natural_Oevaln(c_Com_Ocom_OSKIP,V_s,V_n,V_s).
% 2.02/2.20 0 [] c_Com_Ocom_OSemi(V_com1_H,V_com2_H)!=c_Com_Ocom_OSKIP.
% 2.02/2.20 0 [] c_Natural_Oevaln(V_c,V_s,c_Natural_Osko__Natural__Xevalc__evaln__1__1(V_c,V_s,V_t),V_t)| -c_Natural_Oevalc(V_c,V_s,V_t).
% 2.02/2.20 0 [] c_Com_Ocom_OSKIP!=c_Com_Ocom_OSemi(V_com1_H,V_com2_H).
% 2.02/2.20 0 [] V_u=V_t| -c_Natural_Oevalc(V_c,V_s,V_u)| -c_Natural_Oevalc(V_c,V_s,V_t).
% 2.02/2.20 0 [] c_Natural_Oevalc(c_Com_Ocom_OSKIP,V_s,V_s).
% 2.02/2.20 0 [] c_Fun_Oid(v_x,t_a)=v_x.
% 2.02/2.20 0 [] v_sko__Hoare__Mirabelle__Xstate__not__singleton__def__raw__1!=v_sko__Hoare__Mirabelle__Xstate__not__singleton__def__raw__2| -c_Hoare__Mirabelle_Ostate__not__singleton.
% 2.02/2.20 0 [] c_Hoare__Mirabelle_Ostate__not__singleton|V_x=V_xa.
% 2.02/2.20 0 [] v_sko__Hoare__Mirabelle__Xsingle__stateE__1(V_t)!=V_t| -c_Hoare__Mirabelle_Ostate__not__singleton.
% 2.02/2.20 0 [] c_Natural_Oevalc(c_Com_Ocom_OSemi(V_c0,V_c1),V_s0,V_s2)| -c_Natural_Oevalc(V_c1,V_s1,V_s2)| -c_Natural_Oevalc(V_c0,V_s0,V_s1).
% 2.02/2.20 0 [] v_sko__Hoare__Mirabelle__Xstate__not__singleton__def__1!=v_sko__Hoare__Mirabelle__Xstate__not__singleton__def__2| -c_Hoare__Mirabelle_Ostate__not__singleton.
% 2.02/2.20 0 [] V_t=V_s| -c_Natural_Oevalc(c_Com_Ocom_OSKIP,V_s,V_t).
% 2.02/2.20 0 [] c_Natural_Oevalc(V_c,V_s,V_t)| -c_Natural_Oevaln(V_c,V_s,V_n,V_t).
% 2.02/2.20 0 [] c_Natural_Oevalc(V_c,V_s,V_t)| -c_Natural_Oevaln(V_c,V_s,V_x,V_t).
% 2.02/2.20 0 [] c_Hoare__Mirabelle_Ostate__not__singleton.
% 2.02/2.20 0 [] -c_Natural_Oevalc(v_c,v_x,v_xa).
% 2.02/2.20 0 [] V_Z_H=v_xa|c_Natural_Oevalc(v_c,v_x,v_xb(V_Z_H)).
% 2.02/2.20 0 [] V_Z_H!=v_xb(V_Z_H)|V_Z_H=v_xa.
% 2.02/2.20 end_of_list.
% 2.02/2.20
% 2.02/2.20 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 2.02/2.20
% 2.02/2.20 This ia a non-Horn set with equality. The strategy will be
% 2.02/2.20 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 2.02/2.20 deletion, with positive clauses in sos and nonpositive
% 2.02/2.20 clauses in usable.
% 2.02/2.20
% 2.02/2.20 dependent: set(knuth_bendix).
% 2.02/2.20 dependent: set(anl_eq).
% 2.02/2.20 dependent: set(para_from).
% 2.02/2.20 dependent: set(para_into).
% 2.02/2.20 dependent: clear(para_from_right).
% 2.02/2.20 dependent: clear(para_into_right).
% 2.02/2.20 dependent: set(para_from_vars).
% 2.02/2.20 dependent: set(eq_units_both_ways).
% 2.02/2.20 dependent: set(dynamic_demod_all).
% 2.02/2.20 dependent: set(dynamic_demod).
% 2.02/2.20 dependent: set(order_eq).
% 2.02/2.20 dependent: set(back_demod).
% 2.02/2.20 dependent: set(lrpo).
% 2.02/2.20 dependent: set(hyper_res).
% 2.02/2.20 dependent: set(unit_deletion).
% 2.02/2.20 dependent: set(factor).
% 2.02/2.21
% 2.02/2.21 ------------> process usable:
% 2.02/2.21 ** KEPT (pick-wt=8): 1 [] A=B| -c_Natural_Oevaln(c_Com_Ocom_OSKIP,B,C,A).
% 2.02/2.21 ** KEPT (pick-wt=14): 2 [] c_Natural_Oevalc(A,c_Natural_Osko__Natural__Xevalc__elim__cases__4__1(B,A,C,D),D)| -c_Natural_Oevalc(c_Com_Ocom_OSemi(B,A),C,D).
% 2.02/2.21 ** KEPT (pick-wt=14): 3 [] c_Natural_Oevalc(A,B,c_Natural_Osko__Natural__Xevalc__elim__cases__4__1(A,C,B,D))| -c_Natural_Oevalc(c_Com_Ocom_OSemi(A,C),B,D).
% 2.02/2.21 ** KEPT (pick-wt=17): 4 [] c_Natural_Oevaln(c_Com_Ocom_OSemi(A,B),C,D,E)| -c_Natural_Oevaln(B,F,D,E)| -c_Natural_Oevaln(A,C,D,F).
% 2.02/2.21 ** KEPT (pick-wt=12): 5 [] c_Natural_Oevaln(A,B,c_Natural_Osko__Natural__Xeval__e_q__1__1(A,B,C),C)| -c_Natural_Oevalc(A,B,C).
% 2.02/2.21 ** KEPT (pick-wt=10): 6 [] c_Com_Ocom_OSemi(A,B)!=c_Com_Ocom_OSemi(C,D)|B=D.
% 2.02/2.21 ** KEPT (pick-wt=10): 7 [] c_Com_Ocom_OSemi(A,B)!=c_Com_Ocom_OSemi(C,D)|A=C.
% 2.02/2.21 ** KEPT (pick-wt=17): 8 [] c_Natural_Oevaln(A,c_Natural_Osko__Natural__Xevaln__elim__cases__4__1(B,A,C,D,E),C,E)| -c_Natural_Oevaln(c_Com_Ocom_OSemi(B,A),D,C,E).
% 2.02/2.21 ** KEPT (pick-wt=17): 9 [] c_Natural_Oevaln(A,B,C,c_Natural_Osko__Natural__Xevaln__elim__cases__4__1(A,D,C,B,E))| -c_Natural_Oevaln(c_Com_Ocom_OSemi(A,D),B,C,E).
% 2.02/2.21 ** KEPT (pick-wt=5): 10 [] c_Com_Ocom_OSemi(A,B)!=c_Com_Ocom_OSKIP.
% 2.02/2.21 ** KEPT (pick-wt=12): 11 [] c_Natural_Oevaln(A,B,c_Natural_Osko__Natural__Xevalc__evaln__1__1(A,B,C),C)| -c_Natural_Oevalc(A,B,C).
% 2.02/2.21 Following clause subsumed by 10 during input processing: 0 [flip.1] c_Com_Ocom_OSemi(A,B)!=c_Com_Ocom_OSKIP.
% 2.02/2.21 ** KEPT (pick-wt=11): 12 [] A=B| -c_Natural_Oevalc(C,D,A)| -c_Natural_Oevalc(C,D,B).
% 2.02/2.21 ** KEPT (pick-wt=4): 14 [copy,13,flip.1] v_sko__Hoare__Mirabelle__Xstate__not__singleton__def__raw__2!=v_sko__Hoare__Mirabelle__Xstate__not__singleton__def__raw__1| -c_Hoare__Mirabelle_Ostate__not__singleton.
% 2.02/2.21 ** KEPT (pick-wt=5): 15 [] v_sko__Hoare__Mirabelle__Xsingle__stateE__1(A)!=A| -c_Hoare__Mirabelle_Ostate__not__singleton.
% 2.02/2.21 ** KEPT (pick-wt=14): 16 [] c_Natural_Oevalc(c_Com_Ocom_OSemi(A,B),C,D)| -c_Natural_Oevalc(B,E,D)| -c_Natural_Oevalc(A,C,E).
% 2.02/2.21 ** KEPT (pick-wt=4): 18 [copy,17,flip.1] v_sko__Hoare__Mirabelle__Xstate__not__singleton__def__2!=v_sko__Hoare__Mirabelle__Xstate__not__singleton__def__1| -c_Hoare__Mirabelle_Ostate__not__singleton.
% 2.02/2.21 ** KEPT (pick-wt=7): 19 [] A=B| -c_Natural_Oevalc(c_Com_Ocom_OSKIP,B,A).
% 2.02/2.21 ** KEPT (pick-wt=9): 20 [] c_Natural_Oevalc(A,B,C)| -c_Natural_Oevaln(A,B,D,C).
% 2.02/2.21 Following clause subsumed by 20 during input processing: 0 [] c_Natural_Oevalc(A,B,C)| -c_Natural_Oevaln(A,B,D,C).
% 2.02/2.21 ** KEPT (pick-wt=4): 21 [] -c_Natural_Oevalc(v_c,v_x,v_xa).
% 2.02/2.21 ** KEPT (pick-wt=7): 23 [copy,22,flip.1] v_xb(A)!=A|A=v_xa.
% 2.02/2.21
% 2.02/2.21 ------------> process sos:
% 2.02/2.21 ** KEPT (pick-wt=3): 27 [] A=A.
% 2.02/2.21 ** KEPT (pick-wt=5): 28 [] c_Fun_Oid(A,B)=A.
% 2.02/2.21 ---> New Demodulator: 29 [new_demod,28] c_Fun_Oid(A,B)=A.
% 2.02/2.21 ** KEPT (pick-wt=5): 30 [] c_Natural_Oevaln(c_Com_Ocom_OSKIP,A,B,A).
% 2.02/2.21 ** KEPT (pick-wt=4): 31 [] c_Natural_Oevalc(c_Com_Ocom_OSKIP,A,A).
% 2.02/2.21 Following clause subsumed by 27 during input processing: 0 [demod,29] v_x=v_x.
% 2.02/2.21 ** KEPT (pick-wt=4): 32 [] c_Hoare__Mirabelle_Ostate__not__singleton|A=B.
% 2.02/2.21 ** KEPT (pick-wt=1): 33 [] c_Hoare__Mirabelle_Ostate__not__singleton.
% 2.02/2.21 ** KEPT (pick-wt=8): 34 [] A=v_xa|c_Natural_Oevalc(v_c,v_x,v_xb(A)).
% 2.02/2.21 Following clause subsumed by 27 during input processing: 0 [copy,27,flip.1] A=A.
% 2.02/2.21 27 back subsumes 25.
% 2.02/2.21 >>>> Starting back demodulation with 29.
% 2.02/2.21 33 back subsumes 32.
% 2.02/2.21
% 2.02/2.21 ======= end of input processing =======
% 2.02/2.21
% 2.02/2.21 =========== start of search ===========
% 2.02/2.21
% 2.02/2.21 -------- PROOF --------
% 2.02/2.21
% 2.02/2.21 ----> UNIT CONFLICT at 0.01 sec ----> 291 [binary,289.1,161.1] $F.
% 2.02/2.21
% 2.02/2.21 Length of proof is 5. Level of proof is 3.
% 2.02/2.21
% 2.02/2.21 ---------------- PROOF ----------------
% 2.02/2.21 % SZS status Unsatisfiable
% 2.02/2.21 % SZS output start Refutation
% See solution above
% 2.02/2.21 ------------ end of proof -------------
% 2.02/2.21
% 2.02/2.21
% 2.02/2.21 Search stopped by max_proofs option.
% 2.02/2.21
% 2.02/2.21
% 2.02/2.21 Search stopped by max_proofs option.
% 2.02/2.21
% 2.02/2.21 ============ end of search ============
% 2.02/2.21
% 2.02/2.21 -------------- statistics -------------
% 2.02/2.21 clauses given 13
% 2.02/2.21 clauses generated 344
% 2.02/2.21 clauses kept 285
% 2.02/2.21 clauses forward subsumed 88
% 2.02/2.21 clauses back subsumed 2
% 2.02/2.21 Kbytes malloced 1953
% 2.02/2.21
% 2.02/2.21 ----------- times (seconds) -----------
% 2.02/2.21 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 2.02/2.21 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.02/2.21 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.02/2.21
% 2.02/2.21 That finishes the proof of the theorem.
% 2.02/2.21
% 2.02/2.21 Process 31921 finished Wed Jul 27 06:02:40 2022
% 2.07/2.21 Otter interrupted
% 2.07/2.21 PROOF FOUND
%------------------------------------------------------------------------------