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