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