TSTP Solution File: SEU162+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SEU162+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n020.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:59 EDT 2022
% Result : Theorem 1.95s 2.12s
% Output : Refutation 1.95s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 8
% Syntax : Number of clauses : 15 ( 6 unt; 3 nHn; 13 RR)
% Number of literals : 24 ( 7 equ; 7 neg)
% Maximal clause size : 2 ( 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 : 11 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(2,axiom,
( ~ disjoint(singleton(A),B)
| ~ in(A,B) ),
file('SEU162+1.p',unknown),
[] ).
cnf(3,axiom,
( ~ disjoint(A,B)
| disjoint(B,A) ),
file('SEU162+1.p',unknown),
[] ).
cnf(4,axiom,
( set_difference(dollar_c2,singleton(dollar_c1)) = dollar_c2
| ~ in(dollar_c1,dollar_c2) ),
file('SEU162+1.p',unknown),
[] ).
cnf(5,axiom,
( set_difference(dollar_c2,singleton(dollar_c1)) != dollar_c2
| in(dollar_c1,dollar_c2) ),
file('SEU162+1.p',unknown),
[] ).
cnf(6,axiom,
( ~ disjoint(A,B)
| set_difference(A,B) = A ),
file('SEU162+1.p',unknown),
[] ).
cnf(7,axiom,
( disjoint(A,B)
| set_difference(A,B) != A ),
file('SEU162+1.p',unknown),
[] ).
cnf(9,axiom,
A = A,
file('SEU162+1.p',unknown),
[] ).
cnf(10,axiom,
( in(A,B)
| disjoint(singleton(A),B) ),
file('SEU162+1.p',unknown),
[] ).
cnf(12,plain,
( disjoint(singleton(dollar_c1),dollar_c2)
| set_difference(dollar_c2,singleton(dollar_c1)) = dollar_c2 ),
inference(hyper,[status(thm)],[10,4]),
[iquote('hyper,10,4')] ).
cnf(21,plain,
( disjoint(dollar_c2,singleton(dollar_c1))
| disjoint(singleton(dollar_c1),dollar_c2) ),
inference(unit_del,[status(thm)],[inference(para_from,[status(thm),theory(equality)],[12,7]),9]),
[iquote('para_from,12.2.1,7.2.1,unit_del,9')] ).
cnf(24,plain,
disjoint(singleton(dollar_c1),dollar_c2),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[21,3])]),
[iquote('hyper,21,3,factor_simp')] ).
cnf(26,plain,
disjoint(dollar_c2,singleton(dollar_c1)),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[21,3])]),
[iquote('hyper,21,3,factor_simp')] ).
cnf(32,plain,
set_difference(dollar_c2,singleton(dollar_c1)) = dollar_c2,
inference(hyper,[status(thm)],[26,6]),
[iquote('hyper,26,6')] ).
cnf(33,plain,
in(dollar_c1,dollar_c2),
inference(unit_del,[status(thm)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[5]),32]),9]),
[iquote('back_demod,5,demod,32,unit_del,9')] ).
cnf(34,plain,
$false,
inference(hyper,[status(thm)],[33,2,24]),
[iquote('hyper,33,2,24')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : SEU162+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n020.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:39:08 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.95/2.12 ----- Otter 3.3f, August 2004 -----
% 1.95/2.12 The process was started by sandbox on n020.cluster.edu,
% 1.95/2.12 Wed Jul 27 07:39:08 2022
% 1.95/2.12 The command was "./otter". The process ID is 20436.
% 1.95/2.12
% 1.95/2.12 set(prolog_style_variables).
% 1.95/2.12 set(auto).
% 1.95/2.12 dependent: set(auto1).
% 1.95/2.12 dependent: set(process_input).
% 1.95/2.12 dependent: clear(print_kept).
% 1.95/2.12 dependent: clear(print_new_demod).
% 1.95/2.12 dependent: clear(print_back_demod).
% 1.95/2.12 dependent: clear(print_back_sub).
% 1.95/2.12 dependent: set(control_memory).
% 1.95/2.12 dependent: assign(max_mem, 12000).
% 1.95/2.12 dependent: assign(pick_given_ratio, 4).
% 1.95/2.12 dependent: assign(stats_level, 1).
% 1.95/2.12 dependent: assign(max_seconds, 10800).
% 1.95/2.12 clear(print_given).
% 1.95/2.12
% 1.95/2.12 formula_list(usable).
% 1.95/2.12 all A (A=A).
% 1.95/2.12 all A B (in(A,B)-> -in(B,A)).
% 1.95/2.12 $T.
% 1.95/2.12 $T.
% 1.95/2.12 all A B (-(disjoint(singleton(A),B)&in(A,B))).
% 1.95/2.12 all A B (-in(A,B)->disjoint(singleton(A),B)).
% 1.95/2.12 all A B (disjoint(A,B)->disjoint(B,A)).
% 1.95/2.12 -(all A B (set_difference(A,singleton(B))=A<-> -in(B,A))).
% 1.95/2.12 all A B (disjoint(A,B)<->set_difference(A,B)=A).
% 1.95/2.12 end_of_list.
% 1.95/2.12
% 1.95/2.12 -------> usable clausifies to:
% 1.95/2.12
% 1.95/2.12 list(usable).
% 1.95/2.12 0 [] A=A.
% 1.95/2.12 0 [] -in(A,B)| -in(B,A).
% 1.95/2.12 0 [] $T.
% 1.95/2.12 0 [] $T.
% 1.95/2.12 0 [] -disjoint(singleton(A),B)| -in(A,B).
% 1.95/2.12 0 [] in(A,B)|disjoint(singleton(A),B).
% 1.95/2.12 0 [] -disjoint(A,B)|disjoint(B,A).
% 1.95/2.12 0 [] set_difference($c2,singleton($c1))=$c2| -in($c1,$c2).
% 1.95/2.12 0 [] set_difference($c2,singleton($c1))!=$c2|in($c1,$c2).
% 1.95/2.12 0 [] -disjoint(A,B)|set_difference(A,B)=A.
% 1.95/2.12 0 [] disjoint(A,B)|set_difference(A,B)!=A.
% 1.95/2.12 end_of_list.
% 1.95/2.12
% 1.95/2.12 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=2.
% 1.95/2.12
% 1.95/2.12 This ia a non-Horn set with equality. The strategy will be
% 1.95/2.12 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.95/2.12 deletion, with positive clauses in sos and nonpositive
% 1.95/2.12 clauses in usable.
% 1.95/2.12
% 1.95/2.12 dependent: set(knuth_bendix).
% 1.95/2.12 dependent: set(anl_eq).
% 1.95/2.12 dependent: set(para_from).
% 1.95/2.12 dependent: set(para_into).
% 1.95/2.12 dependent: clear(para_from_right).
% 1.95/2.12 dependent: clear(para_into_right).
% 1.95/2.12 dependent: set(para_from_vars).
% 1.95/2.12 dependent: set(eq_units_both_ways).
% 1.95/2.12 dependent: set(dynamic_demod_all).
% 1.95/2.12 dependent: set(dynamic_demod).
% 1.95/2.12 dependent: set(order_eq).
% 1.95/2.12 dependent: set(back_demod).
% 1.95/2.12 dependent: set(lrpo).
% 1.95/2.12 dependent: set(hyper_res).
% 1.95/2.12 dependent: set(unit_deletion).
% 1.95/2.12 dependent: set(factor).
% 1.95/2.12
% 1.95/2.12 ------------> process usable:
% 1.95/2.12 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 1.95/2.12 ** KEPT (pick-wt=7): 2 [] -disjoint(singleton(A),B)| -in(A,B).
% 1.95/2.12 ** KEPT (pick-wt=6): 3 [] -disjoint(A,B)|disjoint(B,A).
% 1.95/2.12 ** KEPT (pick-wt=9): 4 [] set_difference($c2,singleton($c1))=$c2| -in($c1,$c2).
% 1.95/2.12 ** KEPT (pick-wt=9): 5 [] set_difference($c2,singleton($c1))!=$c2|in($c1,$c2).
% 1.95/2.12 ** KEPT (pick-wt=8): 6 [] -disjoint(A,B)|set_difference(A,B)=A.
% 1.95/2.12 ** KEPT (pick-wt=8): 7 [] disjoint(A,B)|set_difference(A,B)!=A.
% 1.95/2.12
% 1.95/2.12 ------------> process sos:
% 1.95/2.12 ** KEPT (pick-wt=3): 9 [] A=A.
% 1.95/2.12 ** KEPT (pick-wt=7): 10 [] in(A,B)|disjoint(singleton(A),B).
% 1.95/2.12 Following clause subsumed by 9 during input processing: 0 [copy,9,flip.1] A=A.
% 1.95/2.12
% 1.95/2.12 ======= end of input processing =======
% 1.95/2.12
% 1.95/2.12 =========== start of search ===========
% 1.95/2.12
% 1.95/2.12 -------- PROOF --------
% 1.95/2.12
% 1.95/2.12 -----> EMPTY CLAUSE at 0.00 sec ----> 34 [hyper,33,2,24] $F.
% 1.95/2.12
% 1.95/2.12 Length of proof is 6. Level of proof is 5.
% 1.95/2.12
% 1.95/2.12 ---------------- PROOF ----------------
% 1.95/2.12 % SZS status Theorem
% 1.95/2.12 % SZS output start Refutation
% See solution above
% 1.95/2.12 ------------ end of proof -------------
% 1.95/2.12
% 1.95/2.12
% 1.95/2.12 Search stopped by max_proofs option.
% 1.95/2.12
% 1.95/2.12
% 1.95/2.12 Search stopped by max_proofs option.
% 1.95/2.12
% 1.95/2.12 ============ end of search ============
% 1.95/2.12
% 1.95/2.12 -------------- statistics -------------
% 1.95/2.12 clauses given 13
% 1.95/2.12 clauses generated 65
% 1.95/2.12 clauses kept 29
% 1.95/2.12 clauses forward subsumed 48
% 1.95/2.12 clauses back subsumed 4
% 1.95/2.12 Kbytes malloced 976
% 1.95/2.12
% 1.95/2.12 ----------- times (seconds) -----------
% 1.95/2.12 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.95/2.12 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.95/2.12 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.95/2.12
% 1.95/2.12 That finishes the proof of the theorem.
% 1.95/2.12
% 1.95/2.12 Process 20436 finished Wed Jul 27 07:39:10 2022
% 1.95/2.12 Otter interrupted
% 1.95/2.12 PROOF FOUND
%------------------------------------------------------------------------------