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