TSTP Solution File: SET841-2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SET841-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n027.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.68s 1.89s
% Output : Refutation 1.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 7
% Syntax : Number of clauses : 11 ( 10 unt; 1 nHn; 10 RR)
% Number of literals : 15 ( 4 equ; 5 neg)
% Maximal clause size : 5 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-3 aty)
% Number of variables : 6 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ c_in(A,c_Zorn_OTFin(B,C),tc_set(tc_set(C)))
| ~ c_in(D,c_Zorn_OTFin(B,C),tc_set(tc_set(C)))
| ~ c_lesse_quals(A,D,tc_set(tc_set(C)))
| c_lesse_quals(c_Zorn_Osucc(B,A,C),D,tc_set(tc_set(C)))
| A = D ),
file('SET841-2.p',unknown),
[] ).
cnf(2,axiom,
~ c_lesse_quals(c_Zorn_Osucc(v_S,v_x,t_a),v_m,tc_set(tc_set(t_a))),
file('SET841-2.p',unknown),
[] ).
cnf(5,axiom,
c_lesse_quals(A,A,tc_set(B)),
file('SET841-2.p',unknown),
[] ).
cnf(6,axiom,
c_in(v_m,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))),
file('SET841-2.p',unknown),
[] ).
cnf(7,axiom,
v_m = c_Zorn_Osucc(v_S,v_m,t_a),
file('SET841-2.p',unknown),
[] ).
cnf(9,plain,
c_Zorn_Osucc(v_S,v_m,t_a) = v_m,
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[7])]),
[iquote('copy,7,flip.1')] ).
cnf(10,axiom,
c_in(v_x,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))),
file('SET841-2.p',unknown),
[] ).
cnf(11,axiom,
c_lesse_quals(v_x,v_m,tc_set(tc_set(t_a))),
file('SET841-2.p',unknown),
[] ).
cnf(30,plain,
v_x = v_m,
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[10,1,6,11]),2]),
[iquote('hyper,10,1,6,11,unit_del,2')] ).
cnf(33,plain,
~ c_lesse_quals(v_m,v_m,tc_set(tc_set(t_a))),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[2]),30,9]),
[iquote('back_demod,2,demod,30,9')] ).
cnf(34,plain,
$false,
inference(binary,[status(thm)],[33,5]),
[iquote('binary,33.1,5.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET841-2 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n027.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:44:51 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.68/1.89 ----- Otter 3.3f, August 2004 -----
% 1.68/1.89 The process was started by sandbox on n027.cluster.edu,
% 1.68/1.89 Wed Jul 27 10:44:52 2022
% 1.68/1.89 The command was "./otter". The process ID is 15934.
% 1.68/1.89
% 1.68/1.89 set(prolog_style_variables).
% 1.68/1.89 set(auto).
% 1.68/1.89 dependent: set(auto1).
% 1.68/1.89 dependent: set(process_input).
% 1.68/1.89 dependent: clear(print_kept).
% 1.68/1.89 dependent: clear(print_new_demod).
% 1.68/1.89 dependent: clear(print_back_demod).
% 1.68/1.89 dependent: clear(print_back_sub).
% 1.68/1.89 dependent: set(control_memory).
% 1.68/1.89 dependent: assign(max_mem, 12000).
% 1.68/1.89 dependent: assign(pick_given_ratio, 4).
% 1.68/1.89 dependent: assign(stats_level, 1).
% 1.68/1.89 dependent: assign(max_seconds, 10800).
% 1.68/1.89 clear(print_given).
% 1.68/1.89
% 1.68/1.89 list(usable).
% 1.68/1.89 0 [] A=A.
% 1.68/1.89 0 [] c_lesse_quals(V_A,V_A,tc_set(T_a)).
% 1.68/1.89 0 [] -c_in(V_n,c_Zorn_OTFin(V_S,T_a),tc_set(tc_set(T_a)))| -c_in(V_m,c_Zorn_OTFin(V_S,T_a),tc_set(tc_set(T_a)))| -c_lesse_quals(V_n,V_m,tc_set(tc_set(T_a)))|c_lesse_quals(c_Zorn_Osucc(V_S,V_n,T_a),V_m,tc_set(tc_set(T_a)))|V_n=V_m.
% 1.68/1.89 0 [] c_in(v_m,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))).
% 1.68/1.89 0 [] v_m=c_Zorn_Osucc(v_S,v_m,t_a).
% 1.68/1.89 0 [] c_in(v_x,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))).
% 1.68/1.89 0 [] c_lesse_quals(v_x,v_m,tc_set(tc_set(t_a))).
% 1.68/1.89 0 [] -c_lesse_quals(c_Zorn_Osucc(v_S,v_x,t_a),v_m,tc_set(tc_set(t_a))).
% 1.68/1.89 end_of_list.
% 1.68/1.89
% 1.68/1.89 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=5.
% 1.68/1.89
% 1.68/1.89 This ia a non-Horn set with equality. The strategy will be
% 1.68/1.89 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.68/1.89 deletion, with positive clauses in sos and nonpositive
% 1.68/1.89 clauses in usable.
% 1.68/1.89
% 1.68/1.89 dependent: set(knuth_bendix).
% 1.68/1.89 dependent: set(anl_eq).
% 1.68/1.89 dependent: set(para_from).
% 1.68/1.89 dependent: set(para_into).
% 1.68/1.89 dependent: clear(para_from_right).
% 1.68/1.89 dependent: clear(para_into_right).
% 1.68/1.89 dependent: set(para_from_vars).
% 1.68/1.89 dependent: set(eq_units_both_ways).
% 1.68/1.89 dependent: set(dynamic_demod_all).
% 1.68/1.89 dependent: set(dynamic_demod).
% 1.68/1.89 dependent: set(order_eq).
% 1.68/1.89 dependent: set(back_demod).
% 1.68/1.89 dependent: set(lrpo).
% 1.68/1.89 dependent: set(hyper_res).
% 1.68/1.89 dependent: set(unit_deletion).
% 1.68/1.89 dependent: set(factor).
% 1.68/1.89
% 1.68/1.89 ------------> process usable:
% 1.68/1.89 ** KEPT (pick-wt=34): 1 [] -c_in(A,c_Zorn_OTFin(B,C),tc_set(tc_set(C)))| -c_in(D,c_Zorn_OTFin(B,C),tc_set(tc_set(C)))| -c_lesse_quals(A,D,tc_set(tc_set(C)))|c_lesse_quals(c_Zorn_Osucc(B,A,C),D,tc_set(tc_set(C)))|A=D.
% 1.68/1.89 ** KEPT (pick-wt=9): 2 [] -c_lesse_quals(c_Zorn_Osucc(v_S,v_x,t_a),v_m,tc_set(tc_set(t_a))).
% 1.68/1.89
% 1.68/1.89 ------------> process sos:
% 1.68/1.89 ** KEPT (pick-wt=3): 4 [] A=A.
% 1.68/1.89 ** KEPT (pick-wt=5): 5 [] c_lesse_quals(A,A,tc_set(B)).
% 1.68/1.89 ** KEPT (pick-wt=8): 6 [] c_in(v_m,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))).
% 1.68/1.89 ** KEPT (pick-wt=6): 8 [copy,7,flip.1] c_Zorn_Osucc(v_S,v_m,t_a)=v_m.
% 1.68/1.89 ---> New Demodulator: 9 [new_demod,8] c_Zorn_Osucc(v_S,v_m,t_a)=v_m.
% 1.68/1.89 ** KEPT (pick-wt=8): 10 [] c_in(v_x,c_Zorn_OTFin(v_S,t_a),tc_set(tc_set(t_a))).
% 1.68/1.89 ** KEPT (pick-wt=6): 11 [] c_lesse_quals(v_x,v_m,tc_set(tc_set(t_a))).
% 1.68/1.89 Following clause subsumed by 4 during input processing: 0 [copy,4,flip.1] A=A.
% 1.68/1.89 4 back subsumes 3.
% 1.68/1.89 >>>> Starting back demodulation with 9.
% 1.68/1.89
% 1.68/1.89 ======= end of input processing =======
% 1.68/1.89
% 1.68/1.89 =========== start of search ===========
% 1.68/1.89
% 1.68/1.89 -------- PROOF --------
% 1.68/1.89
% 1.68/1.89 ----> UNIT CONFLICT at 0.00 sec ----> 34 [binary,33.1,5.1] $F.
% 1.68/1.89
% 1.68/1.89 Length of proof is 3. Level of proof is 2.
% 1.68/1.89
% 1.68/1.89 ---------------- PROOF ----------------
% 1.68/1.89 % SZS status Unsatisfiable
% 1.68/1.89 % SZS output start Refutation
% See solution above
% 1.68/1.89 ------------ end of proof -------------
% 1.68/1.89
% 1.68/1.89
% 1.68/1.89 Search stopped by max_proofs option.
% 1.68/1.89
% 1.68/1.89
% 1.68/1.89 Search stopped by max_proofs option.
% 1.68/1.89
% 1.68/1.89 ============ end of search ============
% 1.68/1.89
% 1.68/1.89 -------------- statistics -------------
% 1.68/1.89 clauses given 6
% 1.68/1.89 clauses generated 43
% 1.68/1.89 clauses kept 30
% 1.68/1.89 clauses forward subsumed 29
% 1.68/1.89 clauses back subsumed 1
% 1.68/1.89 Kbytes malloced 976
% 1.68/1.89
% 1.68/1.89 ----------- times (seconds) -----------
% 1.68/1.89 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.68/1.89 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.68/1.89 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.68/1.89
% 1.68/1.89 That finishes the proof of the theorem.
% 1.68/1.89
% 1.68/1.89 Process 15934 finished Wed Jul 27 10:44:53 2022
% 1.68/1.89 Otter interrupted
% 1.68/1.89 PROOF FOUND
%------------------------------------------------------------------------------