TSTP Solution File: SEU133+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU133+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n012.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:51 EDT 2022
% Result : Theorem 1.75s 1.93s
% Output : Refutation 1.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 9 ( 6 unt; 1 nHn; 7 RR)
% Number of literals : 13 ( 2 equ; 4 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 9 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(3,axiom,
( subset(A,B)
| ~ in(dollar_f1(A,B),B) ),
file('SEU133+1.p',unknown),
[] ).
cnf(4,axiom,
( A != set_difference(B,C)
| ~ in(D,A)
| in(D,B) ),
file('SEU133+1.p',unknown),
[] ).
cnf(10,axiom,
~ subset(set_difference(dollar_c4,dollar_c3),dollar_c4),
file('SEU133+1.p',unknown),
[] ).
cnf(19,axiom,
A = A,
file('SEU133+1.p',unknown),
[] ).
cnf(20,axiom,
( subset(A,B)
| in(dollar_f1(A,B),A) ),
file('SEU133+1.p',unknown),
[] ).
cnf(43,plain,
in(dollar_f1(set_difference(dollar_c4,dollar_c3),dollar_c4),set_difference(dollar_c4,dollar_c3)),
inference(hyper,[status(thm)],[20,10]),
[iquote('hyper,20,10')] ).
cnf(331,plain,
in(dollar_f1(set_difference(dollar_c4,dollar_c3),dollar_c4),dollar_c4),
inference(hyper,[status(thm)],[43,4,19]),
[iquote('hyper,43,4,19')] ).
cnf(425,plain,
subset(set_difference(dollar_c4,dollar_c3),dollar_c4),
inference(hyper,[status(thm)],[331,3]),
[iquote('hyper,331,3')] ).
cnf(426,plain,
$false,
inference(binary,[status(thm)],[425,10]),
[iquote('binary,425.1,10.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : SEU133+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n012.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 07:44:05 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.67/1.89 ----- Otter 3.3f, August 2004 -----
% 1.67/1.89 The process was started by sandbox2 on n012.cluster.edu,
% 1.67/1.89 Wed Jul 27 07:44:05 2022
% 1.67/1.89 The command was "./otter". The process ID is 2020.
% 1.67/1.89
% 1.67/1.89 set(prolog_style_variables).
% 1.67/1.89 set(auto).
% 1.67/1.89 dependent: set(auto1).
% 1.67/1.89 dependent: set(process_input).
% 1.67/1.89 dependent: clear(print_kept).
% 1.67/1.89 dependent: clear(print_new_demod).
% 1.67/1.89 dependent: clear(print_back_demod).
% 1.67/1.89 dependent: clear(print_back_sub).
% 1.67/1.89 dependent: set(control_memory).
% 1.67/1.89 dependent: assign(max_mem, 12000).
% 1.67/1.89 dependent: assign(pick_given_ratio, 4).
% 1.67/1.89 dependent: assign(stats_level, 1).
% 1.67/1.89 dependent: assign(max_seconds, 10800).
% 1.67/1.89 clear(print_given).
% 1.67/1.89
% 1.67/1.89 formula_list(usable).
% 1.67/1.89 all A (A=A).
% 1.67/1.89 all A B (in(A,B)-> -in(B,A)).
% 1.67/1.89 all A B (subset(A,B)<-> (all C (in(C,A)->in(C,B)))).
% 1.67/1.89 all A B C (C=set_difference(A,B)<-> (all D (in(D,C)<->in(D,A)& -in(D,B)))).
% 1.67/1.89 $T.
% 1.67/1.89 $T.
% 1.67/1.89 empty(empty_set).
% 1.67/1.89 exists A empty(A).
% 1.67/1.89 exists A (-empty(A)).
% 1.67/1.89 all A B subset(A,A).
% 1.67/1.89 -(all A B subset(set_difference(A,B),A)).
% 1.67/1.89 all A (set_difference(A,empty_set)=A).
% 1.67/1.89 all A (set_difference(empty_set,A)=empty_set).
% 1.67/1.89 all A (empty(A)->A=empty_set).
% 1.67/1.89 all A B (-(in(A,B)&empty(B))).
% 1.67/1.89 all A B (-(empty(A)&A!=B&empty(B))).
% 1.67/1.89 end_of_list.
% 1.67/1.89
% 1.67/1.89 -------> usable clausifies to:
% 1.67/1.89
% 1.67/1.89 list(usable).
% 1.67/1.89 0 [] A=A.
% 1.67/1.89 0 [] -in(A,B)| -in(B,A).
% 1.67/1.89 0 [] -subset(A,B)| -in(C,A)|in(C,B).
% 1.67/1.89 0 [] subset(A,B)|in($f1(A,B),A).
% 1.67/1.89 0 [] subset(A,B)| -in($f1(A,B),B).
% 1.67/1.89 0 [] C!=set_difference(A,B)| -in(D,C)|in(D,A).
% 1.67/1.89 0 [] C!=set_difference(A,B)| -in(D,C)| -in(D,B).
% 1.67/1.89 0 [] C!=set_difference(A,B)|in(D,C)| -in(D,A)|in(D,B).
% 1.67/1.89 0 [] C=set_difference(A,B)|in($f2(A,B,C),C)|in($f2(A,B,C),A).
% 1.67/1.89 0 [] C=set_difference(A,B)|in($f2(A,B,C),C)| -in($f2(A,B,C),B).
% 1.67/1.89 0 [] C=set_difference(A,B)| -in($f2(A,B,C),C)| -in($f2(A,B,C),A)|in($f2(A,B,C),B).
% 1.67/1.89 0 [] $T.
% 1.67/1.89 0 [] $T.
% 1.67/1.89 0 [] empty(empty_set).
% 1.67/1.89 0 [] empty($c1).
% 1.67/1.89 0 [] -empty($c2).
% 1.67/1.89 0 [] subset(A,A).
% 1.67/1.89 0 [] -subset(set_difference($c4,$c3),$c4).
% 1.67/1.89 0 [] set_difference(A,empty_set)=A.
% 1.67/1.89 0 [] set_difference(empty_set,A)=empty_set.
% 1.67/1.89 0 [] -empty(A)|A=empty_set.
% 1.67/1.89 0 [] -in(A,B)| -empty(B).
% 1.67/1.89 0 [] -empty(A)|A=B| -empty(B).
% 1.67/1.89 end_of_list.
% 1.67/1.89
% 1.67/1.89 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 1.67/1.89
% 1.67/1.89 This ia a non-Horn set with equality. The strategy will be
% 1.67/1.89 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.67/1.89 deletion, with positive clauses in sos and nonpositive
% 1.67/1.89 clauses in usable.
% 1.67/1.89
% 1.67/1.89 dependent: set(knuth_bendix).
% 1.67/1.89 dependent: set(anl_eq).
% 1.67/1.89 dependent: set(para_from).
% 1.67/1.89 dependent: set(para_into).
% 1.67/1.89 dependent: clear(para_from_right).
% 1.67/1.89 dependent: clear(para_into_right).
% 1.67/1.89 dependent: set(para_from_vars).
% 1.67/1.89 dependent: set(eq_units_both_ways).
% 1.67/1.89 dependent: set(dynamic_demod_all).
% 1.67/1.89 dependent: set(dynamic_demod).
% 1.67/1.89 dependent: set(order_eq).
% 1.67/1.89 dependent: set(back_demod).
% 1.67/1.89 dependent: set(lrpo).
% 1.67/1.89 dependent: set(hyper_res).
% 1.67/1.89 dependent: set(unit_deletion).
% 1.67/1.89 dependent: set(factor).
% 1.67/1.89
% 1.67/1.89 ------------> process usable:
% 1.67/1.89 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 1.67/1.89 ** KEPT (pick-wt=9): 2 [] -subset(A,B)| -in(C,A)|in(C,B).
% 1.67/1.89 ** KEPT (pick-wt=8): 3 [] subset(A,B)| -in($f1(A,B),B).
% 1.67/1.89 ** KEPT (pick-wt=11): 4 [] A!=set_difference(B,C)| -in(D,A)|in(D,B).
% 1.67/1.89 ** KEPT (pick-wt=11): 5 [] A!=set_difference(B,C)| -in(D,A)| -in(D,C).
% 1.67/1.89 ** KEPT (pick-wt=14): 6 [] A!=set_difference(B,C)|in(D,A)| -in(D,B)|in(D,C).
% 1.67/1.89 ** KEPT (pick-wt=17): 7 [] A=set_difference(B,C)|in($f2(B,C,A),A)| -in($f2(B,C,A),C).
% 1.67/1.89 ** KEPT (pick-wt=23): 8 [] A=set_difference(B,C)| -in($f2(B,C,A),A)| -in($f2(B,C,A),B)|in($f2(B,C,A),C).
% 1.67/1.89 ** KEPT (pick-wt=2): 9 [] -empty($c2).
% 1.67/1.89 ** KEPT (pick-wt=5): 10 [] -subset(set_difference($c4,$c3),$c4).
% 1.67/1.89 ** KEPT (pick-wt=5): 11 [] -empty(A)|A=empty_set.
% 1.67/1.89 ** KEPT (pick-wt=5): 12 [] -in(A,B)| -empty(B).
% 1.67/1.89 ** KEPT (pick-wt=7): 13 [] -empty(A)|A=B| -empty(B).
% 1.67/1.89
% 1.67/1.89 ------------> process sos:
% 1.67/1.89 ** KEPT (pick-wt=3): 19 [] A=A.
% 1.67/1.89 ** KEPT (pick-wt=8): 20 [] subset(A,B)|in($f1(A,B),A).
% 1.67/1.89 ** KEPT (pick-wt=17): 21 [] A=set_difference(B,C)|in($f2(B,C,A),A)|in($f2(B,C,A),B).
% 1.67/1.89 ** KEPT (pick-wt=2): 22 [] empty(empty_set).
% 1.67/1.89 ** KEPT (pick-wt=2): 23 [] empty($c1).
% 1.67/1.89 ** KEPT (pick-wt=3): 24 [] subset(A,A).
% 1.67/1.89 ** KEPT (pick-wt=5): 25 [] set_difference(A,empty_set)=A.
% 1.67/1.89 ---> New Demodulator: 26 [new_demod,25] set_difference(A,empty_set)=A.
% 1.75/1.93 ** KEPT (pick-wt=5): 27 [] set_difference(empty_set,A)=empty_set.
% 1.75/1.93 ---> New Demodulator: 28 [new_demod,27] set_difference(empty_set,A)=empty_set.
% 1.75/1.93 Following clause subsumed by 19 during input processing: 0 [copy,19,flip.1] A=A.
% 1.75/1.93 19 back subsumes 18.
% 1.75/1.93 >>>> Starting back demodulation with 26.
% 1.75/1.93 >>>> Starting back demodulation with 28.
% 1.75/1.93
% 1.75/1.93 ======= end of input processing =======
% 1.75/1.93
% 1.75/1.93 =========== start of search ===========
% 1.75/1.93
% 1.75/1.93 -------- PROOF --------
% 1.75/1.93
% 1.75/1.93 ----> UNIT CONFLICT at 0.04 sec ----> 426 [binary,425.1,10.1] $F.
% 1.75/1.93
% 1.75/1.93 Length of proof is 3. Level of proof is 3.
% 1.75/1.93
% 1.75/1.93 ---------------- PROOF ----------------
% 1.75/1.93 % SZS status Theorem
% 1.75/1.93 % SZS output start Refutation
% See solution above
% 1.75/1.93 ------------ end of proof -------------
% 1.75/1.93
% 1.75/1.93
% 1.75/1.93 Search stopped by max_proofs option.
% 1.75/1.93
% 1.75/1.93
% 1.75/1.93 Search stopped by max_proofs option.
% 1.75/1.93
% 1.75/1.93 ============ end of search ============
% 1.75/1.93
% 1.75/1.93 -------------- statistics -------------
% 1.75/1.93 clauses given 27
% 1.75/1.93 clauses generated 783
% 1.75/1.93 clauses kept 420
% 1.75/1.93 clauses forward subsumed 362
% 1.75/1.93 clauses back subsumed 22
% 1.75/1.93 Kbytes malloced 1953
% 1.75/1.93
% 1.75/1.93 ----------- times (seconds) -----------
% 1.75/1.93 user CPU time 0.04 (0 hr, 0 min, 0 sec)
% 1.75/1.93 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.75/1.93 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.75/1.93
% 1.75/1.93 That finishes the proof of the theorem.
% 1.75/1.93
% 1.75/1.93 Process 2020 finished Wed Jul 27 07:44:07 2022
% 1.75/1.93 Otter interrupted
% 1.75/1.93 PROOF FOUND
%------------------------------------------------------------------------------