TSTP Solution File: SEU163+3 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU163+3 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n013.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:15:00 EDT 2022
% Result : Theorem 1.99s 2.16s
% Output : Refutation 1.99s
% 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 ( 0 equ; 2 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-1 aty)
% Number of variables : 2 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(3,axiom,
~ subset(dollar_c4,union(dollar_c3)),
file('SEU163+3.p',unknown),
[] ).
cnf(4,axiom,
( ~ in(A,B)
| subset(A,union(B)) ),
file('SEU163+3.p',unknown),
[] ).
cnf(7,axiom,
in(dollar_c4,dollar_c3),
file('SEU163+3.p',unknown),
[] ).
cnf(8,plain,
subset(dollar_c4,union(dollar_c3)),
inference(hyper,[status(thm)],[7,4]),
[iquote('hyper,7,4')] ).
cnf(9,plain,
$false,
inference(binary,[status(thm)],[8,3]),
[iquote('binary,8.1,3.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU163+3 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.13 % Command : otter-tptp-script %s
% 0.14/0.34 % Computer : n013.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 300
% 0.14/0.34 % DateTime : Wed Jul 27 07:47:15 EDT 2022
% 0.14/0.34 % CPUTime :
% 1.99/2.16 ----- Otter 3.3f, August 2004 -----
% 1.99/2.16 The process was started by sandbox2 on n013.cluster.edu,
% 1.99/2.16 Wed Jul 27 07:47:15 2022
% 1.99/2.16 The command was "./otter". The process ID is 8137.
% 1.99/2.16
% 1.99/2.16 set(prolog_style_variables).
% 1.99/2.16 set(auto).
% 1.99/2.16 dependent: set(auto1).
% 1.99/2.16 dependent: set(process_input).
% 1.99/2.16 dependent: clear(print_kept).
% 1.99/2.16 dependent: clear(print_new_demod).
% 1.99/2.16 dependent: clear(print_back_demod).
% 1.99/2.16 dependent: clear(print_back_sub).
% 1.99/2.16 dependent: set(control_memory).
% 1.99/2.16 dependent: assign(max_mem, 12000).
% 1.99/2.16 dependent: assign(pick_given_ratio, 4).
% 1.99/2.16 dependent: assign(stats_level, 1).
% 1.99/2.16 dependent: assign(max_seconds, 10800).
% 1.99/2.16 clear(print_given).
% 1.99/2.16
% 1.99/2.16 formula_list(usable).
% 1.99/2.16 all A B subset(A,A).
% 1.99/2.16 all A B (in(A,B)-> -in(B,A)).
% 1.99/2.16 exists A empty(A).
% 1.99/2.16 exists A (-empty(A)).
% 1.99/2.16 -(all A B (in(A,B)->subset(A,union(B)))).
% 1.99/2.16 all A B (in(A,B)->subset(A,union(B))).
% 1.99/2.16 end_of_list.
% 1.99/2.16
% 1.99/2.16 -------> usable clausifies to:
% 1.99/2.16
% 1.99/2.16 list(usable).
% 1.99/2.16 0 [] subset(A,A).
% 1.99/2.16 0 [] -in(A,B)| -in(B,A).
% 1.99/2.16 0 [] empty($c1).
% 1.99/2.16 0 [] -empty($c2).
% 1.99/2.16 0 [] in($c4,$c3).
% 1.99/2.16 0 [] -subset($c4,union($c3)).
% 1.99/2.16 0 [] -in(A,B)|subset(A,union(B)).
% 1.99/2.16 end_of_list.
% 1.99/2.16
% 1.99/2.16 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=2.
% 1.99/2.16
% 1.99/2.16 This is a Horn set without equality. The strategy will
% 1.99/2.16 be hyperresolution, with satellites in sos and nuclei
% 1.99/2.16 in usable.
% 1.99/2.16
% 1.99/2.16 dependent: set(hyper_res).
% 1.99/2.16 dependent: clear(order_hyper).
% 1.99/2.16
% 1.99/2.16 ------------> process usable:
% 1.99/2.16 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 1.99/2.16 ** KEPT (pick-wt=2): 2 [] -empty($c2).
% 1.99/2.16 ** KEPT (pick-wt=4): 3 [] -subset($c4,union($c3)).
% 1.99/2.16 ** KEPT (pick-wt=7): 4 [] -in(A,B)|subset(A,union(B)).
% 1.99/2.16
% 1.99/2.16 ------------> process sos:
% 1.99/2.16 ** KEPT (pick-wt=3): 5 [] subset(A,A).
% 1.99/2.16 ** KEPT (pick-wt=2): 6 [] empty($c1).
% 1.99/2.16 ** KEPT (pick-wt=3): 7 [] in($c4,$c3).
% 1.99/2.16
% 1.99/2.16 ======= end of input processing =======
% 1.99/2.16
% 1.99/2.16 =========== start of search ===========
% 1.99/2.16
% 1.99/2.16 -------- PROOF --------
% 1.99/2.16
% 1.99/2.16 ----> UNIT CONFLICT at 0.00 sec ----> 9 [binary,8.1,3.1] $F.
% 1.99/2.16
% 1.99/2.16 Length of proof is 1. Level of proof is 1.
% 1.99/2.16
% 1.99/2.16 ---------------- PROOF ----------------
% 1.99/2.16 % SZS status Theorem
% 1.99/2.16 % SZS output start Refutation
% See solution above
% 1.99/2.16 ------------ end of proof -------------
% 1.99/2.16
% 1.99/2.16
% 1.99/2.16 Search stopped by max_proofs option.
% 1.99/2.16
% 1.99/2.16
% 1.99/2.16 Search stopped by max_proofs option.
% 1.99/2.16
% 1.99/2.16 ============ end of search ============
% 1.99/2.16
% 1.99/2.16 -------------- statistics -------------
% 1.99/2.16 clauses given 3
% 1.99/2.16 clauses generated 1
% 1.99/2.16 clauses kept 8
% 1.99/2.16 clauses forward subsumed 0
% 1.99/2.16 clauses back subsumed 0
% 1.99/2.16 Kbytes malloced 976
% 1.99/2.16
% 1.99/2.16 ----------- times (seconds) -----------
% 1.99/2.16 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.99/2.16 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.99/2.16 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.99/2.16
% 1.99/2.16 That finishes the proof of the theorem.
% 1.99/2.16
% 1.99/2.16 Process 8137 finished Wed Jul 27 07:47:17 2022
% 1.99/2.16 Otter interrupted
% 1.99/2.16 PROOF FOUND
%------------------------------------------------------------------------------