TSTP Solution File: SEU130+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU130+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n008.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.94s 2.11s
% Output : Refutation 1.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 6
% Syntax : Number of clauses : 12 ( 7 unt; 2 nHn; 9 RR)
% Number of literals : 22 ( 7 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 : 4 ( 4 usr; 2 con; 0-3 aty)
% Number of variables : 14 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(5,axiom,
( ~ subset(A,B)
| ~ in(C,A)
| in(C,B) ),
file('SEU130+1.p',unknown),
[] ).
cnf(10,axiom,
( A = set_intersection2(B,C)
| ~ in(dollar_f2(B,C,A),A)
| ~ in(dollar_f2(B,C,A),B)
| ~ in(dollar_f2(B,C,A),C) ),
file('SEU130+1.p',unknown),
[] ).
cnf(12,axiom,
set_intersection2(dollar_c4,dollar_c3) != dollar_c4,
file('SEU130+1.p',unknown),
[] ).
cnf(19,plain,
( set_intersection2(A,B) = A
| ~ in(dollar_f2(A,B,A),A)
| ~ in(dollar_f2(A,B,A),B) ),
inference(flip,[status(thm),theory(equality)],[inference(factor,[status(thm)],[10])]),
[iquote('factor,10.2.3,flip.1')] ).
cnf(24,axiom,
A = A,
file('SEU130+1.p',unknown),
[] ).
cnf(27,axiom,
( A = set_intersection2(B,C)
| in(dollar_f2(B,C,A),A)
| in(dollar_f2(B,C,A),B) ),
file('SEU130+1.p',unknown),
[] ).
cnf(35,axiom,
subset(dollar_c4,dollar_c3),
file('SEU130+1.p',unknown),
[] ).
cnf(38,plain,
( set_intersection2(A,B) = A
| in(dollar_f2(A,B,A),A) ),
inference(flip,[status(thm),theory(equality)],[inference(factor,[status(thm)],[27])]),
[iquote('factor,27.2.3,flip.1')] ).
cnf(467,plain,
in(dollar_f2(dollar_c4,dollar_c3,dollar_c4),dollar_c4),
inference(unit_del,[status(thm)],[inference(para_from,[status(thm),theory(equality)],[38,12]),24]),
[iquote('para_from,38.1.1,12.1.1,unit_del,24')] ).
cnf(827,plain,
in(dollar_f2(dollar_c4,dollar_c3,dollar_c4),dollar_c3),
inference(hyper,[status(thm)],[467,5,35]),
[iquote('hyper,467,5,35')] ).
cnf(1133,plain,
set_intersection2(dollar_c4,dollar_c3) = dollar_c4,
inference(hyper,[status(thm)],[827,19,467]),
[iquote('hyper,827,19,467')] ).
cnf(1135,plain,
$false,
inference(binary,[status(thm)],[1133,12]),
[iquote('binary,1133.1,12.1')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SEU130+1 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.13 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n008.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:59:08 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.75/1.93 ----- Otter 3.3f, August 2004 -----
% 1.75/1.93 The process was started by sandbox2 on n008.cluster.edu,
% 1.75/1.93 Wed Jul 27 07:59:08 2022
% 1.75/1.93 The command was "./otter". The process ID is 31624.
% 1.75/1.93
% 1.75/1.93 set(prolog_style_variables).
% 1.75/1.93 set(auto).
% 1.75/1.93 dependent: set(auto1).
% 1.75/1.93 dependent: set(process_input).
% 1.75/1.93 dependent: clear(print_kept).
% 1.75/1.93 dependent: clear(print_new_demod).
% 1.75/1.93 dependent: clear(print_back_demod).
% 1.75/1.93 dependent: clear(print_back_sub).
% 1.75/1.93 dependent: set(control_memory).
% 1.75/1.93 dependent: assign(max_mem, 12000).
% 1.75/1.93 dependent: assign(pick_given_ratio, 4).
% 1.75/1.93 dependent: assign(stats_level, 1).
% 1.75/1.93 dependent: assign(max_seconds, 10800).
% 1.75/1.93 clear(print_given).
% 1.75/1.93
% 1.75/1.93 formula_list(usable).
% 1.75/1.93 all A (A=A).
% 1.75/1.93 all A B (in(A,B)-> -in(B,A)).
% 1.75/1.93 all A B (set_intersection2(A,B)=set_intersection2(B,A)).
% 1.75/1.93 all A B (A=B<->subset(A,B)&subset(B,A)).
% 1.75/1.93 all A B (subset(A,B)<-> (all C (in(C,A)->in(C,B)))).
% 1.75/1.93 all A B C (C=set_intersection2(A,B)<-> (all D (in(D,C)<->in(D,A)&in(D,B)))).
% 1.75/1.93 $T.
% 1.75/1.93 $T.
% 1.75/1.93 empty(empty_set).
% 1.75/1.93 all A B (set_intersection2(A,A)=A).
% 1.75/1.93 exists A empty(A).
% 1.75/1.93 exists A (-empty(A)).
% 1.75/1.93 all A B subset(A,A).
% 1.75/1.93 all A B subset(set_intersection2(A,B),A).
% 1.75/1.93 -(all A B (subset(A,B)->set_intersection2(A,B)=A)).
% 1.75/1.93 all A (set_intersection2(A,empty_set)=empty_set).
% 1.75/1.93 all A (empty(A)->A=empty_set).
% 1.75/1.93 all A B (-(in(A,B)&empty(B))).
% 1.75/1.93 all A B (-(empty(A)&A!=B&empty(B))).
% 1.75/1.93 end_of_list.
% 1.75/1.93
% 1.75/1.93 -------> usable clausifies to:
% 1.75/1.93
% 1.75/1.93 list(usable).
% 1.75/1.93 0 [] A=A.
% 1.75/1.93 0 [] -in(A,B)| -in(B,A).
% 1.75/1.93 0 [] set_intersection2(A,B)=set_intersection2(B,A).
% 1.75/1.93 0 [] A!=B|subset(A,B).
% 1.75/1.93 0 [] A!=B|subset(B,A).
% 1.75/1.93 0 [] A=B| -subset(A,B)| -subset(B,A).
% 1.75/1.93 0 [] -subset(A,B)| -in(C,A)|in(C,B).
% 1.75/1.93 0 [] subset(A,B)|in($f1(A,B),A).
% 1.75/1.93 0 [] subset(A,B)| -in($f1(A,B),B).
% 1.75/1.93 0 [] C!=set_intersection2(A,B)| -in(D,C)|in(D,A).
% 1.75/1.93 0 [] C!=set_intersection2(A,B)| -in(D,C)|in(D,B).
% 1.75/1.93 0 [] C!=set_intersection2(A,B)|in(D,C)| -in(D,A)| -in(D,B).
% 1.75/1.93 0 [] C=set_intersection2(A,B)|in($f2(A,B,C),C)|in($f2(A,B,C),A).
% 1.75/1.93 0 [] C=set_intersection2(A,B)|in($f2(A,B,C),C)|in($f2(A,B,C),B).
% 1.75/1.93 0 [] C=set_intersection2(A,B)| -in($f2(A,B,C),C)| -in($f2(A,B,C),A)| -in($f2(A,B,C),B).
% 1.75/1.93 0 [] $T.
% 1.75/1.93 0 [] $T.
% 1.75/1.93 0 [] empty(empty_set).
% 1.75/1.93 0 [] set_intersection2(A,A)=A.
% 1.75/1.93 0 [] empty($c1).
% 1.75/1.93 0 [] -empty($c2).
% 1.75/1.93 0 [] subset(A,A).
% 1.75/1.93 0 [] subset(set_intersection2(A,B),A).
% 1.75/1.93 0 [] subset($c4,$c3).
% 1.75/1.93 0 [] set_intersection2($c4,$c3)!=$c4.
% 1.75/1.93 0 [] set_intersection2(A,empty_set)=empty_set.
% 1.75/1.93 0 [] -empty(A)|A=empty_set.
% 1.75/1.93 0 [] -in(A,B)| -empty(B).
% 1.75/1.93 0 [] -empty(A)|A=B| -empty(B).
% 1.75/1.93 end_of_list.
% 1.75/1.93
% 1.75/1.93 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=4.
% 1.75/1.93
% 1.75/1.93 This ia a non-Horn set with equality. The strategy will be
% 1.75/1.93 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.75/1.93 deletion, with positive clauses in sos and nonpositive
% 1.75/1.93 clauses in usable.
% 1.75/1.93
% 1.75/1.93 dependent: set(knuth_bendix).
% 1.75/1.93 dependent: set(anl_eq).
% 1.75/1.93 dependent: set(para_from).
% 1.75/1.93 dependent: set(para_into).
% 1.75/1.93 dependent: clear(para_from_right).
% 1.75/1.93 dependent: clear(para_into_right).
% 1.75/1.93 dependent: set(para_from_vars).
% 1.75/1.93 dependent: set(eq_units_both_ways).
% 1.75/1.93 dependent: set(dynamic_demod_all).
% 1.75/1.93 dependent: set(dynamic_demod).
% 1.75/1.93 dependent: set(order_eq).
% 1.75/1.93 dependent: set(back_demod).
% 1.75/1.93 dependent: set(lrpo).
% 1.75/1.93 dependent: set(hyper_res).
% 1.75/1.93 dependent: set(unit_deletion).
% 1.75/1.93 dependent: set(factor).
% 1.75/1.93
% 1.75/1.93 ------------> process usable:
% 1.75/1.93 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 1.75/1.93 ** KEPT (pick-wt=6): 2 [] A!=B|subset(A,B).
% 1.75/1.93 ** KEPT (pick-wt=6): 3 [] A!=B|subset(B,A).
% 1.75/1.93 ** KEPT (pick-wt=9): 4 [] A=B| -subset(A,B)| -subset(B,A).
% 1.75/1.93 ** KEPT (pick-wt=9): 5 [] -subset(A,B)| -in(C,A)|in(C,B).
% 1.75/1.93 ** KEPT (pick-wt=8): 6 [] subset(A,B)| -in($f1(A,B),B).
% 1.75/1.93 ** KEPT (pick-wt=11): 7 [] A!=set_intersection2(B,C)| -in(D,A)|in(D,B).
% 1.75/1.93 ** KEPT (pick-wt=11): 8 [] A!=set_intersection2(B,C)| -in(D,A)|in(D,C).
% 1.75/1.93 ** KEPT (pick-wt=14): 9 [] A!=set_intersection2(B,C)|in(D,A)| -in(D,B)| -in(D,C).
% 1.75/1.93 ** KEPT (pick-wt=23): 10 [] A=set_intersection2(B,C)| -in($f2(B,C,A),A)| -in($f2(B,C,A),B)| -in($f2(B,C,A),C).
% 1.75/1.93 ** KEPT (pick-wt=2): 11 [] -empty($c2).
% 1.75/1.93 ** KEPT (pick-wt=5): 12 [] set_intersection2($c4,$c3)!=$c4.
% 1.75/1.93 ** KEPT (pick-wt=5): 13 [] -empty(A)|A=empty_set.
% 1.75/1.93 ** KEPT (pick-wt=5): 14 [] -in(A,B)| -empty(B).
% 1.75/1.93 ** KEPT (pick-wt=7): 15 [] -empty(A)|A=B| -empty(B).
% 1.75/1.93
% 1.75/1.93 ------------> process sos:
% 1.94/2.11 ** KEPT (pick-wt=3): 24 [] A=A.
% 1.94/2.11 ** KEPT (pick-wt=7): 25 [] set_intersection2(A,B)=set_intersection2(B,A).
% 1.94/2.11 ** KEPT (pick-wt=8): 26 [] subset(A,B)|in($f1(A,B),A).
% 1.94/2.11 ** KEPT (pick-wt=17): 27 [] A=set_intersection2(B,C)|in($f2(B,C,A),A)|in($f2(B,C,A),B).
% 1.94/2.11 ** KEPT (pick-wt=17): 28 [] A=set_intersection2(B,C)|in($f2(B,C,A),A)|in($f2(B,C,A),C).
% 1.94/2.11 ** KEPT (pick-wt=2): 29 [] empty(empty_set).
% 1.94/2.11 ** KEPT (pick-wt=5): 30 [] set_intersection2(A,A)=A.
% 1.94/2.11 ---> New Demodulator: 31 [new_demod,30] set_intersection2(A,A)=A.
% 1.94/2.11 ** KEPT (pick-wt=2): 32 [] empty($c1).
% 1.94/2.11 ** KEPT (pick-wt=3): 33 [] subset(A,A).
% 1.94/2.11 ** KEPT (pick-wt=5): 34 [] subset(set_intersection2(A,B),A).
% 1.94/2.11 ** KEPT (pick-wt=3): 35 [] subset($c4,$c3).
% 1.94/2.11 ** KEPT (pick-wt=5): 36 [] set_intersection2(A,empty_set)=empty_set.
% 1.94/2.11 ---> New Demodulator: 37 [new_demod,36] set_intersection2(A,empty_set)=empty_set.
% 1.94/2.11 Following clause subsumed by 24 during input processing: 0 [copy,24,flip.1] A=A.
% 1.94/2.11 24 back subsumes 22.
% 1.94/2.11 24 back subsumes 17.
% 1.94/2.11 Following clause subsumed by 25 during input processing: 0 [copy,25,flip.1] set_intersection2(A,B)=set_intersection2(B,A).
% 1.94/2.11 >>>> Starting back demodulation with 31.
% 1.94/2.11 >> back demodulating 23 with 31.
% 1.94/2.11 >> back demodulating 21 with 31.
% 1.94/2.11 >> back demodulating 18 with 31.
% 1.94/2.11 >>>> Starting back demodulation with 37.
% 1.94/2.11
% 1.94/2.11 ======= end of input processing =======
% 1.94/2.11
% 1.94/2.11 =========== start of search ===========
% 1.94/2.11
% 1.94/2.11 -------- PROOF --------
% 1.94/2.11
% 1.94/2.11 ----> UNIT CONFLICT at 0.18 sec ----> 1135 [binary,1133.1,12.1] $F.
% 1.94/2.11
% 1.94/2.11 Length of proof is 5. Level of proof is 4.
% 1.94/2.11
% 1.94/2.11 ---------------- PROOF ----------------
% 1.94/2.11 % SZS status Theorem
% 1.94/2.11 % SZS output start Refutation
% See solution above
% 1.94/2.11 ------------ end of proof -------------
% 1.94/2.11
% 1.94/2.11
% 1.94/2.11 Search stopped by max_proofs option.
% 1.94/2.11
% 1.94/2.11
% 1.94/2.11 Search stopped by max_proofs option.
% 1.94/2.11
% 1.94/2.11 ============ end of search ============
% 1.94/2.11
% 1.94/2.11 -------------- statistics -------------
% 1.94/2.11 clauses given 53
% 1.94/2.11 clauses generated 3522
% 1.94/2.11 clauses kept 1128
% 1.94/2.11 clauses forward subsumed 2418
% 1.94/2.11 clauses back subsumed 99
% 1.94/2.11 Kbytes malloced 2929
% 1.94/2.11
% 1.94/2.11 ----------- times (seconds) -----------
% 1.94/2.11 user CPU time 0.19 (0 hr, 0 min, 0 sec)
% 1.94/2.11 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.94/2.11 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.94/2.11
% 1.94/2.11 That finishes the proof of the theorem.
% 1.94/2.11
% 1.94/2.11 Process 31624 finished Wed Jul 27 07:59:10 2022
% 1.94/2.11 Otter interrupted
% 1.94/2.11 PROOF FOUND
%------------------------------------------------------------------------------