TSTP Solution File: SEU140+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU140+1 : TPTP v8.1.0. Released v3.3.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:53 EDT 2022
% Result : Theorem 1.56s 2.12s
% Output : Refutation 1.56s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 10
% Syntax : Number of clauses : 20 ( 12 unt; 0 nHn; 18 RR)
% Number of literals : 29 ( 10 equ; 10 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 16 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
( ~ disjoint(A,B)
| set_intersection2(A,B) = empty_set ),
file('SEU140+1.p',unknown),
[] ).
cnf(3,axiom,
( disjoint(A,B)
| set_intersection2(A,B) != empty_set ),
file('SEU140+1.p',unknown),
[] ).
cnf(6,axiom,
( ~ subset(A,B)
| subset(set_intersection2(A,C),set_intersection2(B,C)) ),
file('SEU140+1.p',unknown),
[] ).
cnf(7,axiom,
( ~ subset(A,empty_set)
| A = empty_set ),
file('SEU140+1.p',unknown),
[] ).
cnf(8,axiom,
~ disjoint(dollar_c5,dollar_c3),
file('SEU140+1.p',unknown),
[] ).
cnf(11,axiom,
( ~ empty(A)
| A = B
| ~ empty(B) ),
file('SEU140+1.p',unknown),
[] ).
cnf(14,axiom,
empty(empty_set),
file('SEU140+1.p',unknown),
[] ).
cnf(17,axiom,
empty(dollar_c1),
file('SEU140+1.p',unknown),
[] ).
cnf(21,axiom,
subset(dollar_c5,dollar_c4),
file('SEU140+1.p',unknown),
[] ).
cnf(22,axiom,
disjoint(dollar_c4,dollar_c3),
file('SEU140+1.p',unknown),
[] ).
cnf(24,plain,
empty_set = dollar_c1,
inference(hyper,[status(thm)],[17,11,14]),
[iquote('hyper,17,11,14')] ).
cnf(28,plain,
( ~ subset(A,dollar_c1)
| A = dollar_c1 ),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[7]),24,24]),
[iquote('back_demod,7,demod,24,24')] ).
cnf(29,plain,
( disjoint(A,B)
| set_intersection2(A,B) != dollar_c1 ),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[3]),24]),
[iquote('back_demod,3,demod,24')] ).
cnf(30,plain,
( ~ disjoint(A,B)
| set_intersection2(A,B) = dollar_c1 ),
inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[2]),24]),
[iquote('back_demod,2,demod,24')] ).
cnf(31,plain,
subset(set_intersection2(dollar_c5,A),set_intersection2(dollar_c4,A)),
inference(hyper,[status(thm)],[21,6]),
[iquote('hyper,21,6')] ).
cnf(103,plain,
set_intersection2(dollar_c4,dollar_c3) = dollar_c1,
inference(hyper,[status(thm)],[30,22]),
[iquote('hyper,30,22')] ).
cnf(136,plain,
subset(set_intersection2(dollar_c5,dollar_c3),dollar_c1),
inference(para_from,[status(thm),theory(equality)],[103,31]),
[iquote('para_from,103.1.1,31.1.2')] ).
cnf(164,plain,
set_intersection2(dollar_c5,dollar_c3) = dollar_c1,
inference(hyper,[status(thm)],[136,28]),
[iquote('hyper,136,28')] ).
cnf(191,plain,
disjoint(dollar_c5,dollar_c3),
inference(hyper,[status(thm)],[164,29]),
[iquote('hyper,164,29')] ).
cnf(192,plain,
$false,
inference(binary,[status(thm)],[191,8]),
[iquote('binary,191.1,8.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU140+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/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 07:38:53 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.56/2.12 ----- Otter 3.3f, August 2004 -----
% 1.56/2.12 The process was started by sandbox on n020.cluster.edu,
% 1.56/2.12 Wed Jul 27 07:38:53 2022
% 1.56/2.12 The command was "./otter". The process ID is 19559.
% 1.56/2.12
% 1.56/2.12 set(prolog_style_variables).
% 1.56/2.12 set(auto).
% 1.56/2.12 dependent: set(auto1).
% 1.56/2.12 dependent: set(process_input).
% 1.56/2.12 dependent: clear(print_kept).
% 1.56/2.12 dependent: clear(print_new_demod).
% 1.56/2.12 dependent: clear(print_back_demod).
% 1.56/2.12 dependent: clear(print_back_sub).
% 1.56/2.12 dependent: set(control_memory).
% 1.56/2.12 dependent: assign(max_mem, 12000).
% 1.56/2.12 dependent: assign(pick_given_ratio, 4).
% 1.56/2.12 dependent: assign(stats_level, 1).
% 1.56/2.12 dependent: assign(max_seconds, 10800).
% 1.56/2.12 clear(print_given).
% 1.56/2.12
% 1.56/2.12 formula_list(usable).
% 1.56/2.12 all A (A=A).
% 1.56/2.12 all A B (in(A,B)-> -in(B,A)).
% 1.56/2.12 all A B (set_intersection2(A,B)=set_intersection2(B,A)).
% 1.56/2.12 all A B (disjoint(A,B)<->set_intersection2(A,B)=empty_set).
% 1.56/2.12 $T.
% 1.56/2.12 $T.
% 1.56/2.12 empty(empty_set).
% 1.56/2.12 all A B (set_intersection2(A,A)=A).
% 1.56/2.12 exists A empty(A).
% 1.56/2.12 exists A (-empty(A)).
% 1.56/2.12 all A B subset(A,A).
% 1.56/2.12 all A B (disjoint(A,B)->disjoint(B,A)).
% 1.56/2.12 all A B C (subset(A,B)->subset(set_intersection2(A,C),set_intersection2(B,C))).
% 1.56/2.12 all A (set_intersection2(A,empty_set)=empty_set).
% 1.56/2.12 all A (subset(A,empty_set)->A=empty_set).
% 1.56/2.12 -(all A B C (subset(A,B)&disjoint(B,C)->disjoint(A,C))).
% 1.56/2.12 all A (empty(A)->A=empty_set).
% 1.56/2.12 all A B (-(in(A,B)&empty(B))).
% 1.56/2.12 all A B (-(empty(A)&A!=B&empty(B))).
% 1.56/2.12 end_of_list.
% 1.56/2.12
% 1.56/2.12 -------> usable clausifies to:
% 1.56/2.12
% 1.56/2.12 list(usable).
% 1.56/2.12 0 [] A=A.
% 1.56/2.12 0 [] -in(A,B)| -in(B,A).
% 1.56/2.12 0 [] set_intersection2(A,B)=set_intersection2(B,A).
% 1.56/2.12 0 [] -disjoint(A,B)|set_intersection2(A,B)=empty_set.
% 1.56/2.12 0 [] disjoint(A,B)|set_intersection2(A,B)!=empty_set.
% 1.56/2.12 0 [] $T.
% 1.56/2.12 0 [] $T.
% 1.56/2.12 0 [] empty(empty_set).
% 1.56/2.12 0 [] set_intersection2(A,A)=A.
% 1.56/2.12 0 [] empty($c1).
% 1.56/2.12 0 [] -empty($c2).
% 1.56/2.12 0 [] subset(A,A).
% 1.56/2.12 0 [] -disjoint(A,B)|disjoint(B,A).
% 1.56/2.12 0 [] -subset(A,B)|subset(set_intersection2(A,C),set_intersection2(B,C)).
% 1.56/2.12 0 [] set_intersection2(A,empty_set)=empty_set.
% 1.56/2.12 0 [] -subset(A,empty_set)|A=empty_set.
% 1.56/2.12 0 [] subset($c5,$c4).
% 1.56/2.12 0 [] disjoint($c4,$c3).
% 1.56/2.12 0 [] -disjoint($c5,$c3).
% 1.56/2.12 0 [] -empty(A)|A=empty_set.
% 1.56/2.12 0 [] -in(A,B)| -empty(B).
% 1.56/2.12 0 [] -empty(A)|A=B| -empty(B).
% 1.56/2.12 end_of_list.
% 1.56/2.12
% 1.56/2.12 SCAN INPUT: prop=0, horn=1, equality=1, symmetry=0, max_lits=3.
% 1.56/2.12
% 1.56/2.12 This is a Horn set with equality. The strategy will be
% 1.56/2.12 Knuth-Bendix and hyper_res, with positive clauses in
% 1.56/2.12 sos and nonpositive clauses in usable.
% 1.56/2.12
% 1.56/2.12 dependent: set(knuth_bendix).
% 1.56/2.12 dependent: set(anl_eq).
% 1.56/2.12 dependent: set(para_from).
% 1.56/2.12 dependent: set(para_into).
% 1.56/2.12 dependent: clear(para_from_right).
% 1.56/2.12 dependent: clear(para_into_right).
% 1.56/2.12 dependent: set(para_from_vars).
% 1.56/2.12 dependent: set(eq_units_both_ways).
% 1.56/2.12 dependent: set(dynamic_demod_all).
% 1.56/2.12 dependent: set(dynamic_demod).
% 1.56/2.12 dependent: set(order_eq).
% 1.56/2.12 dependent: set(back_demod).
% 1.56/2.12 dependent: set(lrpo).
% 1.56/2.12 dependent: set(hyper_res).
% 1.56/2.12 dependent: clear(order_hyper).
% 1.56/2.12
% 1.56/2.12 ------------> process usable:
% 1.56/2.12 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 1.56/2.12 ** KEPT (pick-wt=8): 2 [] -disjoint(A,B)|set_intersection2(A,B)=empty_set.
% 1.56/2.12 ** KEPT (pick-wt=8): 3 [] disjoint(A,B)|set_intersection2(A,B)!=empty_set.
% 1.56/2.12 ** KEPT (pick-wt=2): 4 [] -empty($c2).
% 1.56/2.12 ** KEPT (pick-wt=6): 5 [] -disjoint(A,B)|disjoint(B,A).
% 1.56/2.12 ** KEPT (pick-wt=10): 6 [] -subset(A,B)|subset(set_intersection2(A,C),set_intersection2(B,C)).
% 1.56/2.12 ** KEPT (pick-wt=6): 7 [] -subset(A,empty_set)|A=empty_set.
% 1.56/2.12 ** KEPT (pick-wt=3): 8 [] -disjoint($c5,$c3).
% 1.56/2.12 ** KEPT (pick-wt=5): 9 [] -empty(A)|A=empty_set.
% 1.56/2.12 ** KEPT (pick-wt=5): 10 [] -in(A,B)| -empty(B).
% 1.56/2.12 ** KEPT (pick-wt=7): 11 [] -empty(A)|A=B| -empty(B).
% 1.56/2.12
% 1.56/2.12 ------------> process sos:
% 1.56/2.12 ** KEPT (pick-wt=3): 12 [] A=A.
% 1.56/2.12 ** KEPT (pick-wt=7): 13 [] set_intersection2(A,B)=set_intersection2(B,A).
% 1.56/2.12 ** KEPT (pick-wt=2): 14 [] empty(empty_set).
% 1.56/2.12 ** KEPT (pick-wt=5): 15 [] set_intersection2(A,A)=A.
% 1.56/2.12 ---> New Demodulator: 16 [new_demod,15] set_intersection2(A,A)=A.
% 1.56/2.12 ** KEPT (pick-wt=2): 17 [] empty($c1).
% 1.56/2.12 ** KEPT (pick-wt=3): 18 [] subset(A,A).
% 1.56/2.12 ** KEPT (pick-wt=5): 19 [] set_intersection2(A,empty_set)=empty_set.
% 1.56/2.12 ---> New Demodulator: 20 [new_demod,19] set_intersection2(A,empty_set)=empty_set.
% 1.56/2.12 ** KEPT (pick-wt=3): 21 [] subset($c5,$c4).
% 1.56/2.12 ** KEPT (pick-wt=3): 22 [] disjoint($c4,$c3).
% 1.56/2.12 Following clause subsumed by 12 during input processing: 0 [copy,12,flip.1] A=A.
% 1.56/2.12 Following clause subsumed by 13 during input processing: 0 [copy,13,flip.1] set_intersection2(A,B)=set_intersection2(B,A).
% 1.56/2.12 >>>> Starting back demodulation with 16.
% 1.56/2.12 >>>> Starting back demodulation with 20.
% 1.56/2.12
% 1.56/2.12 ======= end of input processing =======
% 1.56/2.12
% 1.56/2.12 =========== start of search ===========
% 1.56/2.12
% 1.56/2.12 -------- PROOF --------
% 1.56/2.12
% 1.56/2.12 ----> UNIT CONFLICT at 0.01 sec ----> 192 [binary,191.1,8.1] $F.
% 1.56/2.12
% 1.56/2.12 Length of proof is 9. Level of proof is 6.
% 1.56/2.12
% 1.56/2.12 ---------------- PROOF ----------------
% 1.56/2.12 % SZS status Theorem
% 1.56/2.12 % SZS output start Refutation
% See solution above
% 1.56/2.12 ------------ end of proof -------------
% 1.56/2.12
% 1.56/2.12
% 1.56/2.12 Search stopped by max_proofs option.
% 1.56/2.12
% 1.56/2.12
% 1.56/2.12 Search stopped by max_proofs option.
% 1.56/2.12
% 1.56/2.12 ============ end of search ============
% 1.56/2.12
% 1.56/2.12 -------------- statistics -------------
% 1.56/2.12 clauses given 44
% 1.56/2.12 clauses generated 408
% 1.56/2.12 clauses kept 183
% 1.56/2.12 clauses forward subsumed 245
% 1.56/2.12 clauses back subsumed 30
% 1.56/2.12 Kbytes malloced 976
% 1.56/2.12
% 1.56/2.12 ----------- times (seconds) -----------
% 1.56/2.12 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 1.56/2.12 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.56/2.12 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.56/2.12
% 1.56/2.12 That finishes the proof of the theorem.
% 1.56/2.12
% 1.56/2.12 Process 19559 finished Wed Jul 27 07:38:55 2022
% 1.56/2.13 Otter interrupted
% 1.56/2.13 PROOF FOUND
%------------------------------------------------------------------------------