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