TSTP Solution File: LCL431-2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : LCL431-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:24 EDT 2022
% Result : Unsatisfiable 1.71s 1.90s
% Output : Refutation 1.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 7 ( 5 unt; 0 nHn; 5 RR)
% Number of literals : 9 ( 1 equ; 3 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 8 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ c_in(v_p,c_PropLog_Othms(c_emptyset,t_a),tc_PropLog_Opl(t_a)),
file('LCL431-2.p',unknown),
[] ).
cnf(2,axiom,
( ~ c_PropLog_Osat(c_emptyset,A,B)
| c_in(A,c_PropLog_Othms(c_minus(c_PropLog_Ohyps(A,C,B),c_PropLog_Ohyps(A,D,B),tc_set(tc_PropLog_Opl(B))),B),tc_PropLog_Opl(B)) ),
file('LCL431-2.p',unknown),
[] ).
cnf(4,axiom,
c_PropLog_Osat(c_emptyset,v_p,t_a),
file('LCL431-2.p',unknown),
[] ).
cnf(5,axiom,
c_minus(A,A,tc_set(B)) = c_emptyset,
file('LCL431-2.p',unknown),
[] ).
cnf(8,plain,
( ~ c_PropLog_Osat(c_emptyset,A,B)
| c_in(A,c_PropLog_Othms(c_emptyset,B),tc_PropLog_Opl(B)) ),
inference(para_from,[status(thm),theory(equality)],[5,2]),
[iquote('para_from,5.1.1,2.2.2.1')] ).
cnf(9,plain,
c_in(v_p,c_PropLog_Othms(c_emptyset,t_a),tc_PropLog_Opl(t_a)),
inference(hyper,[status(thm)],[8,4]),
[iquote('hyper,8,4')] ).
cnf(10,plain,
$false,
inference(binary,[status(thm)],[9,1]),
[iquote('binary,9.1,1.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL431-2 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : otter-tptp-script %s
% 0.12/0.34 % Computer : n014.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Wed Jul 27 09:21:24 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.71/1.90 ----- Otter 3.3f, August 2004 -----
% 1.71/1.90 The process was started by sandbox2 on n014.cluster.edu,
% 1.71/1.90 Wed Jul 27 09:21:24 2022
% 1.71/1.90 The command was "./otter". The process ID is 8216.
% 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 [] A=A.
% 1.71/1.90 0 [] c_PropLog_Osat(c_emptyset,v_p,t_a).
% 1.71/1.90 0 [] -c_in(v_p,c_PropLog_Othms(c_emptyset,t_a),tc_PropLog_Opl(t_a)).
% 1.71/1.90 0 [] -c_PropLog_Osat(c_emptyset,V_p,T_a)|c_in(V_p,c_PropLog_Othms(c_minus(c_PropLog_Ohyps(V_p,V_U,T_a),c_PropLog_Ohyps(V_p,V_t0,T_a),tc_set(tc_PropLog_Opl(T_a))),T_a),tc_PropLog_Opl(T_a)).
% 1.71/1.90 0 [] c_minus(V_A,V_A,tc_set(T_a))=c_emptyset.
% 1.71/1.90 end_of_list.
% 1.71/1.90
% 1.71/1.90 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=2.
% 1.71/1.90
% 1.71/1.90 This is a Horn set with equality. The strategy will be
% 1.71/1.90 Knuth-Bendix and hyper_res, with positive clauses in
% 1.71/1.90 sos and nonpositive clauses in usable.
% 1.71/1.90
% 1.71/1.90 dependent: set(knuth_bendix).
% 1.71/1.90 dependent: set(anl_eq).
% 1.71/1.90 dependent: set(para_from).
% 1.71/1.90 dependent: set(para_into).
% 1.71/1.90 dependent: clear(para_from_right).
% 1.71/1.90 dependent: clear(para_into_right).
% 1.71/1.90 dependent: set(para_from_vars).
% 1.71/1.90 dependent: set(eq_units_both_ways).
% 1.71/1.90 dependent: set(dynamic_demod_all).
% 1.71/1.90 dependent: set(dynamic_demod).
% 1.71/1.90 dependent: set(order_eq).
% 1.71/1.90 dependent: set(back_demod).
% 1.71/1.90 dependent: set(lrpo).
% 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=7): 1 [] -c_in(v_p,c_PropLog_Othms(c_emptyset,t_a),tc_PropLog_Opl(t_a)).
% 1.71/1.90 ** KEPT (pick-wt=22): 2 [] -c_PropLog_Osat(c_emptyset,A,B)|c_in(A,c_PropLog_Othms(c_minus(c_PropLog_Ohyps(A,C,B),c_PropLog_Ohyps(A,D,B),tc_set(tc_PropLog_Opl(B))),B),tc_PropLog_Opl(B)).
% 1.71/1.90
% 1.71/1.90 ------------> process sos:
% 1.71/1.90 ** KEPT (pick-wt=3): 3 [] A=A.
% 1.71/1.90 ** KEPT (pick-wt=4): 4 [] c_PropLog_Osat(c_emptyset,v_p,t_a).
% 1.71/1.90 ** KEPT (pick-wt=7): 5 [] c_minus(A,A,tc_set(B))=c_emptyset.
% 1.71/1.90 ---> New Demodulator: 6 [new_demod,5] c_minus(A,A,tc_set(B))=c_emptyset.
% 1.71/1.90 Following clause subsumed by 3 during input processing: 0 [copy,3,flip.1] A=A.
% 1.71/1.90 >>>> Starting back demodulation with 6.
% 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 ----> 10 [binary,9.1,1.1] $F.
% 1.71/1.90
% 1.71/1.90 Length of proof is 2. Level of proof is 2.
% 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 4
% 1.71/1.90 clauses generated 5
% 1.71/1.90 clauses kept 8
% 1.71/1.90 clauses forward subsumed 3
% 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 8216 finished Wed Jul 27 09:21:25 2022
% 1.71/1.90 Otter interrupted
% 1.71/1.90 PROOF FOUND
%------------------------------------------------------------------------------