TSTP Solution File: SET148+3 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SET148+3 : TPTP v8.1.0. Released v2.2.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:13:11 EDT 2022
% Result : Theorem 1.92s 2.12s
% Output : Refutation 1.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 3
% Syntax : Number of clauses : 5 ( 4 unt; 0 nHn; 3 RR)
% Number of literals : 6 ( 3 equ; 2 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 1 con; 0-2 aty)
% Number of variables : 4 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ subset(A,B)
| intersection(A,B) = A ),
file('SET148+3.p',unknown),
[] ).
cnf(13,axiom,
intersection(dollar_c1,dollar_c1) != dollar_c1,
file('SET148+3.p',unknown),
[] ).
cnf(20,axiom,
subset(A,A),
file('SET148+3.p',unknown),
[] ).
cnf(22,plain,
intersection(A,A) = A,
inference(hyper,[status(thm)],[20,1]),
[iquote('hyper,20,1')] ).
cnf(24,plain,
$false,
inference(binary,[status(thm)],[22,13]),
[iquote('binary,22.1,13.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET148+3 : TPTP v8.1.0. Released v2.2.0.
% 0.11/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 10:31:23 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.92/2.12 ----- Otter 3.3f, August 2004 -----
% 1.92/2.12 The process was started by sandbox on n020.cluster.edu,
% 1.92/2.12 Wed Jul 27 10:31:23 2022
% 1.92/2.12 The command was "./otter". The process ID is 30272.
% 1.92/2.12
% 1.92/2.12 set(prolog_style_variables).
% 1.92/2.12 set(auto).
% 1.92/2.12 dependent: set(auto1).
% 1.92/2.12 dependent: set(process_input).
% 1.92/2.12 dependent: clear(print_kept).
% 1.92/2.12 dependent: clear(print_new_demod).
% 1.92/2.12 dependent: clear(print_back_demod).
% 1.92/2.12 dependent: clear(print_back_sub).
% 1.92/2.12 dependent: set(control_memory).
% 1.92/2.12 dependent: assign(max_mem, 12000).
% 1.92/2.12 dependent: assign(pick_given_ratio, 4).
% 1.92/2.12 dependent: assign(stats_level, 1).
% 1.92/2.12 dependent: assign(max_seconds, 10800).
% 1.92/2.12 clear(print_given).
% 1.92/2.12
% 1.92/2.12 formula_list(usable).
% 1.92/2.12 all A (A=A).
% 1.92/2.12 all B C (subset(B,C)->intersection(B,C)=B).
% 1.92/2.12 all B C D (member(D,intersection(B,C))<->member(D,B)&member(D,C)).
% 1.92/2.12 all B C (B=C<->subset(B,C)&subset(C,B)).
% 1.92/2.12 all B C (intersection(B,C)=intersection(C,B)).
% 1.92/2.12 all B C (subset(B,C)<-> (all D (member(D,B)->member(D,C)))).
% 1.92/2.12 all B subset(B,B).
% 1.92/2.12 all B C (B=C<-> (all D (member(D,B)<->member(D,C)))).
% 1.92/2.12 -(all B (intersection(B,B)=B)).
% 1.92/2.12 end_of_list.
% 1.92/2.12
% 1.92/2.12 -------> usable clausifies to:
% 1.92/2.12
% 1.92/2.12 list(usable).
% 1.92/2.12 0 [] A=A.
% 1.92/2.12 0 [] -subset(B,C)|intersection(B,C)=B.
% 1.92/2.12 0 [] -member(D,intersection(B,C))|member(D,B).
% 1.92/2.12 0 [] -member(D,intersection(B,C))|member(D,C).
% 1.92/2.12 0 [] member(D,intersection(B,C))| -member(D,B)| -member(D,C).
% 1.92/2.12 0 [] B!=C|subset(B,C).
% 1.92/2.12 0 [] B!=C|subset(C,B).
% 1.92/2.12 0 [] B=C| -subset(B,C)| -subset(C,B).
% 1.92/2.12 0 [] intersection(B,C)=intersection(C,B).
% 1.92/2.12 0 [] -subset(B,C)| -member(D,B)|member(D,C).
% 1.92/2.12 0 [] subset(B,C)|member($f1(B,C),B).
% 1.92/2.12 0 [] subset(B,C)| -member($f1(B,C),C).
% 1.92/2.12 0 [] subset(B,B).
% 1.92/2.12 0 [] B!=C| -member(D,B)|member(D,C).
% 1.92/2.12 0 [] B!=C|member(D,B)| -member(D,C).
% 1.92/2.12 0 [] B=C|member($f2(B,C),B)|member($f2(B,C),C).
% 1.92/2.12 0 [] B=C| -member($f2(B,C),B)| -member($f2(B,C),C).
% 1.92/2.12 0 [] intersection($c1,$c1)!=$c1.
% 1.92/2.12 end_of_list.
% 1.92/2.12
% 1.92/2.12 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 1.92/2.12
% 1.92/2.12 This ia a non-Horn set with equality. The strategy will be
% 1.92/2.12 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.92/2.12 deletion, with positive clauses in sos and nonpositive
% 1.92/2.12 clauses in usable.
% 1.92/2.12
% 1.92/2.12 dependent: set(knuth_bendix).
% 1.92/2.12 dependent: set(anl_eq).
% 1.92/2.12 dependent: set(para_from).
% 1.92/2.12 dependent: set(para_into).
% 1.92/2.12 dependent: clear(para_from_right).
% 1.92/2.12 dependent: clear(para_into_right).
% 1.92/2.12 dependent: set(para_from_vars).
% 1.92/2.12 dependent: set(eq_units_both_ways).
% 1.92/2.12 dependent: set(dynamic_demod_all).
% 1.92/2.12 dependent: set(dynamic_demod).
% 1.92/2.12 dependent: set(order_eq).
% 1.92/2.12 dependent: set(back_demod).
% 1.92/2.12 dependent: set(lrpo).
% 1.92/2.12 dependent: set(hyper_res).
% 1.92/2.12 dependent: set(unit_deletion).
% 1.92/2.12 dependent: set(factor).
% 1.92/2.12
% 1.92/2.12 ------------> process usable:
% 1.92/2.12 ** KEPT (pick-wt=8): 1 [] -subset(A,B)|intersection(A,B)=A.
% 1.92/2.12 ** KEPT (pick-wt=8): 2 [] -member(A,intersection(B,C))|member(A,B).
% 1.92/2.12 ** KEPT (pick-wt=8): 3 [] -member(A,intersection(B,C))|member(A,C).
% 1.92/2.12 ** KEPT (pick-wt=11): 4 [] member(A,intersection(B,C))| -member(A,B)| -member(A,C).
% 1.92/2.12 ** KEPT (pick-wt=6): 5 [] A!=B|subset(A,B).
% 1.92/2.12 ** KEPT (pick-wt=6): 6 [] A!=B|subset(B,A).
% 1.92/2.12 ** KEPT (pick-wt=9): 7 [] A=B| -subset(A,B)| -subset(B,A).
% 1.92/2.12 ** KEPT (pick-wt=9): 8 [] -subset(A,B)| -member(C,A)|member(C,B).
% 1.92/2.12 ** KEPT (pick-wt=8): 9 [] subset(A,B)| -member($f1(A,B),B).
% 1.92/2.12 ** KEPT (pick-wt=9): 10 [] A!=B| -member(C,A)|member(C,B).
% 1.92/2.12 ** KEPT (pick-wt=9): 11 [] A!=B|member(C,A)| -member(C,B).
% 1.92/2.12 ** KEPT (pick-wt=13): 12 [] A=B| -member($f2(A,B),A)| -member($f2(A,B),B).
% 1.92/2.12 ** KEPT (pick-wt=5): 13 [] intersection($c1,$c1)!=$c1.
% 1.92/2.12
% 1.92/2.12 ------------> process sos:
% 1.92/2.12 ** KEPT (pick-wt=3): 17 [] A=A.
% 1.92/2.12 ** KEPT (pick-wt=7): 18 [] intersection(A,B)=intersection(B,A).
% 1.92/2.12 ** KEPT (pick-wt=8): 19 [] subset(A,B)|member($f1(A,B),A).
% 1.92/2.12 ** KEPT (pick-wt=3): 20 [] subset(A,A).
% 1.92/2.12 ** KEPT (pick-wt=13): 21 [] A=B|member($f2(A,B),A)|member($f2(A,B),B).
% 1.92/2.12 Following clause subsumed by 17 during input processing: 0 [copy,17,flip.1] A=A.
% 1.92/2.12 17 back subsumes 16.
% 1.92/2.12 17 back subsumes 15.
% 1.92/2.12 Following clause subsumed by 18 during input processing: 0 [copy,18,flip.1] intersection(A,B)=intersection(B,A).
% 1.92/2.12
% 1.92/2.12 ======= end of input processing =======
% 1.92/2.12
% 1.92/2.12 =========== start of search ===========
% 1.92/2.12
% 1.92/2.12 -------- PROOF --------
% 1.92/2.12
% 1.92/2.12 ----> UNIT CONFLICT at 0.00 sec ----> 24 [binary,22.1,13.1] $F.
% 1.92/2.12
% 1.92/2.12 Length of proof is 1. Level of proof is 1.
% 1.92/2.12
% 1.92/2.12 ---------------- PROOF ----------------
% 1.92/2.12 % SZS status Theorem
% 1.92/2.12 % SZS output start Refutation
% See solution above
% 1.92/2.12 ------------ end of proof -------------
% 1.92/2.12
% 1.92/2.12
% 1.92/2.12 Search stopped by max_proofs option.
% 1.92/2.12
% 1.92/2.12
% 1.92/2.12 Search stopped by max_proofs option.
% 1.92/2.12
% 1.92/2.12 ============ end of search ============
% 1.92/2.12
% 1.92/2.12 -------------- statistics -------------
% 1.92/2.12 clauses given 2
% 1.92/2.12 clauses generated 9
% 1.92/2.12 clauses kept 22
% 1.92/2.12 clauses forward subsumed 7
% 1.92/2.12 clauses back subsumed 2
% 1.92/2.12 Kbytes malloced 976
% 1.92/2.12
% 1.92/2.12 ----------- times (seconds) -----------
% 1.92/2.12 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.92/2.12 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.92/2.12 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.92/2.12
% 1.92/2.12 That finishes the proof of the theorem.
% 1.92/2.12
% 1.92/2.12 Process 30272 finished Wed Jul 27 10:31:25 2022
% 1.92/2.12 Otter interrupted
% 1.92/2.12 PROOF FOUND
%------------------------------------------------------------------------------