TSTP Solution File: SEU161+3 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU161+3 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n029.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:59 EDT 2022
% Result : Theorem 1.73s 1.93s
% Output : Refutation 1.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 3
% Syntax : Number of clauses : 5 ( 4 unt; 0 nHn; 5 RR)
% Number of literals : 6 ( 3 equ; 2 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 2 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(5,axiom,
set_union2(singleton(dollar_c4),dollar_c3) != dollar_c3,
file('SEU161+3.p',unknown),
[] ).
cnf(6,axiom,
( ~ in(A,B)
| set_union2(singleton(A),B) = B ),
file('SEU161+3.p',unknown),
[] ).
cnf(12,axiom,
in(dollar_c4,dollar_c3),
file('SEU161+3.p',unknown),
[] ).
cnf(13,plain,
set_union2(singleton(dollar_c4),dollar_c3) = dollar_c3,
inference(hyper,[status(thm)],[12,6]),
[iquote('hyper,12,6')] ).
cnf(15,plain,
$false,
inference(binary,[status(thm)],[13,5]),
[iquote('binary,13.1,5.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU161+3 : TPTP v8.1.0. Released v3.2.0.
% 0.07/0.13 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n029.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 07:56:29 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.73/1.93 ----- Otter 3.3f, August 2004 -----
% 1.73/1.93 The process was started by sandbox2 on n029.cluster.edu,
% 1.73/1.93 Wed Jul 27 07:56:29 2022
% 1.73/1.93 The command was "./otter". The process ID is 23938.
% 1.73/1.93
% 1.73/1.93 set(prolog_style_variables).
% 1.73/1.93 set(auto).
% 1.73/1.93 dependent: set(auto1).
% 1.73/1.93 dependent: set(process_input).
% 1.73/1.93 dependent: clear(print_kept).
% 1.73/1.93 dependent: clear(print_new_demod).
% 1.73/1.93 dependent: clear(print_back_demod).
% 1.73/1.93 dependent: clear(print_back_sub).
% 1.73/1.93 dependent: set(control_memory).
% 1.73/1.93 dependent: assign(max_mem, 12000).
% 1.73/1.93 dependent: assign(pick_given_ratio, 4).
% 1.73/1.93 dependent: assign(stats_level, 1).
% 1.73/1.93 dependent: assign(max_seconds, 10800).
% 1.73/1.93 clear(print_given).
% 1.73/1.93
% 1.73/1.93 formula_list(usable).
% 1.73/1.93 all A (A=A).
% 1.73/1.93 all A B (-empty(A)-> -empty(set_union2(A,B))).
% 1.73/1.93 all A B (-empty(A)-> -empty(set_union2(B,A))).
% 1.73/1.93 all A B (set_union2(A,B)=set_union2(B,A)).
% 1.73/1.93 all A B (set_union2(A,A)=A).
% 1.73/1.93 all A B (in(A,B)-> -in(B,A)).
% 1.73/1.93 exists A empty(A).
% 1.73/1.93 exists A (-empty(A)).
% 1.73/1.93 -(all A B (in(A,B)->set_union2(singleton(A),B)=B)).
% 1.73/1.93 all A B (in(A,B)->set_union2(singleton(A),B)=B).
% 1.73/1.93 end_of_list.
% 1.73/1.93
% 1.73/1.93 -------> usable clausifies to:
% 1.73/1.93
% 1.73/1.93 list(usable).
% 1.73/1.93 0 [] A=A.
% 1.73/1.93 0 [] empty(A)| -empty(set_union2(A,B)).
% 1.73/1.93 0 [] empty(A)| -empty(set_union2(B,A)).
% 1.73/1.93 0 [] set_union2(A,B)=set_union2(B,A).
% 1.73/1.93 0 [] set_union2(A,A)=A.
% 1.73/1.93 0 [] -in(A,B)| -in(B,A).
% 1.73/1.93 0 [] empty($c1).
% 1.73/1.93 0 [] -empty($c2).
% 1.73/1.93 0 [] in($c4,$c3).
% 1.73/1.93 0 [] set_union2(singleton($c4),$c3)!=$c3.
% 1.73/1.93 0 [] -in(A,B)|set_union2(singleton(A),B)=B.
% 1.73/1.93 end_of_list.
% 1.73/1.93
% 1.73/1.93 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=2.
% 1.73/1.93
% 1.73/1.93 This is a Horn set with equality. The strategy will be
% 1.73/1.93 Knuth-Bendix and hyper_res, with positive clauses in
% 1.73/1.93 sos and nonpositive clauses in usable.
% 1.73/1.93
% 1.73/1.93 dependent: set(knuth_bendix).
% 1.73/1.93 dependent: set(anl_eq).
% 1.73/1.93 dependent: set(para_from).
% 1.73/1.93 dependent: set(para_into).
% 1.73/1.93 dependent: clear(para_from_right).
% 1.73/1.93 dependent: clear(para_into_right).
% 1.73/1.93 dependent: set(para_from_vars).
% 1.73/1.93 dependent: set(eq_units_both_ways).
% 1.73/1.93 dependent: set(dynamic_demod_all).
% 1.73/1.93 dependent: set(dynamic_demod).
% 1.73/1.93 dependent: set(order_eq).
% 1.73/1.93 dependent: set(back_demod).
% 1.73/1.93 dependent: set(lrpo).
% 1.73/1.93 dependent: set(hyper_res).
% 1.73/1.93 dependent: clear(order_hyper).
% 1.73/1.93
% 1.73/1.93 ------------> process usable:
% 1.73/1.93 ** KEPT (pick-wt=6): 1 [] empty(A)| -empty(set_union2(A,B)).
% 1.73/1.93 ** KEPT (pick-wt=6): 2 [] empty(A)| -empty(set_union2(B,A)).
% 1.73/1.93 ** KEPT (pick-wt=6): 3 [] -in(A,B)| -in(B,A).
% 1.73/1.93 ** KEPT (pick-wt=2): 4 [] -empty($c2).
% 1.73/1.93 ** KEPT (pick-wt=6): 5 [] set_union2(singleton($c4),$c3)!=$c3.
% 1.73/1.93 ** KEPT (pick-wt=9): 6 [] -in(A,B)|set_union2(singleton(A),B)=B.
% 1.73/1.93
% 1.73/1.93 ------------> process sos:
% 1.73/1.93 ** KEPT (pick-wt=3): 7 [] A=A.
% 1.73/1.93 ** KEPT (pick-wt=7): 8 [] set_union2(A,B)=set_union2(B,A).
% 1.73/1.93 ** KEPT (pick-wt=5): 9 [] set_union2(A,A)=A.
% 1.73/1.93 ---> New Demodulator: 10 [new_demod,9] set_union2(A,A)=A.
% 1.73/1.93 ** KEPT (pick-wt=2): 11 [] empty($c1).
% 1.73/1.93 ** KEPT (pick-wt=3): 12 [] in($c4,$c3).
% 1.73/1.93 Following clause subsumed by 7 during input processing: 0 [copy,7,flip.1] A=A.
% 1.73/1.93 Following clause subsumed by 8 during input processing: 0 [copy,8,flip.1] set_union2(A,B)=set_union2(B,A).
% 1.73/1.93 >>>> Starting back demodulation with 10.
% 1.73/1.93
% 1.73/1.93 ======= end of input processing =======
% 1.73/1.93
% 1.73/1.93 =========== start of search ===========
% 1.73/1.93
% 1.73/1.93 -------- PROOF --------
% 1.73/1.93
% 1.73/1.93 ----> UNIT CONFLICT at 0.00 sec ----> 15 [binary,13.1,5.1] $F.
% 1.73/1.93
% 1.73/1.93 Length of proof is 1. Level of proof is 1.
% 1.73/1.93
% 1.73/1.93 ---------------- PROOF ----------------
% 1.73/1.93 % SZS status Theorem
% 1.73/1.93 % SZS output start Refutation
% See solution above
% 1.73/1.93 ------------ end of proof -------------
% 1.73/1.93
% 1.73/1.93
% 1.73/1.93 Search stopped by max_proofs option.
% 1.73/1.93
% 1.73/1.93
% 1.73/1.93 Search stopped by max_proofs option.
% 1.73/1.93
% 1.73/1.93 ============ end of search ============
% 1.73/1.93
% 1.73/1.93 -------------- statistics -------------
% 1.73/1.93 clauses given 3
% 1.73/1.93 clauses generated 1
% 1.73/1.93 clauses kept 12
% 1.73/1.93 clauses forward subsumed 2
% 1.73/1.93 clauses back subsumed 0
% 1.73/1.93 Kbytes malloced 976
% 1.73/1.93
% 1.73/1.93 ----------- times (seconds) -----------
% 1.73/1.93 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.73/1.93 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.73/1.93 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.73/1.93
% 1.73/1.93 That finishes the proof of the theorem.
% 1.73/1.93
% 1.73/1.93 Process 23938 finished Wed Jul 27 07:56:31 2022
% 1.73/1.93 Otter interrupted
% 1.73/1.93 PROOF FOUND
%------------------------------------------------------------------------------