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