TSTP Solution File: SET822-2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SET822-2 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n014.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:19 EDT 2022
% Result : Unsatisfiable 1.70s 1.92s
% Output : Refutation 1.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 11 ( 6 unt; 2 nHn; 6 RR)
% Number of literals : 17 ( 2 equ; 6 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 1 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 : 20 ( 3 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ c_in(A,c_emptyset,B),
file('SET822-2.p',unknown),
[] ).
cnf(2,axiom,
( ~ c_in(A,c_insert(B,C,D),D)
| c_in(A,C,D)
| A = B ),
file('SET822-2.p',unknown),
[] ).
cnf(3,axiom,
( ~ c_in(v_f(A),B,tc_IntDef_Oint)
| c_in(v_x(A,B),B,tc_IntDef_Oint) ),
file('SET822-2.p',unknown),
[] ).
cnf(4,axiom,
( ~ c_in(v_f(A),B,tc_IntDef_Oint)
| ~ v_P(v_x(A,B)) ),
file('SET822-2.p',unknown),
[] ).
cnf(6,axiom,
c_in(A,c_insert(A,B,C),C),
file('SET822-2.p',unknown),
[] ).
cnf(7,axiom,
v_P(v_f(v_b)),
file('SET822-2.p',unknown),
[] ).
cnf(10,plain,
c_in(v_x(A,c_insert(v_f(A),B,tc_IntDef_Oint)),c_insert(v_f(A),B,tc_IntDef_Oint),tc_IntDef_Oint),
inference(hyper,[status(thm)],[6,3]),
[iquote('hyper,6,3')] ).
cnf(17,plain,
( c_in(v_x(A,c_insert(v_f(A),B,tc_IntDef_Oint)),B,tc_IntDef_Oint)
| v_x(A,c_insert(v_f(A),B,tc_IntDef_Oint)) = v_f(A) ),
inference(hyper,[status(thm)],[10,2]),
[iquote('hyper,10,2')] ).
cnf(42,plain,
( ~ v_P(v_f(A))
| c_in(v_x(A,c_insert(v_f(A),B,tc_IntDef_Oint)),B,tc_IntDef_Oint) ),
inference(unit_del,[status(thm)],[inference(para_from,[status(thm),theory(equality)],[17,4]),6]),
[iquote('para_from,17.2.1,4.2.1,unit_del,6')] ).
cnf(43,plain,
c_in(v_x(v_b,c_insert(v_f(v_b),A,tc_IntDef_Oint)),A,tc_IntDef_Oint),
inference(hyper,[status(thm)],[42,7]),
[iquote('hyper,42,7')] ).
cnf(44,plain,
$false,
inference(binary,[status(thm)],[43,1]),
[iquote('binary,43.1,1.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET822-2 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.13 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n014.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Wed Jul 27 10:55:39 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.70/1.92 ----- Otter 3.3f, August 2004 -----
% 1.70/1.92 The process was started by sandbox2 on n014.cluster.edu,
% 1.70/1.92 Wed Jul 27 10:55:39 2022
% 1.70/1.92 The command was "./otter". The process ID is 29216.
% 1.70/1.92
% 1.70/1.92 set(prolog_style_variables).
% 1.70/1.92 set(auto).
% 1.70/1.92 dependent: set(auto1).
% 1.70/1.92 dependent: set(process_input).
% 1.70/1.92 dependent: clear(print_kept).
% 1.70/1.92 dependent: clear(print_new_demod).
% 1.70/1.92 dependent: clear(print_back_demod).
% 1.70/1.92 dependent: clear(print_back_sub).
% 1.70/1.92 dependent: set(control_memory).
% 1.70/1.92 dependent: assign(max_mem, 12000).
% 1.70/1.92 dependent: assign(pick_given_ratio, 4).
% 1.70/1.92 dependent: assign(stats_level, 1).
% 1.70/1.92 dependent: assign(max_seconds, 10800).
% 1.70/1.92 clear(print_given).
% 1.70/1.92
% 1.70/1.92 list(usable).
% 1.70/1.92 0 [] A=A.
% 1.70/1.92 0 [] -c_in(V_a,c_emptyset,T_a).
% 1.70/1.92 0 [] c_in(V_x,c_insert(V_x,V_B,T_a),T_a).
% 1.70/1.92 0 [] -c_in(V_a,c_insert(V_b,V_A,T_a),T_a)|c_in(V_a,V_A,T_a)|V_a=V_b.
% 1.70/1.92 0 [] v_P(v_f(v_b)).
% 1.70/1.92 0 [] -c_in(v_f(V_U),V_V,tc_IntDef_Oint)|c_in(v_x(V_U,V_V),V_V,tc_IntDef_Oint).
% 1.70/1.92 0 [] -c_in(v_f(V_U),V_V,tc_IntDef_Oint)| -v_P(v_x(V_U,V_V)).
% 1.70/1.92 end_of_list.
% 1.70/1.92
% 1.70/1.92 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 1.70/1.92
% 1.70/1.92 This ia a non-Horn set with equality. The strategy will be
% 1.70/1.92 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.70/1.92 deletion, with positive clauses in sos and nonpositive
% 1.70/1.92 clauses in usable.
% 1.70/1.92
% 1.70/1.92 dependent: set(knuth_bendix).
% 1.70/1.92 dependent: set(anl_eq).
% 1.70/1.92 dependent: set(para_from).
% 1.70/1.92 dependent: set(para_into).
% 1.70/1.92 dependent: clear(para_from_right).
% 1.70/1.92 dependent: clear(para_into_right).
% 1.70/1.92 dependent: set(para_from_vars).
% 1.70/1.92 dependent: set(eq_units_both_ways).
% 1.70/1.92 dependent: set(dynamic_demod_all).
% 1.70/1.92 dependent: set(dynamic_demod).
% 1.70/1.92 dependent: set(order_eq).
% 1.70/1.92 dependent: set(back_demod).
% 1.70/1.92 dependent: set(lrpo).
% 1.70/1.92 dependent: set(hyper_res).
% 1.70/1.92 dependent: set(unit_deletion).
% 1.70/1.92 dependent: set(factor).
% 1.70/1.92
% 1.70/1.92 ------------> process usable:
% 1.70/1.92 ** KEPT (pick-wt=4): 1 [] -c_in(A,c_emptyset,B).
% 1.70/1.92 ** KEPT (pick-wt=14): 2 [] -c_in(A,c_insert(B,C,D),D)|c_in(A,C,D)|A=B.
% 1.70/1.92 ** KEPT (pick-wt=11): 3 [] -c_in(v_f(A),B,tc_IntDef_Oint)|c_in(v_x(A,B),B,tc_IntDef_Oint).
% 1.70/1.92 ** KEPT (pick-wt=9): 4 [] -c_in(v_f(A),B,tc_IntDef_Oint)| -v_P(v_x(A,B)).
% 1.70/1.92
% 1.70/1.92 ------------> process sos:
% 1.70/1.92 ** KEPT (pick-wt=3): 5 [] A=A.
% 1.70/1.92 ** KEPT (pick-wt=7): 6 [] c_in(A,c_insert(A,B,C),C).
% 1.70/1.92 ** KEPT (pick-wt=3): 7 [] v_P(v_f(v_b)).
% 1.70/1.92 Following clause subsumed by 5 during input processing: 0 [copy,5,flip.1] A=A.
% 1.70/1.92
% 1.70/1.92 ======= end of input processing =======
% 1.70/1.92
% 1.70/1.92 =========== start of search ===========
% 1.70/1.92
% 1.70/1.92 -------- PROOF --------
% 1.70/1.92
% 1.70/1.92 ----> UNIT CONFLICT at 0.00 sec ----> 44 [binary,43.1,1.1] $F.
% 1.70/1.92
% 1.70/1.92 Length of proof is 4. Level of proof is 4.
% 1.70/1.92
% 1.70/1.92 ---------------- PROOF ----------------
% 1.70/1.92 % SZS status Unsatisfiable
% 1.70/1.92 % SZS output start Refutation
% See solution above
% 1.70/1.92 ------------ end of proof -------------
% 1.70/1.92
% 1.70/1.92
% 1.70/1.92 Search stopped by max_proofs option.
% 1.70/1.92
% 1.70/1.92
% 1.70/1.92 Search stopped by max_proofs option.
% 1.70/1.92
% 1.70/1.92 ============ end of search ============
% 1.70/1.92
% 1.70/1.92 -------------- statistics -------------
% 1.70/1.92 clauses given 8
% 1.70/1.92 clauses generated 55
% 1.70/1.92 clauses kept 43
% 1.70/1.92 clauses forward subsumed 20
% 1.70/1.92 clauses back subsumed 0
% 1.70/1.92 Kbytes malloced 976
% 1.70/1.92
% 1.70/1.92 ----------- times (seconds) -----------
% 1.70/1.92 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.70/1.92 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.70/1.92 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.70/1.92
% 1.70/1.92 That finishes the proof of the theorem.
% 1.70/1.92
% 1.70/1.92 Process 29216 finished Wed Jul 27 10:55:40 2022
% 1.70/1.92 Otter interrupted
% 1.70/1.92 PROOF FOUND
%------------------------------------------------------------------------------