TSTP Solution File: SET855-2 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SET855-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:24 EDT 2022
% Result : Unsatisfiable 1.68s 1.87s
% Output : Refutation 1.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 4
% Syntax : Number of clauses : 7 ( 6 unt; 0 nHn; 7 RR)
% Number of literals : 9 ( 4 equ; 4 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 2 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-3 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 3 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ c_lesse_quals(A,B,tc_set(C))
| ~ c_lesse_quals(B,A,tc_set(C))
| B = A ),
file('SET855-2.p',unknown),
[] ).
cnf(2,axiom,
v_n != c_Union(v_Y,tc_set(t_a)),
file('SET855-2.p',unknown),
[] ).
cnf(3,plain,
c_Union(v_Y,tc_set(t_a)) != v_n,
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[2])]),
[iquote('copy,2,flip.1')] ).
cnf(5,axiom,
c_lesse_quals(v_n,c_Union(v_Y,tc_set(t_a)),tc_set(tc_set(t_a))),
file('SET855-2.p',unknown),
[] ).
cnf(6,axiom,
c_lesse_quals(c_Union(v_Y,tc_set(t_a)),v_n,tc_set(tc_set(t_a))),
file('SET855-2.p',unknown),
[] ).
cnf(15,plain,
c_Union(v_Y,tc_set(t_a)) = v_n,
inference(hyper,[status(thm)],[6,1,5]),
[iquote('hyper,6,1,5')] ).
cnf(17,plain,
$false,
inference(binary,[status(thm)],[15,3]),
[iquote('binary,15.1,3.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SET855-2 : TPTP v8.1.0. Released v3.2.0.
% 0.06/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:52:51 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.68/1.87 ----- Otter 3.3f, August 2004 -----
% 1.68/1.87 The process was started by sandbox on n027.cluster.edu,
% 1.68/1.87 Wed Jul 27 10:52:52 2022
% 1.68/1.87 The command was "./otter". The process ID is 29341.
% 1.68/1.87
% 1.68/1.87 set(prolog_style_variables).
% 1.68/1.87 set(auto).
% 1.68/1.87 dependent: set(auto1).
% 1.68/1.87 dependent: set(process_input).
% 1.68/1.87 dependent: clear(print_kept).
% 1.68/1.87 dependent: clear(print_new_demod).
% 1.68/1.87 dependent: clear(print_back_demod).
% 1.68/1.87 dependent: clear(print_back_sub).
% 1.68/1.87 dependent: set(control_memory).
% 1.68/1.87 dependent: assign(max_mem, 12000).
% 1.68/1.87 dependent: assign(pick_given_ratio, 4).
% 1.68/1.87 dependent: assign(stats_level, 1).
% 1.68/1.87 dependent: assign(max_seconds, 10800).
% 1.68/1.87 clear(print_given).
% 1.68/1.87
% 1.68/1.87 list(usable).
% 1.68/1.87 0 [] A=A.
% 1.68/1.87 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.68/1.87 0 [] c_lesse_quals(v_n,c_Union(v_Y,tc_set(t_a)),tc_set(tc_set(t_a))).
% 1.68/1.87 0 [] c_lesse_quals(c_Union(v_Y,tc_set(t_a)),v_n,tc_set(tc_set(t_a))).
% 1.68/1.87 0 [] v_n!=c_Union(v_Y,tc_set(t_a)).
% 1.68/1.87 end_of_list.
% 1.68/1.87
% 1.68/1.87 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 1.68/1.87
% 1.68/1.87 This is a Horn set with equality. The strategy will be
% 1.68/1.87 Knuth-Bendix and hyper_res, with positive clauses in
% 1.68/1.87 sos and nonpositive clauses in usable.
% 1.68/1.87
% 1.68/1.87 dependent: set(knuth_bendix).
% 1.68/1.87 dependent: set(anl_eq).
% 1.68/1.87 dependent: set(para_from).
% 1.68/1.87 dependent: set(para_into).
% 1.68/1.87 dependent: clear(para_from_right).
% 1.68/1.87 dependent: clear(para_into_right).
% 1.68/1.87 dependent: set(para_from_vars).
% 1.68/1.87 dependent: set(eq_units_both_ways).
% 1.68/1.87 dependent: set(dynamic_demod_all).
% 1.68/1.87 dependent: set(dynamic_demod).
% 1.68/1.87 dependent: set(order_eq).
% 1.68/1.87 dependent: set(back_demod).
% 1.68/1.87 dependent: set(lrpo).
% 1.68/1.87 dependent: set(hyper_res).
% 1.68/1.87 dependent: clear(order_hyper).
% 1.68/1.87
% 1.68/1.87 ------------> process usable:
% 1.68/1.87 ** KEPT (pick-wt=13): 1 [] -c_lesse_quals(A,B,tc_set(C))| -c_lesse_quals(B,A,tc_set(C))|B=A.
% 1.68/1.87 ** KEPT (pick-wt=6): 3 [copy,2,flip.1] c_Union(v_Y,tc_set(t_a))!=v_n.
% 1.68/1.87
% 1.68/1.87 ------------> process sos:
% 1.68/1.87 ** KEPT (pick-wt=3): 4 [] A=A.
% 1.68/1.87 ** KEPT (pick-wt=9): 5 [] c_lesse_quals(v_n,c_Union(v_Y,tc_set(t_a)),tc_set(tc_set(t_a))).
% 1.68/1.87 ** KEPT (pick-wt=9): 6 [] c_lesse_quals(c_Union(v_Y,tc_set(t_a)),v_n,tc_set(tc_set(t_a))).
% 1.68/1.87 Following clause subsumed by 4 during input processing: 0 [copy,4,flip.1] A=A.
% 1.68/1.87
% 1.68/1.87 ======= end of input processing =======
% 1.68/1.87
% 1.68/1.87 =========== start of search ===========
% 1.68/1.87
% 1.68/1.87 -------- PROOF --------
% 1.68/1.87
% 1.68/1.87 ----> UNIT CONFLICT at 0.00 sec ----> 17 [binary,15.1,3.1] $F.
% 1.68/1.87
% 1.68/1.87 Length of proof is 2. Level of proof is 1.
% 1.68/1.87
% 1.68/1.87 ---------------- PROOF ----------------
% 1.68/1.87 % SZS status Unsatisfiable
% 1.68/1.87 % SZS output start Refutation
% See solution above
% 1.68/1.87 ------------ end of proof -------------
% 1.68/1.87
% 1.68/1.87
% 1.68/1.87 Search stopped by max_proofs option.
% 1.68/1.87
% 1.68/1.87
% 1.68/1.87 Search stopped by max_proofs option.
% 1.68/1.87
% 1.68/1.87 ============ end of search ============
% 1.68/1.87
% 1.68/1.87 -------------- statistics -------------
% 1.68/1.87 clauses given 3
% 1.68/1.87 clauses generated 9
% 1.68/1.87 clauses kept 14
% 1.68/1.87 clauses forward subsumed 1
% 1.68/1.87 clauses back subsumed 0
% 1.68/1.87 Kbytes malloced 976
% 1.68/1.87
% 1.68/1.87 ----------- times (seconds) -----------
% 1.68/1.87 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.68/1.87 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.68/1.87 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.68/1.87
% 1.68/1.87 That finishes the proof of the theorem.
% 1.68/1.87
% 1.68/1.87 Process 29341 finished Wed Jul 27 10:52:53 2022
% 1.68/1.87 Otter interrupted
% 1.68/1.87 PROOF FOUND
%------------------------------------------------------------------------------