%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SET913+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n020.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:31 EDT 2022
% Result : Theorem 1.89s 2.09s
% Output : Refutation 1.89s
% Verified :
% SZS Type : Refutation
% Derivation depth : 1
% Number of leaves : 3
% Syntax : Number of clauses : 4 ( 3 unt; 0 nHn; 4 RR)
% Number of literals : 5 ( 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(4,axiom,
( ~ disjoint(singleton(A),B)
| ~ in(A,B) ),
file('SET913+1.p',unknown),
[] ).
cnf(6,axiom,
disjoint(singleton(dollar_c4),dollar_c3),
file('SET913+1.p',unknown),
[] ).
cnf(7,axiom,
in(dollar_c4,dollar_c3),
file('SET913+1.p',unknown),
[] ).
cnf(8,plain,
$false,
inference(hyper,[status(thm)],[6,4,7]),
[iquote('hyper,6,4,7')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SET913+1 : TPTP v8.1.0. Released v3.2.0.
% 0.04/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n020.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:31:53 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.89/2.09 ----- Otter 3.3f, August 2004 -----
% 1.89/2.09 The process was started by sandbox on n020.cluster.edu,
% 1.89/2.09 Wed Jul 27 10:31:53 2022
% 1.89/2.09 The command was "./otter". The process ID is 32036.
% 1.89/2.09
% 1.89/2.09 set(prolog_style_variables).
% 1.89/2.09 set(auto).
% 1.89/2.09 dependent: set(auto1).
% 1.89/2.09 dependent: set(process_input).
% 1.89/2.09 dependent: clear(print_kept).
% 1.89/2.09 dependent: clear(print_new_demod).
% 1.89/2.09 dependent: clear(print_back_demod).
% 1.89/2.09 dependent: clear(print_back_sub).
% 1.89/2.09 dependent: set(control_memory).
% 1.89/2.09 dependent: assign(max_mem, 12000).
% 1.89/2.09 dependent: assign(pick_given_ratio, 4).
% 1.89/2.09 dependent: assign(stats_level, 1).
% 1.89/2.09 dependent: assign(max_seconds, 10800).
% 1.89/2.09 clear(print_given).
% 1.89/2.09
% 1.89/2.09 formula_list(usable).
% 1.89/2.09 all A B (disjoint(A,B)->disjoint(B,A)).
% 1.89/2.09 all A B (in(A,B)-> -in(B,A)).
% 1.89/2.09 exists A empty(A).
% 1.89/2.09 exists A (-empty(A)).
% 1.89/2.09 -(all A B (-(disjoint(singleton(A),B)&in(A,B)))).
% 1.89/2.09 all A B (-(disjoint(singleton(A),B)&in(A,B))).
% 1.89/2.09 end_of_list.
% 1.89/2.09
% 1.89/2.09 -------> usable clausifies to:
% 1.89/2.09
% 1.89/2.09 list(usable).
% 1.89/2.09 0 [] -disjoint(A,B)|disjoint(B,A).
% 1.89/2.09 0 [] -in(A,B)| -in(B,A).
% 1.89/2.09 0 [] empty($c1).
% 1.89/2.09 0 [] -empty($c2).
% 1.89/2.09 0 [] disjoint(singleton($c4),$c3).
% 1.89/2.09 0 [] in($c4,$c3).
% 1.89/2.09 0 [] -disjoint(singleton(A),B)| -in(A,B).
% 1.89/2.09 end_of_list.
% 1.89/2.09
% 1.89/2.09 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=2.
% 1.89/2.09
% 1.89/2.09 This is a Horn set without equality. The strategy will
% 1.89/2.09 be hyperresolution, with satellites in sos and nuclei
% 1.89/2.09 in usable.
% 1.89/2.09
% 1.89/2.09 dependent: set(hyper_res).
% 1.89/2.09 dependent: clear(order_hyper).
% 1.89/2.09
% 1.89/2.09 ------------> process usable:
% 1.89/2.09 ** KEPT (pick-wt=6): 1 [] -disjoint(A,B)|disjoint(B,A).
% 1.89/2.09 ** KEPT (pick-wt=6): 2 [] -in(A,B)| -in(B,A).
% 1.89/2.09 ** KEPT (pick-wt=2): 3 [] -empty($c2).
% 1.89/2.09 ** KEPT (pick-wt=7): 4 [] -disjoint(singleton(A),B)| -in(A,B).
% 1.89/2.09
% 1.89/2.09 ------------> process sos:
% 1.89/2.09 ** KEPT (pick-wt=2): 5 [] empty($c1).
% 1.89/2.09 ** KEPT (pick-wt=4): 6 [] disjoint(singleton($c4),$c3).
% 1.89/2.09 ** KEPT (pick-wt=3): 7 [] in($c4,$c3).
% 1.89/2.09
% 1.89/2.09 ======= end of input processing =======
% 1.89/2.09
% 1.89/2.09 =========== start of search ===========
% 1.89/2.09
% 1.89/2.09 -------- PROOF --------
% 1.89/2.09
% 1.89/2.09 -----> EMPTY CLAUSE at 0.00 sec ----> 8 [hyper,6,4,7] $F.
% 1.89/2.09
% 1.89/2.09 Length of proof is 0. Level of proof is 0.
% 1.89/2.09
% 1.89/2.09 ---------------- PROOF ----------------
% 1.89/2.09 % SZS status Theorem
% 1.89/2.09 % SZS output start Refutation
% See solution above
% 1.89/2.09 ------------ end of proof -------------
% 1.89/2.09
% 1.89/2.09
% 1.89/2.09 Search stopped by max_proofs option.
% 1.89/2.09
% 1.89/2.09
% 1.89/2.09 Search stopped by max_proofs option.
% 1.89/2.09
% 1.89/2.09 ============ end of search ============
% 1.89/2.09
% 1.89/2.09 -------------- statistics -------------
% 1.89/2.09 clauses given 3
% 1.89/2.09 clauses generated 1
% 1.89/2.09 clauses kept 7
% 1.89/2.09 clauses forward subsumed 0
% 1.89/2.09 clauses back subsumed 0
% 1.89/2.09 Kbytes malloced 976
% 1.89/2.09
% 1.89/2.09 ----------- times (seconds) -----------
% 1.89/2.09 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.89/2.09 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.89/2.09 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.89/2.09
% 1.89/2.09 That finishes the proof of the theorem.
% 1.89/2.09
% 1.89/2.09 Process 32036 finished Wed Jul 27 10:31:55 2022
% 1.89/2.09 Otter interrupted
% 1.89/2.09 PROOF FOUND
%------------------------------------------------------------------------------