TSTP Solution File: SET006-1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SET006-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n015.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:12:45 EDT 2022
% Result : Unsatisfiable 1.99s 2.12s
% Output : Refutation 1.99s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 9 ( 6 unt; 1 nHn; 8 RR)
% Number of literals : 13 ( 0 equ; 4 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 3 ( 3 usr; 2 con; 0-2 aty)
% Number of variables : 8 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
( ~ member(member_of_1_not_of_2(A,B),B)
| subset(A,B) ),
file('SET006-1.p',unknown),
[] ).
cnf(7,axiom,
( ~ intersection(A,B,C)
| ~ member(D,C)
| member(D,B) ),
file('SET006-1.p',unknown),
[] ).
cnf(10,axiom,
~ subset(d,a),
file('SET006-1.p',unknown),
[] ).
cnf(17,axiom,
( subset(A,B)
| member(member_of_1_not_of_2(A,B),A) ),
file('SET006-1.p',unknown),
[] ).
cnf(20,axiom,
intersection(d,a,d),
file('SET006-1.p',unknown),
[] ).
cnf(24,plain,
member(member_of_1_not_of_2(d,a),d),
inference(hyper,[status(thm)],[17,10]),
[iquote('hyper,17,10')] ).
cnf(26,plain,
member(member_of_1_not_of_2(d,a),a),
inference(hyper,[status(thm)],[24,7,20]),
[iquote('hyper,24,7,20')] ).
cnf(28,plain,
subset(d,a),
inference(hyper,[status(thm)],[26,2]),
[iquote('hyper,26,2')] ).
cnf(29,plain,
$false,
inference(binary,[status(thm)],[28,10]),
[iquote('binary,28.1,10.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : SET006-1 : TPTP v8.1.0. Released v1.0.0.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.12/0.34 % Computer : n015.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Wed Jul 27 10:44:27 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.99/2.12 ----- Otter 3.3f, August 2004 -----
% 1.99/2.12 The process was started by sandbox2 on n015.cluster.edu,
% 1.99/2.12 Wed Jul 27 10:44:27 2022
% 1.99/2.12 The command was "./otter". The process ID is 9223.
% 1.99/2.12
% 1.99/2.12 set(prolog_style_variables).
% 1.99/2.12 set(auto).
% 1.99/2.12 dependent: set(auto1).
% 1.99/2.12 dependent: set(process_input).
% 1.99/2.12 dependent: clear(print_kept).
% 1.99/2.12 dependent: clear(print_new_demod).
% 1.99/2.12 dependent: clear(print_back_demod).
% 1.99/2.12 dependent: clear(print_back_sub).
% 1.99/2.12 dependent: set(control_memory).
% 1.99/2.12 dependent: assign(max_mem, 12000).
% 1.99/2.12 dependent: assign(pick_given_ratio, 4).
% 1.99/2.12 dependent: assign(stats_level, 1).
% 1.99/2.12 dependent: assign(max_seconds, 10800).
% 1.99/2.12 clear(print_given).
% 1.99/2.12
% 1.99/2.12 list(usable).
% 1.99/2.12 0 [] -member(Element,Subset)| -subset(Subset,Superset)|member(Element,Superset).
% 1.99/2.12 0 [] subset(Subset,Superset)|member(member_of_1_not_of_2(Subset,Superset),Subset).
% 1.99/2.12 0 [] -member(member_of_1_not_of_2(Subset,Superset),Superset)|subset(Subset,Superset).
% 1.99/2.12 0 [] -e_qual_sets(Subset,Superset)|subset(Subset,Superset).
% 1.99/2.12 0 [] -e_qual_sets(Superset,Subset)|subset(Subset,Superset).
% 1.99/2.12 0 [] -subset(Set1,Set2)| -subset(Set2,Set1)|e_qual_sets(Set2,Set1).
% 1.99/2.12 0 [] -intersection(Set1,Set2,Intersection)| -member(Element,Intersection)|member(Element,Set1).
% 1.99/2.12 0 [] -intersection(Set1,Set2,Intersection)| -member(Element,Intersection)|member(Element,Set2).
% 1.99/2.12 0 [] -intersection(Set1,Set2,Intersection)| -member(Element,Set2)| -member(Element,Set1)|member(Element,Intersection).
% 1.99/2.12 0 [] member(h(Set1,Set2,Intersection),Intersection)|intersection(Set1,Set2,Intersection)|member(h(Set1,Set2,Intersection),Set1).
% 1.99/2.12 0 [] member(h(Set1,Set2,Intersection),Intersection)|intersection(Set1,Set2,Intersection)|member(h(Set1,Set2,Intersection),Set2).
% 1.99/2.12 0 [] -member(h(Set1,Set2,Intersection),Intersection)| -member(h(Set1,Set2,Intersection),Set2)| -member(h(Set1,Set2,Intersection),Set1)|intersection(Set1,Set2,Intersection).
% 1.99/2.12 0 [] intersection(d,a,d).
% 1.99/2.12 0 [] -subset(d,a).
% 1.99/2.12 end_of_list.
% 1.99/2.12
% 1.99/2.12 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=4.
% 1.99/2.12
% 1.99/2.12 This is a non-Horn set without equality. The strategy will
% 1.99/2.12 be ordered hyper_res, unit deletion, and factoring, with
% 1.99/2.12 satellites in sos and with nuclei in usable.
% 1.99/2.12
% 1.99/2.12 dependent: set(hyper_res).
% 1.99/2.12 dependent: set(factor).
% 1.99/2.12 dependent: set(unit_deletion).
% 1.99/2.12
% 1.99/2.12 ------------> process usable:
% 1.99/2.12 ** KEPT (pick-wt=9): 1 [] -member(A,B)| -subset(B,C)|member(A,C).
% 1.99/2.12 ** KEPT (pick-wt=8): 2 [] -member(member_of_1_not_of_2(A,B),B)|subset(A,B).
% 1.99/2.12 ** KEPT (pick-wt=6): 3 [] -e_qual_sets(A,B)|subset(A,B).
% 1.99/2.12 ** KEPT (pick-wt=6): 4 [] -e_qual_sets(A,B)|subset(B,A).
% 1.99/2.12 ** KEPT (pick-wt=9): 5 [] -subset(A,B)| -subset(B,A)|e_qual_sets(B,A).
% 1.99/2.12 ** KEPT (pick-wt=10): 6 [] -intersection(A,B,C)| -member(D,C)|member(D,A).
% 1.99/2.12 ** KEPT (pick-wt=10): 7 [] -intersection(A,B,C)| -member(D,C)|member(D,B).
% 1.99/2.12 ** KEPT (pick-wt=13): 8 [] -intersection(A,B,C)| -member(D,B)| -member(D,A)|member(D,C).
% 1.99/2.12 ** KEPT (pick-wt=22): 9 [] -member(h(A,B,C),C)| -member(h(A,B,C),B)| -member(h(A,B,C),A)|intersection(A,B,C).
% 1.99/2.12 ** KEPT (pick-wt=3): 10 [] -subset(d,a).
% 1.99/2.12
% 1.99/2.12 ------------> process sos:
% 1.99/2.12 ** KEPT (pick-wt=8): 17 [] subset(A,B)|member(member_of_1_not_of_2(A,B),A).
% 1.99/2.12 ** KEPT (pick-wt=16): 18 [] member(h(A,B,C),C)|intersection(A,B,C)|member(h(A,B,C),A).
% 1.99/2.12 ** KEPT (pick-wt=16): 19 [] member(h(A,B,C),C)|intersection(A,B,C)|member(h(A,B,C),B).
% 1.99/2.12 ** KEPT (pick-wt=4): 20 [] intersection(d,a,d).
% 1.99/2.12
% 1.99/2.12 ======= end of input processing =======
% 1.99/2.12
% 1.99/2.12 =========== start of search ===========
% 1.99/2.12
% 1.99/2.12 -------- PROOF --------
% 1.99/2.12
% 1.99/2.12 ----> UNIT CONFLICT at 0.00 sec ----> 29 [binary,28.1,10.1] $F.
% 1.99/2.12
% 1.99/2.12 Length of proof is 3. Level of proof is 3.
% 1.99/2.12
% 1.99/2.12 ---------------- PROOF ----------------
% 1.99/2.12 % SZS status Unsatisfiable
% 1.99/2.12 % SZS output start Refutation
% See solution above
% 1.99/2.12 ------------ end of proof -------------
% 1.99/2.12
% 1.99/2.12
% 1.99/2.12 Search stopped by max_proofs option.
% 1.99/2.12
% 1.99/2.12
% 1.99/2.12 Search stopped by max_proofs option.
% 1.99/2.12
% 1.99/2.12 ============ end of search ============
% 1.99/2.12
% 1.99/2.12 -------------- statistics -------------
% 1.99/2.12 clauses given 4
% 1.99/2.12 clauses generated 20
% 1.99/2.12 clauses kept 28
% 1.99/2.12 clauses forward subsumed 6
% 1.99/2.12 clauses back subsumed 0
% 1.99/2.12 Kbytes malloced 976
% 1.99/2.12
% 1.99/2.12 ----------- times (seconds) -----------
% 1.99/2.12 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.99/2.12 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.99/2.12 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.99/2.12
% 1.99/2.12 That finishes the proof of the theorem.
% 1.99/2.12
% 1.99/2.12 Process 9223 finished Wed Jul 27 10:44:28 2022
% 1.99/2.12 Otter interrupted
% 1.99/2.12 PROOF FOUND
%------------------------------------------------------------------------------