TSTP Solution File: SYO607+1 by Otter---3.3
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : SYO607+1 : TPTP v8.1.0. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : otter-tptp-script %s
% Computer : n003.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:26:24 EDT 2022
% Result : Theorem 1.68s 1.91s
% Output : Refutation 1.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 9
% Syntax : Number of clauses : 44 ( 7 unt; 34 nHn; 22 RR)
% Number of literals : 154 ( 0 equ; 18 neg)
% Maximal clause size : 8 ( 3 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-1 aty)
% Number of variables : 64 ( 43 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ g_false_only(a,A)
| ~ g_false_only(A,B) ),
file('SYO607+1.p',unknown),
[] ).
cnf(2,axiom,
~ g_true_only(A,dollar_f1(A)),
file('SYO607+1.p',unknown),
[] ).
cnf(3,axiom,
( ~ g_both(a,A)
| g_true_only(a,A)
| g_true_only(A,B)
| g_false_only(a,dollar_c2)
| ~ g_both(C,D)
| g_false_only(C,dollar_f3(C))
| g_true_only(dollar_c3,E) ),
file('SYO607+1.p',unknown),
[] ).
cnf(4,axiom,
( ~ g_both(a,A)
| g_true_only(a,A)
| g_true_only(A,B)
| g_false_only(dollar_c2,dollar_c1)
| ~ g_both(C,D)
| g_false_only(C,dollar_f3(C))
| g_true_only(dollar_c3,E) ),
file('SYO607+1.p',unknown),
[] ).
cnf(5,axiom,
( ~ g_both(A,B)
| g_false_only(A,dollar_f2(A))
| g_true_only(a,A)
| g_true_only(A,C)
| g_false_only(a,dollar_c2)
| ~ g_both(D,E)
| g_false_only(D,dollar_f3(D))
| g_true_only(dollar_c3,F) ),
file('SYO607+1.p',unknown),
[] ).
cnf(6,axiom,
( ~ g_both(A,B)
| g_false_only(A,dollar_f2(A))
| g_true_only(a,A)
| g_true_only(A,C)
| g_false_only(dollar_c2,dollar_c1)
| ~ g_both(D,E)
| g_false_only(D,dollar_f3(D))
| g_true_only(dollar_c3,F) ),
file('SYO607+1.p',unknown),
[] ).
cnf(8,axiom,
( ~ g_true_only(A,B)
| ~ g_false(A,B) ),
file('SYO607+1.p',unknown),
[] ).
cnf(11,axiom,
( ~ g_both(A,B)
| g_false(A,B) ),
file('SYO607+1.p',unknown),
[] ).
cnf(17,plain,
( ~ g_both(a,A)
| g_true_only(a,A)
| g_true_only(A,B)
| g_false_only(a,dollar_c2)
| g_false_only(a,dollar_f3(a))
| g_true_only(dollar_c3,C) ),
inference(factor,[status(thm)],[3]),
[iquote('factor,3.1.5')] ).
cnf(20,plain,
( ~ g_both(a,A)
| g_true_only(a,A)
| g_true_only(A,B)
| g_false_only(dollar_c2,dollar_c1)
| g_false_only(a,dollar_f3(a))
| g_true_only(dollar_c3,C) ),
inference(factor,[status(thm)],[4]),
[iquote('factor,4.1.5')] ).
cnf(23,plain,
( ~ g_both(A,B)
| g_false_only(A,dollar_f2(A))
| g_true_only(a,A)
| g_true_only(A,C)
| g_false_only(a,dollar_c2)
| g_false_only(A,dollar_f3(A))
| g_true_only(dollar_c3,D) ),
inference(factor,[status(thm)],[5]),
[iquote('factor,5.1.6')] ).
cnf(26,plain,
( ~ g_both(A,B)
| g_false_only(A,dollar_f2(A))
| g_true_only(a,A)
| g_true_only(A,C)
| g_false_only(dollar_c2,dollar_c1)
| g_false_only(A,dollar_f3(A))
| g_true_only(dollar_c3,D) ),
inference(factor,[status(thm)],[6]),
[iquote('factor,6.1.6')] ).
cnf(37,axiom,
( g_true_only(A,B)
| g_both(A,B)
| g_false_only(A,B) ),
file('SYO607+1.p',unknown),
[] ).
cnf(39,plain,
( g_both(A,dollar_f1(A))
| g_false_only(A,dollar_f1(A)) ),
inference(hyper,[status(thm)],[37,2]),
[iquote('hyper,37,2')] ).
cnf(41,plain,
( g_both(dollar_f1(a),dollar_f1(dollar_f1(a)))
| g_both(a,dollar_f1(a)) ),
inference(hyper,[status(thm)],[39,1,39]),
[iquote('hyper,39,1,39')] ).
cnf(42,plain,
( g_both(a,dollar_f1(a))
| g_false_only(dollar_f1(a),dollar_f2(dollar_f1(a)))
| g_true_only(dollar_f1(a),A)
| g_false_only(dollar_c2,dollar_c1)
| g_false_only(dollar_f1(a),dollar_f3(dollar_f1(a)))
| g_true_only(dollar_c3,B) ),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[41,26]),2]),
[iquote('hyper,41,26,unit_del,2')] ).
cnf(43,plain,
( g_both(a,dollar_f1(a))
| g_false_only(dollar_f1(a),dollar_f2(dollar_f1(a)))
| g_true_only(dollar_f1(a),A)
| g_false_only(a,dollar_c2)
| g_false_only(dollar_f1(a),dollar_f3(dollar_f1(a)))
| g_true_only(dollar_c3,B) ),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[41,23]),2]),
[iquote('hyper,41,23,unit_del,2')] ).
cnf(44,plain,
( g_both(a,dollar_f1(a))
| g_false(dollar_f1(a),dollar_f1(dollar_f1(a))) ),
inference(hyper,[status(thm)],[41,11]),
[iquote('hyper,41,11')] ).
cnf(53,plain,
( g_both(a,dollar_f1(a))
| g_false_only(dollar_f1(a),dollar_f2(dollar_f1(a)))
| g_false_only(dollar_c2,dollar_c1)
| g_false_only(dollar_f1(a),dollar_f3(dollar_f1(a)))
| g_true_only(dollar_c3,A) ),
inference(hyper,[status(thm)],[42,2]),
[iquote('hyper,42,2')] ).
cnf(57,plain,
( g_both(a,dollar_f1(a))
| g_false_only(dollar_f1(a),dollar_f2(dollar_f1(a)))
| g_false_only(a,dollar_c2)
| g_false_only(dollar_f1(a),dollar_f3(dollar_f1(a)))
| g_true_only(dollar_c3,A) ),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[43,8,44])]),
[iquote('hyper,43,8,44,factor_simp')] ).
cnf(94,plain,
( g_both(a,dollar_f1(a))
| g_false_only(dollar_f1(a),dollar_f2(dollar_f1(a)))
| g_false_only(dollar_c2,dollar_c1)
| g_false_only(dollar_f1(a),dollar_f3(dollar_f1(a))) ),
inference(hyper,[status(thm)],[53,2]),
[iquote('hyper,53,2')] ).
cnf(109,plain,
( g_both(a,dollar_f1(a))
| g_false_only(dollar_f1(a),dollar_f2(dollar_f1(a)))
| g_false_only(a,dollar_c2)
| g_false_only(dollar_f1(a),dollar_f3(dollar_f1(a))) ),
inference(hyper,[status(thm)],[57,2]),
[iquote('hyper,57,2')] ).
cnf(111,plain,
( g_both(a,dollar_f1(a))
| g_false_only(dollar_c2,dollar_c1)
| g_false_only(dollar_f1(a),dollar_f3(dollar_f1(a))) ),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[94,1,39])]),
[iquote('hyper,94,1,39,factor_simp')] ).
cnf(117,plain,
( g_both(a,dollar_f1(a))
| g_false_only(dollar_c2,dollar_c1) ),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[111,1,39])]),
[iquote('hyper,111,1,39,factor_simp')] ).
cnf(124,plain,
( g_both(a,dollar_f1(a))
| g_false_only(a,dollar_c2)
| g_false_only(dollar_f1(a),dollar_f3(dollar_f1(a))) ),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[109,1,39])]),
[iquote('hyper,109,1,39,factor_simp')] ).
cnf(132,plain,
( g_both(a,dollar_f1(a))
| g_false_only(a,dollar_c2) ),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[124,1,39])]),
[iquote('hyper,124,1,39,factor_simp')] ).
cnf(134,plain,
g_both(a,dollar_f1(a)),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[132,1,117])]),
[iquote('hyper,132,1,117,factor_simp')] ).
cnf(143,plain,
( g_true_only(dollar_f1(a),A)
| g_false_only(dollar_c2,dollar_c1)
| g_false_only(a,dollar_f3(a))
| g_true_only(dollar_c3,B) ),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[134,20]),2]),
[iquote('hyper,134,20,unit_del,2')] ).
cnf(144,plain,
( g_true_only(dollar_f1(a),A)
| g_false_only(a,dollar_c2)
| g_false_only(a,dollar_f3(a))
| g_true_only(dollar_c3,B) ),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[134,17]),2]),
[iquote('hyper,134,17,unit_del,2')] ).
cnf(151,plain,
( g_false_only(dollar_c2,dollar_c1)
| g_false_only(a,dollar_f3(a))
| g_true_only(dollar_c3,A) ),
inference(hyper,[status(thm)],[143,2]),
[iquote('hyper,143,2')] ).
cnf(161,plain,
( g_false_only(dollar_c2,dollar_c1)
| g_false_only(a,dollar_f3(a)) ),
inference(hyper,[status(thm)],[151,2]),
[iquote('hyper,151,2')] ).
cnf(174,plain,
( g_false_only(a,dollar_c2)
| g_false_only(a,dollar_f3(a))
| g_true_only(dollar_c3,A) ),
inference(hyper,[status(thm)],[144,2]),
[iquote('hyper,144,2')] ).
cnf(184,plain,
( g_false_only(a,dollar_c2)
| g_false_only(a,dollar_f3(a)) ),
inference(hyper,[status(thm)],[174,2]),
[iquote('hyper,174,2')] ).
cnf(188,plain,
g_false_only(a,dollar_f3(a)),
inference(factor_simp,[status(thm)],[inference(hyper,[status(thm)],[184,1,161])]),
[iquote('hyper,184,1,161,factor_simp')] ).
cnf(192,plain,
g_both(dollar_f3(a),dollar_f1(dollar_f3(a))),
inference(hyper,[status(thm)],[188,1,39]),
[iquote('hyper,188,1,39')] ).
cnf(204,plain,
( g_true_only(dollar_f1(a),A)
| g_false_only(dollar_c2,dollar_c1)
| g_false_only(dollar_f3(a),dollar_f3(dollar_f3(a)))
| g_true_only(dollar_c3,B) ),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[192,4,134]),2]),
[iquote('hyper,192,4,134,unit_del,2')] ).
cnf(205,plain,
( g_true_only(dollar_f1(a),A)
| g_false_only(a,dollar_c2)
| g_false_only(dollar_f3(a),dollar_f3(dollar_f3(a)))
| g_true_only(dollar_c3,B) ),
inference(unit_del,[status(thm)],[inference(hyper,[status(thm)],[192,3,134]),2]),
[iquote('hyper,192,3,134,unit_del,2')] ).
cnf(208,plain,
( g_false_only(dollar_c2,dollar_c1)
| g_false_only(dollar_f3(a),dollar_f3(dollar_f3(a)))
| g_true_only(dollar_c3,A) ),
inference(hyper,[status(thm)],[204,2]),
[iquote('hyper,204,2')] ).
cnf(215,plain,
( g_false_only(dollar_c2,dollar_c1)
| g_false_only(dollar_f3(a),dollar_f3(dollar_f3(a))) ),
inference(hyper,[status(thm)],[208,2]),
[iquote('hyper,208,2')] ).
cnf(218,plain,
g_false_only(dollar_c2,dollar_c1),
inference(hyper,[status(thm)],[215,1,188]),
[iquote('hyper,215,1,188')] ).
cnf(225,plain,
( g_false_only(a,dollar_c2)
| g_false_only(dollar_f3(a),dollar_f3(dollar_f3(a)))
| g_true_only(dollar_c3,A) ),
inference(hyper,[status(thm)],[205,2]),
[iquote('hyper,205,2')] ).
cnf(231,plain,
( g_false_only(a,dollar_c2)
| g_false_only(dollar_f3(a),dollar_f3(dollar_f3(a))) ),
inference(hyper,[status(thm)],[225,2]),
[iquote('hyper,225,2')] ).
cnf(235,plain,
g_false_only(a,dollar_c2),
inference(hyper,[status(thm)],[231,1,188]),
[iquote('hyper,231,1,188')] ).
cnf(237,plain,
$false,
inference(hyper,[status(thm)],[235,1,218]),
[iquote('hyper,235,1,218')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11 % Problem : SYO607+1 : TPTP v8.1.0. Released v7.0.0.
% 0.03/0.12 % Command : otter-tptp-script %s
% 0.12/0.33 % Computer : n003.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 10:09:11 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.68/1.89 ----- Otter 3.3f, August 2004 -----
% 1.68/1.89 The process was started by sandbox2 on n003.cluster.edu,
% 1.68/1.89 Wed Jul 27 10:09:11 2022
% 1.68/1.89 The command was "./otter". The process ID is 14038.
% 1.68/1.89
% 1.68/1.89 set(prolog_style_variables).
% 1.68/1.89 set(auto).
% 1.68/1.89 dependent: set(auto1).
% 1.68/1.89 dependent: set(process_input).
% 1.68/1.89 dependent: clear(print_kept).
% 1.68/1.89 dependent: clear(print_new_demod).
% 1.68/1.89 dependent: clear(print_back_demod).
% 1.68/1.89 dependent: clear(print_back_sub).
% 1.68/1.89 dependent: set(control_memory).
% 1.68/1.89 dependent: assign(max_mem, 12000).
% 1.68/1.89 dependent: assign(pick_given_ratio, 4).
% 1.68/1.89 dependent: assign(stats_level, 1).
% 1.68/1.89 dependent: assign(max_seconds, 10800).
% 1.68/1.89 clear(print_given).
% 1.68/1.89
% 1.68/1.89 formula_list(usable).
% 1.68/1.89 -((exists A (g_false_only(a,A)& (exists B g_false_only(A,B))))| (exists A all B g_true_only(A,B))| (exists A ((g_both(a,A)| (exists B g_both(A,B))& -(exists B g_false_only(A,B)))& -g_true_only(a,A)& -(all B g_true_only(A,B))))& -(exists A (g_false_only(a,A)& (exists B g_false_only(A,B))))& (exists A ((exists B g_both(A,B))& -(exists B g_false_only(A,B))))& -(exists A all B g_true_only(A,B))).
% 1.68/1.89 all X_2 X_1 (g_true_only(X_2,X_1)<->g_true(X_2,X_1)& -g_false(X_2,X_1)).
% 1.68/1.89 all X_2 X_1 (g_both(X_2,X_1)<->g_true(X_2,X_1)&g_false(X_2,X_1)).
% 1.68/1.89 all X_2 X_1 (g_false_only(X_2,X_1)<->g_false(X_2,X_1)& -g_true(X_2,X_1)).
% 1.68/1.89 all X_2 X_1 (g_true_only(X_2,X_1)|g_both(X_2,X_1)|g_false_only(X_2,X_1)).
% 1.68/1.89 end_of_list.
% 1.68/1.89
% 1.68/1.89 -------> usable clausifies to:
% 1.68/1.89
% 1.68/1.89 list(usable).
% 1.68/1.89 0 [] -g_false_only(a,A)| -g_false_only(A,B).
% 1.68/1.89 0 [] -g_true_only(X1,$f1(X1)).
% 1.68/1.89 0 [] -g_both(a,X2)|g_true_only(a,X2)|g_true_only(X2,X4)|g_false_only(a,$c2)| -g_both(X5,X6)|g_false_only(X5,$f3(X5))|g_true_only($c3,X7).
% 1.68/1.89 0 [] -g_both(a,X2)|g_true_only(a,X2)|g_true_only(X2,X4)|g_false_only($c2,$c1)| -g_both(X5,X6)|g_false_only(X5,$f3(X5))|g_true_only($c3,X7).
% 1.68/1.89 0 [] -g_both(X2,X3)|g_false_only(X2,$f2(X2))|g_true_only(a,X2)|g_true_only(X2,X4)|g_false_only(a,$c2)| -g_both(X5,X6)|g_false_only(X5,$f3(X5))|g_true_only($c3,X7).
% 1.68/1.89 0 [] -g_both(X2,X3)|g_false_only(X2,$f2(X2))|g_true_only(a,X2)|g_true_only(X2,X4)|g_false_only($c2,$c1)| -g_both(X5,X6)|g_false_only(X5,$f3(X5))|g_true_only($c3,X7).
% 1.68/1.89 0 [] -g_true_only(X_2,X_1)|g_true(X_2,X_1).
% 1.68/1.89 0 [] -g_true_only(X_2,X_1)| -g_false(X_2,X_1).
% 1.68/1.89 0 [] g_true_only(X_2,X_1)| -g_true(X_2,X_1)|g_false(X_2,X_1).
% 1.68/1.89 0 [] -g_both(X_2,X_1)|g_true(X_2,X_1).
% 1.68/1.89 0 [] -g_both(X_2,X_1)|g_false(X_2,X_1).
% 1.68/1.89 0 [] g_both(X_2,X_1)| -g_true(X_2,X_1)| -g_false(X_2,X_1).
% 1.68/1.89 0 [] -g_false_only(X_2,X_1)|g_false(X_2,X_1).
% 1.68/1.89 0 [] -g_false_only(X_2,X_1)| -g_true(X_2,X_1).
% 1.68/1.89 0 [] g_false_only(X_2,X_1)| -g_false(X_2,X_1)|g_true(X_2,X_1).
% 1.68/1.89 0 [] g_true_only(X_2,X_1)|g_both(X_2,X_1)|g_false_only(X_2,X_1).
% 1.68/1.89 end_of_list.
% 1.68/1.89
% 1.68/1.89 SCAN INPUT: prop=0, horn=0, equality=0, symmetry=0, max_lits=8.
% 1.68/1.89
% 1.68/1.89 This is a non-Horn set without equality. The strategy will
% 1.68/1.89 be ordered hyper_res, unit deletion, and factoring, with
% 1.68/1.89 satellites in sos and with nuclei in usable.
% 1.68/1.89
% 1.68/1.89 dependent: set(hyper_res).
% 1.68/1.89 dependent: set(factor).
% 1.68/1.89 dependent: set(unit_deletion).
% 1.68/1.89
% 1.68/1.89 ------------> process usable:
% 1.68/1.89 ** KEPT (pick-wt=6): 1 [] -g_false_only(a,A)| -g_false_only(A,B).
% 1.68/1.89 ** KEPT (pick-wt=4): 2 [] -g_true_only(A,$f1(A)).
% 1.68/1.89 ** KEPT (pick-wt=22): 3 [] -g_both(a,A)|g_true_only(a,A)|g_true_only(A,B)|g_false_only(a,$c2)| -g_both(C,D)|g_false_only(C,$f3(C))|g_true_only($c3,E).
% 1.68/1.89 ** KEPT (pick-wt=22): 4 [] -g_both(a,A)|g_true_only(a,A)|g_true_only(A,B)|g_false_only($c2,$c1)| -g_both(C,D)|g_false_only(C,$f3(C))|g_true_only($c3,E).
% 1.68/1.89 ** KEPT (pick-wt=26): 5 [] -g_both(A,B)|g_false_only(A,$f2(A))|g_true_only(a,A)|g_true_only(A,C)|g_false_only(a,$c2)| -g_both(D,E)|g_false_only(D,$f3(D))|g_true_only($c3,F).
% 1.68/1.89 ** KEPT (pick-wt=26): 6 [] -g_both(A,B)|g_false_only(A,$f2(A))|g_true_only(a,A)|g_true_only(A,C)|g_false_only($c2,$c1)| -g_both(D,E)|g_false_only(D,$f3(D))|g_true_only($c3,F).
% 1.68/1.89 ** KEPT (pick-wt=6): 7 [] -g_true_only(A,B)|g_true(A,B).
% 1.68/1.89 ** KEPT (pick-wt=6): 8 [] -g_true_only(A,B)| -g_false(A,B).
% 1.68/1.89 ** KEPT (pick-wt=9): 9 [] g_true_only(A,B)| -g_true(A,B)|g_false(A,B).
% 1.68/1.89 ** KEPT (pick-wt=6): 10 [] -g_both(A,B)|g_true(A,B).
% 1.68/1.89 ** KEPT (pick-wt=6): 11 [] -g_both(A,B)|g_false(A,B).
% 1.68/1.89 ** KEPT (pick-wt=9): 12 [] g_both(A,B)| -g_true(A,B)| -g_false(A,B).
% 1.68/1.89 ** KEPT (pick-wt=6): 13 [] -g_false_only(A,B)|g_false(A,B).
% 1.68/1.91 ** KEPT (pick-wt=6): 14 [] -g_false_only(A,B)| -g_true(A,B).
% 1.68/1.91 ** KEPT (pick-wt=9): 15 [] g_false_only(A,B)| -g_false(A,B)|g_true(A,B).
% 1.68/1.91
% 1.68/1.91 ------------> process sos:
% 1.68/1.91 ** KEPT (pick-wt=9): 37 [] g_true_only(A,B)|g_both(A,B)|g_false_only(A,B).
% 1.68/1.91
% 1.68/1.91 ======= end of input processing =======
% 1.68/1.91
% 1.68/1.91 =========== start of search ===========
% 1.68/1.91
% 1.68/1.91 -------- PROOF --------
% 1.68/1.91
% 1.68/1.91 -----> EMPTY CLAUSE at 0.01 sec ----> 237 [hyper,235,1,218] $F.
% 1.68/1.91
% 1.68/1.91 Length of proof is 34. Level of proof is 17.
% 1.68/1.91
% 1.68/1.91 ---------------- PROOF ----------------
% 1.68/1.91 % SZS status Theorem
% 1.68/1.91 % SZS output start Refutation
% See solution above
% 1.68/1.91 ------------ end of proof -------------
% 1.68/1.91
% 1.68/1.91
% 1.68/1.91 Search stopped by max_proofs option.
% 1.68/1.91
% 1.68/1.91
% 1.68/1.91 Search stopped by max_proofs option.
% 1.68/1.91
% 1.68/1.91 ============ end of search ============
% 1.68/1.91
% 1.68/1.91 -------------- statistics -------------
% 1.68/1.91 clauses given 75
% 1.68/1.91 clauses generated 484
% 1.68/1.91 clauses kept 236
% 1.68/1.91 clauses forward subsumed 263
% 1.68/1.91 clauses back subsumed 207
% 1.68/1.91 Kbytes malloced 976
% 1.68/1.91
% 1.68/1.91 ----------- times (seconds) -----------
% 1.68/1.91 user CPU time 0.02 (0 hr, 0 min, 0 sec)
% 1.68/1.91 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 1.68/1.91 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 1.68/1.91
% 1.68/1.91 That finishes the proof of the theorem.
% 1.68/1.91
% 1.68/1.91 Process 14038 finished Wed Jul 27 10:09:13 2022
% 1.68/1.91 Otter interrupted
% 1.68/1.91 PROOF FOUND
%------------------------------------------------------------------------------