%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SET001-1 : TPTP v8.1.0. Released v1.0.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:12:45 EDT 2022
% Result : Unsatisfiable 1.94s 2.09s
% Output : Refutation 1.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of clauses : 8 ( 6 unt; 0 nHn; 8 RR)
% Number of literals : 11 ( 0 equ; 4 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 5 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ member(A,B)
| ~ subset(B,C)
| member(A,C) ),
file('SET001-1.p',unknown),
[] ).
cnf(3,axiom,
( ~ e_qual_sets(A,B)
| subset(A,B) ),
file('SET001-1.p',unknown),
[] ).
cnf(6,axiom,
~ member(element_of_b,bb),
file('SET001-1.p',unknown),
[] ).
cnf(9,axiom,
e_qual_sets(b,bb),
file('SET001-1.p',unknown),
[] ).
cnf(10,axiom,
member(element_of_b,b),
file('SET001-1.p',unknown),
[] ).
cnf(14,plain,
subset(b,bb),
inference(hyper,[status(thm)],[9,3]),
[iquote('hyper,9,3')] ).
cnf(18,plain,
member(element_of_b,bb),
inference(hyper,[status(thm)],[14,1,10]),
[iquote('hyper,14,1,10')] ).
cnf(19,plain,
$false,
inference(binary,[status(thm)],[18,6]),
[iquote('binary,18.1,6.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SET001-1 : TPTP v8.1.0. Released v1.0.0.
% 0.04/0.13 % Command : otter-tptp-script %s
% 0.12/0.34 % Computer : n013.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Wed Jul 27 10:46:30 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.94/2.09 ----- Otter 3.3f, August 2004 -----
% 1.94/2.09 The process was started by sandbox on n013.cluster.edu,
% 1.94/2.09 Wed Jul 27 10:46:30 2022
% 1.94/2.09 The command was "./otter". The process ID is 8579.
% 1.94/2.09
% 1.94/2.09 set(prolog_style_variables).
% 1.94/2.09 set(auto).
% 1.94/2.09 dependent: set(auto1).
% 1.94/2.09 dependent: set(process_input).
% 1.94/2.09 dependent: clear(print_kept).
% 1.94/2.09 dependent: clear(print_new_demod).
% 1.94/2.09 dependent: clear(print_back_demod).
% 1.94/2.09 dependent: clear(print_back_sub).
% 1.94/2.09 dependent: set(control_memory).
% 1.94/2.09 dependent: assign(max_mem, 12000).
% 1.94/2.09 dependent: assign(pick_given_ratio, 4).
% 1.94/2.09 dependent: assign(stats_level, 1).
% 1.94/2.09 dependent: assign(max_seconds, 10800).
% 1.94/2.09 clear(print_given).
% 1.94/2.09
% 1.94/2.09 list(usable).
% 1.94/2.09 0 [] -member(Element,Subset)| -subset(Subset,Superset)|member(Element,Superset).
% 1.94/2.09 0 [] subset(Subset,Superset)|member(member_of_1_not_of_2(Subset,Superset),Subset).
% 1.94/2.09 0 [] -member(member_of_1_not_of_2(Subset,Superset),Superset)|subset(Subset,Superset).
% 1.94/2.09 0 [] -e_qual_sets(Subset,Superset)|subset(Subset,Superset).
% 1.94/2.09 0 [] -e_qual_sets(Superset,Subset)|subset(Subset,Superset).
% 1.94/2.09 0 [] -subset(Set1,Set2)| -subset(Set2,Set1)|e_qual_sets(Set2,Set1).
% 1.94/2.09 0 [] e_qual_sets(b,bb).
% 1.94/2.09 0 [] member(element_of_b,b).
% 1.94/2.09 0 [] -member(element_of_b,bb).
% 1.94/2.09 end_of_list.
% 1.94/2.09
% 1.94/2.09 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=3.
% 1.94/2.09
% 1.94/2.09 This is a non-Horn set without equality. The strategy will
% 1.94/2.09 be ordered hyper_res, unit deletion, and factoring, with
% 1.94/2.09 satellites in sos and with nuclei in usable.
% 1.94/2.09
% 1.94/2.09 dependent: set(hyper_res).
% 1.94/2.09 dependent: set(factor).
% 1.94/2.09 dependent: set(unit_deletion).
% 1.94/2.09
% 1.94/2.09 ------------> process usable:
% 1.94/2.09 ** KEPT (pick-wt=9): 1 [] -member(A,B)| -subset(B,C)|member(A,C).
% 1.94/2.09 ** KEPT (pick-wt=8): 2 [] -member(member_of_1_not_of_2(A,B),B)|subset(A,B).
% 1.94/2.09 ** KEPT (pick-wt=6): 3 [] -e_qual_sets(A,B)|subset(A,B).
% 1.94/2.09 ** KEPT (pick-wt=6): 4 [] -e_qual_sets(A,B)|subset(B,A).
% 1.94/2.09 ** KEPT (pick-wt=9): 5 [] -subset(A,B)| -subset(B,A)|e_qual_sets(B,A).
% 1.94/2.09 ** KEPT (pick-wt=3): 6 [] -member(element_of_b,bb).
% 1.94/2.09
% 1.94/2.09 ------------> process sos:
% 1.94/2.09 ** KEPT (pick-wt=8): 8 [] subset(A,B)|member(member_of_1_not_of_2(A,B),A).
% 1.94/2.09 ** KEPT (pick-wt=3): 9 [] e_qual_sets(b,bb).
% 1.94/2.09 ** KEPT (pick-wt=3): 10 [] member(element_of_b,b).
% 1.94/2.09
% 1.94/2.09 ======= end of input processing =======
% 1.94/2.09
% 1.94/2.09 =========== start of search ===========
% 1.94/2.09
% 1.94/2.09 -------- PROOF --------
% 1.94/2.09
% 1.94/2.09 ----> UNIT CONFLICT at 0.00 sec ----> 19 [binary,18.1,6.1] $F.
% 1.94/2.09
% 1.94/2.09 Length of proof is 2. Level of proof is 2.
% 1.94/2.09
% 1.94/2.09 ---------------- PROOF ----------------
% 1.94/2.09 % SZS status Unsatisfiable
% 1.94/2.09 % SZS output start Refutation
% See solution above
% 1.94/2.09 ------------ end of proof -------------
% 1.94/2.09
% 1.94/2.09
% 1.94/2.09 Search stopped by max_proofs option.
% 1.94/2.09
% 1.94/2.09
% 1.94/2.09 Search stopped by max_proofs option.
% 1.94/2.09
% 1.94/2.09 ============ end of search ============
% 1.94/2.09
% 1.94/2.09 -------------- statistics -------------
% 1.94/2.09 clauses given 5
% 1.94/2.09 clauses generated 15
% 1.94/2.09 clauses kept 18
% 1.94/2.09 clauses forward subsumed 6
% 1.94/2.09 clauses back subsumed 0
% 1.94/2.09 Kbytes malloced 976
% 1.94/2.09
% 1.94/2.09 ----------- times (seconds) -----------
% 1.94/2.09 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.94/2.09 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.94/2.09 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.94/2.09
% 1.94/2.09 That finishes the proof of the theorem.
% 1.94/2.09
% 1.94/2.09 Process 8579 finished Wed Jul 27 10:46:31 2022
% 1.94/2.09 Otter interrupted
% 1.94/2.09 PROOF FOUND
%------------------------------------------------------------------------------