TSTP Solution File: SET842-2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SET842-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n029.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:14:22 EDT 2022
% Result : Unsatisfiable 1.63s 1.86s
% Output : Refutation 1.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 7
% Syntax : Number of clauses : 14 ( 8 unt; 1 nHn; 13 RR)
% Number of literals : 21 ( 0 equ; 7 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 3 con; 0-3 aty)
% Number of variables : 17 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ c_lesse_quals(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(tc_set(t_a))),
file('SET842-2.p',unknown),
[] ).
cnf(2,axiom,
( c_lesse_quals(A,v_m,tc_set(tc_set(t_a)))
| ~ c_in(A,v_Y,tc_set(tc_set(t_a))) ),
file('SET842-2.p',unknown),
[] ).
cnf(3,axiom,
( ~ c_in(A,c_Union(B,C),C)
| c_in(c_Main_OUnionE__1(A,B,C),B,tc_set(C)) ),
file('SET842-2.p',unknown),
[] ).
cnf(4,axiom,
( ~ c_in(A,c_Union(B,C),C)
| c_in(A,c_Main_OUnionE__1(A,B,C),C) ),
file('SET842-2.p',unknown),
[] ).
cnf(5,axiom,
( ~ c_in(A,B,C)
| ~ c_lesse_quals(B,D,tc_set(C))
| c_in(A,D,C) ),
file('SET842-2.p',unknown),
[] ).
cnf(6,axiom,
( ~ c_in(c_Main_OsubsetI__1(A,B,C),B,C)
| c_lesse_quals(A,B,tc_set(C)) ),
file('SET842-2.p',unknown),
[] ).
cnf(7,axiom,
( c_in(c_Main_OsubsetI__1(A,B,C),A,C)
| c_lesse_quals(A,B,tc_set(C)) ),
file('SET842-2.p',unknown),
[] ).
cnf(8,plain,
c_in(c_Main_OsubsetI__1(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(t_a)),c_Union(v_Y,tc_set(t_a)),tc_set(t_a)),
inference(hyper,[status(thm)],[7,1]),
[iquote('hyper,7,1')] ).
cnf(10,plain,
c_in(c_Main_OsubsetI__1(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(t_a)),c_Main_OUnionE__1(c_Main_OsubsetI__1(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(t_a)),v_Y,tc_set(t_a)),tc_set(t_a)),
inference(hyper,[status(thm)],[8,4]),
[iquote('hyper,8,4')] ).
cnf(11,plain,
c_in(c_Main_OUnionE__1(c_Main_OsubsetI__1(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(t_a)),v_Y,tc_set(t_a)),v_Y,tc_set(tc_set(t_a))),
inference(hyper,[status(thm)],[8,3]),
[iquote('hyper,8,3')] ).
cnf(13,plain,
c_lesse_quals(c_Main_OUnionE__1(c_Main_OsubsetI__1(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(t_a)),v_Y,tc_set(t_a)),v_m,tc_set(tc_set(t_a))),
inference(hyper,[status(thm)],[11,2]),
[iquote('hyper,11,2')] ).
cnf(14,plain,
c_in(c_Main_OsubsetI__1(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(t_a)),v_m,tc_set(t_a)),
inference(hyper,[status(thm)],[10,5,13]),
[iquote('hyper,10,5,13')] ).
cnf(22,plain,
c_lesse_quals(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(tc_set(t_a))),
inference(hyper,[status(thm)],[14,6]),
[iquote('hyper,14,6')] ).
cnf(23,plain,
$false,
inference(binary,[status(thm)],[22,1]),
[iquote('binary,22.1,1.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET842-2 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n029.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 10:43:59 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.63/1.86 ----- Otter 3.3f, August 2004 -----
% 1.63/1.86 The process was started by sandbox on n029.cluster.edu,
% 1.63/1.86 Wed Jul 27 10:43:59 2022
% 1.63/1.86 The command was "./otter". The process ID is 14320.
% 1.63/1.86
% 1.63/1.86 set(prolog_style_variables).
% 1.63/1.86 set(auto).
% 1.63/1.86 dependent: set(auto1).
% 1.63/1.86 dependent: set(process_input).
% 1.63/1.86 dependent: clear(print_kept).
% 1.63/1.86 dependent: clear(print_new_demod).
% 1.63/1.86 dependent: clear(print_back_demod).
% 1.63/1.86 dependent: clear(print_back_sub).
% 1.63/1.86 dependent: set(control_memory).
% 1.63/1.86 dependent: assign(max_mem, 12000).
% 1.63/1.86 dependent: assign(pick_given_ratio, 4).
% 1.63/1.86 dependent: assign(stats_level, 1).
% 1.63/1.86 dependent: assign(max_seconds, 10800).
% 1.63/1.86 clear(print_given).
% 1.63/1.86
% 1.63/1.86 list(usable).
% 1.63/1.86 0 [] -c_lesse_quals(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(tc_set(t_a))).
% 1.63/1.86 0 [] c_lesse_quals(V_U,v_m,tc_set(tc_set(t_a)))| -c_in(V_U,v_Y,tc_set(tc_set(t_a))).
% 1.63/1.86 0 [] -c_in(V_A,c_Union(V_C,T_a),T_a)|c_in(c_Main_OUnionE__1(V_A,V_C,T_a),V_C,tc_set(T_a)).
% 1.63/1.86 0 [] -c_in(V_A,c_Union(V_C,T_a),T_a)|c_in(V_A,c_Main_OUnionE__1(V_A,V_C,T_a),T_a).
% 1.63/1.86 0 [] -c_in(V_c,V_A,T_a)| -c_lesse_quals(V_A,V_B,tc_set(T_a))|c_in(V_c,V_B,T_a).
% 1.63/1.86 0 [] c_in(c_Main_OsubsetI__1(V_A,V_B,T_a),V_A,T_a)|c_lesse_quals(V_A,V_B,tc_set(T_a)).
% 1.63/1.86 0 [] -c_in(c_Main_OsubsetI__1(V_A,V_B,T_a),V_B,T_a)|c_lesse_quals(V_A,V_B,tc_set(T_a)).
% 1.63/1.86 end_of_list.
% 1.63/1.86
% 1.63/1.86 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=3.
% 1.63/1.86
% 1.63/1.86 This is a non-Horn set without equality. The strategy will
% 1.63/1.86 be ordered hyper_res, unit deletion, and factoring, with
% 1.63/1.86 satellites in sos and with nuclei in usable.
% 1.63/1.86
% 1.63/1.86 dependent: set(hyper_res).
% 1.63/1.86 dependent: set(factor).
% 1.63/1.86 dependent: set(unit_deletion).
% 1.63/1.86
% 1.63/1.86 ------------> process usable:
% 1.63/1.86 ** KEPT (pick-wt=9): 1 [] -c_lesse_quals(c_Union(v_Y,tc_set(t_a)),v_m,tc_set(tc_set(t_a))).
% 1.63/1.86 ** KEPT (pick-wt=12): 2 [] c_lesse_quals(A,v_m,tc_set(tc_set(t_a)))| -c_in(A,v_Y,tc_set(tc_set(t_a))).
% 1.63/1.86 ** KEPT (pick-wt=14): 3 [] -c_in(A,c_Union(B,C),C)|c_in(c_Main_OUnionE__1(A,B,C),B,tc_set(C)).
% 1.63/1.86 ** KEPT (pick-wt=13): 4 [] -c_in(A,c_Union(B,C),C)|c_in(A,c_Main_OUnionE__1(A,B,C),C).
% 1.63/1.86 ** KEPT (pick-wt=13): 5 [] -c_in(A,B,C)| -c_lesse_quals(B,D,tc_set(C))|c_in(A,D,C).
% 1.63/1.86 ** KEPT (pick-wt=12): 6 [] -c_in(c_Main_OsubsetI__1(A,B,C),B,C)|c_lesse_quals(A,B,tc_set(C)).
% 1.63/1.86
% 1.63/1.86 ------------> process sos:
% 1.63/1.86 ** KEPT (pick-wt=12): 7 [] c_in(c_Main_OsubsetI__1(A,B,C),A,C)|c_lesse_quals(A,B,tc_set(C)).
% 1.63/1.86
% 1.63/1.86 ======= end of input processing =======
% 1.63/1.86
% 1.63/1.86 =========== start of search ===========
% 1.63/1.86
% 1.63/1.86 -------- PROOF --------
% 1.63/1.86
% 1.63/1.86 ----> UNIT CONFLICT at 0.00 sec ----> 23 [binary,22.1,1.1] $F.
% 1.63/1.86
% 1.63/1.86 Length of proof is 6. Level of proof is 5.
% 1.63/1.86
% 1.63/1.86 ---------------- PROOF ----------------
% 1.63/1.86 % SZS status Unsatisfiable
% 1.63/1.86 % SZS output start Refutation
% See solution above
% 1.63/1.86 ------------ end of proof -------------
% 1.63/1.86
% 1.63/1.86
% 1.63/1.86 Search stopped by max_proofs option.
% 1.63/1.86
% 1.63/1.86
% 1.63/1.86 Search stopped by max_proofs option.
% 1.63/1.86
% 1.63/1.86 ============ end of search ============
% 1.63/1.86
% 1.63/1.86 -------------- statistics -------------
% 1.63/1.86 clauses given 7
% 1.63/1.86 clauses generated 23
% 1.63/1.86 clauses kept 22
% 1.63/1.86 clauses forward subsumed 8
% 1.63/1.86 clauses back subsumed 0
% 1.63/1.86 Kbytes malloced 976
% 1.63/1.86
% 1.63/1.86 ----------- times (seconds) -----------
% 1.63/1.86 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.63/1.86 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.63/1.86 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.63/1.86
% 1.63/1.86 That finishes the proof of the theorem.
% 1.63/1.86
% 1.63/1.86 Process 14320 finished Wed Jul 27 10:44:01 2022
% 1.63/1.86 Otter interrupted
% 1.63/1.86 PROOF FOUND
%------------------------------------------------------------------------------