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