%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU196+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n025.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:07 EDT 2022
% Result : Theorem 2.06s 2.26s
% Output : Refutation 2.06s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of clauses : 9 ( 6 unt; 0 nHn; 4 RR)
% Number of literals : 14 ( 0 equ; 6 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 9 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(3,axiom,
( ~ relation(A)
| relation(relation_dom_restriction(A,B)) ),
file('SEU196+1.p',unknown),
[] ).
cnf(16,axiom,
( ~ relation(A)
| ~ relation(B)
| ~ subset(A,B)
| subset(relation_rng(A),relation_rng(B)) ),
file('SEU196+1.p',unknown),
[] ).
cnf(24,axiom,
( ~ relation(A)
| subset(relation_dom_restriction(A,B),A) ),
file('SEU196+1.p',unknown),
[] ).
cnf(26,axiom,
~ subset(relation_rng(relation_dom_restriction(dollar_c5,dollar_c6)),relation_rng(dollar_c5)),
file('SEU196+1.p',unknown),
[] ).
cnf(43,axiom,
relation(dollar_c5),
file('SEU196+1.p',unknown),
[] ).
cnf(66,plain,
subset(relation_dom_restriction(dollar_c5,A),dollar_c5),
inference(hyper,[status(thm)],[43,24]),
[iquote('hyper,43,24')] ).
cnf(67,plain,
relation(relation_dom_restriction(dollar_c5,A)),
inference(hyper,[status(thm)],[43,3]),
[iquote('hyper,43,3')] ).
cnf(146,plain,
subset(relation_rng(relation_dom_restriction(dollar_c5,A)),relation_rng(dollar_c5)),
inference(hyper,[status(thm)],[66,16,67,43]),
[iquote('hyper,66,16,67,43')] ).
cnf(147,plain,
$false,
inference(binary,[status(thm)],[146,26]),
[iquote('binary,146.1,26.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SEU196+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n025.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 07:58:45 EDT 2022
% 0.12/0.33 % CPUTime :
% 2.06/2.26 ----- Otter 3.3f, August 2004 -----
% 2.06/2.26 The process was started by sandbox on n025.cluster.edu,
% 2.06/2.26 Wed Jul 27 07:58:45 2022
% 2.06/2.26 The command was "./otter". The process ID is 8999.
% 2.06/2.26
% 2.06/2.26 set(prolog_style_variables).
% 2.06/2.26 set(auto).
% 2.06/2.26 dependent: set(auto1).
% 2.06/2.26 dependent: set(process_input).
% 2.06/2.26 dependent: clear(print_kept).
% 2.06/2.26 dependent: clear(print_new_demod).
% 2.06/2.26 dependent: clear(print_back_demod).
% 2.06/2.26 dependent: clear(print_back_sub).
% 2.06/2.26 dependent: set(control_memory).
% 2.06/2.26 dependent: assign(max_mem, 12000).
% 2.06/2.26 dependent: assign(pick_given_ratio, 4).
% 2.06/2.26 dependent: assign(stats_level, 1).
% 2.06/2.26 dependent: assign(max_seconds, 10800).
% 2.06/2.26 clear(print_given).
% 2.06/2.26
% 2.06/2.26 formula_list(usable).
% 2.06/2.26 all A (A=A).
% 2.06/2.26 all A B (in(A,B)-> -in(B,A)).
% 2.06/2.26 all A (empty(A)->relation(A)).
% 2.06/2.26 $T.
% 2.06/2.26 $T.
% 2.06/2.26 $T.
% 2.06/2.26 $T.
% 2.06/2.26 all A B (relation(A)->relation(relation_dom_restriction(A,B))).
% 2.06/2.26 $T.
% 2.06/2.26 all A exists B element(B,A).
% 2.06/2.26 all A (-empty(powerset(A))).
% 2.06/2.26 empty(empty_set).
% 2.06/2.26 empty(empty_set).
% 2.06/2.26 relation(empty_set).
% 2.06/2.26 all A (-empty(A)&relation(A)-> -empty(relation_dom(A))).
% 2.06/2.26 all A (-empty(A)&relation(A)-> -empty(relation_rng(A))).
% 2.06/2.26 all A (empty(A)->empty(relation_dom(A))&relation(relation_dom(A))).
% 2.06/2.26 all A (empty(A)->empty(relation_rng(A))&relation(relation_rng(A))).
% 2.06/2.26 exists A (empty(A)&relation(A)).
% 2.06/2.26 all A (-empty(A)-> (exists B (element(B,powerset(A))& -empty(B)))).
% 2.06/2.26 exists A empty(A).
% 2.06/2.26 exists A (-empty(A)&relation(A)).
% 2.06/2.26 all A exists B (element(B,powerset(A))&empty(B)).
% 2.06/2.26 exists A (-empty(A)).
% 2.06/2.26 all A B subset(A,A).
% 2.06/2.26 all A B (in(A,B)->element(A,B)).
% 2.06/2.26 all A (relation(A)-> (all B (relation(B)-> (subset(A,B)->subset(relation_dom(A),relation_dom(B))&subset(relation_rng(A),relation_rng(B)))))).
% 2.06/2.26 all A B (element(A,B)->empty(B)|in(A,B)).
% 2.06/2.26 all A B (element(A,powerset(B))<->subset(A,B)).
% 2.06/2.26 all A B C (in(A,B)&element(B,powerset(C))->element(A,C)).
% 2.06/2.26 all A B C (-(in(A,B)&element(B,powerset(C))&empty(C))).
% 2.06/2.26 all A (empty(A)->A=empty_set).
% 2.06/2.26 all A B (-(in(A,B)&empty(B))).
% 2.06/2.26 all A B (relation(B)->subset(relation_dom_restriction(B,A),B)).
% 2.06/2.26 all A B (-(empty(A)&A!=B&empty(B))).
% 2.06/2.26 -(all A B (relation(B)->subset(relation_rng(relation_dom_restriction(B,A)),relation_rng(B)))).
% 2.06/2.26 end_of_list.
% 2.06/2.26
% 2.06/2.26 -------> usable clausifies to:
% 2.06/2.26
% 2.06/2.26 list(usable).
% 2.06/2.26 0 [] A=A.
% 2.06/2.26 0 [] -in(A,B)| -in(B,A).
% 2.06/2.26 0 [] -empty(A)|relation(A).
% 2.06/2.26 0 [] $T.
% 2.06/2.26 0 [] $T.
% 2.06/2.26 0 [] $T.
% 2.06/2.26 0 [] $T.
% 2.06/2.26 0 [] -relation(A)|relation(relation_dom_restriction(A,B)).
% 2.06/2.26 0 [] $T.
% 2.06/2.26 0 [] element($f1(A),A).
% 2.06/2.26 0 [] -empty(powerset(A)).
% 2.06/2.26 0 [] empty(empty_set).
% 2.06/2.26 0 [] empty(empty_set).
% 2.06/2.26 0 [] relation(empty_set).
% 2.06/2.26 0 [] empty(A)| -relation(A)| -empty(relation_dom(A)).
% 2.06/2.26 0 [] empty(A)| -relation(A)| -empty(relation_rng(A)).
% 2.06/2.26 0 [] -empty(A)|empty(relation_dom(A)).
% 2.06/2.26 0 [] -empty(A)|relation(relation_dom(A)).
% 2.06/2.26 0 [] -empty(A)|empty(relation_rng(A)).
% 2.06/2.26 0 [] -empty(A)|relation(relation_rng(A)).
% 2.06/2.26 0 [] empty($c1).
% 2.06/2.26 0 [] relation($c1).
% 2.06/2.26 0 [] empty(A)|element($f2(A),powerset(A)).
% 2.06/2.26 0 [] empty(A)| -empty($f2(A)).
% 2.06/2.26 0 [] empty($c2).
% 2.06/2.26 0 [] -empty($c3).
% 2.06/2.26 0 [] relation($c3).
% 2.06/2.26 0 [] element($f3(A),powerset(A)).
% 2.06/2.26 0 [] empty($f3(A)).
% 2.06/2.26 0 [] -empty($c4).
% 2.06/2.26 0 [] subset(A,A).
% 2.06/2.26 0 [] -in(A,B)|element(A,B).
% 2.06/2.26 0 [] -relation(A)| -relation(B)| -subset(A,B)|subset(relation_dom(A),relation_dom(B)).
% 2.06/2.26 0 [] -relation(A)| -relation(B)| -subset(A,B)|subset(relation_rng(A),relation_rng(B)).
% 2.06/2.26 0 [] -element(A,B)|empty(B)|in(A,B).
% 2.06/2.26 0 [] -element(A,powerset(B))|subset(A,B).
% 2.06/2.26 0 [] element(A,powerset(B))| -subset(A,B).
% 2.06/2.26 0 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 2.06/2.26 0 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 2.06/2.26 0 [] -empty(A)|A=empty_set.
% 2.06/2.26 0 [] -in(A,B)| -empty(B).
% 2.06/2.26 0 [] -relation(B)|subset(relation_dom_restriction(B,A),B).
% 2.06/2.26 0 [] -empty(A)|A=B| -empty(B).
% 2.06/2.26 0 [] relation($c5).
% 2.06/2.26 0 [] -subset(relation_rng(relation_dom_restriction($c5,$c6)),relation_rng($c5)).
% 2.06/2.26 end_of_list.
% 2.06/2.26
% 2.06/2.26 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 2.06/2.26
% 2.06/2.26 This ia a non-Horn set with equality. The strategy will be
% 2.06/2.26 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 2.06/2.26 deletion, with positive clauses in sos and nonpositive
% 2.06/2.26 clauses in usable.
% 2.06/2.26
% 2.06/2.26 dependent: set(knuth_bendix).
% 2.06/2.26 dependent: set(anl_eq).
% 2.06/2.26 dependent: set(para_from).
% 2.06/2.26 dependent: set(para_into).
% 2.06/2.26 dependent: clear(para_from_right).
% 2.06/2.26 dependent: clear(para_into_right).
% 2.06/2.26 dependent: set(para_from_vars).
% 2.06/2.26 dependent: set(eq_units_both_ways).
% 2.06/2.26 dependent: set(dynamic_demod_all).
% 2.06/2.26 dependent: set(dynamic_demod).
% 2.06/2.26 dependent: set(order_eq).
% 2.06/2.26 dependent: set(back_demod).
% 2.06/2.26 dependent: set(lrpo).
% 2.06/2.26 dependent: set(hyper_res).
% 2.06/2.26 dependent: set(unit_deletion).
% 2.06/2.26 dependent: set(factor).
% 2.06/2.26
% 2.06/2.26 ------------> process usable:
% 2.06/2.26 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 2.06/2.26 ** KEPT (pick-wt=4): 2 [] -empty(A)|relation(A).
% 2.06/2.26 ** KEPT (pick-wt=6): 3 [] -relation(A)|relation(relation_dom_restriction(A,B)).
% 2.06/2.26 ** KEPT (pick-wt=3): 4 [] -empty(powerset(A)).
% 2.06/2.26 ** KEPT (pick-wt=7): 5 [] empty(A)| -relation(A)| -empty(relation_dom(A)).
% 2.06/2.26 ** KEPT (pick-wt=7): 6 [] empty(A)| -relation(A)| -empty(relation_rng(A)).
% 2.06/2.26 ** KEPT (pick-wt=5): 7 [] -empty(A)|empty(relation_dom(A)).
% 2.06/2.26 ** KEPT (pick-wt=5): 8 [] -empty(A)|relation(relation_dom(A)).
% 2.06/2.26 ** KEPT (pick-wt=5): 9 [] -empty(A)|empty(relation_rng(A)).
% 2.06/2.26 ** KEPT (pick-wt=5): 10 [] -empty(A)|relation(relation_rng(A)).
% 2.06/2.26 ** KEPT (pick-wt=5): 11 [] empty(A)| -empty($f2(A)).
% 2.06/2.26 ** KEPT (pick-wt=2): 12 [] -empty($c3).
% 2.06/2.26 ** KEPT (pick-wt=2): 13 [] -empty($c4).
% 2.06/2.26 ** KEPT (pick-wt=6): 14 [] -in(A,B)|element(A,B).
% 2.06/2.26 ** KEPT (pick-wt=12): 15 [] -relation(A)| -relation(B)| -subset(A,B)|subset(relation_dom(A),relation_dom(B)).
% 2.06/2.26 ** KEPT (pick-wt=12): 16 [] -relation(A)| -relation(B)| -subset(A,B)|subset(relation_rng(A),relation_rng(B)).
% 2.06/2.26 ** KEPT (pick-wt=8): 17 [] -element(A,B)|empty(B)|in(A,B).
% 2.06/2.26 ** KEPT (pick-wt=7): 18 [] -element(A,powerset(B))|subset(A,B).
% 2.06/2.26 ** KEPT (pick-wt=7): 19 [] element(A,powerset(B))| -subset(A,B).
% 2.06/2.26 ** KEPT (pick-wt=10): 20 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 2.06/2.26 ** KEPT (pick-wt=9): 21 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 2.06/2.26 ** KEPT (pick-wt=5): 22 [] -empty(A)|A=empty_set.
% 2.06/2.26 ** KEPT (pick-wt=5): 23 [] -in(A,B)| -empty(B).
% 2.06/2.26 ** KEPT (pick-wt=7): 24 [] -relation(A)|subset(relation_dom_restriction(A,B),A).
% 2.06/2.26 ** KEPT (pick-wt=7): 25 [] -empty(A)|A=B| -empty(B).
% 2.06/2.26 ** KEPT (pick-wt=7): 26 [] -subset(relation_rng(relation_dom_restriction($c5,$c6)),relation_rng($c5)).
% 2.06/2.26
% 2.06/2.26 ------------> process sos:
% 2.06/2.26 ** KEPT (pick-wt=3): 31 [] A=A.
% 2.06/2.26 ** KEPT (pick-wt=4): 32 [] element($f1(A),A).
% 2.06/2.26 ** KEPT (pick-wt=2): 33 [] empty(empty_set).
% 2.06/2.26 Following clause subsumed by 33 during input processing: 0 [] empty(empty_set).
% 2.06/2.26 ** KEPT (pick-wt=2): 34 [] relation(empty_set).
% 2.06/2.26 ** KEPT (pick-wt=2): 35 [] empty($c1).
% 2.06/2.26 ** KEPT (pick-wt=2): 36 [] relation($c1).
% 2.06/2.26 ** KEPT (pick-wt=7): 37 [] empty(A)|element($f2(A),powerset(A)).
% 2.06/2.26 ** KEPT (pick-wt=2): 38 [] empty($c2).
% 2.06/2.26 ** KEPT (pick-wt=2): 39 [] relation($c3).
% 2.06/2.26 ** KEPT (pick-wt=5): 40 [] element($f3(A),powerset(A)).
% 2.06/2.26 ** KEPT (pick-wt=3): 41 [] empty($f3(A)).
% 2.06/2.26 ** KEPT (pick-wt=3): 42 [] subset(A,A).
% 2.06/2.26 ** KEPT (pick-wt=2): 43 [] relation($c5).
% 2.06/2.26 Following clause subsumed by 31 during input processing: 0 [copy,31,flip.1] A=A.
% 2.06/2.26 31 back subsumes 30.
% 2.06/2.26 42 back subsumes 29.
% 2.06/2.26 42 back subsumes 28.
% 2.06/2.26
% 2.06/2.26 ======= end of input processing =======
% 2.06/2.26
% 2.06/2.26 =========== start of search ===========
% 2.06/2.26
% 2.06/2.26 -------- PROOF --------
% 2.06/2.26
% 2.06/2.26 ----> UNIT CONFLICT at 0.01 sec ----> 147 [binary,146.1,26.1] $F.
% 2.06/2.26
% 2.06/2.26 Length of proof is 3. Level of proof is 2.
% 2.06/2.26
% 2.06/2.26 ---------------- PROOF ----------------
% 2.06/2.26 % SZS status Theorem
% 2.06/2.26 % SZS output start Refutation
% See solution above
% 2.06/2.26 ------------ end of proof -------------
% 2.06/2.26
% 2.06/2.26
% 2.06/2.26 Search stopped by max_proofs option.
% 2.06/2.26
% 2.06/2.26
% 2.06/2.26 Search stopped by max_proofs option.
% 2.06/2.26
% 2.06/2.26 ============ end of search ============
% 2.06/2.26
% 2.06/2.26 -------------- statistics -------------
% 2.06/2.26 clauses given 35
% 2.06/2.26 clauses generated 314
% 2.06/2.26 clauses kept 141
% 2.06/2.26 clauses forward subsumed 236
% 2.06/2.26 clauses back subsumed 4
% 2.06/2.26 Kbytes malloced 1953
% 2.06/2.26
% 2.06/2.26 ----------- times (seconds) -----------
% 2.06/2.26 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 2.06/2.26 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.06/2.26 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.06/2.26
% 2.06/2.26 That finishes the proof of the theorem.
% 2.06/2.26
% 2.06/2.26 Process 8999 finished Wed Jul 27 07:58:47 2022
% 2.06/2.26 Otter interrupted
% 2.06/2.26 PROOF FOUND
%------------------------------------------------------------------------------