TSTP Solution File: CSR055+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : CSR055+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %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 : 600s
% DateTime : Fri Jul 15 23:05:11 EDT 2022
% Result : Theorem 0.74s 1.06s
% Output : Refutation 0.74s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : CSR055+1 : TPTP v8.1.0. Released v3.4.0.
% 0.08/0.12 % Command : tptp2X_and_run_prover9 %d %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.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Thu Jun 9 21:54:21 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.74/1.05 ============================== Prover9 ===============================
% 0.74/1.05 Prover9 (32) version 2009-11A, November 2009.
% 0.74/1.05 Process 22772 was started by sandbox2 on n020.cluster.edu,
% 0.74/1.05 Thu Jun 9 21:54:22 2022
% 0.74/1.05 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_22390_n020.cluster.edu".
% 0.74/1.05 ============================== end of head ===========================
% 0.74/1.05
% 0.74/1.05 ============================== INPUT =================================
% 0.74/1.05
% 0.74/1.05 % Reading from file /tmp/Prover9_22390_n020.cluster.edu
% 0.74/1.05
% 0.74/1.05 set(prolog_style_variables).
% 0.74/1.05 set(auto2).
% 0.74/1.05 % set(auto2) -> set(auto).
% 0.74/1.05 % set(auto) -> set(auto_inference).
% 0.74/1.05 % set(auto) -> set(auto_setup).
% 0.74/1.05 % set(auto_setup) -> set(predicate_elim).
% 0.74/1.05 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.74/1.05 % set(auto) -> set(auto_limits).
% 0.74/1.05 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.74/1.05 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.74/1.05 % set(auto) -> set(auto_denials).
% 0.74/1.05 % set(auto) -> set(auto_process).
% 0.74/1.05 % set(auto2) -> assign(new_constants, 1).
% 0.74/1.05 % set(auto2) -> assign(fold_denial_max, 3).
% 0.74/1.05 % set(auto2) -> assign(max_weight, "200.000").
% 0.74/1.05 % set(auto2) -> assign(max_hours, 1).
% 0.74/1.05 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.74/1.05 % set(auto2) -> assign(max_seconds, 0).
% 0.74/1.05 % set(auto2) -> assign(max_minutes, 5).
% 0.74/1.05 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.74/1.05 % set(auto2) -> set(sort_initial_sos).
% 0.74/1.05 % set(auto2) -> assign(sos_limit, -1).
% 0.74/1.05 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.74/1.05 % set(auto2) -> assign(max_megs, 400).
% 0.74/1.05 % set(auto2) -> assign(stats, some).
% 0.74/1.05 % set(auto2) -> clear(echo_input).
% 0.74/1.05 % set(auto2) -> set(quiet).
% 0.74/1.05 % set(auto2) -> clear(print_initial_clauses).
% 0.74/1.05 % set(auto2) -> clear(print_given).
% 0.74/1.05 assign(lrs_ticks,-1).
% 0.74/1.05 assign(sos_limit,10000).
% 0.74/1.05 assign(order,kbo).
% 0.74/1.05 set(lex_order_vars).
% 0.74/1.05 clear(print_given).
% 0.74/1.05
% 0.74/1.05 % formulas(sos). % not echoed (56 formulas)
% 0.74/1.05
% 0.74/1.05 ============================== end of input ==========================
% 0.74/1.05
% 0.74/1.05 % From the command line: assign(max_seconds, 300).
% 0.74/1.05
% 0.74/1.05 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.74/1.05
% 0.74/1.05 % Formulas that are not ordinary clauses:
% 0.74/1.05 1 (all OBJ -(collection(OBJ) & individual(OBJ))) # label(just5) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.05 2 (all OBJ all COL1 all COL2 -(isa(OBJ,COL1) & isa(OBJ,COL2) & disjointwith(COL1,COL2))) # label(just7) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.05 3 (all SPECPRED all PRED all GENLPRED (genlinverse(SPECPRED,PRED) & genlinverse(PRED,GENLPRED) -> genlpreds(SPECPRED,GENLPRED))) # label(just8) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.05 4 (all ARG1 all ARG2 (disjointwith(ARG1,ARG2) -> collection(ARG2))) # label(just10) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.05 5 (all OBJ all COL1 all COL2 -(isa(OBJ,COL1) & isa(OBJ,COL2) & disjointwith(COL1,COL2))) # label(just11) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.05 6 (all SPECPRED all PRED all GENLPRED (genlinverse(SPECPRED,PRED) & genlinverse(PRED,GENLPRED) -> genlpreds(SPECPRED,GENLPRED))) # label(just12) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.05 7 (all ARG1 all INS (arg2isa(ARG1,INS) -> collection(INS))) # label(just13) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.05 8 (all INS all ARG2 (arg2isa(INS,ARG2) -> relation(INS))) # label(just14) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.05 9 (all ARG1 all OLD all NEW (arg2isa(ARG1,OLD) & genls(OLD,NEW) -> arg2isa(ARG1,NEW))) # label(just15) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.05 10 (all ARG1 all OLD all NEW (arg2isa(ARG1,OLD) & genls(OLD,NEW) -> arg2isa(ARG1,NEW))) # label(just16) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.05 11 (all ARG1 all INS (genlpreds(ARG1,INS) -> predicate(INS))) # label(just17) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.05 12 (all ARG1 all INS (genlpreds(ARG1,INS) -> predicate(INS))) # label(just18) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.05 13 (all INS all ARG2 (genlpreds(INS,ARG2) -> predicate(INS))) # label(just19) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.05 14 (all INS all ARG2 (genlpreds(INS,ARG2) -> predicate(INS))) # label(just20) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.05 15 (all X all Y all Z (genlpreds(X,Y) & genlpreds(Y,Z) -> genlpreds(X,Z))) # label(just21) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.05 16 (all X (predicate(X) -> genlpreds(X,X))) # label(just22) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.05 17 (all X (predicate(X) -> genlpreds(X,X))) # label(just23) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.05 18 (all ARG1 all INS (genlinverse(ARG1,INS) -> binarypredicate(INS))) # label(just24) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.05 19 (all INS all ARG2 (genlinverse(INS,ARG2) -> binarypredicate(INS))) # label(just25) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.05 20 (all OLD all ARG2 all NEW (genlinverse(OLD,ARG2) & genlpreds(NEW,OLD) -> genlinverse(NEW,ARG2))) # label(just26) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.05 21 (all ARG1 all OLD all NEW (genlinverse(ARG1,OLD) & genlpreds(OLD,NEW) -> genlinverse(ARG1,NEW))) # label(just27) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.05 22 (all X (isa(X,c_collection) -> collection(X))) # label(just29) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.05 23 (all X (collection(X) -> isa(X,c_collection))) # label(just30) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.05 24 (all ARG1 all INS (disjointwith(ARG1,INS) -> collection(INS))) # label(just31) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.05 25 (all INS all ARG2 (disjointwith(INS,ARG2) -> collection(INS))) # label(just32) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.05 26 (all X all Y (disjointwith(X,Y) -> disjointwith(Y,X))) # label(just33) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.05 27 (all ARG1 all OLD all NEW (disjointwith(ARG1,OLD) & genls(NEW,OLD) -> disjointwith(ARG1,NEW))) # label(just34) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.05 28 (all OLD all ARG2 all NEW (disjointwith(OLD,ARG2) & genls(NEW,OLD) -> disjointwith(NEW,ARG2))) # label(just35) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.05 29 (all X (isa(X,c_transitivebinarypredicate) -> transitivebinarypredicate(X))) # label(just37) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.05 30 (all X (transitivebinarypredicate(X) -> isa(X,c_transitivebinarypredicate))) # label(just38) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.05 31 (all SPECMT all GENLMT (mtvisible(SPECMT) & genlmt(SPECMT,GENLMT) -> mtvisible(GENLMT))) # label(just40) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.05 32 (all ARG1 all INS (genlmt(ARG1,INS) -> microtheory(INS))) # label(just41) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.05 33 (all ARG1 all INS (genlmt(ARG1,INS) -> microtheory(INS))) # label(just42) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.05 34 (all INS all ARG2 (genlmt(INS,ARG2) -> microtheory(INS))) # label(just43) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.05 35 (all INS all ARG2 (genlmt(INS,ARG2) -> microtheory(INS))) # label(just44) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.05 36 (all X all Y all Z (genlmt(X,Y) & genlmt(Y,Z) -> genlmt(X,Z))) # label(just45) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.05 37 (all X (microtheory(X) -> genlmt(X,X))) # label(just46) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.05 38 (all X (microtheory(X) -> genlmt(X,X))) # label(just47) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.05 39 (all X (isa(X,c_individual) -> individual(X))) # label(just48) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.05 40 (all X (individual(X) -> isa(X,c_individual))) # label(just49) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.05 41 (all ARG1 all INS (isa(ARG1,INS) -> collection(INS))) # label(just50) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.05 42 (all ARG1 all INS (isa(ARG1,INS) -> collection(INS))) # label(just51) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.05 43 (all INS all ARG2 (isa(INS,ARG2) -> thing(INS))) # label(just52) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.05 44 (all INS all ARG2 (isa(INS,ARG2) -> thing(INS))) # label(just53) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.05 45 (all ARG1 all OLD all NEW (isa(ARG1,OLD) & genls(OLD,NEW) -> isa(ARG1,NEW))) # label(just54) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.05 46 --disjointwith(c_xskijump_thegame,c_tptpcol_16_35301) # label(query55) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.74/1.05
% 0.74/1.05 ============================== end of process non-clausal formulas ===
% 0.74/1.05
% 0.74/1.05 ============================== PROCESS INITIAL CLAUSES ===============
% 0.74/1.05
% 0.74/1.05 ============================== PREDICATE ELIMINATION =================
% 0.74/1.05 47 -collection(A) | -individual(A) # label(just5) # label(axiom). [clausify(1)].
% 0.74/1.05 48 individual(c_xskijump_thegame) # label(just1) # label(axiom). [assumption].
% 0.74/1.05 Derived: -collection(c_xskijump_thegame). [resolve(47,b,48,a)].
% 0.74/1.05 49 -isa(A,c_individual) | individual(A) # label(just48) # label(axiom). [clausify(39)].
% 0.74/1.05 Derived: -isa(A,c_individual) | -collection(A). [resolve(49,b,47,b)].
% 0.74/1.05 50 -individual(A) | isa(A,c_individual) # label(just49) # label(axiom). [clausify(40)].
% 0.74/1.05 Derived: isa(c_xskijump_thegame,c_individual). [resolve(50,a,48,a)].
% 0.74/1.05 51 -transitivebinarypredicate(A) | isa(A,c_transitivebinarypredicate) # label(just38) # label(axiom). [clausify(30)].
% 0.74/1.05 52 transitivebinarypredicate(c_genlmt) # label(just3) # label(axiom). [assumption].
% 0.74/1.05 53 -isa(A,c_transitivebinarypredicate) | transitivebinarypredicate(A) # label(just37) # label(axiom). [clausify(29)].
% 0.74/1.05 Derived: isa(c_genlmt,c_transitivebinarypredicate). [resolve(51,a,52,a)].
% 0.74/1.05 54 -collection(A) | isa(A,c_collection) # label(just30) # label(axiom). [clausify(23)].
% 0.74/1.05 55 -disjointwith(A,B) | collection(B) # label(just10) # label(axiom). [clausify(4)].
% 0.74/1.05 56 -arg2isa(A,B) | collection(B) # label(just13) # label(axiom). [clausify(7)].
% 0.74/1.05 57 -isa(A,c_collection) | collection(A) # label(just29) # label(axiom). [clausify(22)].
% 0.74/1.05 Derived: isa(A,c_collection) | -disjointwith(B,A). [resolve(54,a,55,b)].
% 0.74/1.05 Derived: isa(A,c_collection) | -arg2isa(B,A). [resolve(54,a,56,b)].
% 0.74/1.05 58 -disjointwith(A,B) | collection(B) # label(just31) # label(axiom). [clausify(24)].
% 0.74/1.05 59 -disjointwith(A,B) | collection(A) # label(just32) # label(axiom). [clausify(25)].
% 0.74/1.05 Derived: -disjointwith(A,B) | isa(A,c_collection). [resolve(59,b,54,a)].
% 0.74/1.05 60 -isa(A,B) | collection(B) # label(just50) # label(axiom). [clausify(41)].
% 0.74/1.05 Derived: -isa(A,B) | isa(B,c_collection). [resolve(60,b,54,a)].
% 0.74/1.05 61 -isa(A,B) | collection(B) # label(just51) # label(axiom). [clausify(42)].
% 0.74/1.05 62 -collection(c_xskijump_thegame). [resolve(47,b,48,a)].
% 0.74/1.05 Derived: -disjointwith(A,c_xskijump_thegame). [resolve(62,a,55,b)].
% 0.74/1.05 Derived: -arg2isa(A,c_xskijump_thegame). [resolve(62,a,56,b)].
% 0.74/1.05 Derived: -isa(c_xskijump_thegame,c_collection). [resolve(62,a,57,b)].
% 0.74/1.05 Derived: -disjointwith(c_xskijump_thegame,A). [resolve(62,a,59,b)].
% 0.74/1.05 Derived: -isa(A,c_xskijump_thegame). [resolve(62,a,60,b)].
% 0.74/1.05 63 -isa(A,c_individual) | -collection(A). [resolve(49,b,47,b)].
% 0.74/1.05 Derived: -isa(A,c_individual) | -disjointwith(B,A). [resolve(63,b,55,b)].
% 0.74/1.05 Derived: -isa(A,c_individual) | -arg2isa(B,A). [resolve(63,b,56,b)].
% 0.74/1.05 Derived: -isa(A,c_individual) | -isa(A,c_collection). [resolve(63,b,57,b)].
% 0.74/1.05 Derived: -isa(A,c_individual) | -disjointwith(A,B). [resolve(63,b,59,b)].
% 0.74/1.05 Derived: -isa(A,c_individual) | -isa(B,A). [resolve(63,b,60,b)].
% 0.74/1.05 64 -predicate(A) | genlpreds(A,A) # label(just22) # label(axiom). [clausify(16)].
% 0.74/1.05 65 -genlpreds(A,B) | predicate(B) # label(just17) # label(axiom). [clausify(11)].
% 0.74/1.05 66 -genlpreds(A,B) | predicate(B) # label(just18) # label(axiom). [clausify(12)].
% 0.74/1.05 67 -genlpreds(A,B) | predicate(A) # label(just19) # label(axiom). [clausify(13)].
% 0.74/1.05 68 -genlpreds(A,B) | predicate(A) # label(just20) # label(axiom). [clausify(14)].
% 0.74/1.05 Derived: genlpreds(A,A) | -genlpreds(B,A). [resolve(64,a,65,b)].
% 0.74/1.05 Derived: genlpreds(A,A) | -genlpreds(A,B). [resolve(64,a,67,b)].
% 0.74/1.05 69 -predicate(A) | genlpreds(A,A) # label(just23) # label(axiom). [clausify(17)].
% 0.74/1.05 70 -microtheory(A) | genlmt(A,A) # label(just46) # label(axiom). [clausify(37)].
% 0.74/1.05 71 -genlmt(A,B) | microtheory(B) # label(just41) # label(axiom). [clausify(32)].
% 0.74/1.05 72 -genlmt(A,B) | microtheory(B) # label(just42) # label(axiom). [clausify(33)].
% 0.74/1.05 73 -genlmt(A,B) | microtheory(A) # label(just43) # label(axi
% 0.74/1.05 WARNING: denials share constants (see output).
% 0.74/1.05
% 0.74/1.06 om). [clausify(34)].
% 0.74/1.06 74 -genlmt(A,B) | microtheory(A) # label(just44) # label(axiom). [clausify(35)].
% 0.74/1.06 Derived: genlmt(A,A) | -genlmt(B,A). [resolve(70,a,71,b)].
% 0.74/1.06 Derived: genlmt(A,A) | -genlmt(A,B). [resolve(70,a,73,b)].
% 0.74/1.06 75 -microtheory(A) | genlmt(A,A) # label(just47) # label(axiom). [clausify(38)].
% 0.74/1.06 76 isa(A,c_collection) | -arg2isa(B,A). [resolve(54,a,56,b)].
% 0.74/1.06 77 arg2isa(c_disjointwith,c_collection) # label(just9) # label(axiom). [assumption].
% 0.74/1.06 Derived: isa(c_collection,c_collection). [resolve(76,b,77,a)].
% 0.74/1.06 78 -arg2isa(A,c_xskijump_thegame). [resolve(62,a,56,b)].
% 0.74/1.06 79 -isa(A,c_individual) | -arg2isa(B,A). [resolve(63,b,56,b)].
% 0.74/1.06 Derived: -isa(c_collection,c_individual). [resolve(79,b,77,a)].
% 0.74/1.06
% 0.74/1.06 ============================== end predicate elimination =============
% 0.74/1.06
% 0.74/1.06 Auto_denials:
% 0.74/1.06 % copying label just7 to answer in negative clause
% 0.74/1.06 % copying label just11 to answer in negative clause
% 0.74/1.06 % assign(max_proofs, 11). % (Horn set with more than one neg. clause)
% 0.74/1.06
% 0.74/1.06 WARNING, because some of the denials share constants,
% 0.74/1.06 some of the denials or their descendents may be subsumed,
% 0.74/1.06 preventing the target number of proofs from being found.
% 0.74/1.06 The shared constants are: c_individual, c_collection, c_xskijump_thegame.
% 0.74/1.06
% 0.74/1.06 Term ordering decisions:
% 0.74/1.06 Function symbol KB weights: c_collection=1. c_corecyclmt=1. c_individual=1. c_logicaltruthmt=1. c_universalvocabularymt=1. c_xskijump_thegame=1. c_basekb=1. c_genlmt=1. c_tptpcol_16_35301=1. c_transitivebinarypredicate=1.
% 0.74/1.06
% 0.74/1.06 ============================== PROOF =================================
% 0.74/1.06 % SZS status Theorem
% 0.74/1.06 % SZS output start Refutation
% 0.74/1.06
% 0.74/1.06 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.74/1.06 % Length of proof is 10.
% 0.74/1.06 % Level of proof is 4.
% 0.74/1.06 % Maximum clause weight is 3.000.
% 0.74/1.06 % Given clauses 0.
% 0.74/1.06
% 0.74/1.06 1 (all OBJ -(collection(OBJ) & individual(OBJ))) # label(just5) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.06 25 (all INS all ARG2 (disjointwith(INS,ARG2) -> collection(INS))) # label(just32) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.06 46 --disjointwith(c_xskijump_thegame,c_tptpcol_16_35301) # label(query55) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.74/1.06 47 -collection(A) | -individual(A) # label(just5) # label(axiom). [clausify(1)].
% 0.74/1.06 48 individual(c_xskijump_thegame) # label(just1) # label(axiom). [assumption].
% 0.74/1.06 59 -disjointwith(A,B) | collection(A) # label(just32) # label(axiom). [clausify(25)].
% 0.74/1.06 62 -collection(c_xskijump_thegame). [resolve(47,b,48,a)].
% 0.74/1.06 87 disjointwith(c_xskijump_thegame,c_tptpcol_16_35301) # label(query55) # label(negated_conjecture). [clausify(46)].
% 0.74/1.06 103 -disjointwith(c_xskijump_thegame,A). [resolve(62,a,59,b)].
% 0.74/1.06 104 $F. [resolve(103,a,87,a)].
% 0.74/1.06
% 0.74/1.06 % SZS output end Refutation
% 0.74/1.06 ============================== end of proof ==========================
% 0.74/1.06
% 0.74/1.06 % Disable descendants (x means already disabled):
% 0.74/1.06 47x 62x 63x 78x 79x 101 102 103 105 106
% 0.74/1.06 107 108 109 115
% 0.74/1.06
% 0.74/1.06 ============================== end of process initial clauses ========
% 0.74/1.06
% 0.74/1.06 ============================== CLAUSES FOR SEARCH ====================
% 0.74/1.06
% 0.74/1.06 ============================== end of clauses for search =============
% 0.74/1.06
% 0.74/1.06 ============================== SEARCH ================================
% 0.74/1.06
% 0.74/1.06 % Starting search at 0.02 seconds.
% 0.74/1.06
% 0.74/1.06 ============================== PROOF =================================
% 0.74/1.06 % SZS status Theorem
% 0.74/1.06 % SZS output start Refutation
% 0.74/1.06
% 0.74/1.06 % Proof 2 at 0.02 (+ 0.00) seconds: just7.
% 0.74/1.06 % Length of proof is 16.
% 0.74/1.06 % Level of proof is 4.
% 0.74/1.06 % Maximum clause weight is 9.000.
% 0.74/1.06 % Given clauses 20.
% 0.74/1.06
% 0.74/1.06 2 (all OBJ all COL1 all COL2 -(isa(OBJ,COL1) & isa(OBJ,COL2) & disjointwith(COL1,COL2))) # label(just7) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.06 23 (all X (collection(X) -> isa(X,c_collection))) # label(just30) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.06 25 (all INS all ARG2 (disjointwith(INS,ARG2) -> collection(INS))) # label(just32) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.06 40 (all X (individual(X) -> isa(X,c_individual))) # label(just49) # label(axiom) # label(non_clause). [assumption].
% 0.74/1.06 46 --disjointwith(c_xskijump_thegame,c_tptpcol_16_35301) # label(query55) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.74/1.06 48 individual(c_xskijump_thegame) # label(just1) # label(axiom). [assumption].
% 0.74/1.06 50 -individual(A) | isa(A,c_individual) # label(just49) # label(axiom). [clausify(40)].
% 0.74/1.06 54 -collection(A) | isa(A,c_collection) # label(just30) # label(axiom). [clausify(23)].
% 0.74/1.06 59 -disjointwith(A,B) | collection(A) # label(just32) # label(axiom). [clausify(25)].
% 0.74/1.06 86 disjointwith(c_collection,c_individual) # label(just6) # label(axiom). [assumption].
% 0.74/1.06 87 disjointwith(c_xskijump_thegame,c_tptpcol_16_35301) # label(query55) # label(negated_conjecture). [clausify(46)].
% 0.74/1.06 88 -isa(A,B) | -isa(A,C) | -disjointwith(B,C) # label(just7) # label(axiom) # answer(just7). [clausify(2)].
% 0.74/1.06 96 isa(c_xskijump_thegame,c_individual). [resolve(50,a,48,a)].
% 0.74/1.06 99 -disjointwith(A,B) | isa(A,c_collection). [resolve(59,b,54,a)].
% 0.74/1.06 123 -isa(c_xskijump_thegame,c_collection) # answer(just7). [ur(88,b,96,a,c,86,a)].
% 0.74/1.06 134 $F # answer(just7). [ur(99,a,87,a),unit_del(a,123)].
% 0.74/1.06
% 0.74/1.06 % SZS output end Refutation
% 0.74/1.06 ============================== end of proof ==========================
% 0.74/1.06
% 0.74/1.06 % Disable descendants (x means already disabled):
% 0.74/1.06 88 116 117 121 122 123 124 125 126 127
% 0.74/1.06 128 129 132 133
% 0.74/1.06
% 0.74/1.06 ============================== STATISTICS ============================
% 0.74/1.06
% 0.74/1.06 Given=36. Generated=103. Kept=58. proofs=2.
% 0.74/1.06 Usable=35. Sos=0. Demods=0. Limbo=0, Disabled=103. Hints=0.
% 0.74/1.06 Megabytes=0.11.
% 0.74/1.06 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.74/1.06
% 0.74/1.06 ============================== end of statistics =====================
% 0.74/1.06
% 0.74/1.06 ============================== end of search =========================
% 0.74/1.06
% 0.74/1.06 SEARCH FAILED
% 0.74/1.06
% 0.74/1.06 Exiting with 2 proofs.
% 0.74/1.06
% 0.74/1.06 Process 22772 exit (sos_empty) Thu Jun 9 21:54:22 2022
% 0.74/1.06 Prover9 interrupted
%------------------------------------------------------------------------------