TSTP Solution File: SET013-4 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SET013-4 : TPTP v8.1.0. Bugfixed v1.2.1.
% 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:47 EDT 2022
% Result : Unsatisfiable 6.88s 7.06s
% Output : Refutation 6.88s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 24 ( 10 unt; 3 nHn; 21 RR)
% Number of literals : 46 ( 10 equ; 18 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 22 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
( ~ member(f1(A,B),A)
| ~ member(f1(A,B),B)
| A = B ),
file('SET013-4.p',unknown),
[] ).
cnf(3,axiom,
( ~ member(A,intersection(B,C))
| member(A,B) ),
file('SET013-4.p',unknown),
[] ).
cnf(4,axiom,
( ~ member(A,intersection(B,C))
| member(A,C) ),
file('SET013-4.p',unknown),
[] ).
cnf(5,axiom,
( member(A,intersection(B,C))
| ~ member(A,B)
| ~ member(A,C) ),
file('SET013-4.p',unknown),
[] ).
cnf(8,axiom,
cs != ds,
file('SET013-4.p',unknown),
[] ).
cnf(9,plain,
ds != cs,
inference(flip,[status(thm),theory(equality)],[inference(copy,[status(thm)],[8])]),
[iquote('copy,8,flip.1')] ).
cnf(14,axiom,
( member(f1(A,B),A)
| member(f1(A,B),B)
| A = B ),
file('SET013-4.p',unknown),
[] ).
cnf(15,axiom,
intersection(as,bs) = cs,
file('SET013-4.p',unknown),
[] ).
cnf(18,axiom,
intersection(bs,as) = ds,
file('SET013-4.p',unknown),
[] ).
cnf(22,plain,
( member(A,cs)
| ~ member(A,as)
| ~ member(A,bs) ),
inference(para_from,[status(thm),theory(equality)],[15,5]),
[iquote('para_from,15.1.1,5.1.2')] ).
cnf(23,plain,
( ~ member(A,cs)
| member(A,bs) ),
inference(para_from,[status(thm),theory(equality)],[15,4]),
[iquote('para_from,15.1.1,4.1.2')] ).
cnf(24,plain,
( ~ member(A,cs)
| member(A,as) ),
inference(para_from,[status(thm),theory(equality)],[15,3]),
[iquote('para_from,15.1.1,3.1.2')] ).
cnf(27,plain,
( A = ds
| ~ member(f1(ds,A),ds)
| ~ member(f1(ds,A),A) ),
inference(demod,[status(thm),theory(equality)],[inference(para_into,[status(thm),theory(equality)],[18,2]),18,18,18]),
[iquote('para_into,17.1.1,2.3.1,demod,18,18,18')] ).
cnf(28,plain,
( member(A,ds)
| ~ member(A,bs)
| ~ member(A,as) ),
inference(para_from,[status(thm),theory(equality)],[18,5]),
[iquote('para_from,17.1.1,5.1.2')] ).
cnf(29,plain,
( ~ member(A,ds)
| member(A,as) ),
inference(para_from,[status(thm),theory(equality)],[18,4]),
[iquote('para_from,17.1.1,4.1.2')] ).
cnf(30,plain,
( ~ member(A,ds)
| member(A,bs) ),
inference(para_from,[status(thm),theory(equality)],[18,3]),
[iquote('para_from,17.1.1,3.1.2')] ).
cnf(95,plain,
( member(f1(ds,A),A)
| ds = A
| member(f1(ds,A),bs) ),
inference(hyper,[status(thm)],[14,30]),
[iquote('hyper,14,30')] ).
cnf(96,plain,
( member(f1(ds,A),A)
| ds = A
| member(f1(ds,A),as) ),
inference(hyper,[status(thm)],[14,29]),
[iquote('hyper,14,29')] ).
cnf(5747,plain,
member(f1(ds,cs),bs),
inference(factor_simp,[status(thm)],[inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[95,23]),9])]),
[iquote('hyper,95,23,unit_del,9,factor_simp')] ).
cnf(5781,plain,
member(f1(ds,cs),as),
inference(factor_simp,[status(thm)],[inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[96,24]),9])]),
[iquote('hyper,96,24,unit_del,9,factor_simp')] ).
cnf(5782,plain,
member(f1(ds,cs),cs),
inference(factor_simp,[status(thm)],[inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[96,22,5747]),9])]),
[iquote('hyper,96,22,5747,unit_del,9,factor_simp')] ).
cnf(5786,plain,
member(f1(ds,cs),ds),
inference(hyper,[status(thm)],[5781,28,5747]),
[iquote('hyper,5781,28,5747')] ).
cnf(5865,plain,
ds = cs,
inference(flip,[status(thm),theory(equality)],[inference(hyper,[status(thm)],[5786,27,5782])]),
[iquote('hyper,5786,27,5782,flip.1')] ).
cnf(5867,plain,
$false,
inference(binary,[status(thm)],[5865,9]),
[iquote('binary,5865.1,9.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SET013-4 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n015.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:45:57 EDT 2022
% 0.12/0.33 % CPUTime :
% 6.88/7.06 ----- Otter 3.3f, August 2004 -----
% 6.88/7.06 The process was started by sandbox on n015.cluster.edu,
% 6.88/7.06 Wed Jul 27 10:45:57 2022
% 6.88/7.06 The command was "./otter". The process ID is 14565.
% 6.88/7.06
% 6.88/7.06 set(prolog_style_variables).
% 6.88/7.06 set(auto).
% 6.88/7.06 dependent: set(auto1).
% 6.88/7.06 dependent: set(process_input).
% 6.88/7.06 dependent: clear(print_kept).
% 6.88/7.06 dependent: clear(print_new_demod).
% 6.88/7.06 dependent: clear(print_back_demod).
% 6.88/7.06 dependent: clear(print_back_sub).
% 6.88/7.06 dependent: set(control_memory).
% 6.88/7.06 dependent: assign(max_mem, 12000).
% 6.88/7.06 dependent: assign(pick_given_ratio, 4).
% 6.88/7.06 dependent: assign(stats_level, 1).
% 6.88/7.06 dependent: assign(max_seconds, 10800).
% 6.88/7.06 clear(print_given).
% 6.88/7.06
% 6.88/7.06 list(usable).
% 6.88/7.06 0 [] A=A.
% 6.88/7.06 0 [] -member(X,Y)|little_set(X).
% 6.88/7.06 0 [] little_set(f1(X,Y))|X=Y.
% 6.88/7.06 0 [] member(f1(X,Y),X)|member(f1(X,Y),Y)|X=Y.
% 6.88/7.06 0 [] -member(f1(X,Y),X)| -member(f1(X,Y),Y)|X=Y.
% 6.88/7.06 0 [] -member(Z,intersection(X,Y))|member(Z,X).
% 6.88/7.06 0 [] -member(Z,intersection(X,Y))|member(Z,Y).
% 6.88/7.06 0 [] member(Z,intersection(X,Y))| -member(Z,X)| -member(Z,Y).
% 6.88/7.06 0 [] -member(Z,empty_set).
% 6.88/7.06 0 [] member(Z,universal_set)| -little_set(Z).
% 6.88/7.06 0 [] intersection(as,bs)=cs.
% 6.88/7.06 0 [] intersection(bs,as)=ds.
% 6.88/7.06 0 [] cs!=ds.
% 6.88/7.06 end_of_list.
% 6.88/7.06
% 6.88/7.06 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=3.
% 6.88/7.06
% 6.88/7.06 This ia a non-Horn set with equality. The strategy will be
% 6.88/7.06 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 6.88/7.06 deletion, with positive clauses in sos and nonpositive
% 6.88/7.06 clauses in usable.
% 6.88/7.06
% 6.88/7.06 dependent: set(knuth_bendix).
% 6.88/7.06 dependent: set(anl_eq).
% 6.88/7.06 dependent: set(para_from).
% 6.88/7.06 dependent: set(para_into).
% 6.88/7.06 dependent: clear(para_from_right).
% 6.88/7.06 dependent: clear(para_into_right).
% 6.88/7.06 dependent: set(para_from_vars).
% 6.88/7.06 dependent: set(eq_units_both_ways).
% 6.88/7.06 dependent: set(dynamic_demod_all).
% 6.88/7.06 dependent: set(dynamic_demod).
% 6.88/7.06 dependent: set(order_eq).
% 6.88/7.06 dependent: set(back_demod).
% 6.88/7.06 dependent: set(lrpo).
% 6.88/7.06 dependent: set(hyper_res).
% 6.88/7.06 dependent: set(unit_deletion).
% 6.88/7.06 dependent: set(factor).
% 6.88/7.06
% 6.88/7.06 ------------> process usable:
% 6.88/7.06 ** KEPT (pick-wt=5): 1 [] -member(A,B)|little_set(A).
% 6.88/7.06 ** KEPT (pick-wt=13): 2 [] -member(f1(A,B),A)| -member(f1(A,B),B)|A=B.
% 6.88/7.06 ** KEPT (pick-wt=8): 3 [] -member(A,intersection(B,C))|member(A,B).
% 6.88/7.06 ** KEPT (pick-wt=8): 4 [] -member(A,intersection(B,C))|member(A,C).
% 6.88/7.06 ** KEPT (pick-wt=11): 5 [] member(A,intersection(B,C))| -member(A,B)| -member(A,C).
% 6.88/7.06 ** KEPT (pick-wt=3): 6 [] -member(A,empty_set).
% 6.88/7.06 ** KEPT (pick-wt=5): 7 [] member(A,universal_set)| -little_set(A).
% 6.88/7.06 ** KEPT (pick-wt=3): 9 [copy,8,flip.1] ds!=cs.
% 6.88/7.06
% 6.88/7.06 ------------> process sos:
% 6.88/7.06 ** KEPT (pick-wt=3): 12 [] A=A.
% 6.88/7.06 ** KEPT (pick-wt=7): 13 [] little_set(f1(A,B))|A=B.
% 6.88/7.06 ** KEPT (pick-wt=13): 14 [] member(f1(A,B),A)|member(f1(A,B),B)|A=B.
% 6.88/7.06 ** KEPT (pick-wt=5): 15 [] intersection(as,bs)=cs.
% 6.88/7.06 ---> New Demodulator: 16 [new_demod,15] intersection(as,bs)=cs.
% 6.88/7.06 ** KEPT (pick-wt=5): 17 [] intersection(bs,as)=ds.
% 6.88/7.06 ---> New Demodulator: 18 [new_demod,17] intersection(bs,as)=ds.
% 6.88/7.06 Following clause subsumed by 12 during input processing: 0 [copy,12,flip.1] A=A.
% 6.88/7.06 12 back subsumes 10.
% 6.88/7.06 >>>> Starting back demodulation with 16.
% 6.88/7.06 >>>> Starting back demodulation with 18.
% 6.88/7.06
% 6.88/7.06 ======= end of input processing =======
% 6.88/7.06
% 6.88/7.06 =========== start of search ===========
% 6.88/7.06
% 6.88/7.06
% 6.88/7.06 Resetting weight limit to 10.
% 6.88/7.06
% 6.88/7.06
% 6.88/7.06 Resetting weight limit to 10.
% 6.88/7.06
% 6.88/7.06 sos_size=4586
% 6.88/7.06
% 6.88/7.06
% 6.88/7.06 Resetting weight limit to 9.
% 6.88/7.06
% 6.88/7.06
% 6.88/7.06 Resetting weight limit to 9.
% 6.88/7.06
% 6.88/7.06 sos_size=4619
% 6.88/7.06
% 6.88/7.06 -------- PROOF --------
% 6.88/7.06
% 6.88/7.06 ----> UNIT CONFLICT at 4.96 sec ----> 5867 [binary,5865.1,9.1] $F.
% 6.88/7.06
% 6.88/7.06 Length of proof is 15. Level of proof is 5.
% 6.88/7.06
% 6.88/7.06 ---------------- PROOF ----------------
% 6.88/7.06 % SZS status Unsatisfiable
% 6.88/7.06 % SZS output start Refutation
% See solution above
% 6.88/7.06 ------------ end of proof -------------
% 6.88/7.06
% 6.88/7.06
% 6.88/7.06 Search stopped by max_proofs option.
% 6.88/7.06
% 6.88/7.06
% 6.88/7.06 Search stopped by max_proofs option.
% 6.88/7.06
% 6.88/7.06 ============ end of search ============
% 6.88/7.06
% 6.88/7.06 -------------- statistics -------------
% 6.88/7.06 clauses given 320
% 6.88/7.06 clauses generated 60814
% 6.88/7.06 clauses kept 5862
% 6.88/7.06 clauses forward subsumed 6906
% 6.88/7.06 clauses back subsumed 994
% 6.88/7.06 Kbytes malloced 4882
% 6.88/7.06
% 6.88/7.06 ----------- times (seconds) -----------
% 6.88/7.06 user CPU time 4.96 (0 hr, 0 min, 4 sec)
% 6.88/7.06 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 6.88/7.06 wall-clock time 6 (0 hr, 0 min, 6 sec)
% 6.88/7.06
% 6.88/7.06 That finishes the proof of the theorem.
% 6.88/7.06
% 6.88/7.06 Process 14565 finished Wed Jul 27 10:46:03 2022
% 6.88/7.06 Otter interrupted
% 6.88/7.06 PROOF FOUND
%------------------------------------------------------------------------------