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