TSTP Solution File: SEU198+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU198+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n028.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:08 EDT 2022
% Result : Theorem 2.04s 2.18s
% Output : Refutation 2.04s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 9 ( 6 unt; 1 nHn; 8 RR)
% Number of literals : 13 ( 0 equ; 4 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 7 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(4,axiom,
( subset(A,B)
| ~ in(dollar_f1(A,B),B) ),
file('SEU198+1.p',unknown),
[] ).
cnf(13,axiom,
( ~ relation(A)
| ~ in(B,relation_rng(relation_rng_restriction(C,A)))
| in(B,C) ),
file('SEU198+1.p',unknown),
[] ).
cnf(16,axiom,
~ subset(relation_rng(relation_rng_restriction(dollar_c6,dollar_c5)),dollar_c6),
file('SEU198+1.p',unknown),
[] ).
cnf(30,axiom,
( subset(A,B)
| in(dollar_f1(A,B),A) ),
file('SEU198+1.p',unknown),
[] ).
cnf(42,axiom,
relation(dollar_c5),
file('SEU198+1.p',unknown),
[] ).
cnf(53,plain,
in(dollar_f1(relation_rng(relation_rng_restriction(dollar_c6,dollar_c5)),dollar_c6),relation_rng(relation_rng_restriction(dollar_c6,dollar_c5))),
inference(hyper,[status(thm)],[30,16]),
[iquote('hyper,30,16')] ).
cnf(157,plain,
in(dollar_f1(relation_rng(relation_rng_restriction(dollar_c6,dollar_c5)),dollar_c6),dollar_c6),
inference(hyper,[status(thm)],[53,13,42]),
[iquote('hyper,53,13,42')] ).
cnf(1189,plain,
subset(relation_rng(relation_rng_restriction(dollar_c6,dollar_c5)),dollar_c6),
inference(hyper,[status(thm)],[157,4]),
[iquote('hyper,157,4')] ).
cnf(1190,plain,
$false,
inference(binary,[status(thm)],[1189,16]),
[iquote('binary,1189.1,16.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU198+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n028.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Wed Jul 27 07:59:49 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.88/2.04 ----- Otter 3.3f, August 2004 -----
% 1.88/2.04 The process was started by sandbox on n028.cluster.edu,
% 1.88/2.04 Wed Jul 27 07:59:49 2022
% 1.88/2.04 The command was "./otter". The process ID is 23620.
% 1.88/2.04
% 1.88/2.04 set(prolog_style_variables).
% 1.88/2.04 set(auto).
% 1.88/2.04 dependent: set(auto1).
% 1.88/2.04 dependent: set(process_input).
% 1.88/2.04 dependent: clear(print_kept).
% 1.88/2.04 dependent: clear(print_new_demod).
% 1.88/2.04 dependent: clear(print_back_demod).
% 1.88/2.04 dependent: clear(print_back_sub).
% 1.88/2.04 dependent: set(control_memory).
% 1.88/2.04 dependent: assign(max_mem, 12000).
% 1.88/2.04 dependent: assign(pick_given_ratio, 4).
% 1.88/2.04 dependent: assign(stats_level, 1).
% 1.88/2.04 dependent: assign(max_seconds, 10800).
% 1.88/2.04 clear(print_given).
% 1.88/2.04
% 1.88/2.04 formula_list(usable).
% 1.88/2.04 all A (A=A).
% 1.88/2.04 all A B (in(A,B)-> -in(B,A)).
% 1.88/2.04 all A (empty(A)->relation(A)).
% 1.88/2.04 all A B (subset(A,B)<-> (all C (in(C,A)->in(C,B)))).
% 1.88/2.04 $T.
% 1.88/2.04 $T.
% 1.88/2.04 $T.
% 1.88/2.04 all A B (relation(B)->relation(relation_rng_restriction(A,B))).
% 1.88/2.04 $T.
% 1.88/2.04 all A exists B element(B,A).
% 1.88/2.04 all A (-empty(powerset(A))).
% 1.88/2.04 empty(empty_set).
% 1.88/2.04 empty(empty_set).
% 1.88/2.04 relation(empty_set).
% 1.88/2.04 all A (-empty(A)&relation(A)-> -empty(relation_rng(A))).
% 1.88/2.04 all A (empty(A)->empty(relation_rng(A))&relation(relation_rng(A))).
% 1.88/2.04 exists A (empty(A)&relation(A)).
% 1.88/2.04 all A (-empty(A)-> (exists B (element(B,powerset(A))& -empty(B)))).
% 1.88/2.04 exists A empty(A).
% 1.88/2.04 exists A (-empty(A)&relation(A)).
% 1.88/2.04 all A exists B (element(B,powerset(A))&empty(B)).
% 1.88/2.04 exists A (-empty(A)).
% 1.88/2.04 all A B subset(A,A).
% 1.88/2.04 all A B C (relation(C)-> (in(A,relation_rng(relation_rng_restriction(B,C)))<->in(A,B)&in(A,relation_rng(C)))).
% 1.88/2.04 -(all A B (relation(B)->subset(relation_rng(relation_rng_restriction(A,B)),A))).
% 1.88/2.04 all A B (in(A,B)->element(A,B)).
% 1.88/2.04 all A B (element(A,B)->empty(B)|in(A,B)).
% 1.88/2.04 all A B (element(A,powerset(B))<->subset(A,B)).
% 1.88/2.04 all A B C (in(A,B)&element(B,powerset(C))->element(A,C)).
% 1.88/2.04 all A B C (-(in(A,B)&element(B,powerset(C))&empty(C))).
% 1.88/2.04 all A (empty(A)->A=empty_set).
% 1.88/2.04 all A B (-(in(A,B)&empty(B))).
% 1.88/2.04 all A B (-(empty(A)&A!=B&empty(B))).
% 1.88/2.04 end_of_list.
% 1.88/2.04
% 1.88/2.04 -------> usable clausifies to:
% 1.88/2.04
% 1.88/2.04 list(usable).
% 1.88/2.04 0 [] A=A.
% 1.88/2.04 0 [] -in(A,B)| -in(B,A).
% 1.88/2.04 0 [] -empty(A)|relation(A).
% 1.88/2.04 0 [] -subset(A,B)| -in(C,A)|in(C,B).
% 1.88/2.04 0 [] subset(A,B)|in($f1(A,B),A).
% 1.88/2.04 0 [] subset(A,B)| -in($f1(A,B),B).
% 1.88/2.04 0 [] $T.
% 1.88/2.04 0 [] $T.
% 1.88/2.04 0 [] $T.
% 1.88/2.04 0 [] -relation(B)|relation(relation_rng_restriction(A,B)).
% 1.88/2.04 0 [] $T.
% 1.88/2.04 0 [] element($f2(A),A).
% 1.88/2.04 0 [] -empty(powerset(A)).
% 1.88/2.04 0 [] empty(empty_set).
% 1.88/2.04 0 [] empty(empty_set).
% 1.88/2.04 0 [] relation(empty_set).
% 1.88/2.04 0 [] empty(A)| -relation(A)| -empty(relation_rng(A)).
% 1.88/2.04 0 [] -empty(A)|empty(relation_rng(A)).
% 1.88/2.04 0 [] -empty(A)|relation(relation_rng(A)).
% 1.88/2.04 0 [] empty($c1).
% 1.88/2.04 0 [] relation($c1).
% 1.88/2.04 0 [] empty(A)|element($f3(A),powerset(A)).
% 1.88/2.04 0 [] empty(A)| -empty($f3(A)).
% 1.88/2.04 0 [] empty($c2).
% 1.88/2.04 0 [] -empty($c3).
% 1.88/2.04 0 [] relation($c3).
% 1.88/2.04 0 [] element($f4(A),powerset(A)).
% 1.88/2.04 0 [] empty($f4(A)).
% 1.88/2.04 0 [] -empty($c4).
% 1.88/2.04 0 [] subset(A,A).
% 1.88/2.04 0 [] -relation(C)| -in(A,relation_rng(relation_rng_restriction(B,C)))|in(A,B).
% 1.88/2.04 0 [] -relation(C)| -in(A,relation_rng(relation_rng_restriction(B,C)))|in(A,relation_rng(C)).
% 1.88/2.04 0 [] -relation(C)|in(A,relation_rng(relation_rng_restriction(B,C)))| -in(A,B)| -in(A,relation_rng(C)).
% 1.88/2.04 0 [] relation($c5).
% 1.88/2.04 0 [] -subset(relation_rng(relation_rng_restriction($c6,$c5)),$c6).
% 1.88/2.04 0 [] -in(A,B)|element(A,B).
% 1.88/2.04 0 [] -element(A,B)|empty(B)|in(A,B).
% 1.88/2.04 0 [] -element(A,powerset(B))|subset(A,B).
% 1.88/2.04 0 [] element(A,powerset(B))| -subset(A,B).
% 1.88/2.04 0 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 1.88/2.04 0 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 1.88/2.04 0 [] -empty(A)|A=empty_set.
% 1.88/2.04 0 [] -in(A,B)| -empty(B).
% 1.88/2.04 0 [] -empty(A)|A=B| -empty(B).
% 1.88/2.04 end_of_list.
% 1.88/2.04
% 1.88/2.04 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 1.88/2.04
% 1.88/2.04 This ia a non-Horn set with equality. The strategy will be
% 1.88/2.04 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.88/2.04 deletion, with positive clauses in sos and nonpositive
% 1.88/2.04 clauses in usable.
% 1.88/2.04
% 1.88/2.04 dependent: set(knuth_bendix).
% 1.88/2.04 dependent: set(anl_eq).
% 1.88/2.04 dependent: set(para_from).
% 1.88/2.04 dependent: set(para_into).
% 1.88/2.04 dependent: clear(para_from_right).
% 1.88/2.04 dependent: clear(para_into_right).
% 1.88/2.04 dependent: set(para_from_vars).
% 1.88/2.04 dependent: set(eq_units_both_ways).
% 1.88/2.04 dependent: set(dynamic_demod_all).
% 1.88/2.04 dependent: set(dynamic_demod).
% 1.88/2.04 dependent: set(order_eq).
% 1.88/2.04 dependent: set(back_demod).
% 1.88/2.04 dependent: set(lrpo).
% 2.04/2.18 dependent: set(hyper_res).
% 2.04/2.18 dependent: set(unit_deletion).
% 2.04/2.18 dependent: set(factor).
% 2.04/2.18
% 2.04/2.18 ------------> process usable:
% 2.04/2.18 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 2.04/2.18 ** KEPT (pick-wt=4): 2 [] -empty(A)|relation(A).
% 2.04/2.18 ** KEPT (pick-wt=9): 3 [] -subset(A,B)| -in(C,A)|in(C,B).
% 2.04/2.18 ** KEPT (pick-wt=8): 4 [] subset(A,B)| -in($f1(A,B),B).
% 2.04/2.18 ** KEPT (pick-wt=6): 5 [] -relation(A)|relation(relation_rng_restriction(B,A)).
% 2.04/2.18 ** KEPT (pick-wt=3): 6 [] -empty(powerset(A)).
% 2.04/2.18 ** KEPT (pick-wt=7): 7 [] empty(A)| -relation(A)| -empty(relation_rng(A)).
% 2.04/2.18 ** KEPT (pick-wt=5): 8 [] -empty(A)|empty(relation_rng(A)).
% 2.04/2.18 ** KEPT (pick-wt=5): 9 [] -empty(A)|relation(relation_rng(A)).
% 2.04/2.18 ** KEPT (pick-wt=5): 10 [] empty(A)| -empty($f3(A)).
% 2.04/2.18 ** KEPT (pick-wt=2): 11 [] -empty($c3).
% 2.04/2.18 ** KEPT (pick-wt=2): 12 [] -empty($c4).
% 2.04/2.18 ** KEPT (pick-wt=11): 13 [] -relation(A)| -in(B,relation_rng(relation_rng_restriction(C,A)))|in(B,C).
% 2.04/2.18 ** KEPT (pick-wt=12): 14 [] -relation(A)| -in(B,relation_rng(relation_rng_restriction(C,A)))|in(B,relation_rng(A)).
% 2.04/2.18 ** KEPT (pick-wt=15): 15 [] -relation(A)|in(B,relation_rng(relation_rng_restriction(C,A)))| -in(B,C)| -in(B,relation_rng(A)).
% 2.04/2.18 ** KEPT (pick-wt=6): 16 [] -subset(relation_rng(relation_rng_restriction($c6,$c5)),$c6).
% 2.04/2.18 ** KEPT (pick-wt=6): 17 [] -in(A,B)|element(A,B).
% 2.04/2.18 ** KEPT (pick-wt=8): 18 [] -element(A,B)|empty(B)|in(A,B).
% 2.04/2.18 ** KEPT (pick-wt=7): 19 [] -element(A,powerset(B))|subset(A,B).
% 2.04/2.18 ** KEPT (pick-wt=7): 20 [] element(A,powerset(B))| -subset(A,B).
% 2.04/2.18 ** KEPT (pick-wt=10): 21 [] -in(A,B)| -element(B,powerset(C))|element(A,C).
% 2.04/2.18 ** KEPT (pick-wt=9): 22 [] -in(A,B)| -element(B,powerset(C))| -empty(C).
% 2.04/2.18 ** KEPT (pick-wt=5): 23 [] -empty(A)|A=empty_set.
% 2.04/2.18 ** KEPT (pick-wt=5): 24 [] -in(A,B)| -empty(B).
% 2.04/2.18 ** KEPT (pick-wt=7): 25 [] -empty(A)|A=B| -empty(B).
% 2.04/2.18
% 2.04/2.18 ------------> process sos:
% 2.04/2.18 ** KEPT (pick-wt=3): 29 [] A=A.
% 2.04/2.18 ** KEPT (pick-wt=8): 30 [] subset(A,B)|in($f1(A,B),A).
% 2.04/2.18 ** KEPT (pick-wt=4): 31 [] element($f2(A),A).
% 2.04/2.18 ** KEPT (pick-wt=2): 32 [] empty(empty_set).
% 2.04/2.18 Following clause subsumed by 32 during input processing: 0 [] empty(empty_set).
% 2.04/2.18 ** KEPT (pick-wt=2): 33 [] relation(empty_set).
% 2.04/2.18 ** KEPT (pick-wt=2): 34 [] empty($c1).
% 2.04/2.18 ** KEPT (pick-wt=2): 35 [] relation($c1).
% 2.04/2.18 ** KEPT (pick-wt=7): 36 [] empty(A)|element($f3(A),powerset(A)).
% 2.04/2.18 ** KEPT (pick-wt=2): 37 [] empty($c2).
% 2.04/2.18 ** KEPT (pick-wt=2): 38 [] relation($c3).
% 2.04/2.18 ** KEPT (pick-wt=5): 39 [] element($f4(A),powerset(A)).
% 2.04/2.18 ** KEPT (pick-wt=3): 40 [] empty($f4(A)).
% 2.04/2.18 ** KEPT (pick-wt=3): 41 [] subset(A,A).
% 2.04/2.18 ** KEPT (pick-wt=2): 42 [] relation($c5).
% 2.04/2.18 Following clause subsumed by 29 during input processing: 0 [copy,29,flip.1] A=A.
% 2.04/2.18 29 back subsumes 28.
% 2.04/2.18
% 2.04/2.18 ======= end of input processing =======
% 2.04/2.18
% 2.04/2.18 =========== start of search ===========
% 2.04/2.18
% 2.04/2.18
% 2.04/2.18 Resetting weight limit to 8.
% 2.04/2.18
% 2.04/2.18
% 2.04/2.18 Resetting weight limit to 8.
% 2.04/2.18
% 2.04/2.18 sos_size=1007
% 2.04/2.18
% 2.04/2.18 -------- PROOF --------
% 2.04/2.18
% 2.04/2.18 ----> UNIT CONFLICT at 0.14 sec ----> 1190 [binary,1189.1,16.1] $F.
% 2.04/2.18
% 2.04/2.18 Length of proof is 3. Level of proof is 3.
% 2.04/2.18
% 2.04/2.18 ---------------- PROOF ----------------
% 2.04/2.18 % SZS status Theorem
% 2.04/2.18 % SZS output start Refutation
% See solution above
% 2.04/2.18 ------------ end of proof -------------
% 2.04/2.18
% 2.04/2.18
% 2.04/2.18 Search stopped by max_proofs option.
% 2.04/2.18
% 2.04/2.18
% 2.04/2.18 Search stopped by max_proofs option.
% 2.04/2.18
% 2.04/2.18 ============ end of search ============
% 2.04/2.18
% 2.04/2.18 -------------- statistics -------------
% 2.04/2.18 clauses given 110
% 2.04/2.18 clauses generated 4907
% 2.04/2.18 clauses kept 1184
% 2.04/2.18 clauses forward subsumed 2826
% 2.04/2.18 clauses back subsumed 36
% 2.04/2.18 Kbytes malloced 4882
% 2.04/2.18
% 2.04/2.18 ----------- times (seconds) -----------
% 2.04/2.18 user CPU time 0.14 (0 hr, 0 min, 0 sec)
% 2.04/2.18 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.04/2.18 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 2.04/2.18
% 2.04/2.18 That finishes the proof of the theorem.
% 2.04/2.18
% 2.04/2.18 Process 23620 finished Wed Jul 27 07:59:50 2022
% 2.04/2.18 Otter interrupted
% 2.04/2.18 PROOF FOUND
%------------------------------------------------------------------------------