TSTP Solution File: LCL443-10 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LCL443-10 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n022.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:04:27 EDT 2022
% Result : Unsatisfiable 1.84s 2.02s
% Output : Refutation 1.84s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of clauses : 18 ( 18 unt; 0 nHn; 6 RR)
% Number of literals : 18 ( 17 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-4 aty)
% Number of variables : 32 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(v_p,v_q,t_a),c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)) != true,
file('LCL443-10.p',unknown),
[] ).
cnf(4,axiom,
ife_q(A,A,B,C) = B,
file('LCL443-10.p',unknown),
[] ).
cnf(5,axiom,
ife_q(c_in(c_PropLog_Opl_Oop_A_N_62(A,B,C),c_PropLog_Othms(D,C),tc_PropLog_Opl(C)),true,ife_q(c_in(A,c_PropLog_Othms(D,C),tc_PropLog_Opl(C)),true,c_in(B,c_PropLog_Othms(D,C),tc_PropLog_Opl(C)),true),true) = true,
file('LCL443-10.p',unknown),
[] ).
cnf(7,axiom,
ife_q(c_in(A,c_PropLog_Othms(c_insert(B,C,tc_PropLog_Opl(D)),D),tc_PropLog_Opl(D)),true,c_in(c_PropLog_Opl_Oop_A_N_62(B,A,D),c_PropLog_Othms(C,D),tc_PropLog_Opl(D)),true) = true,
file('LCL443-10.p',unknown),
[] ).
cnf(9,axiom,
ife_q(c_in(A,B,tc_PropLog_Opl(C)),true,c_in(A,c_PropLog_Othms(B,C),tc_PropLog_Opl(C)),true) = true,
file('LCL443-10.p',unknown),
[] ).
cnf(11,axiom,
ife_q(c_in(A,c_PropLog_Othms(B,C),tc_PropLog_Opl(C)),true,c_in(A,c_PropLog_Othms(c_insert(D,B,tc_PropLog_Opl(C)),C),tc_PropLog_Opl(C)),true) = true,
file('LCL443-10.p',unknown),
[] ).
cnf(13,axiom,
c_in(A,c_insert(A,B,C),C) = true,
file('LCL443-10.p',unknown),
[] ).
cnf(15,axiom,
c_in(v_p,c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)) = true,
file('LCL443-10.p',unknown),
[] ).
cnf(17,axiom,
c_in(c_PropLog_Opl_Oop_A_N_62(v_q,c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)) = true,
file('LCL443-10.p',unknown),
[] ).
cnf(33,plain,
c_in(A,c_PropLog_Othms(c_insert(A,B,tc_PropLog_Opl(C)),C),tc_PropLog_Opl(C)) = true,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[9,13]),4]),
[iquote('para_into,9.1.1.1,13.1.1,demod,4')] ).
cnf(51,plain,
ife_q(c_in(A,c_PropLog_Othms(c_insert(c_PropLog_Opl_Oop_A_N_62(A,B,C),D,tc_PropLog_Opl(C)),C),tc_PropLog_Opl(C)),true,c_in(B,c_PropLog_Othms(c_insert(c_PropLog_Opl_Oop_A_N_62(A,B,C),D,tc_PropLog_Opl(C)),C),tc_PropLog_Opl(C)),true) = true,
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[33,5]),4]),
[iquote('para_from,33.1.1,5.1.1.1,demod,4')] ).
cnf(87,plain,
c_in(c_PropLog_Opl_Oop_A_N_62(v_q,c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(c_insert(A,v_H,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)) = true,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[11,17]),4]),
[iquote('para_into,11.1.1.1,17.1.1,demod,4')] ).
cnf(89,plain,
c_in(v_p,c_PropLog_Othms(c_insert(A,v_H,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)) = true,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[11,15]),4]),
[iquote('para_into,11.1.1.1,15.1.1,demod,4')] ).
cnf(167,plain,
ife_q(c_in(v_q,c_PropLog_Othms(c_insert(A,v_H,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)),true,c_in(c_PropLog_Opl_Ofalse,c_PropLog_Othms(c_insert(A,v_H,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)),true) = true,
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[87,5]),4]),
[iquote('para_from,87.1.1,5.1.1.1,demod,4')] ).
cnf(251,plain,
c_in(A,c_PropLog_Othms(c_insert(c_PropLog_Opl_Oop_A_N_62(v_p,A,t_a),v_H,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)) = true,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[51,89]),4]),
[iquote('para_into,51.1.1.1,89.1.1,demod,4')] ).
cnf(407,plain,
c_in(c_PropLog_Opl_Ofalse,c_PropLog_Othms(c_insert(c_PropLog_Opl_Oop_A_N_62(v_p,v_q,t_a),v_H,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)) = true,
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[167,251]),4]),
[iquote('para_into,167.1.1.1,251.1.1,demod,4')] ).
cnf(413,plain,
c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(v_p,v_q,t_a),c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)) = true,
inference(demod,[status(thm),theory(equality)],[inference(para_from,[status(thm),theory(equality)],[407,7]),4]),
[iquote('para_from,407.1.1,7.1.1.1,demod,4')] ).
cnf(415,plain,
$false,
inference(binary,[status(thm)],[413,1]),
[iquote('binary,413.1,1.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : LCL443-10 : TPTP v8.1.0. Released v7.3.0.
% 0.04/0.14 % Command : otter-tptp-script %s
% 0.14/0.35 % Computer : n022.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 300
% 0.14/0.35 % DateTime : Wed Jul 27 09:16:50 EDT 2022
% 0.14/0.35 % CPUTime :
% 1.80/1.97 ----- Otter 3.3f, August 2004 -----
% 1.80/1.97 The process was started by sandbox on n022.cluster.edu,
% 1.80/1.97 Wed Jul 27 09:16:50 2022
% 1.80/1.97 The command was "./otter". The process ID is 16790.
% 1.80/1.97
% 1.80/1.97 set(prolog_style_variables).
% 1.80/1.97 set(auto).
% 1.80/1.97 dependent: set(auto1).
% 1.80/1.97 dependent: set(process_input).
% 1.80/1.97 dependent: clear(print_kept).
% 1.80/1.97 dependent: clear(print_new_demod).
% 1.80/1.97 dependent: clear(print_back_demod).
% 1.80/1.97 dependent: clear(print_back_sub).
% 1.80/1.97 dependent: set(control_memory).
% 1.80/1.97 dependent: assign(max_mem, 12000).
% 1.80/1.97 dependent: assign(pick_given_ratio, 4).
% 1.80/1.97 dependent: assign(stats_level, 1).
% 1.80/1.97 dependent: assign(max_seconds, 10800).
% 1.80/1.97 clear(print_given).
% 1.80/1.97
% 1.80/1.97 list(usable).
% 1.80/1.97 0 [] A=A.
% 1.80/1.97 0 [] ife_q(A,A,B,C)=B.
% 1.80/1.97 0 [] ife_q(c_in(c_PropLog_Opl_Oop_A_N_62(V_p,V_q,T_a),c_PropLog_Othms(V_H,T_a),tc_PropLog_Opl(T_a)),true,ife_q(c_in(V_p,c_PropLog_Othms(V_H,T_a),tc_PropLog_Opl(T_a)),true,c_in(V_q,c_PropLog_Othms(V_H,T_a),tc_PropLog_Opl(T_a)),true),true)=true.
% 1.80/1.97 0 [] ife_q(c_in(V_q,c_PropLog_Othms(c_insert(V_p,V_H,tc_PropLog_Opl(T_a)),T_a),tc_PropLog_Opl(T_a)),true,c_in(c_PropLog_Opl_Oop_A_N_62(V_p,V_q,T_a),c_PropLog_Othms(V_H,T_a),tc_PropLog_Opl(T_a)),true)=true.
% 1.80/1.97 0 [] ife_q(c_in(V_p,V_H,tc_PropLog_Opl(T_a)),true,c_in(V_p,c_PropLog_Othms(V_H,T_a),tc_PropLog_Opl(T_a)),true)=true.
% 1.80/1.97 0 [] ife_q(c_in(V_p,c_PropLog_Othms(V_G,T_a),tc_PropLog_Opl(T_a)),true,c_in(V_p,c_PropLog_Othms(c_insert(V_a,V_G,tc_PropLog_Opl(T_a)),T_a),tc_PropLog_Opl(T_a)),true)=true.
% 1.80/1.97 0 [] c_in(V_x,c_insert(V_x,V_B,T_a),T_a)=true.
% 1.80/1.97 0 [] c_in(v_p,c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a))=true.
% 1.80/1.97 0 [] c_in(c_PropLog_Opl_Oop_A_N_62(v_q,c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a))=true.
% 1.80/1.97 0 [] c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(v_p,v_q,t_a),c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a))!=true.
% 1.80/1.97 end_of_list.
% 1.80/1.97
% 1.80/1.97 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=1.
% 1.80/1.97
% 1.80/1.97 All clauses are units, and equality is present; the
% 1.80/1.97 strategy will be Knuth-Bendix with positive clauses in sos.
% 1.80/1.97
% 1.80/1.97 dependent: set(knuth_bendix).
% 1.80/1.97 dependent: set(anl_eq).
% 1.80/1.97 dependent: set(para_from).
% 1.80/1.97 dependent: set(para_into).
% 1.80/1.97 dependent: clear(para_from_right).
% 1.80/1.97 dependent: clear(para_into_right).
% 1.80/1.97 dependent: set(para_from_vars).
% 1.80/1.97 dependent: set(eq_units_both_ways).
% 1.80/1.97 dependent: set(dynamic_demod_all).
% 1.80/1.97 dependent: set(dynamic_demod).
% 1.80/1.97 dependent: set(order_eq).
% 1.80/1.97 dependent: set(back_demod).
% 1.80/1.97 dependent: set(lrpo).
% 1.80/1.97
% 1.80/1.97 ------------> process usable:
% 1.80/1.97 ** KEPT (pick-wt=15): 1 [] c_in(c_PropLog_Opl_Oop_A_N_62(c_PropLog_Opl_Oop_A_N_62(v_p,v_q,t_a),c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a))!=true.
% 1.80/1.97
% 1.80/1.97 ------------> process sos:
% 1.80/1.97 ** KEPT (pick-wt=3): 2 [] A=A.
% 1.80/1.97 ** KEPT (pick-wt=7): 3 [] ife_q(A,A,B,C)=B.
% 1.80/1.97 ---> New Demodulator: 4 [new_demod,3] ife_q(A,A,B,C)=B.
% 1.80/1.97 ** KEPT (pick-wt=32): 5 [] ife_q(c_in(c_PropLog_Opl_Oop_A_N_62(A,B,C),c_PropLog_Othms(D,C),tc_PropLog_Opl(C)),true,ife_q(c_in(A,c_PropLog_Othms(D,C),tc_PropLog_Opl(C)),true,c_in(B,c_PropLog_Othms(D,C),tc_PropLog_Opl(C)),true),true)=true.
% 1.80/1.97 ---> New Demodulator: 6 [new_demod,5] ife_q(c_in(c_PropLog_Opl_Oop_A_N_62(A,B,C),c_PropLog_Othms(D,C),tc_PropLog_Opl(C)),true,ife_q(c_in(A,c_PropLog_Othms(D,C),tc_PropLog_Opl(C)),true,c_in(B,c_PropLog_Othms(D,C),tc_PropLog_Opl(C)),true),true)=true.
% 1.80/1.97 ** KEPT (pick-wt=26): 7 [] ife_q(c_in(A,c_PropLog_Othms(c_insert(B,C,tc_PropLog_Opl(D)),D),tc_PropLog_Opl(D)),true,c_in(c_PropLog_Opl_Oop_A_N_62(B,A,D),c_PropLog_Othms(C,D),tc_PropLog_Opl(D)),true)=true.
% 1.80/1.97 ---> New Demodulator: 8 [new_demod,7] ife_q(c_in(A,c_PropLog_Othms(c_insert(B,C,tc_PropLog_Opl(D)),D),tc_PropLog_Opl(D)),true,c_in(c_PropLog_Opl_Oop_A_N_62(B,A,D),c_PropLog_Othms(C,D),tc_PropLog_Opl(D)),true)=true.
% 1.80/1.97 ** KEPT (pick-wt=17): 9 [] ife_q(c_in(A,B,tc_PropLog_Opl(C)),true,c_in(A,c_PropLog_Othms(B,C),tc_PropLog_Opl(C)),true)=true.
% 1.80/1.97 ---> New Demodulator: 10 [new_demod,9] ife_q(c_in(A,B,tc_PropLog_Opl(C)),true,c_in(A,c_PropLog_Othms(B,C),tc_PropLog_Opl(C)),true)=true.
% 1.80/1.97 ** KEPT (pick-wt=23): 11 [] ife_q(c_in(A,c_PropLog_Othms(B,C),tc_PropLog_Opl(C)),true,c_in(A,c_PropLog_Othms(c_insert(D,B,tc_PropLog_Opl(C)),C),tc_PropLog_Opl(C)),true)=true.
% 1.84/2.02 ---> New Demodulator: 12 [new_demod,11] ife_q(c_in(A,c_PropLog_Othms(B,C),tc_PropLog_Opl(C)),true,c_in(A,c_PropLog_Othms(c_insert(D,B,tc_PropLog_Opl(C)),C),tc_PropLog_Opl(C)),true)=true.
% 1.84/2.02 ** KEPT (pick-wt=9): 13 [] c_in(A,c_insert(A,B,C),C)=true.
% 1.84/2.02 ---> New Demodulator: 14 [new_demod,13] c_in(A,c_insert(A,B,C),C)=true.
% 1.84/2.02 ** KEPT (pick-wt=9): 15 [] c_in(v_p,c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a))=true.
% 1.84/2.02 ---> New Demodulator: 16 [new_demod,15] c_in(v_p,c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a))=true.
% 1.84/2.02 ** KEPT (pick-wt=12): 17 [] c_in(c_PropLog_Opl_Oop_A_N_62(v_q,c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a))=true.
% 1.84/2.02 ---> New Demodulator: 18 [new_demod,17] c_in(c_PropLog_Opl_Oop_A_N_62(v_q,c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a))=true.
% 1.84/2.02 Following clause subsumed by 2 during input processing: 0 [copy,2,flip.1] A=A.
% 1.84/2.02 >>>> Starting back demodulation with 4.
% 1.84/2.02 >>>> Starting back demodulation with 6.
% 1.84/2.02 >>>> Starting back demodulation with 8.
% 1.84/2.02 >>>> Starting back demodulation with 10.
% 1.84/2.02 >>>> Starting back demodulation with 12.
% 1.84/2.02 >>>> Starting back demodulation with 14.
% 1.84/2.02 >>>> Starting back demodulation with 16.
% 1.84/2.02 >>>> Starting back demodulation with 18.
% 1.84/2.02
% 1.84/2.02 ======= end of input processing =======
% 1.84/2.02
% 1.84/2.02 =========== start of search ===========
% 1.84/2.02
% 1.84/2.02
% 1.84/2.02 Resetting weight limit to 18.
% 1.84/2.02
% 1.84/2.02
% 1.84/2.02 Resetting weight limit to 18.
% 1.84/2.02
% 1.84/2.02 sos_size=117
% 1.84/2.02
% 1.84/2.02 -------- PROOF --------
% 1.84/2.02
% 1.84/2.02 ----> UNIT CONFLICT at 0.04 sec ----> 415 [binary,413.1,1.1] $F.
% 1.84/2.02
% 1.84/2.02 Length of proof is 8. Level of proof is 5.
% 1.84/2.02
% 1.84/2.02 ---------------- PROOF ----------------
% 1.84/2.02 % SZS status Unsatisfiable
% 1.84/2.02 % SZS output start Refutation
% See solution above
% 1.84/2.02 ------------ end of proof -------------
% 1.84/2.02
% 1.84/2.02
% 1.84/2.02 Search stopped by max_proofs option.
% 1.84/2.02
% 1.84/2.02
% 1.84/2.02 Search stopped by max_proofs option.
% 1.84/2.02
% 1.84/2.02 ============ end of search ============
% 1.84/2.02
% 1.84/2.02 -------------- statistics -------------
% 1.84/2.02 clauses given 152
% 1.84/2.02 clauses generated 3238
% 1.84/2.02 clauses kept 208
% 1.84/2.02 clauses forward subsumed 2744
% 1.84/2.02 clauses back subsumed 0
% 1.84/2.02 Kbytes malloced 5859
% 1.84/2.02
% 1.84/2.02 ----------- times (seconds) -----------
% 1.84/2.02 user CPU time 0.04 (0 hr, 0 min, 0 sec)
% 1.84/2.02 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.84/2.02 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.84/2.02
% 1.84/2.02 That finishes the proof of the theorem.
% 1.84/2.02
% 1.84/2.02 Process 16790 finished Wed Jul 27 09:16:52 2022
% 1.84/2.02 Otter interrupted
% 1.84/2.02 PROOF FOUND
%------------------------------------------------------------------------------