TSTP Solution File: SET884+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SET884+1 : TPTP v8.1.0. Released v3.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:14:28 EDT 2022
% Result : Theorem 2.00s 2.20s
% Output : Refutation 2.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 8
% Syntax : Number of clauses : 11 ( 8 unt; 1 nHn; 8 RR)
% Number of literals : 18 ( 9 equ; 8 neg)
% Maximal clause size : 4 ( 1 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 14 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(3,axiom,
( A != singleton(B)
| in(C,A)
| C != B ),
file('SET884+1.p',unknown),
[] ).
cnf(5,axiom,
( A != unordered_pair(B,C)
| ~ in(D,A)
| D = B
| D = C ),
file('SET884+1.p',unknown),
[] ).
cnf(10,axiom,
( ~ subset(A,B)
| ~ in(C,A)
| in(C,B) ),
file('SET884+1.p',unknown),
[] ).
cnf(13,axiom,
dollar_c5 != dollar_c4,
file('SET884+1.p',unknown),
[] ).
cnf(14,axiom,
dollar_c5 != dollar_c3,
file('SET884+1.p',unknown),
[] ).
cnf(17,axiom,
A = A,
file('SET884+1.p',unknown),
[] ).
cnf(18,axiom,
unordered_pair(A,B) = unordered_pair(B,A),
file('SET884+1.p',unknown),
[] ).
cnf(24,axiom,
subset(singleton(dollar_c5),unordered_pair(dollar_c4,dollar_c3)),
file('SET884+1.p',unknown),
[] ).
cnf(28,plain,
in(A,singleton(A)),
inference(hyper,[status(thm)],[17,3,17]),
[iquote('hyper,17,3,17')] ).
cnf(67,plain,
in(dollar_c5,unordered_pair(dollar_c4,dollar_c3)),
inference(hyper,[status(thm)],[24,10,28]),
[iquote('hyper,24,10,28')] ).
cnf(104,plain,
$false,
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[67,5,18]),14,13]),
[iquote('hyper,67,5,18,unit_del,14,13')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SET884+1 : TPTP v8.1.0. Released v3.2.0.
% 0.12/0.13 % Command : otter-tptp-script %s
% 0.12/0.34 % Computer : n006.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:52:01 EDT 2022
% 0.12/0.34 % CPUTime :
% 2.00/2.19 ----- Otter 3.3f, August 2004 -----
% 2.00/2.19 The process was started by sandbox on n006.cluster.edu,
% 2.00/2.19 Wed Jul 27 10:52:02 2022
% 2.00/2.19 The command was "./otter". The process ID is 13293.
% 2.00/2.19
% 2.00/2.19 set(prolog_style_variables).
% 2.00/2.19 set(auto).
% 2.00/2.19 dependent: set(auto1).
% 2.00/2.19 dependent: set(process_input).
% 2.00/2.19 dependent: clear(print_kept).
% 2.00/2.19 dependent: clear(print_new_demod).
% 2.00/2.19 dependent: clear(print_back_demod).
% 2.00/2.19 dependent: clear(print_back_sub).
% 2.00/2.19 dependent: set(control_memory).
% 2.00/2.19 dependent: assign(max_mem, 12000).
% 2.00/2.19 dependent: assign(pick_given_ratio, 4).
% 2.00/2.19 dependent: assign(stats_level, 1).
% 2.00/2.19 dependent: assign(max_seconds, 10800).
% 2.00/2.19 clear(print_given).
% 2.00/2.19
% 2.00/2.19 formula_list(usable).
% 2.00/2.19 all A (A=A).
% 2.00/2.19 all A B (in(A,B)-> -in(B,A)).
% 2.00/2.19 all A B (unordered_pair(A,B)=unordered_pair(B,A)).
% 2.00/2.19 all A B (B=singleton(A)<-> (all C (in(C,B)<->C=A))).
% 2.00/2.19 all A B C (C=unordered_pair(A,B)<-> (all D (in(D,C)<->D=A|D=B))).
% 2.00/2.19 all A B (subset(A,B)<-> (all C (in(C,A)->in(C,B)))).
% 2.00/2.19 exists A empty(A).
% 2.00/2.19 exists A (-empty(A)).
% 2.00/2.19 all A B subset(A,A).
% 2.00/2.19 -(all A B C (-(subset(singleton(A),unordered_pair(B,C))&A!=B&A!=C))).
% 2.00/2.19 end_of_list.
% 2.00/2.19
% 2.00/2.19 -------> usable clausifies to:
% 2.00/2.19
% 2.00/2.19 list(usable).
% 2.00/2.19 0 [] A=A.
% 2.00/2.19 0 [] -in(A,B)| -in(B,A).
% 2.00/2.19 0 [] unordered_pair(A,B)=unordered_pair(B,A).
% 2.00/2.19 0 [] B!=singleton(A)| -in(C,B)|C=A.
% 2.00/2.19 0 [] B!=singleton(A)|in(C,B)|C!=A.
% 2.00/2.19 0 [] B=singleton(A)|in($f1(A,B),B)|$f1(A,B)=A.
% 2.00/2.19 0 [] B=singleton(A)| -in($f1(A,B),B)|$f1(A,B)!=A.
% 2.00/2.19 0 [] C!=unordered_pair(A,B)| -in(D,C)|D=A|D=B.
% 2.00/2.19 0 [] C!=unordered_pair(A,B)|in(D,C)|D!=A.
% 2.00/2.19 0 [] C!=unordered_pair(A,B)|in(D,C)|D!=B.
% 2.00/2.19 0 [] C=unordered_pair(A,B)|in($f2(A,B,C),C)|$f2(A,B,C)=A|$f2(A,B,C)=B.
% 2.00/2.19 0 [] C=unordered_pair(A,B)| -in($f2(A,B,C),C)|$f2(A,B,C)!=A.
% 2.00/2.19 0 [] C=unordered_pair(A,B)| -in($f2(A,B,C),C)|$f2(A,B,C)!=B.
% 2.00/2.19 0 [] -subset(A,B)| -in(C,A)|in(C,B).
% 2.00/2.19 0 [] subset(A,B)|in($f3(A,B),A).
% 2.00/2.19 0 [] subset(A,B)| -in($f3(A,B),B).
% 2.00/2.19 0 [] empty($c1).
% 2.00/2.19 0 [] -empty($c2).
% 2.00/2.19 0 [] subset(A,A).
% 2.00/2.19 0 [] subset(singleton($c5),unordered_pair($c4,$c3)).
% 2.00/2.19 0 [] $c5!=$c4.
% 2.00/2.19 0 [] $c5!=$c3.
% 2.00/2.19 end_of_list.
% 2.00/2.19
% 2.00/2.19 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 2.00/2.19
% 2.00/2.19 This ia a non-Horn set with equality. The strategy will be
% 2.00/2.19 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 2.00/2.19 deletion, with positive clauses in sos and nonpositive
% 2.00/2.19 clauses in usable.
% 2.00/2.19
% 2.00/2.19 dependent: set(knuth_bendix).
% 2.00/2.19 dependent: set(anl_eq).
% 2.00/2.19 dependent: set(para_from).
% 2.00/2.19 dependent: set(para_into).
% 2.00/2.19 dependent: clear(para_from_right).
% 2.00/2.19 dependent: clear(para_into_right).
% 2.00/2.19 dependent: set(para_from_vars).
% 2.00/2.19 dependent: set(eq_units_both_ways).
% 2.00/2.19 dependent: set(dynamic_demod_all).
% 2.00/2.19 dependent: set(dynamic_demod).
% 2.00/2.19 dependent: set(order_eq).
% 2.00/2.19 dependent: set(back_demod).
% 2.00/2.19 dependent: set(lrpo).
% 2.00/2.19 dependent: set(hyper_res).
% 2.00/2.19 dependent: set(unit_deletion).
% 2.00/2.19 dependent: set(factor).
% 2.00/2.19
% 2.00/2.19 ------------> process usable:
% 2.00/2.19 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 2.00/2.19 ** KEPT (pick-wt=10): 2 [] A!=singleton(B)| -in(C,A)|C=B.
% 2.00/2.19 ** KEPT (pick-wt=10): 3 [] A!=singleton(B)|in(C,A)|C!=B.
% 2.00/2.19 ** KEPT (pick-wt=14): 4 [] A=singleton(B)| -in($f1(B,A),A)|$f1(B,A)!=B.
% 2.00/2.19 ** KEPT (pick-wt=14): 5 [] A!=unordered_pair(B,C)| -in(D,A)|D=B|D=C.
% 2.00/2.19 ** KEPT (pick-wt=11): 6 [] A!=unordered_pair(B,C)|in(D,A)|D!=B.
% 2.00/2.19 ** KEPT (pick-wt=11): 7 [] A!=unordered_pair(B,C)|in(D,A)|D!=C.
% 2.00/2.19 ** KEPT (pick-wt=17): 8 [] A=unordered_pair(B,C)| -in($f2(B,C,A),A)|$f2(B,C,A)!=B.
% 2.00/2.19 ** KEPT (pick-wt=17): 9 [] A=unordered_pair(B,C)| -in($f2(B,C,A),A)|$f2(B,C,A)!=C.
% 2.00/2.19 ** KEPT (pick-wt=9): 10 [] -subset(A,B)| -in(C,A)|in(C,B).
% 2.00/2.19 ** KEPT (pick-wt=8): 11 [] subset(A,B)| -in($f3(A,B),B).
% 2.00/2.19 ** KEPT (pick-wt=2): 12 [] -empty($c2).
% 2.00/2.19 ** KEPT (pick-wt=3): 13 [] $c5!=$c4.
% 2.00/2.19 ** KEPT (pick-wt=3): 14 [] $c5!=$c3.
% 2.00/2.19
% 2.00/2.19 ------------> process sos:
% 2.00/2.19 ** KEPT (pick-wt=3): 17 [] A=A.
% 2.00/2.19 ** KEPT (pick-wt=7): 18 [] unordered_pair(A,B)=unordered_pair(B,A).
% 2.00/2.19 ** KEPT (pick-wt=14): 19 [] A=singleton(B)|in($f1(B,A),A)|$f1(B,A)=B.
% 2.00/2.19 ** KEPT (pick-wt=23): 20 [] A=unordered_pair(B,C)|in($f2(B,C,A),A)|$f2(B,C,A)=B|$f2(B,C,A)=C.
% 2.00/2.19 ** KEPT (pick-wt=8): 21 [] subset(A,B)|in($f3(A,B),A).
% 2.00/2.19 ** KEPT (pick-wt=2): 22 [] empty($c1).
% 2.00/2.19 ** KEPT (pick-wt=3): 23 [] subset(A,A).
% 2.00/2.19 ** KEPT (pick-wt=6): 24 [] subset(singleton($c5),unordered_pair($c4,$c3)).
% 2.00/2.19 Following clause subsumed by 17 during input processing: 0 [copy,17,flip.1] A=A.
% 2.00/2.20 Following clause subsumed by 18 during input processing: 0 [copy,18,flip.1] unordered_pair(A,B)=unordered_pair(B,A).
% 2.00/2.20
% 2.00/2.20 ======= end of input processing =======
% 2.00/2.20
% 2.00/2.20 =========== start of search ===========
% 2.00/2.20
% 2.00/2.20 -------- PROOF --------
% 2.00/2.20
% 2.00/2.20 -----> EMPTY CLAUSE at 0.01 sec ----> 104 [hyper,67,5,18,unit_del,14,13] $F.
% 2.00/2.20
% 2.00/2.20 Length of proof is 2. Level of proof is 2.
% 2.00/2.20
% 2.00/2.20 ---------------- PROOF ----------------
% 2.00/2.20 % SZS status Theorem
% 2.00/2.20 % SZS output start Refutation
% See solution above
% 2.00/2.20 ------------ end of proof -------------
% 2.00/2.20
% 2.00/2.20
% 2.00/2.20 Search stopped by max_proofs option.
% 2.00/2.20
% 2.00/2.20
% 2.00/2.20 Search stopped by max_proofs option.
% 2.00/2.20
% 2.00/2.20 ============ end of search ============
% 2.00/2.20
% 2.00/2.20 -------------- statistics -------------
% 2.00/2.20 clauses given 9
% 2.00/2.20 clauses generated 110
% 2.00/2.20 clauses kept 103
% 2.00/2.20 clauses forward subsumed 30
% 2.00/2.20 clauses back subsumed 0
% 2.00/2.20 Kbytes malloced 976
% 2.00/2.20
% 2.00/2.20 ----------- times (seconds) -----------
% 2.00/2.20 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 2.00/2.20 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.00/2.20 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 2.00/2.20
% 2.00/2.20 That finishes the proof of the theorem.
% 2.00/2.20
% 2.00/2.20 Process 13293 finished Wed Jul 27 10:52:03 2022
% 2.00/2.20 Otter interrupted
% 2.00/2.20 PROOF FOUND
%------------------------------------------------------------------------------