TSTP Solution File: SET839-2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SET839-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n022.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.82s 1.98s
% Output : Refutation 1.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 11 ( 7 unt; 1 nHn; 6 RR)
% Number of literals : 17 ( 2 equ; 7 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-3 aty)
% Number of variables : 22 ( 9 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ c_lesse_quals(v_S,c_insert(A,c_emptyset,tc_set(t_a)),tc_set(tc_set(t_a))),
file('SET839-2.p',unknown),
[] ).
cnf(2,axiom,
( c_lesse_quals(A,B,tc_set(t_a))
| ~ c_in(B,v_S,tc_set(t_a))
| ~ c_in(A,v_S,tc_set(t_a)) ),
file('SET839-2.p',unknown),
[] ).
cnf(3,axiom,
( ~ c_in(c_Main_OsubsetI__1(A,B,C),B,C)
| c_lesse_quals(A,B,tc_set(C)) ),
file('SET839-2.p',unknown),
[] ).
cnf(4,axiom,
( ~ c_lesse_quals(A,B,tc_set(C))
| ~ c_lesse_quals(B,A,tc_set(C))
| B = A ),
file('SET839-2.p',unknown),
[] ).
cnf(8,axiom,
c_in(A,c_insert(A,B,C),C),
file('SET839-2.p',unknown),
[] ).
cnf(9,axiom,
( c_in(c_Main_OsubsetI__1(A,B,C),A,C)
| c_lesse_quals(A,B,tc_set(C)) ),
file('SET839-2.p',unknown),
[] ).
cnf(12,plain,
c_in(c_Main_OsubsetI__1(v_S,c_insert(A,c_emptyset,tc_set(t_a)),tc_set(t_a)),v_S,tc_set(t_a)),
inference(hyper,[status(thm)],[9,1]),
[iquote('hyper,9,1')] ).
cnf(16,plain,
c_lesse_quals(c_Main_OsubsetI__1(v_S,c_insert(A,c_emptyset,tc_set(t_a)),tc_set(t_a)),c_Main_OsubsetI__1(v_S,c_insert(B,c_emptyset,tc_set(t_a)),tc_set(t_a)),tc_set(t_a)),
inference(hyper,[status(thm)],[12,2,12]),
[iquote('hyper,12,2,12')] ).
cnf(85,plain,
c_Main_OsubsetI__1(v_S,c_insert(A,c_emptyset,tc_set(t_a)),tc_set(t_a)) = c_Main_OsubsetI__1(v_S,c_insert(B,c_emptyset,tc_set(t_a)),tc_set(t_a)),
inference(hyper,[status(thm)],[16,4,16]),
[iquote('hyper,16,4,16')] ).
cnf(138,plain,
~ c_in(c_Main_OsubsetI__1(v_S,c_insert(A,c_emptyset,tc_set(t_a)),tc_set(t_a)),c_insert(B,c_emptyset,tc_set(t_a)),tc_set(t_a)),
inference(unit_del,[status(thm)],[inference(para_from,[status(thm),theory(equality)],[85,3]),1]),
[iquote('para_from,85.1.1,3.1.1,unit_del,1')] ).
cnf(139,plain,
$false,
inference(binary,[status(thm)],[138,8]),
[iquote('binary,138.1,8.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : SET839-2 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.14 % Command : otter-tptp-script %s
% 0.14/0.35 % Computer : n022.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:42:50 EDT 2022
% 0.14/0.35 % CPUTime :
% 1.82/1.98 ----- Otter 3.3f, August 2004 -----
% 1.82/1.98 The process was started by sandbox on n022.cluster.edu,
% 1.82/1.98 Wed Jul 27 10:42:50 2022
% 1.82/1.98 The command was "./otter". The process ID is 28013.
% 1.82/1.98
% 1.82/1.98 set(prolog_style_variables).
% 1.82/1.98 set(auto).
% 1.82/1.98 dependent: set(auto1).
% 1.82/1.98 dependent: set(process_input).
% 1.82/1.98 dependent: clear(print_kept).
% 1.82/1.98 dependent: clear(print_new_demod).
% 1.82/1.98 dependent: clear(print_back_demod).
% 1.82/1.98 dependent: clear(print_back_sub).
% 1.82/1.98 dependent: set(control_memory).
% 1.82/1.98 dependent: assign(max_mem, 12000).
% 1.82/1.98 dependent: assign(pick_given_ratio, 4).
% 1.82/1.98 dependent: assign(stats_level, 1).
% 1.82/1.98 dependent: assign(max_seconds, 10800).
% 1.82/1.98 clear(print_given).
% 1.82/1.98
% 1.82/1.98 list(usable).
% 1.82/1.98 0 [] A=A.
% 1.82/1.98 0 [] -c_lesse_quals(v_S,c_insert(V_U,c_emptyset,tc_set(t_a)),tc_set(tc_set(t_a))).
% 1.82/1.98 0 [] c_lesse_quals(V_U,V_V,tc_set(t_a))| -c_in(V_V,v_S,tc_set(t_a))| -c_in(V_U,v_S,tc_set(t_a)).
% 1.82/1.98 0 [] c_in(V_x,c_insert(V_x,V_B,T_a),T_a).
% 1.82/1.98 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.82/1.98 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.82/1.98 0 [] -c_lesse_quals(V_B,V_A,tc_set(T_a))| -c_lesse_quals(V_A,V_B,tc_set(T_a))|V_A=V_B.
% 1.82/1.98 end_of_list.
% 1.82/1.98
% 1.82/1.98 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 1.82/1.98
% 1.82/1.98 This ia a non-Horn set with equality. The strategy will be
% 1.82/1.98 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.82/1.98 deletion, with positive clauses in sos and nonpositive
% 1.82/1.98 clauses in usable.
% 1.82/1.98
% 1.82/1.98 dependent: set(knuth_bendix).
% 1.82/1.98 dependent: set(anl_eq).
% 1.82/1.98 dependent: set(para_from).
% 1.82/1.98 dependent: set(para_into).
% 1.82/1.98 dependent: clear(para_from_right).
% 1.82/1.98 dependent: clear(para_into_right).
% 1.82/1.98 dependent: set(para_from_vars).
% 1.82/1.98 dependent: set(eq_units_both_ways).
% 1.82/1.98 dependent: set(dynamic_demod_all).
% 1.82/1.98 dependent: set(dynamic_demod).
% 1.82/1.98 dependent: set(order_eq).
% 1.82/1.98 dependent: set(back_demod).
% 1.82/1.98 dependent: set(lrpo).
% 1.82/1.98 dependent: set(hyper_res).
% 1.82/1.98 dependent: set(unit_deletion).
% 1.82/1.98 dependent: set(factor).
% 1.82/1.98
% 1.82/1.98 ------------> process usable:
% 1.82/1.98 ** KEPT (pick-wt=10): 1 [] -c_lesse_quals(v_S,c_insert(A,c_emptyset,tc_set(t_a)),tc_set(tc_set(t_a))).
% 1.82/1.98 ** KEPT (pick-wt=15): 2 [] c_lesse_quals(A,B,tc_set(t_a))| -c_in(B,v_S,tc_set(t_a))| -c_in(A,v_S,tc_set(t_a)).
% 1.82/1.98 ** KEPT (pick-wt=12): 3 [] -c_in(c_Main_OsubsetI__1(A,B,C),B,C)|c_lesse_quals(A,B,tc_set(C)).
% 1.82/1.98 ** KEPT (pick-wt=13): 4 [] -c_lesse_quals(A,B,tc_set(C))| -c_lesse_quals(B,A,tc_set(C))|B=A.
% 1.82/1.98
% 1.82/1.98 ------------> process sos:
% 1.82/1.98 ** KEPT (pick-wt=3): 7 [] A=A.
% 1.82/1.98 ** KEPT (pick-wt=7): 8 [] c_in(A,c_insert(A,B,C),C).
% 1.82/1.98 ** KEPT (pick-wt=12): 9 [] c_in(c_Main_OsubsetI__1(A,B,C),A,C)|c_lesse_quals(A,B,tc_set(C)).
% 1.82/1.98 Following clause subsumed by 7 during input processing: 0 [copy,7,flip.1] A=A.
% 1.82/1.98 7 back subsumes 6.
% 1.82/1.98
% 1.82/1.98 ======= end of input processing =======
% 1.82/1.98
% 1.82/1.98 =========== start of search ===========
% 1.82/1.98
% 1.82/1.98 -------- PROOF --------
% 1.82/1.98
% 1.82/1.98 ----> UNIT CONFLICT at 0.01 sec ----> 139 [binary,138.1,8.1] $F.
% 1.82/1.98
% 1.82/1.98 Length of proof is 4. Level of proof is 4.
% 1.82/1.98
% 1.82/1.98 ---------------- PROOF ----------------
% 1.82/1.98 % SZS status Unsatisfiable
% 1.82/1.98 % SZS output start Refutation
% See solution above
% 1.82/1.98 ------------ end of proof -------------
% 1.82/1.98
% 1.82/1.98
% 1.82/1.98 Search stopped by max_proofs option.
% 1.82/1.98
% 1.82/1.98
% 1.82/1.98 Search stopped by max_proofs option.
% 1.82/1.98
% 1.82/1.98 ============ end of search ============
% 1.82/1.98
% 1.82/1.98 -------------- statistics -------------
% 1.82/1.98 clauses given 8
% 1.82/1.98 clauses generated 303
% 1.82/1.98 clauses kept 138
% 1.82/1.98 clauses forward subsumed 174
% 1.82/1.98 clauses back subsumed 2
% 1.82/1.98 Kbytes malloced 1953
% 1.82/1.98
% 1.82/1.98 ----------- times (seconds) -----------
% 1.82/1.98 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.82/1.98 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.82/1.98 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.82/1.98
% 1.82/1.98 That finishes the proof of the theorem.
% 1.82/1.98
% 1.82/1.98 Process 28013 finished Wed Jul 27 10:42:52 2022
% 1.82/1.98 Otter interrupted
% 1.82/1.98 PROOF FOUND
%------------------------------------------------------------------------------