TSTP Solution File: SET627+3 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SET627+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n022.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:54 EDT 2022
% Result : Theorem 1.70s 1.90s
% Output : Refutation 1.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 4
% Syntax : Number of clauses : 7 ( 4 unt; 2 nHn; 4 RR)
% Number of literals : 10 ( 0 equ; 3 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 8 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
~ member(A,empty_set),
file('SET627+3.p',unknown),
[] ).
cnf(3,axiom,
( ~ intersect(A,B)
| member(dollar_f1(A,B),B) ),
file('SET627+3.p',unknown),
[] ).
cnf(8,axiom,
~ disjoint(dollar_c1,empty_set),
file('SET627+3.p',unknown),
[] ).
cnf(10,axiom,
( disjoint(A,B)
| intersect(A,B) ),
file('SET627+3.p',unknown),
[] ).
cnf(13,plain,
( disjoint(A,B)
| member(dollar_f1(A,B),B) ),
inference(hyper,[status(thm)],[10,3]),
[iquote('hyper,10,3')] ).
cnf(19,plain,
disjoint(A,empty_set),
inference(hyper,[status(thm)],[13,1]),
[iquote('hyper,13,1')] ).
cnf(20,plain,
$false,
inference(binary,[status(thm)],[19,8]),
[iquote('binary,19.1,8.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SET627+3 : TPTP v8.1.0. Released v2.2.0.
% 0.04/0.13 % Command : otter-tptp-script %s
% 0.13/0.35 % Computer : n022.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Wed Jul 27 10:43:05 EDT 2022
% 0.13/0.35 % CPUTime :
% 1.70/1.90 ----- Otter 3.3f, August 2004 -----
% 1.70/1.90 The process was started by sandbox on n022.cluster.edu,
% 1.70/1.90 Wed Jul 27 10:43:05 2022
% 1.70/1.90 The command was "./otter". The process ID is 29788.
% 1.70/1.90
% 1.70/1.90 set(prolog_style_variables).
% 1.70/1.90 set(auto).
% 1.70/1.90 dependent: set(auto1).
% 1.70/1.90 dependent: set(process_input).
% 1.70/1.90 dependent: clear(print_kept).
% 1.70/1.90 dependent: clear(print_new_demod).
% 1.70/1.90 dependent: clear(print_back_demod).
% 1.70/1.90 dependent: clear(print_back_sub).
% 1.70/1.90 dependent: set(control_memory).
% 1.70/1.90 dependent: assign(max_mem, 12000).
% 1.70/1.90 dependent: assign(pick_given_ratio, 4).
% 1.70/1.90 dependent: assign(stats_level, 1).
% 1.70/1.90 dependent: assign(max_seconds, 10800).
% 1.70/1.90 clear(print_given).
% 1.70/1.90
% 1.70/1.90 formula_list(usable).
% 1.70/1.90 all B (-member(B,empty_set)).
% 1.70/1.90 all B C (intersect(B,C)<-> (exists D (member(D,B)&member(D,C)))).
% 1.70/1.90 all B C (disjoint(B,C)<-> -intersect(B,C)).
% 1.70/1.90 all B C (intersect(B,C)->intersect(C,B)).
% 1.70/1.90 all B (empty(B)<-> (all C (-member(C,B)))).
% 1.70/1.90 -(all B disjoint(B,empty_set)).
% 1.70/1.90 end_of_list.
% 1.70/1.90
% 1.70/1.90 -------> usable clausifies to:
% 1.70/1.90
% 1.70/1.90 list(usable).
% 1.70/1.90 0 [] -member(B,empty_set).
% 1.70/1.90 0 [] -intersect(B,C)|member($f1(B,C),B).
% 1.70/1.90 0 [] -intersect(B,C)|member($f1(B,C),C).
% 1.70/1.90 0 [] intersect(B,C)| -member(D,B)| -member(D,C).
% 1.70/1.90 0 [] -disjoint(B,C)| -intersect(B,C).
% 1.70/1.90 0 [] disjoint(B,C)|intersect(B,C).
% 1.70/1.90 0 [] -intersect(B,C)|intersect(C,B).
% 1.70/1.90 0 [] -empty(B)| -member(C,B).
% 1.70/1.90 0 [] empty(B)|member($f2(B),B).
% 1.70/1.90 0 [] -disjoint($c1,empty_set).
% 1.70/1.90 end_of_list.
% 1.70/1.90
% 1.70/1.90 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=3.
% 1.70/1.90
% 1.70/1.90 This is a non-Horn set without equality. The strategy will
% 1.70/1.90 be ordered hyper_res, unit deletion, and factoring, with
% 1.70/1.90 satellites in sos and with nuclei in usable.
% 1.70/1.90
% 1.70/1.90 dependent: set(hyper_res).
% 1.70/1.90 dependent: set(factor).
% 1.70/1.90 dependent: set(unit_deletion).
% 1.70/1.90
% 1.70/1.90 ------------> process usable:
% 1.70/1.90 ** KEPT (pick-wt=3): 1 [] -member(A,empty_set).
% 1.70/1.90 ** KEPT (pick-wt=8): 2 [] -intersect(A,B)|member($f1(A,B),A).
% 1.70/1.90 ** KEPT (pick-wt=8): 3 [] -intersect(A,B)|member($f1(A,B),B).
% 1.70/1.90 ** KEPT (pick-wt=9): 4 [] intersect(A,B)| -member(C,A)| -member(C,B).
% 1.70/1.90 ** KEPT (pick-wt=6): 5 [] -disjoint(A,B)| -intersect(A,B).
% 1.70/1.90 ** KEPT (pick-wt=6): 6 [] -intersect(A,B)|intersect(B,A).
% 1.70/1.90 ** KEPT (pick-wt=5): 7 [] -empty(A)| -member(B,A).
% 1.70/1.90 ** KEPT (pick-wt=3): 8 [] -disjoint($c1,empty_set).
% 1.70/1.90
% 1.70/1.90 ------------> process sos:
% 1.70/1.90 ** KEPT (pick-wt=6): 10 [] disjoint(A,B)|intersect(A,B).
% 1.70/1.90 ** KEPT (pick-wt=6): 11 [] empty(A)|member($f2(A),A).
% 1.70/1.90
% 1.70/1.90 ======= end of input processing =======
% 1.70/1.90
% 1.70/1.90 =========== start of search ===========
% 1.70/1.90
% 1.70/1.90 -------- PROOF --------
% 1.70/1.90
% 1.70/1.90 ----> UNIT CONFLICT at 0.00 sec ----> 20 [binary,19.1,8.1] $F.
% 1.70/1.90
% 1.70/1.90 Length of proof is 2. Level of proof is 2.
% 1.70/1.90
% 1.70/1.90 ---------------- PROOF ----------------
% 1.70/1.90 % SZS status Theorem
% 1.70/1.90 % SZS output start Refutation
% See solution above
% 1.70/1.90 ------------ end of proof -------------
% 1.70/1.90
% 1.70/1.90
% 1.70/1.90 Search stopped by max_proofs option.
% 1.70/1.90
% 1.70/1.90
% 1.70/1.90 Search stopped by max_proofs option.
% 1.70/1.90
% 1.70/1.90 ============ end of search ============
% 1.70/1.90
% 1.70/1.90 -------------- statistics -------------
% 1.70/1.90 clauses given 4
% 1.70/1.90 clauses generated 12
% 1.70/1.90 clauses kept 19
% 1.70/1.90 clauses forward subsumed 3
% 1.70/1.90 clauses back subsumed 0
% 1.70/1.90 Kbytes malloced 976
% 1.70/1.90
% 1.70/1.90 ----------- times (seconds) -----------
% 1.70/1.90 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.70/1.90 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.70/1.90 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.70/1.90
% 1.70/1.90 That finishes the proof of the theorem.
% 1.70/1.90
% 1.70/1.90 Process 29788 finished Wed Jul 27 10:43:07 2022
% 1.70/1.90 Otter interrupted
% 1.70/1.90 PROOF FOUND
%------------------------------------------------------------------------------