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