TSTP Solution File: SET924+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SET924+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n013.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:32 EDT 2022
% Result : Theorem 1.91s 2.10s
% Output : Refutation 1.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of clauses : 8 ( 4 unt; 1 nHn; 6 RR)
% Number of literals : 12 ( 6 equ; 4 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 3 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 5 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(3,axiom,
( set_difference(singleton(dollar_c4),dollar_c3) = singleton(dollar_c4)
| ~ in(dollar_c4,dollar_c3) ),
file('SET924+1.p',unknown),
[] ).
cnf(4,axiom,
( set_difference(singleton(dollar_c4),dollar_c3) != singleton(dollar_c4)
| in(dollar_c4,dollar_c3) ),
file('SET924+1.p',unknown),
[] ).
cnf(5,axiom,
( set_difference(singleton(A),B) != singleton(A)
| ~ in(A,B) ),
file('SET924+1.p',unknown),
[] ).
cnf(7,axiom,
A = A,
file('SET924+1.p',unknown),
[] ).
cnf(9,axiom,
( set_difference(singleton(A),B) = singleton(A)
| in(A,B) ),
file('SET924+1.p',unknown),
[] ).
cnf(13,plain,
set_difference(singleton(dollar_c4),dollar_c3) = singleton(dollar_c4),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[9,3])]),
[iquote('hyper,9,3,factor_simp')] ).
cnf(15,plain,
in(dollar_c4,dollar_c3),
inference(unit_del,[status(thm)],[inference(demod,[status(thm),theory(equality)],[inference(back_demod,[status(thm)],[4]),13]),7]),
[iquote('back_demod,4,demod,13,unit_del,7')] ).
cnf(18,plain,
$false,
inference(hyper,[status(thm)],[13,5,15]),
[iquote('hyper,12,5,15')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SET924+1 : TPTP v8.1.0. Released v3.2.0.
% 0.12/0.12 % Command : otter-tptp-script %s
% 0.12/0.34 % Computer : n013.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 300
% 0.12/0.34 % DateTime : Wed Jul 27 10:39:00 EDT 2022
% 0.12/0.34 % CPUTime :
% 1.91/2.10 ----- Otter 3.3f, August 2004 -----
% 1.91/2.10 The process was started by sandbox on n013.cluster.edu,
% 1.91/2.10 Wed Jul 27 10:39:00 2022
% 1.91/2.10 The command was "./otter". The process ID is 29387.
% 1.91/2.10
% 1.91/2.10 set(prolog_style_variables).
% 1.91/2.10 set(auto).
% 1.91/2.10 dependent: set(auto1).
% 1.91/2.10 dependent: set(process_input).
% 1.91/2.10 dependent: clear(print_kept).
% 1.91/2.10 dependent: clear(print_new_demod).
% 1.91/2.10 dependent: clear(print_back_demod).
% 1.91/2.10 dependent: clear(print_back_sub).
% 1.91/2.10 dependent: set(control_memory).
% 1.91/2.10 dependent: assign(max_mem, 12000).
% 1.91/2.10 dependent: assign(pick_given_ratio, 4).
% 1.91/2.10 dependent: assign(stats_level, 1).
% 1.91/2.10 dependent: assign(max_seconds, 10800).
% 1.91/2.10 clear(print_given).
% 1.91/2.10
% 1.91/2.10 formula_list(usable).
% 1.91/2.10 all A (A=A).
% 1.91/2.10 all A B (in(A,B)-> -in(B,A)).
% 1.91/2.10 exists A empty(A).
% 1.91/2.10 exists A (-empty(A)).
% 1.91/2.10 -(all A B (set_difference(singleton(A),B)=singleton(A)<-> -in(A,B))).
% 1.91/2.10 all A B (set_difference(singleton(A),B)=singleton(A)<-> -in(A,B)).
% 1.91/2.10 end_of_list.
% 1.91/2.10
% 1.91/2.10 -------> usable clausifies to:
% 1.91/2.10
% 1.91/2.10 list(usable).
% 1.91/2.10 0 [] A=A.
% 1.91/2.10 0 [] -in(A,B)| -in(B,A).
% 1.91/2.10 0 [] empty($c1).
% 1.91/2.10 0 [] -empty($c2).
% 1.91/2.10 0 [] set_difference(singleton($c4),$c3)=singleton($c4)| -in($c4,$c3).
% 1.91/2.10 0 [] set_difference(singleton($c4),$c3)!=singleton($c4)|in($c4,$c3).
% 1.91/2.10 0 [] set_difference(singleton(A),B)!=singleton(A)| -in(A,B).
% 1.91/2.10 0 [] set_difference(singleton(A),B)=singleton(A)|in(A,B).
% 1.91/2.10 end_of_list.
% 1.91/2.10
% 1.91/2.10 SCAN INPUT: prop=0, horn=0, equality=1, symmetry=0, max_lits=2.
% 1.91/2.10
% 1.91/2.10 This ia a non-Horn set with equality. The strategy will be
% 1.91/2.10 Knuth-Bendix, ordered hyper_res, factoring, and unit
% 1.91/2.10 deletion, with positive clauses in sos and nonpositive
% 1.91/2.10 clauses in usable.
% 1.91/2.10
% 1.91/2.10 dependent: set(knuth_bendix).
% 1.91/2.10 dependent: set(anl_eq).
% 1.91/2.10 dependent: set(para_from).
% 1.91/2.10 dependent: set(para_into).
% 1.91/2.10 dependent: clear(para_from_right).
% 1.91/2.10 dependent: clear(para_into_right).
% 1.91/2.10 dependent: set(para_from_vars).
% 1.91/2.10 dependent: set(eq_units_both_ways).
% 1.91/2.10 dependent: set(dynamic_demod_all).
% 1.91/2.10 dependent: set(dynamic_demod).
% 1.91/2.10 dependent: set(order_eq).
% 1.91/2.10 dependent: set(back_demod).
% 1.91/2.10 dependent: set(lrpo).
% 1.91/2.10 dependent: set(hyper_res).
% 1.91/2.10 dependent: set(unit_deletion).
% 1.91/2.10 dependent: set(factor).
% 1.91/2.10
% 1.91/2.10 ------------> process usable:
% 1.91/2.10 ** KEPT (pick-wt=6): 1 [] -in(A,B)| -in(B,A).
% 1.91/2.10 ** KEPT (pick-wt=2): 2 [] -empty($c2).
% 1.91/2.10 ** KEPT (pick-wt=10): 3 [] set_difference(singleton($c4),$c3)=singleton($c4)| -in($c4,$c3).
% 1.91/2.10 ** KEPT (pick-wt=10): 4 [] set_difference(singleton($c4),$c3)!=singleton($c4)|in($c4,$c3).
% 1.91/2.10 ** KEPT (pick-wt=10): 5 [] set_difference(singleton(A),B)!=singleton(A)| -in(A,B).
% 1.91/2.10
% 1.91/2.10 ------------> process sos:
% 1.91/2.10 ** KEPT (pick-wt=3): 7 [] A=A.
% 1.91/2.10 ** KEPT (pick-wt=2): 8 [] empty($c1).
% 1.91/2.10 ** KEPT (pick-wt=10): 9 [] set_difference(singleton(A),B)=singleton(A)|in(A,B).
% 1.91/2.10 Following clause subsumed by 7 during input processing: 0 [copy,7,flip.1] A=A.
% 1.91/2.10
% 1.91/2.10 ======= end of input processing =======
% 1.91/2.10
% 1.91/2.10 =========== start of search ===========
% 1.91/2.10
% 1.91/2.10 -------- PROOF --------
% 1.91/2.10
% 1.91/2.10 -----> EMPTY CLAUSE at 0.00 sec ----> 18 [hyper,12,5,15] $F.
% 1.91/2.10
% 1.91/2.10 Length of proof is 2. Level of proof is 2.
% 1.91/2.10
% 1.91/2.10 ---------------- PROOF ----------------
% 1.91/2.10 % SZS status Theorem
% 1.91/2.10 % SZS output start Refutation
% See solution above
% 1.91/2.10 ------------ end of proof -------------
% 1.91/2.10
% 1.91/2.10
% 1.91/2.10 Search stopped by max_proofs option.
% 1.91/2.10
% 1.91/2.10
% 1.91/2.10 Search stopped by max_proofs option.
% 1.91/2.10
% 1.91/2.10 ============ end of search ============
% 1.91/2.10
% 1.91/2.10 -------------- statistics -------------
% 1.91/2.10 clauses given 6
% 1.91/2.10 clauses generated 18
% 1.91/2.10 clauses kept 14
% 1.91/2.10 clauses forward subsumed 13
% 1.91/2.10 clauses back subsumed 0
% 1.91/2.10 Kbytes malloced 976
% 1.91/2.10
% 1.91/2.10 ----------- times (seconds) -----------
% 1.91/2.10 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.91/2.10 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.91/2.10 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.91/2.10
% 1.91/2.10 That finishes the proof of the theorem.
% 1.91/2.10
% 1.91/2.10 Process 29387 finished Wed Jul 27 10:39:01 2022
% 1.91/2.10 Otter interrupted
% 1.91/2.10 PROOF FOUND
%------------------------------------------------------------------------------