TSTP Solution File: LCL433-2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LCL433-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n010.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:25 EDT 2022
% Result : Unsatisfiable 1.71s 1.90s
% Output : Refutation 1.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 14 ( 9 unt; 0 nHn; 10 RR)
% Number of literals : 20 ( 0 equ; 7 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 4 con; 0-3 aty)
% Number of variables : 23 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ c_in(v_xa,c_PropLog_Othms(c_insert(v_x,v_F,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)),
file('LCL433-2.p',unknown),
[] ).
cnf(2,axiom,
( c_in(A,c_PropLog_Othms(v_F,t_a),tc_PropLog_Opl(t_a))
| ~ c_PropLog_Osat(v_F,A,t_a) ),
file('LCL433-2.p',unknown),
[] ).
cnf(3,axiom,
( ~ c_PropLog_Osat(c_insert(A,B,tc_PropLog_Opl(C)),D,C)
| c_PropLog_Osat(B,c_PropLog_Opl_Oop_A_N_62(A,D,C),C) ),
file('LCL433-2.p',unknown),
[] ).
cnf(4,axiom,
( ~ c_in(A,B,tc_PropLog_Opl(C))
| c_in(A,c_PropLog_Othms(B,C),tc_PropLog_Opl(C)) ),
file('LCL433-2.p',unknown),
[] ).
cnf(5,axiom,
( ~ c_in(A,c_PropLog_Othms(B,C),tc_PropLog_Opl(C))
| ~ c_in(c_PropLog_Opl_Oop_A_N_62(A,D,C),c_PropLog_Othms(B,C),tc_PropLog_Opl(C))
| c_in(D,c_PropLog_Othms(B,C),tc_PropLog_Opl(C)) ),
file('LCL433-2.p',unknown),
[] ).
cnf(6,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('LCL433-2.p',unknown),
[] ).
cnf(7,axiom,
c_PropLog_Osat(c_insert(v_x,v_F,tc_PropLog_Opl(t_a)),v_xa,t_a),
file('LCL433-2.p',unknown),
[] ).
cnf(8,axiom,
c_in(A,c_insert(A,B,C),C),
file('LCL433-2.p',unknown),
[] ).
cnf(9,plain,
c_PropLog_Osat(v_F,c_PropLog_Opl_Oop_A_N_62(v_x,v_xa,t_a),t_a),
inference(hyper,[status(thm)],[7,3]),
[iquote('hyper,7,3')] ).
cnf(10,plain,
c_in(A,c_PropLog_Othms(c_insert(A,B,tc_PropLog_Opl(C)),C),tc_PropLog_Opl(C)),
inference(hyper,[status(thm)],[8,4]),
[iquote('hyper,8,4')] ).
cnf(11,plain,
c_in(c_PropLog_Opl_Oop_A_N_62(v_x,v_xa,t_a),c_PropLog_Othms(v_F,t_a),tc_PropLog_Opl(t_a)),
inference(hyper,[status(thm)],[9,2]),
[iquote('hyper,9,2')] ).
cnf(12,plain,
c_in(c_PropLog_Opl_Oop_A_N_62(v_x,v_xa,t_a),c_PropLog_Othms(c_insert(A,v_F,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)),
inference(hyper,[status(thm)],[11,6]),
[iquote('hyper,11,6')] ).
cnf(17,plain,
c_in(v_xa,c_PropLog_Othms(c_insert(v_x,v_F,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)),
inference(hyper,[status(thm)],[12,5,10]),
[iquote('hyper,12,5,10')] ).
cnf(18,plain,
$false,
inference(binary,[status(thm)],[17,1]),
[iquote('binary,17.1,1.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.11 % Problem : LCL433-2 : TPTP v8.1.0. Released v3.2.0.
% 0.12/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n010.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 300
% 0.12/0.33 % DateTime : Wed Jul 27 09:10:39 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.71/1.90 ----- Otter 3.3f, August 2004 -----
% 1.71/1.90 The process was started by sandbox2 on n010.cluster.edu,
% 1.71/1.90 Wed Jul 27 09:10:40 2022
% 1.71/1.90 The command was "./otter". The process ID is 20070.
% 1.71/1.90
% 1.71/1.90 set(prolog_style_variables).
% 1.71/1.90 set(auto).
% 1.71/1.90 dependent: set(auto1).
% 1.71/1.90 dependent: set(process_input).
% 1.71/1.90 dependent: clear(print_kept).
% 1.71/1.90 dependent: clear(print_new_demod).
% 1.71/1.90 dependent: clear(print_back_demod).
% 1.71/1.90 dependent: clear(print_back_sub).
% 1.71/1.90 dependent: set(control_memory).
% 1.71/1.90 dependent: assign(max_mem, 12000).
% 1.71/1.90 dependent: assign(pick_given_ratio, 4).
% 1.71/1.90 dependent: assign(stats_level, 1).
% 1.71/1.90 dependent: assign(max_seconds, 10800).
% 1.71/1.90 clear(print_given).
% 1.71/1.90
% 1.71/1.90 list(usable).
% 1.71/1.90 0 [] c_PropLog_Osat(c_insert(v_x,v_F,tc_PropLog_Opl(t_a)),v_xa,t_a).
% 1.71/1.90 0 [] -c_in(v_xa,c_PropLog_Othms(c_insert(v_x,v_F,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)).
% 1.71/1.90 0 [] c_in(V_U,c_PropLog_Othms(v_F,t_a),tc_PropLog_Opl(t_a))| -c_PropLog_Osat(v_F,V_U,t_a).
% 1.71/1.90 0 [] -c_PropLog_Osat(c_insert(V_p,V_H,tc_PropLog_Opl(T_a)),V_q,T_a)|c_PropLog_Osat(V_H,c_PropLog_Opl_Oop_A_N_62(V_p,V_q,T_a),T_a).
% 1.71/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.71/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,V_q,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.71/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.71/1.90 0 [] c_in(V_x,c_insert(V_x,V_B,T_a),T_a).
% 1.71/1.90 end_of_list.
% 1.71/1.90
% 1.71/1.90 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 1.71/1.90
% 1.71/1.90 This is a Horn set without equality. The strategy will
% 1.71/1.90 be hyperresolution, with satellites in sos and nuclei
% 1.71/1.90 in usable.
% 1.71/1.90
% 1.71/1.90 dependent: set(hyper_res).
% 1.71/1.90 dependent: clear(order_hyper).
% 1.71/1.90
% 1.71/1.90 ------------> process usable:
% 1.71/1.90 ** KEPT (pick-wt=11): 1 [] -c_in(v_xa,c_PropLog_Othms(c_insert(v_x,v_F,tc_PropLog_Opl(t_a)),t_a),tc_PropLog_Opl(t_a)).
% 1.71/1.90 ** KEPT (pick-wt=11): 2 [] c_in(A,c_PropLog_Othms(v_F,t_a),tc_PropLog_Opl(t_a))| -c_PropLog_Osat(v_F,A,t_a).
% 1.71/1.90 ** KEPT (pick-wt=15): 3 [] -c_PropLog_Osat(c_insert(A,B,tc_PropLog_Opl(C)),D,C)|c_PropLog_Osat(B,c_PropLog_Opl_Oop_A_N_62(A,D,C),C).
% 1.71/1.90 ** KEPT (pick-wt=12): 4 [] -c_in(A,B,tc_PropLog_Opl(C))|c_in(A,c_PropLog_Othms(B,C),tc_PropLog_Opl(C)).
% 1.71/1.90 ** KEPT (pick-wt=24): 5 [] -c_in(A,c_PropLog_Othms(B,C),tc_PropLog_Opl(C))| -c_in(c_PropLog_Opl_Oop_A_N_62(A,D,C),c_PropLog_Othms(B,C),tc_PropLog_Opl(C))|c_in(D,c_PropLog_Othms(B,C),tc_PropLog_Opl(C)).
% 1.71/1.90 ** KEPT (pick-wt=18): 6 [] -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.71/1.90
% 1.71/1.90 ------------> process sos:
% 1.71/1.90 ** KEPT (pick-wt=8): 7 [] c_PropLog_Osat(c_insert(v_x,v_F,tc_PropLog_Opl(t_a)),v_xa,t_a).
% 1.71/1.90 ** KEPT (pick-wt=7): 8 [] c_in(A,c_insert(A,B,C),C).
% 1.71/1.90
% 1.71/1.90 ======= end of input processing =======
% 1.71/1.90
% 1.71/1.90 =========== start of search ===========
% 1.71/1.90
% 1.71/1.90 -------- PROOF --------
% 1.71/1.90
% 1.71/1.90 ----> UNIT CONFLICT at 0.00 sec ----> 18 [binary,17.1,1.1] $F.
% 1.71/1.90
% 1.71/1.90 Length of proof is 5. Level of proof is 4.
% 1.71/1.90
% 1.71/1.90 ---------------- PROOF ----------------
% 1.71/1.90 % SZS status Unsatisfiable
% 1.71/1.90 % SZS output start Refutation
% See solution above
% 1.71/1.90 ------------ end of proof -------------
% 1.71/1.90
% 1.71/1.90
% 1.71/1.90 Search stopped by max_proofs option.
% 1.71/1.90
% 1.71/1.90
% 1.71/1.90 Search stopped by max_proofs option.
% 1.71/1.90
% 1.71/1.90 ============ end of search ============
% 1.71/1.90
% 1.71/1.90 -------------- statistics -------------
% 1.71/1.90 clauses given 6
% 1.71/1.90 clauses generated 9
% 1.71/1.90 clauses kept 17
% 1.71/1.90 clauses forward subsumed 0
% 1.71/1.90 clauses back subsumed 0
% 1.71/1.90 Kbytes malloced 976
% 1.71/1.90
% 1.71/1.90 ----------- times (seconds) -----------
% 1.71/1.90 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.71/1.90 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.71/1.90 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.71/1.90
% 1.71/1.90 That finishes the proof of the theorem.
% 1.71/1.90
% 1.71/1.90 Process 20070 finished Wed Jul 27 09:10:41 2022
% 1.71/1.90 Otter interrupted
% 1.71/1.90 PROOF FOUND
%------------------------------------------------------------------------------