%------------------------------------------------------------------------------
% File : Otter---3.3
% Problem : CSR055+1 : TPTP v8.1.0. Released v3.4.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 12:49:15 EDT 2022
% Result : Theorem 2.00s 2.19s
% Output : Refutation 2.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 4
% Syntax : Number of clauses : 6 ( 4 unt; 0 nHn; 6 RR)
% Number of literals : 8 ( 0 equ; 3 neg)
% Maximal clause size : 2 ( 1 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 2 ( 2 usr; 2 con; 0-0 aty)
% Number of variables : 3 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,axiom,
( ~ collection(A)
| ~ individual(A) ),
file('CSR055+1.p',unknown),
[] ).
cnf(18,axiom,
( ~ disjointwith(A,B)
| collection(A) ),
file('CSR055+1.p',unknown),
[] ).
cnf(34,axiom,
individual(c_xskijump_thegame),
file('CSR055+1.p',unknown),
[] ).
cnf(44,axiom,
disjointwith(c_xskijump_thegame,c_tptpcol_16_35301),
file('CSR055+1.p',unknown),
[] ).
cnf(61,plain,
collection(c_xskijump_thegame),
inference(hyper,[status(thm)],[44,18]),
[iquote('hyper,44,18')] ).
cnf(64,plain,
$false,
inference(hyper,[status(thm)],[61,1,34]),
[iquote('hyper,61,1,34')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : CSR055+1 : TPTP v8.1.0. Released v3.4.0.
% 0.11/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.18/0.33 % CPULimit : 300
% 0.18/0.33 % WCLimit : 300
% 0.18/0.33 % DateTime : Wed Jul 27 04:08:23 EDT 2022
% 0.18/0.33 % CPUTime :
% 2.00/2.19 ----- Otter 3.3f, August 2004 -----
% 2.00/2.19 The process was started by sandbox2 on n020.cluster.edu,
% 2.00/2.19 Wed Jul 27 04:08:23 2022
% 2.00/2.19 The command was "./otter". The process ID is 6964.
% 2.00/2.19
% 2.00/2.19 set(prolog_style_variables).
% 2.00/2.19 set(auto).
% 2.00/2.19 dependent: set(auto1).
% 2.00/2.19 dependent: set(process_input).
% 2.00/2.19 dependent: clear(print_kept).
% 2.00/2.19 dependent: clear(print_new_demod).
% 2.00/2.19 dependent: clear(print_back_demod).
% 2.00/2.19 dependent: clear(print_back_sub).
% 2.00/2.19 dependent: set(control_memory).
% 2.00/2.19 dependent: assign(max_mem, 12000).
% 2.00/2.19 dependent: assign(pick_given_ratio, 4).
% 2.00/2.19 dependent: assign(stats_level, 1).
% 2.00/2.19 dependent: assign(max_seconds, 10800).
% 2.00/2.19 clear(print_given).
% 2.00/2.19
% 2.00/2.19 formula_list(usable).
% 2.00/2.19 individual(c_xskijump_thegame).
% 2.00/2.19 genlmt(c_universalvocabularymt,c_corecyclmt).
% 2.00/2.19 transitivebinarypredicate(c_genlmt).
% 2.00/2.19 genlmt(c_corecyclmt,c_logicaltruthmt).
% 2.00/2.19 all OBJ (-(collection(OBJ)&individual(OBJ))).
% 2.00/2.19 disjointwith(c_collection,c_individual).
% 2.00/2.19 all OBJ COL1 COL2 (-(isa(OBJ,COL1)&isa(OBJ,COL2)&disjointwith(COL1,COL2))).
% 2.00/2.19 all SPECPRED PRED GENLPRED (genlinverse(SPECPRED,PRED)&genlinverse(PRED,GENLPRED)->genlpreds(SPECPRED,GENLPRED)).
% 2.00/2.19 arg2isa(c_disjointwith,c_collection).
% 2.00/2.19 all ARG1 ARG2 (disjointwith(ARG1,ARG2)->collection(ARG2)).
% 2.00/2.19 all OBJ COL1 COL2 (-(isa(OBJ,COL1)&isa(OBJ,COL2)&disjointwith(COL1,COL2))).
% 2.00/2.19 all SPECPRED PRED GENLPRED (genlinverse(SPECPRED,PRED)&genlinverse(PRED,GENLPRED)->genlpreds(SPECPRED,GENLPRED)).
% 2.00/2.19 all ARG1 INS (arg2isa(ARG1,INS)->collection(INS)).
% 2.00/2.19 all INS ARG2 (arg2isa(INS,ARG2)->relation(INS)).
% 2.00/2.19 all ARG1 OLD NEW (arg2isa(ARG1,OLD)&genls(OLD,NEW)->arg2isa(ARG1,NEW)).
% 2.00/2.19 all ARG1 OLD NEW (arg2isa(ARG1,OLD)&genls(OLD,NEW)->arg2isa(ARG1,NEW)).
% 2.00/2.19 all ARG1 INS (genlpreds(ARG1,INS)->predicate(INS)).
% 2.00/2.19 all ARG1 INS (genlpreds(ARG1,INS)->predicate(INS)).
% 2.00/2.19 all INS ARG2 (genlpreds(INS,ARG2)->predicate(INS)).
% 2.00/2.19 all INS ARG2 (genlpreds(INS,ARG2)->predicate(INS)).
% 2.00/2.19 all X Y Z (genlpreds(X,Y)&genlpreds(Y,Z)->genlpreds(X,Z)).
% 2.00/2.19 all X (predicate(X)->genlpreds(X,X)).
% 2.00/2.19 all X (predicate(X)->genlpreds(X,X)).
% 2.00/2.19 all ARG1 INS (genlinverse(ARG1,INS)->binarypredicate(INS)).
% 2.00/2.19 all INS ARG2 (genlinverse(INS,ARG2)->binarypredicate(INS)).
% 2.00/2.19 all OLD ARG2 NEW (genlinverse(OLD,ARG2)&genlpreds(NEW,OLD)->genlinverse(NEW,ARG2)).
% 2.00/2.19 all ARG1 OLD NEW (genlinverse(ARG1,OLD)&genlpreds(OLD,NEW)->genlinverse(ARG1,NEW)).
% 2.00/2.19 mtvisible(c_basekb).
% 2.00/2.19 all X (isa(X,c_collection)->collection(X)).
% 2.00/2.19 all X (collection(X)->isa(X,c_collection)).
% 2.00/2.19 all ARG1 INS (disjointwith(ARG1,INS)->collection(INS)).
% 2.00/2.19 all INS ARG2 (disjointwith(INS,ARG2)->collection(INS)).
% 2.00/2.19 all X Y (disjointwith(X,Y)->disjointwith(Y,X)).
% 2.00/2.19 all ARG1 OLD NEW (disjointwith(ARG1,OLD)&genls(NEW,OLD)->disjointwith(ARG1,NEW)).
% 2.00/2.19 all OLD ARG2 NEW (disjointwith(OLD,ARG2)&genls(NEW,OLD)->disjointwith(NEW,ARG2)).
% 2.00/2.19 mtvisible(c_logicaltruthmt).
% 2.00/2.19 all X (isa(X,c_transitivebinarypredicate)->transitivebinarypredicate(X)).
% 2.00/2.19 all X (transitivebinarypredicate(X)->isa(X,c_transitivebinarypredicate)).
% 2.00/2.19 mtvisible(c_corecyclmt).
% 2.00/2.19 all SPECMT GENLMT (mtvisible(SPECMT)&genlmt(SPECMT,GENLMT)->mtvisible(GENLMT)).
% 2.00/2.19 all ARG1 INS (genlmt(ARG1,INS)->microtheory(INS)).
% 2.00/2.19 all ARG1 INS (genlmt(ARG1,INS)->microtheory(INS)).
% 2.00/2.19 all INS ARG2 (genlmt(INS,ARG2)->microtheory(INS)).
% 2.00/2.19 all INS ARG2 (genlmt(INS,ARG2)->microtheory(INS)).
% 2.00/2.19 all X Y Z (genlmt(X,Y)&genlmt(Y,Z)->genlmt(X,Z)).
% 2.00/2.19 all X (microtheory(X)->genlmt(X,X)).
% 2.00/2.19 all X (microtheory(X)->genlmt(X,X)).
% 2.00/2.19 all X (isa(X,c_individual)->individual(X)).
% 2.00/2.19 all X (individual(X)->isa(X,c_individual)).
% 2.00/2.19 all ARG1 INS (isa(ARG1,INS)->collection(INS)).
% 2.00/2.19 all ARG1 INS (isa(ARG1,INS)->collection(INS)).
% 2.00/2.19 all INS ARG2 (isa(INS,ARG2)->thing(INS)).
% 2.00/2.19 all INS ARG2 (isa(INS,ARG2)->thing(INS)).
% 2.00/2.19 all ARG1 OLD NEW (isa(ARG1,OLD)&genls(OLD,NEW)->isa(ARG1,NEW)).
% 2.00/2.19 mtvisible(c_universalvocabularymt).
% 2.00/2.19 -(-disjointwith(c_xskijump_thegame,c_tptpcol_16_35301)).
% 2.00/2.19 end_of_list.
% 2.00/2.19
% 2.00/2.19 -------> usable clausifies to:
% 2.00/2.19
% 2.00/2.19 list(usable).
% 2.00/2.19 0 [] individual(c_xskijump_thegame).
% 2.00/2.19 0 [] genlmt(c_universalvocabularymt,c_corecyclmt).
% 2.00/2.19 0 [] transitivebinarypredicate(c_genlmt).
% 2.00/2.19 0 [] genlmt(c_corecyclmt,c_logicaltruthmt).
% 2.00/2.19 0 [] -collection(OBJ)| -individual(OBJ).
% 2.00/2.19 0 [] disjointwith(c_collection,c_individual).
% 2.00/2.19 0 [] -isa(OBJ,COL1)| -isa(OBJ,COL2)| -disjointwith(COL1,COL2).
% 2.00/2.19 0 [] -genlinverse(SPECPRED,PRED)| -genlinverse(PRED,GENLPRED)|genlpreds(SPECPRED,GENLPRED).
% 2.00/2.19 0 [] arg2isa(c_disjointwith,c_collection).
% 2.00/2.19 0 [] -disjointwith(ARG1,ARG2)|collection(ARG2).
% 2.00/2.19 0 [] -isa(OBJ,COL1)| -isa(OBJ,COL2)| -disjointwith(COL1,COL2).
% 2.00/2.19 0 [] -genlinverse(SPECPRED,PRED)| -genlinverse(PRED,GENLPRED)|genlpreds(SPECPRED,GENLPRED).
% 2.00/2.19 0 [] -arg2isa(ARG1,INS)|collection(INS).
% 2.00/2.19 0 [] -arg2isa(INS,ARG2)|relation(INS).
% 2.00/2.19 0 [] -arg2isa(ARG1,OLD)| -genls(OLD,NEW)|arg2isa(ARG1,NEW).
% 2.00/2.19 0 [] -arg2isa(ARG1,OLD)| -genls(OLD,NEW)|arg2isa(ARG1,NEW).
% 2.00/2.19 0 [] -genlpreds(ARG1,INS)|predicate(INS).
% 2.00/2.19 0 [] -genlpreds(ARG1,INS)|predicate(INS).
% 2.00/2.19 0 [] -genlpreds(INS,ARG2)|predicate(INS).
% 2.00/2.19 0 [] -genlpreds(INS,ARG2)|predicate(INS).
% 2.00/2.19 0 [] -genlpreds(X,Y)| -genlpreds(Y,Z)|genlpreds(X,Z).
% 2.00/2.19 0 [] -predicate(X)|genlpreds(X,X).
% 2.00/2.19 0 [] -predicate(X)|genlpreds(X,X).
% 2.00/2.19 0 [] -genlinverse(ARG1,INS)|binarypredicate(INS).
% 2.00/2.19 0 [] -genlinverse(INS,ARG2)|binarypredicate(INS).
% 2.00/2.19 0 [] -genlinverse(OLD,ARG2)| -genlpreds(NEW,OLD)|genlinverse(NEW,ARG2).
% 2.00/2.19 0 [] -genlinverse(ARG1,OLD)| -genlpreds(OLD,NEW)|genlinverse(ARG1,NEW).
% 2.00/2.19 0 [] mtvisible(c_basekb).
% 2.00/2.19 0 [] -isa(X,c_collection)|collection(X).
% 2.00/2.19 0 [] -collection(X)|isa(X,c_collection).
% 2.00/2.19 0 [] -disjointwith(ARG1,INS)|collection(INS).
% 2.00/2.19 0 [] -disjointwith(INS,ARG2)|collection(INS).
% 2.00/2.19 0 [] -disjointwith(X,Y)|disjointwith(Y,X).
% 2.00/2.19 0 [] -disjointwith(ARG1,OLD)| -genls(NEW,OLD)|disjointwith(ARG1,NEW).
% 2.00/2.19 0 [] -disjointwith(OLD,ARG2)| -genls(NEW,OLD)|disjointwith(NEW,ARG2).
% 2.00/2.19 0 [] mtvisible(c_logicaltruthmt).
% 2.00/2.19 0 [] -isa(X,c_transitivebinarypredicate)|transitivebinarypredicate(X).
% 2.00/2.19 0 [] -transitivebinarypredicate(X)|isa(X,c_transitivebinarypredicate).
% 2.00/2.19 0 [] mtvisible(c_corecyclmt).
% 2.00/2.19 0 [] -mtvisible(SPECMT)| -genlmt(SPECMT,GENLMT)|mtvisible(GENLMT).
% 2.00/2.19 0 [] -genlmt(ARG1,INS)|microtheory(INS).
% 2.00/2.19 0 [] -genlmt(ARG1,INS)|microtheory(INS).
% 2.00/2.19 0 [] -genlmt(INS,ARG2)|microtheory(INS).
% 2.00/2.19 0 [] -genlmt(INS,ARG2)|microtheory(INS).
% 2.00/2.19 0 [] -genlmt(X,Y)| -genlmt(Y,Z)|genlmt(X,Z).
% 2.00/2.19 0 [] -microtheory(X)|genlmt(X,X).
% 2.00/2.19 0 [] -microtheory(X)|genlmt(X,X).
% 2.00/2.19 0 [] -isa(X,c_individual)|individual(X).
% 2.00/2.19 0 [] -individual(X)|isa(X,c_individual).
% 2.00/2.19 0 [] -isa(ARG1,INS)|collection(INS).
% 2.00/2.19 0 [] -isa(ARG1,INS)|collection(INS).
% 2.00/2.19 0 [] -isa(INS,ARG2)|thing(INS).
% 2.00/2.19 0 [] -isa(INS,ARG2)|thing(INS).
% 2.00/2.19 0 [] -isa(ARG1,OLD)| -genls(OLD,NEW)|isa(ARG1,NEW).
% 2.00/2.19 0 [] mtvisible(c_universalvocabularymt).
% 2.00/2.19 0 [] disjointwith(c_xskijump_thegame,c_tptpcol_16_35301).
% 2.00/2.19 end_of_list.
% 2.00/2.19
% 2.00/2.19 SCAN INPUT: prop=0, horn=1, equality=0, symmetry=0, max_lits=3.
% 2.00/2.19
% 2.00/2.19 This is a Horn set without equality. The strategy will
% 2.00/2.19 be hyperresolution, with satellites in sos and nuclei
% 2.00/2.19 in usable.
% 2.00/2.19
% 2.00/2.19 dependent: set(hyper_res).
% 2.00/2.19 dependent: clear(order_hyper).
% 2.00/2.19
% 2.00/2.19 ------------> process usable:
% 2.00/2.19 ** KEPT (pick-wt=4): 1 [] -collection(A)| -individual(A).
% 2.00/2.19 ** KEPT (pick-wt=9): 2 [] -isa(A,B)| -isa(A,C)| -disjointwith(B,C).
% 2.00/2.19 ** KEPT (pick-wt=9): 3 [] -genlinverse(A,B)| -genlinverse(B,C)|genlpreds(A,C).
% 2.00/2.19 ** KEPT (pick-wt=5): 4 [] -disjointwith(A,B)|collection(B).
% 2.00/2.19 Following clause subsumed by 2 during input processing: 0 [] -isa(A,B)| -isa(A,C)| -disjointwith(B,C).
% 2.00/2.19 Following clause subsumed by 3 during input processing: 0 [] -genlinverse(A,B)| -genlinverse(B,C)|genlpreds(A,C).
% 2.00/2.19 ** KEPT (pick-wt=5): 5 [] -arg2isa(A,B)|collection(B).
% 2.00/2.19 ** KEPT (pick-wt=5): 6 [] -arg2isa(A,B)|relation(A).
% 2.00/2.19 ** KEPT (pick-wt=9): 7 [] -arg2isa(A,B)| -genls(B,C)|arg2isa(A,C).
% 2.00/2.19 Following clause subsumed by 7 during input processing: 0 [] -arg2isa(A,B)| -genls(B,C)|arg2isa(A,C).
% 2.00/2.19 ** KEPT (pick-wt=5): 8 [] -genlpreds(A,B)|predicate(B).
% 2.00/2.19 Following clause subsumed by 8 during input processing: 0 [] -genlpreds(A,B)|predicate(B).
% 2.00/2.19 ** KEPT (pick-wt=5): 9 [] -genlpreds(A,B)|predicate(A).
% 2.00/2.19 Following clause subsumed by 9 during input processing: 0 [] -genlpreds(A,B)|predicate(A).
% 2.00/2.19 ** KEPT (pick-wt=9): 10 [] -genlpreds(A,B)| -genlpreds(B,C)|genlpreds(A,C).
% 2.00/2.19 ** KEPT (pick-wt=5): 11 [] -predicate(A)|genlpreds(A,A).
% 2.00/2.19 Following clause subsumed by 11 during input processing: 0 [] -predicate(A)|genlpreds(A,A).
% 2.00/2.19 ** KEPT (pick-wt=5): 12 [] -genlinverse(A,B)|binarypredicate(B).
% 2.00/2.19 ** KEPT (pick-wt=5): 13 [] -genlinverse(A,B)|binarypredicate(A).
% 2.00/2.19 ** KEPT (pick-wt=9): 14 [] -genlinverse(A,B)| -genlpreds(C,A)|genlinverse(C,B).
% 2.00/2.19 ** KEPT (pick-wt=9): 15 [] -genlinverse(A,B)| -genlpreds(B,C)|genlinverse(A,C).
% 2.00/2.19 ** KEPT (pick-wt=5): 16 [] -isa(A,c_collection)|collection(A).
% 2.00/2.19 ** KEPT (pick-wt=5): 17 [] -collection(A)|isa(A,c_collection).
% 2.00/2.19 Following clause subsumed by 4 during input processing: 0 [] -disjointwith(A,B)|collection(B).
% 2.00/2.19 ** KEPT (pick-wt=5): 18 [] -disjointwith(A,B)|collection(A).
% 2.00/2.19 ** KEPT (pick-wt=6): 19 [] -disjointwith(A,B)|disjointwith(B,A).
% 2.00/2.19 ** KEPT (pick-wt=9): 20 [] -disjointwith(A,B)| -genls(C,B)|disjointwith(A,C).
% 2.00/2.19 ** KEPT (pick-wt=9): 21 [] -disjointwith(A,B)| -genls(C,A)|disjointwith(C,B).
% 2.00/2.19 ** KEPT (pick-wt=5): 22 [] -isa(A,c_transitivebinarypredicate)|transitivebinarypredicate(A).
% 2.00/2.19 ** KEPT (pick-wt=5): 23 [] -transitivebinarypredicate(A)|isa(A,c_transitivebinarypredicate).
% 2.00/2.19 ** KEPT (pick-wt=7): 24 [] -mtvisible(A)| -genlmt(A,B)|mtvisible(B).
% 2.00/2.19 ** KEPT (pick-wt=5): 25 [] -genlmt(A,B)|microtheory(B).
% 2.00/2.19 Following clause subsumed by 25 during input processing: 0 [] -genlmt(A,B)|microtheory(B).
% 2.00/2.19 ** KEPT (pick-wt=5): 26 [] -genlmt(A,B)|microtheory(A).
% 2.00/2.19 Following clause subsumed by 26 during input processing: 0 [] -genlmt(A,B)|microtheory(A).
% 2.00/2.19 ** KEPT (pick-wt=9): 27 [] -genlmt(A,B)| -genlmt(B,C)|genlmt(A,C).
% 2.00/2.19 ** KEPT (pick-wt=5): 28 [] -microtheory(A)|genlmt(A,A).
% 2.00/2.19 Following clause subsumed by 28 during input processing: 0 [] -microtheory(A)|genlmt(A,A).
% 2.00/2.19 ** KEPT (pick-wt=5): 29 [] -isa(A,c_individual)|individual(A).
% 2.00/2.19 ** KEPT (pick-wt=5): 30 [] -individual(A)|isa(A,c_individual).
% 2.00/2.19 ** KEPT (pick-wt=5): 31 [] -isa(A,B)|collection(B).
% 2.00/2.19 Following clause subsumed by 31 during input processing: 0 [] -isa(A,B)|collection(B).
% 2.00/2.19 ** KEPT (pick-wt=5): 32 [] -isa(A,B)|thing(A).
% 2.00/2.19 Following clause subsumed by 32 during input processing: 0 [] -isa(A,B)|thing(A).
% 2.00/2.19 ** KEPT (pick-wt=9): 33 [] -isa(A,B)| -genls(B,C)|isa(A,C).
% 2.00/2.19
% 2.00/2.19 ------------> process sos:
% 2.00/2.19 ** KEPT (pick-wt=2): 34 [] individual(c_xskijump_thegame).
% 2.00/2.19 ** KEPT (pick-wt=3): 35 [] genlmt(c_universalvocabularymt,c_corecyclmt).
% 2.00/2.19 ** KEPT (pick-wt=2): 36 [] transitivebinarypredicate(c_genlmt).
% 2.00/2.19 ** KEPT (pick-wt=3): 37 [] genlmt(c_corecyclmt,c_logicaltruthmt).
% 2.00/2.19 ** KEPT (pick-wt=3): 38 [] disjointwith(c_collection,c_individual).
% 2.00/2.19 ** KEPT (pick-wt=3): 39 [] arg2isa(c_disjointwith,c_collection).
% 2.00/2.19 ** KEPT (pick-wt=2): 40 [] mtvisible(c_basekb).
% 2.00/2.19 ** KEPT (pick-wt=2): 41 [] mtvisible(c_logicaltruthmt).
% 2.00/2.19 ** KEPT (pick-wt=2): 42 [] mtvisible(c_corecyclmt).
% 2.00/2.19 ** KEPT (pick-wt=2): 43 [] mtvisible(c_universalvocabularymt).
% 2.00/2.19 ** KEPT (pick-wt=3): 44 [] disjointwith(c_xskijump_thegame,c_tptpcol_16_35301).
% 2.00/2.19
% 2.00/2.19 ======= end of input processing =======
% 2.00/2.19
% 2.00/2.19 =========== start of search ===========
% 2.00/2.19
% 2.00/2.19 -------- PROOF --------
% 2.00/2.19
% 2.00/2.19 -----> EMPTY CLAUSE at 0.00 sec ----> 64 [hyper,61,1,34] $F.
% 2.00/2.19
% 2.00/2.19 Length of proof is 1. Level of proof is 1.
% 2.00/2.19
% 2.00/2.19 ---------------- PROOF ----------------
% 2.00/2.19 % SZS status Theorem
% 2.00/2.19 % SZS output start Refutation
% See solution above
% 2.00/2.19 ------------ end of proof -------------
% 2.00/2.19
% 2.00/2.19
% 2.00/2.19 Search stopped by max_proofs option.
% 2.00/2.19
% 2.00/2.19
% 2.00/2.19 Search stopped by max_proofs option.
% 2.00/2.19
% 2.00/2.19 ============ end of search ============
% 2.00/2.19
% 2.00/2.19 -------------- statistics -------------
% 2.00/2.19 clauses given 18
% 2.00/2.19 clauses generated 24
% 2.00/2.19 clauses kept 63
% 2.00/2.19 clauses forward subsumed 16
% 2.00/2.19 clauses back subsumed 0
% 2.00/2.19 Kbytes malloced 976
% 2.00/2.19
% 2.00/2.19 ----------- times (seconds) -----------
% 2.00/2.19 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.00/2.19 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 2.00/2.19 wall-clock time 2 (0 hr, 0 min, 2 sec)
% 2.00/2.19
% 2.00/2.19 That finishes the proof of the theorem.
% 2.00/2.19
% 2.00/2.19 Process 6964 finished Wed Jul 27 04:08:25 2022
% 2.00/2.19 Otter interrupted
% 2.00/2.19 PROOF FOUND
%------------------------------------------------------------------------------