TSTP Solution File: LCL439-2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LCL439-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:04:26 EDT 2022
% Result : Unsatisfiable 1.69s 1.90s
% Output : Refutation 1.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of clauses : 12 ( 8 unt; 0 nHn; 5 RR)
% Number of literals : 17 ( 0 equ; 6 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 9 ( 9 usr; 5 con; 0-3 aty)
% Number of variables : 24 ( 7 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ c_in(A,c_PropLog_Othms(c_insert(B,C,tc_PropLog_Opl(D)),D),tc_PropLog_Opl(D))
| c_in(c_PropLog_Opl_Oop_A_N_62(B,A,D),c_PropLog_Othms(C,D),tc_PropLog_Opl(D)) ),
file('LCL439-2.p',unknown),
[] ).
cnf(2,axiom,
( ~ c_in(A,B,tc_PropLog_Opl(C))
| c_in(A,c_PropLog_Othms(B,C),tc_PropLog_Opl(C)) ),
file('LCL439-2.p',unknown),
[] ).
cnf(3,axiom,
( ~ c_in(A,c_PropLog_Othms(B,C),tc_PropLog_Opl(C))
| ~ c_in(c_PropLog_Opl_Oop_A_N_62(A,c_PropLog_Opl_Ofalse,C),c_PropLog_Othms(B,C),tc_PropLog_Opl(C))
| c_in(D,c_PropLog_Othms(B,C),tc_PropLog_Opl(C)) ),
file('LCL439-2.p',unknown),
[] ).
cnf(4,axiom,
( ~ c_in(A,c_PropLog_Othms(B,C),tc_PropLog_Opl(C))
| c_in(A,c_PropLog_Othms(c_insert(D,B,tc_PropLog_Opl(C)),C),tc_PropLog_Opl(C)) ),
file('LCL439-2.p',unknown),
[] ).
cnf(5,axiom,
~ 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)),
file('LCL439-2.p',unknown),
[] ).
cnf(6,axiom,
c_in(A,c_insert(A,B,C),C),
file('LCL439-2.p',unknown),
[] ).
cnf(7,axiom,
c_in(c_PropLog_Opl_Oop_A_N_62(v_p,c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
file('LCL439-2.p',unknown),
[] ).
cnf(8,plain,
c_in(A,c_PropLog_Othms(c_insert(A,B,tc_PropLog_Opl(C)),C),tc_PropLog_Opl(C)),
inference(hyper,[status(thm)],[6,2]),
[iquote('hyper,6,2')] ).
cnf(9,plain,
c_in(c_PropLog_Opl_Oop_A_N_62(v_p,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)),
inference(hyper,[status(thm)],[7,4]),
[iquote('hyper,7,4')] ).
cnf(21,plain,
c_in(A,c_PropLog_Othms(c_insert(v_p,v_H,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)),
inference(hyper,[status(thm)],[9,3,8]),
[iquote('hyper,9,3,8')] ).
cnf(29,plain,
c_in(c_PropLog_Opl_Oop_A_N_62(v_p,A,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)),
inference(hyper,[status(thm)],[21,1]),
[iquote('hyper,21,1')] ).
cnf(30,plain,
$false,
inference(binary,[status(thm)],[29,5]),
[iquote('binary,29.1,5.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : LCL439-2 : TPTP v8.1.0. Released v3.2.0.
% 0.04/0.13 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n014.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 09:15:54 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.69/1.90 ----- Otter 3.3f, August 2004 -----
% 1.69/1.90 The process was started by sandbox2 on n014.cluster.edu,
% 1.69/1.90 Wed Jul 27 09:15:54 2022
% 1.69/1.90 The command was "./otter". The process ID is 30743.
% 1.69/1.90
% 1.69/1.90 set(prolog_style_variables).
% 1.69/1.90 set(auto).
% 1.69/1.90 dependent: set(auto1).
% 1.69/1.90 dependent: set(process_input).
% 1.69/1.90 dependent: clear(print_kept).
% 1.69/1.90 dependent: clear(print_new_demod).
% 1.69/1.90 dependent: clear(print_back_demod).
% 1.69/1.90 dependent: clear(print_back_sub).
% 1.69/1.90 dependent: set(control_memory).
% 1.69/1.90 dependent: assign(max_mem, 12000).
% 1.69/1.90 dependent: assign(pick_given_ratio, 4).
% 1.69/1.90 dependent: assign(stats_level, 1).
% 1.69/1.90 dependent: assign(max_seconds, 10800).
% 1.69/1.90 clear(print_given).
% 1.69/1.90
% 1.69/1.90 list(usable).
% 1.69/1.90 0 [] -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))|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)).
% 1.69/1.90 0 [] -c_in(V_p,V_H,tc_PropLog_Opl(T_a))|c_in(V_p,c_PropLog_Othms(V_H,T_a),tc_PropLog_Opl(T_a)).
% 1.69/1.90 0 [] -c_in(V_p,c_PropLog_Othms(V_H,T_a),tc_PropLog_Opl(T_a))| -c_in(c_PropLog_Opl_Oop_A_N_62(V_p,c_PropLog_Opl_Ofalse,T_a),c_PropLog_Othms(V_H,T_a),tc_PropLog_Opl(T_a))|c_in(V_q,c_PropLog_Othms(V_H,T_a),tc_PropLog_Opl(T_a)).
% 1.69/1.90 0 [] -c_in(V_p,c_PropLog_Othms(V_G,T_a),tc_PropLog_Opl(T_a))|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)).
% 1.69/1.90 0 [] c_in(V_x,c_insert(V_x,V_B,T_a),T_a).
% 1.69/1.90 0 [] c_in(c_PropLog_Opl_Oop_A_N_62(v_p,c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)).
% 1.69/1.90 0 [] -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)).
% 1.69/1.90 end_of_list.
% 1.69/1.90
% 1.69/1.90 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 1.69/1.90
% 1.69/1.90 This is a Horn set without equality. The strategy will
% 1.69/1.90 be hyperresolution, with satellites in sos and nuclei
% 1.69/1.90 in usable.
% 1.69/1.90
% 1.69/1.90 dependent: set(hyper_res).
% 1.69/1.90 dependent: clear(order_hyper).
% 1.69/1.90
% 1.69/1.90 ------------> process usable:
% 1.69/1.90 ** KEPT (pick-wt=21): 1 [] -c_in(A,c_PropLog_Othms(c_insert(B,C,tc_PropLog_Opl(D)),D),tc_PropLog_Opl(D))|c_in(c_PropLog_Opl_Oop_A_N_62(B,A,D),c_PropLog_Othms(C,D),tc_PropLog_Opl(D)).
% 1.69/1.90 ** KEPT (pick-wt=12): 2 [] -c_in(A,B,tc_PropLog_Opl(C))|c_in(A,c_PropLog_Othms(B,C),tc_PropLog_Opl(C)).
% 1.69/1.90 ** KEPT (pick-wt=24): 3 [] -c_in(A,c_PropLog_Othms(B,C),tc_PropLog_Opl(C))| -c_in(c_PropLog_Opl_Oop_A_N_62(A,c_PropLog_Opl_Ofalse,C),c_PropLog_Othms(B,C),tc_PropLog_Opl(C))|c_in(D,c_PropLog_Othms(B,C),tc_PropLog_Opl(C)).
% 1.69/1.90 ** KEPT (pick-wt=18): 4 [] -c_in(A,c_PropLog_Othms(B,C),tc_PropLog_Opl(C))|c_in(A,c_PropLog_Othms(c_insert(D,B,tc_PropLog_Opl(C)),C),tc_PropLog_Opl(C)).
% 1.69/1.90 ** KEPT (pick-wt=10): 5 [] -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)).
% 1.69/1.90
% 1.69/1.90 ------------> process sos:
% 1.69/1.90 ** KEPT (pick-wt=7): 6 [] c_in(A,c_insert(A,B,C),C).
% 1.69/1.90 ** KEPT (pick-wt=10): 7 [] c_in(c_PropLog_Opl_Oop_A_N_62(v_p,c_PropLog_Opl_Ofalse,t_a),c_PropLog_Othms(v_H,t_a),tc_PropLog_Opl(t_a)).
% 1.69/1.90
% 1.69/1.90 ======= end of input processing =======
% 1.69/1.90
% 1.69/1.90 =========== start of search ===========
% 1.69/1.90
% 1.69/1.90 -------- PROOF --------
% 1.69/1.90
% 1.69/1.90 ----> UNIT CONFLICT at 0.00 sec ----> 30 [binary,29.1,5.1] $F.
% 1.69/1.90
% 1.69/1.90 Length of proof is 4. Level of proof is 3.
% 1.69/1.90
% 1.69/1.90 ---------------- PROOF ----------------
% 1.69/1.90 % SZS status Unsatisfiable
% 1.69/1.90 % SZS output start Refutation
% See solution above
% 1.69/1.90 ------------ end of proof -------------
% 1.69/1.90
% 1.69/1.90
% 1.69/1.90 Search stopped by max_proofs option.
% 1.69/1.90
% 1.69/1.90
% 1.69/1.90 Search stopped by max_proofs option.
% 1.69/1.90
% 1.69/1.90 ============ end of search ============
% 1.69/1.90
% 1.69/1.90 -------------- statistics -------------
% 1.69/1.90 clauses given 8
% 1.69/1.90 clauses generated 45
% 1.69/1.90 clauses kept 29
% 1.69/1.90 clauses forward subsumed 23
% 1.69/1.90 clauses back subsumed 0
% 1.69/1.90 Kbytes malloced 976
% 1.69/1.90
% 1.69/1.90 ----------- times (seconds) -----------
% 1.69/1.90 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.69/1.90 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.69/1.90 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.69/1.90
% 1.69/1.90 That finishes the proof of the theorem.
% 1.69/1.90
% 1.69/1.90 Process 30743 finished Wed Jul 27 09:15:55 2022
% 1.69/1.90 Otter interrupted
% 1.69/1.90 PROOF FOUND
%------------------------------------------------------------------------------