TSTP Solution File: SET573+3 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SET573+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:43 EDT 2022
% Result : Theorem 1.88s 2.06s
% Output : Refutation 1.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 5
% Syntax : Number of clauses : 7 ( 5 unt; 0 nHn; 7 RR)
% Number of literals : 10 ( 0 equ; 4 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 3 ( 3 usr; 3 con; 0-0 aty)
% Number of variables : 5 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(3,axiom,
( intersect(A,B)
| ~ member(C,A)
| ~ member(C,B) ),
file('SET573+3.p',unknown),
[] ).
cnf(4,axiom,
( ~ disjoint(A,B)
| ~ intersect(A,B) ),
file('SET573+3.p',unknown),
[] ).
cnf(8,axiom,
member(dollar_c3,dollar_c2),
file('SET573+3.p',unknown),
[] ).
cnf(9,axiom,
disjoint(dollar_c2,dollar_c1),
file('SET573+3.p',unknown),
[] ).
cnf(10,axiom,
member(dollar_c3,dollar_c1),
file('SET573+3.p',unknown),
[] ).
cnf(16,plain,
intersect(dollar_c2,dollar_c1),
inference(hyper,[status(thm)],[10,3,8]),
[iquote('hyper,10,3,8')] ).
cnf(23,plain,
$false,
inference(hyper,[status(thm)],[16,4,9]),
[iquote('hyper,16,4,9')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SET573+3 : TPTP v8.1.0. Released v2.2.0.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n025.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:44:45 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.88/2.06 ----- Otter 3.3f, August 2004 -----
% 1.88/2.06 The process was started by sandbox on n025.cluster.edu,
% 1.88/2.06 Wed Jul 27 10:44:45 2022
% 1.88/2.06 The command was "./otter". The process ID is 3272.
% 1.88/2.06
% 1.88/2.06 set(prolog_style_variables).
% 1.88/2.06 set(auto).
% 1.88/2.06 dependent: set(auto1).
% 1.88/2.06 dependent: set(process_input).
% 1.88/2.06 dependent: clear(print_kept).
% 1.88/2.06 dependent: clear(print_new_demod).
% 1.88/2.06 dependent: clear(print_back_demod).
% 1.88/2.06 dependent: clear(print_back_sub).
% 1.88/2.06 dependent: set(control_memory).
% 1.88/2.06 dependent: assign(max_mem, 12000).
% 1.88/2.06 dependent: assign(pick_given_ratio, 4).
% 1.88/2.06 dependent: assign(stats_level, 1).
% 1.88/2.06 dependent: assign(max_seconds, 10800).
% 1.88/2.06 clear(print_given).
% 1.88/2.06
% 1.88/2.06 formula_list(usable).
% 1.88/2.06 all B C (intersect(B,C)<-> (exists D (member(D,B)&member(D,C)))).
% 1.88/2.06 all B C (disjoint(B,C)<-> -intersect(B,C)).
% 1.88/2.06 all B C (intersect(B,C)->intersect(C,B)).
% 1.88/2.06 -(all B C D (member(B,C)&disjoint(C,D)-> -member(B,D))).
% 1.88/2.06 end_of_list.
% 1.88/2.06
% 1.88/2.06 -------> usable clausifies to:
% 1.88/2.06
% 1.88/2.06 list(usable).
% 1.88/2.06 0 [] -intersect(B,C)|member($f1(B,C),B).
% 1.88/2.06 0 [] -intersect(B,C)|member($f1(B,C),C).
% 1.88/2.06 0 [] intersect(B,C)| -member(D,B)| -member(D,C).
% 1.88/2.06 0 [] -disjoint(B,C)| -intersect(B,C).
% 1.88/2.06 0 [] disjoint(B,C)|intersect(B,C).
% 1.88/2.06 0 [] -intersect(B,C)|intersect(C,B).
% 1.88/2.06 0 [] member($c3,$c2).
% 1.88/2.06 0 [] disjoint($c2,$c1).
% 1.88/2.06 0 [] member($c3,$c1).
% 1.88/2.06 end_of_list.
% 1.88/2.06
% 1.88/2.06 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=3.
% 1.88/2.06
% 1.88/2.06 This is a non-Horn set without equality. The strategy will
% 1.88/2.06 be ordered hyper_res, unit deletion, and factoring, with
% 1.88/2.06 satellites in sos and with nuclei in usable.
% 1.88/2.06
% 1.88/2.06 dependent: set(hyper_res).
% 1.88/2.06 dependent: set(factor).
% 1.88/2.06 dependent: set(unit_deletion).
% 1.88/2.06
% 1.88/2.06 ------------> process usable:
% 1.88/2.06 ** KEPT (pick-wt=8): 1 [] -intersect(A,B)|member($f1(A,B),A).
% 1.88/2.06 ** KEPT (pick-wt=8): 2 [] -intersect(A,B)|member($f1(A,B),B).
% 1.88/2.06 ** KEPT (pick-wt=9): 3 [] intersect(A,B)| -member(C,A)| -member(C,B).
% 1.88/2.06 ** KEPT (pick-wt=6): 4 [] -disjoint(A,B)| -intersect(A,B).
% 1.88/2.06 ** KEPT (pick-wt=6): 5 [] -intersect(A,B)|intersect(B,A).
% 1.88/2.06
% 1.88/2.06 ------------> process sos:
% 1.88/2.06 ** KEPT (pick-wt=6): 7 [] disjoint(A,B)|intersect(A,B).
% 1.88/2.06 ** KEPT (pick-wt=3): 8 [] member($c3,$c2).
% 1.88/2.06 ** KEPT (pick-wt=3): 9 [] disjoint($c2,$c1).
% 1.88/2.06 ** KEPT (pick-wt=3): 10 [] member($c3,$c1).
% 1.88/2.06
% 1.88/2.06 ======= end of input processing =======
% 1.88/2.06
% 1.88/2.06 =========== start of search ===========
% 1.88/2.06
% 1.88/2.06 -------- PROOF --------
% 1.88/2.06
% 1.88/2.06 -----> EMPTY CLAUSE at 0.00 sec ----> 23 [hyper,16,4,9] $F.
% 1.88/2.06
% 1.88/2.06 Length of proof is 1. Level of proof is 1.
% 1.88/2.06
% 1.88/2.06 ---------------- PROOF ----------------
% 1.88/2.06 % SZS status Theorem
% 1.88/2.06 % SZS output start Refutation
% See solution above
% 1.88/2.06 ------------ end of proof -------------
% 1.88/2.06
% 1.88/2.06
% 1.88/2.06 Search stopped by max_proofs option.
% 1.88/2.06
% 1.88/2.06
% 1.88/2.06 Search stopped by max_proofs option.
% 1.88/2.06
% 1.88/2.06 ============ end of search ============
% 1.88/2.06
% 1.88/2.06 -------------- statistics -------------
% 1.88/2.06 clauses given 8
% 1.88/2.06 clauses generated 25
% 1.88/2.06 clauses kept 22
% 1.88/2.06 clauses forward subsumed 11
% 1.88/2.06 clauses back subsumed 0
% 1.88/2.06 Kbytes malloced 976
% 1.88/2.06
% 1.88/2.06 ----------- times (seconds) -----------
% 1.88/2.06 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.88/2.06 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.88/2.06 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.88/2.06
% 1.88/2.06 That finishes the proof of the theorem.
% 1.88/2.06
% 1.88/2.06 Process 3272 finished Wed Jul 27 10:44:47 2022
% 1.88/2.06 Otter interrupted
% 1.88/2.06 PROOF FOUND
%------------------------------------------------------------------------------