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