TSTP Solution File: SET629+3 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SET629+3 : TPTP v8.1.0. Released v2.2.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:13:55 EDT 2022
% Result : Theorem 6.70s 6.87s
% Output : Refutation 6.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 15 ( 4 unt; 5 nHn; 8 RR)
% Number of literals : 26 ( 0 equ; 9 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 3 ( 1 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 : 31 ( 6 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
( ~ member(A,intersection(B,C))
| member(A,C) ),
file('SET629+3.p',unknown),
[] ).
cnf(5,axiom,
( ~ member(A,difference(B,C))
| ~ member(A,C) ),
file('SET629+3.p',unknown),
[] ).
cnf(7,axiom,
( ~ intersect(A,B)
| member(dollar_f1(A,B),A) ),
file('SET629+3.p',unknown),
[] ).
cnf(8,axiom,
( ~ intersect(A,B)
| member(dollar_f1(A,B),B) ),
file('SET629+3.p',unknown),
[] ).
cnf(10,axiom,
( ~ disjoint(A,B)
| ~ intersect(A,B) ),
file('SET629+3.p',unknown),
[] ).
cnf(11,axiom,
( ~ intersect(A,B)
| intersect(B,A) ),
file('SET629+3.p',unknown),
[] ).
cnf(15,axiom,
~ disjoint(intersection(dollar_c2,dollar_c1),difference(dollar_c2,dollar_c1)),
file('SET629+3.p',unknown),
[] ).
cnf(20,axiom,
( disjoint(A,B)
| intersect(A,B) ),
file('SET629+3.p',unknown),
[] ).
cnf(23,plain,
( disjoint(A,B)
| intersect(B,A) ),
inference(hyper,[status(thm)],[20,11]),
[iquote('hyper,20,11')] ).
cnf(24,plain,
( disjoint(A,B)
| member(dollar_f1(A,B),B) ),
inference(hyper,[status(thm)],[20,8]),
[iquote('hyper,20,8')] ).
cnf(25,plain,
( disjoint(A,B)
| member(dollar_f1(A,B),A) ),
inference(hyper,[status(thm)],[20,7]),
[iquote('hyper,20,7')] ).
cnf(98,plain,
( disjoint(A,intersection(B,C))
| member(dollar_f1(A,intersection(B,C)),C) ),
inference(hyper,[status(thm)],[24,2]),
[iquote('hyper,24,2')] ).
cnf(3039,plain,
disjoint(difference(A,B),intersection(C,B)),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[98,5,25])]),
[iquote('hyper,98,5,25,factor_simp')] ).
cnf(3044,plain,
disjoint(intersection(A,B),difference(C,B)),
inference(hyper,[status(thm)],[3039,10,23]),
[iquote('hyper,3039,10,23')] ).
cnf(3045,plain,
$false,
inference(binary,[status(thm)],[3044,15]),
[iquote('binary,3044.1,15.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SET629+3 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.13 % Command : otter-tptp-script %s
% 0.13/0.34 % Computer : n025.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 10:47:00 EDT 2022
% 0.13/0.34 % CPUTime :
% 1.61/2.18 ----- Otter 3.3f, August 2004 -----
% 1.61/2.18 The process was started by sandbox2 on n025.cluster.edu,
% 1.61/2.18 Wed Jul 27 10:47:00 2022
% 1.61/2.18 The command was "./otter". The process ID is 12939.
% 1.61/2.18
% 1.61/2.18 set(prolog_style_variables).
% 1.61/2.18 set(auto).
% 1.61/2.18 dependent: set(auto1).
% 1.61/2.18 dependent: set(process_input).
% 1.61/2.18 dependent: clear(print_kept).
% 1.61/2.18 dependent: clear(print_new_demod).
% 1.61/2.18 dependent: clear(print_back_demod).
% 1.61/2.18 dependent: clear(print_back_sub).
% 1.61/2.18 dependent: set(control_memory).
% 1.61/2.18 dependent: assign(max_mem, 12000).
% 1.61/2.18 dependent: assign(pick_given_ratio, 4).
% 1.61/2.18 dependent: assign(stats_level, 1).
% 1.61/2.18 dependent: assign(max_seconds, 10800).
% 1.61/2.18 clear(print_given).
% 1.61/2.18
% 1.61/2.18 formula_list(usable).
% 1.61/2.18 all A (A=A).
% 1.61/2.18 all B C D (member(D,intersection(B,C))<->member(D,B)&member(D,C)).
% 1.61/2.18 all B C D (member(D,difference(B,C))<->member(D,B)& -member(D,C)).
% 1.61/2.18 all B C (intersect(B,C)<-> (exists D (member(D,B)&member(D,C)))).
% 1.61/2.18 all B C (disjoint(B,C)<-> -intersect(B,C)).
% 1.61/2.18 all B C (intersection(B,C)=intersection(C,B)).
% 1.61/2.18 all B C (intersect(B,C)->intersect(C,B)).
% 1.61/2.18 all B C (B=C<-> (all D (member(D,B)<->member(D,C)))).
% 1.61/2.18 -(all B C disjoint(intersection(B,C),difference(B,C))).
% 1.61/2.18 end_of_list.
% 1.61/2.18
% 1.61/2.18 -------> usable clausifies to:
% 1.61/2.18
% 1.61/2.18 list(usable).
% 1.61/2.18 0 [] A=A.
% 1.61/2.18 0 [] -member(D,intersection(B,C))|member(D,B).
% 1.61/2.18 0 [] -member(D,intersection(B,C))|member(D,C).
% 1.61/2.18 0 [] member(D,intersection(B,C))| -member(D,B)| -member(D,C).
% 1.61/2.18 0 [] -member(D,difference(B,C))|member(D,B).
% 1.61/2.18 0 [] -member(D,difference(B,C))| -member(D,C).
% 1.61/2.18 0 [] member(D,difference(B,C))| -member(D,B)|member(D,C).
% 1.61/2.18 0 [] -intersect(B,C)|member($f1(B,C),B).
% 1.61/2.18 0 [] -intersect(B,C)|member($f1(B,C),C).
% 1.61/2.18 0 [] intersect(B,C)| -member(D,B)| -member(D,C).
% 1.61/2.18 0 [] -disjoint(B,C)| -intersect(B,C).
% 1.61/2.18 0 [] disjoint(B,C)|intersect(B,C).
% 1.61/2.18 0 [] intersection(B,C)=intersection(C,B).
% 1.61/2.18 0 [] -intersect(B,C)|intersect(C,B).
% 1.61/2.18 0 [] B!=C| -member(D,B)|member(D,C).
% 1.61/2.18 0 [] B!=C|member(D,B)| -member(D,C).
% 1.61/2.18 0 [] B=C|member($f2(B,C),B)|member($f2(B,C),C).
% 1.61/2.18 0 [] B=C| -member($f2(B,C),B)| -member($f2(B,C),C).
% 1.61/2.18 0 [] -disjoint(intersection($c2,$c1),difference($c2,$c1)).
% 1.61/2.18 end_of_list.
% 1.61/2.18
% 1.61/2.18 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 1.61/2.18
% 1.61/2.18 This ia a non-Horn set with equality. The strategy will be
% 1.61/2.18 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.61/2.18 deletion, with positive clauses in sos and nonpositive
% 1.61/2.18 clauses in usable.
% 1.61/2.18
% 1.61/2.18 dependent: set(knuth_bendix).
% 1.61/2.18 dependent: set(anl_eq).
% 1.61/2.18 dependent: set(para_from).
% 1.61/2.18 dependent: set(para_into).
% 1.61/2.18 dependent: clear(para_from_right).
% 1.61/2.18 dependent: clear(para_into_right).
% 1.61/2.18 dependent: set(para_from_vars).
% 1.61/2.18 dependent: set(eq_units_both_ways).
% 1.61/2.18 dependent: set(dynamic_demod_all).
% 1.61/2.18 dependent: set(dynamic_demod).
% 1.61/2.18 dependent: set(order_eq).
% 1.61/2.18 dependent: set(back_demod).
% 1.61/2.18 dependent: set(lrpo).
% 1.61/2.18 dependent: set(hyper_res).
% 1.61/2.18 dependent: set(unit_deletion).
% 1.61/2.18 dependent: set(factor).
% 1.61/2.18
% 1.61/2.18 ------------> process usable:
% 1.61/2.18 ** KEPT (pick-wt=8): 1 [] -member(A,intersection(B,C))|member(A,B).
% 1.61/2.18 ** KEPT (pick-wt=8): 2 [] -member(A,intersection(B,C))|member(A,C).
% 1.61/2.18 ** KEPT (pick-wt=11): 3 [] member(A,intersection(B,C))| -member(A,B)| -member(A,C).
% 1.61/2.18 ** KEPT (pick-wt=8): 4 [] -member(A,difference(B,C))|member(A,B).
% 1.61/2.18 ** KEPT (pick-wt=8): 5 [] -member(A,difference(B,C))| -member(A,C).
% 1.61/2.18 ** KEPT (pick-wt=11): 6 [] member(A,difference(B,C))| -member(A,B)|member(A,C).
% 1.61/2.18 ** KEPT (pick-wt=8): 7 [] -intersect(A,B)|member($f1(A,B),A).
% 1.61/2.18 ** KEPT (pick-wt=8): 8 [] -intersect(A,B)|member($f1(A,B),B).
% 1.61/2.18 ** KEPT (pick-wt=9): 9 [] intersect(A,B)| -member(C,A)| -member(C,B).
% 1.61/2.18 ** KEPT (pick-wt=6): 10 [] -disjoint(A,B)| -intersect(A,B).
% 1.61/2.18 ** KEPT (pick-wt=6): 11 [] -intersect(A,B)|intersect(B,A).
% 1.61/2.18 ** KEPT (pick-wt=9): 12 [] A!=B| -member(C,A)|member(C,B).
% 1.61/2.18 ** KEPT (pick-wt=9): 13 [] A!=B|member(C,A)| -member(C,B).
% 1.61/2.18 ** KEPT (pick-wt=13): 14 [] A=B| -member($f2(A,B),A)| -member($f2(A,B),B).
% 1.61/2.18 ** KEPT (pick-wt=7): 15 [] -disjoint(intersection($c2,$c1),difference($c2,$c1)).
% 1.61/2.18
% 1.61/2.18 ------------> process sos:
% 1.61/2.18 ** KEPT (pick-wt=3): 19 [] A=A.
% 1.61/2.18 ** KEPT (pick-wt=6): 20 [] disjoint(A,B)|intersect(A,B).
% 1.61/2.18 ** KEPT (pick-wt=7): 21 [] intersection(A,B)=intersection(B,A).
% 1.61/2.18 ** KEPT (pick-wt=13): 22 [] A=B|member($f2(A,B),A)|member($f2(A,B),B).
% 1.61/2.18 Following clause subsumed by 19 during input processing: 0 [copy,19,flip.1] A=A.
% 6.70/6.87 19 back subsumes 18.
% 6.70/6.87 Following clause subsumed by 21 during input processing: 0 [copy,21,flip.1] intersection(A,B)=intersection(B,A).
% 6.70/6.87
% 6.70/6.87 ======= end of input processing =======
% 6.70/6.87
% 6.70/6.87 =========== start of search ===========
% 6.70/6.87
% 6.70/6.87
% 6.70/6.87 Resetting weight limit to 14.
% 6.70/6.87
% 6.70/6.87
% 6.70/6.87 Resetting weight limit to 14.
% 6.70/6.87
% 6.70/6.87 sos_size=2264
% 6.70/6.87
% 6.70/6.87
% 6.70/6.87 Resetting weight limit to 13.
% 6.70/6.87
% 6.70/6.87
% 6.70/6.87 Resetting weight limit to 13.
% 6.70/6.87
% 6.70/6.87 sos_size=2293
% 6.70/6.87
% 6.70/6.87
% 6.70/6.87 Resetting weight limit to 12.
% 6.70/6.87
% 6.70/6.87
% 6.70/6.87 Resetting weight limit to 12.
% 6.70/6.87
% 6.70/6.87 sos_size=1330
% 6.70/6.87
% 6.70/6.87
% 6.70/6.87 Resetting weight limit to 11.
% 6.70/6.87
% 6.70/6.87
% 6.70/6.87 Resetting weight limit to 11.
% 6.70/6.87
% 6.70/6.87 sos_size=1473
% 6.70/6.87
% 6.70/6.87 -------- PROOF --------
% 6.70/6.87
% 6.70/6.87 ----> UNIT CONFLICT at 4.68 sec ----> 3045 [binary,3044.1,15.1] $F.
% 6.70/6.87
% 6.70/6.87 Length of proof is 6. Level of proof is 4.
% 6.70/6.87
% 6.70/6.87 ---------------- PROOF ----------------
% 6.70/6.87 % SZS status Theorem
% 6.70/6.87 % SZS output start Refutation
% See solution above
% 6.70/6.87 ------------ end of proof -------------
% 6.70/6.87
% 6.70/6.87
% 6.70/6.87 Search stopped by max_proofs option.
% 6.70/6.87
% 6.70/6.87
% 6.70/6.87 Search stopped by max_proofs option.
% 6.70/6.87
% 6.70/6.87 ============ end of search ============
% 6.70/6.87
% 6.70/6.87 -------------- statistics -------------
% 6.70/6.87 clauses given 332
% 6.70/6.87 clauses generated 107956
% 6.70/6.87 clauses kept 3040
% 6.70/6.87 clauses forward subsumed 12773
% 6.70/6.87 clauses back subsumed 290
% 6.70/6.87 Kbytes malloced 5859
% 6.70/6.87
% 6.70/6.87 ----------- times (seconds) -----------
% 6.70/6.87 user CPU time 4.68 (0 hr, 0 min, 4 sec)
% 6.70/6.87 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 6.70/6.87 wall-clock time 7 (0 hr, 0 min, 7 sec)
% 6.70/6.87
% 6.70/6.87 That finishes the proof of the theorem.
% 6.70/6.87
% 6.70/6.87 Process 12939 finished Wed Jul 27 10:47:07 2022
% 6.70/6.87 Otter interrupted
% 6.70/6.87 PROOF FOUND
%------------------------------------------------------------------------------