TSTP Solution File: CSR044+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : CSR044+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:04:36 EDT 2022
% Result : Theorem 0.75s 1.02s
% Output : Refutation 0.75s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11 % Problem : CSR044+1 : TPTP v8.1.0. Released v3.4.0.
% 0.07/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 : Fri Jun 10 07:09:06 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.75/1.01 ============================== Prover9 ===============================
% 0.75/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.75/1.01 Process 2811 was started by sandbox on n020.cluster.edu,
% 0.75/1.01 Fri Jun 10 07:09:06 2022
% 0.75/1.01 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_2658_n020.cluster.edu".
% 0.75/1.01 ============================== end of head ===========================
% 0.75/1.01
% 0.75/1.01 ============================== INPUT =================================
% 0.75/1.01
% 0.75/1.01 % Reading from file /tmp/Prover9_2658_n020.cluster.edu
% 0.75/1.01
% 0.75/1.01 set(prolog_style_variables).
% 0.75/1.01 set(auto2).
% 0.75/1.01 % set(auto2) -> set(auto).
% 0.75/1.01 % set(auto) -> set(auto_inference).
% 0.75/1.01 % set(auto) -> set(auto_setup).
% 0.75/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.75/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.75/1.01 % set(auto) -> set(auto_limits).
% 0.75/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.75/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.75/1.01 % set(auto) -> set(auto_denials).
% 0.75/1.01 % set(auto) -> set(auto_process).
% 0.75/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.75/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.75/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.75/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.75/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.75/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.75/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.75/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.75/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.75/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.75/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.75/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.75/1.01 % set(auto2) -> assign(stats, some).
% 0.75/1.01 % set(auto2) -> clear(echo_input).
% 0.75/1.01 % set(auto2) -> set(quiet).
% 0.75/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.75/1.01 % set(auto2) -> clear(print_given).
% 0.75/1.01 assign(lrs_ticks,-1).
% 0.75/1.01 assign(sos_limit,10000).
% 0.75/1.01 assign(order,kbo).
% 0.75/1.01 set(lex_order_vars).
% 0.75/1.01 clear(print_given).
% 0.75/1.01
% 0.75/1.01 % formulas(sos). % not echoed (65 formulas)
% 0.75/1.01
% 0.75/1.01 ============================== end of input ==========================
% 0.75/1.01
% 0.75/1.01 % From the command line: assign(max_seconds, 300).
% 0.75/1.01
% 0.75/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.75/1.01
% 0.75/1.01 % Formulas that are not ordinary clauses:
% 0.75/1.01 1 (all TERM all INDEPCOL all PRED all DEPCOL (isa(TERM,INDEPCOL) & relationallexists(PRED,INDEPCOL,DEPCOL) -> isa(f_relationallexistsfn(TERM,PRED,INDEPCOL,DEPCOL),DEPCOL))) # label(just1) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.01 2 (all TERM (mtvisible(c_cyclistsmt) & executionbyfiringsquad(TERM) -> tptp_9_720(TERM,f_relationallexistsfn(TERM,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490)))) # label(just10) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.01 3 mtvisible(c_cyclistsmt) -> relationallexists(c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490) # label(just11) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.01 4 (all OBJ all COL1 all COL2 -(isa(OBJ,COL1) & isa(OBJ,COL2) & disjointwith(COL1,COL2))) # label(just13) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.01 5 (all SPECPRED all PRED all GENLPRED (genlinverse(SPECPRED,PRED) & genlinverse(PRED,GENLPRED) -> genlpreds(SPECPRED,GENLPRED))) # label(just14) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.01 6 (all ARG1 all INS (genlpreds(ARG1,INS) -> predicate(INS))) # label(just15) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.01 7 (all ARG1 all INS (genlpreds(ARG1,INS) -> predicate(INS))) # label(just16) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.01 8 (all INS all ARG2 (genlpreds(INS,ARG2) -> predicate(INS))) # label(just17) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.01 9 (all INS all ARG2 (genlpreds(INS,ARG2) -> predicate(INS))) # label(just18) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.01 10 (all X all Y all Z (genlpreds(X,Y) & genlpreds(Y,Z) -> genlpreds(X,Z))) # label(just19) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.01 11 (all X (predicate(X) -> genlpreds(X,X))) # label(just20) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.01 12 (all X (predicate(X) -> genlpreds(X,X))) # label(just21) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.01 13 (all ARG1 all INS (genlinverse(ARG1,INS) -> binarypredicate(INS))) # label(just22) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.01 14 (all INS all ARG2 (genlinverse(INS,ARG2) -> binarypredicate(INS))) # label(just23) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.01 15 (all OLD all ARG2 all NEW (genlinverse(OLD,ARG2) & genlpreds(NEW,OLD) -> genlinverse(NEW,ARG2))) # label(just24) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.01 16 (all ARG1 all OLD all NEW (genlinverse(ARG1,OLD) & genlpreds(OLD,NEW) -> genlinverse(ARG1,NEW))) # label(just25) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.01 17 (all ARG1 all INS (disjointwith(ARG1,INS) -> collection(INS))) # label(just26) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.01 18 (all INS all ARG2 (disjointwith(INS,ARG2) -> collection(INS))) # label(just27) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.01 19 (all X all Y (disjointwith(X,Y) -> disjointwith(Y,X))) # label(just28) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.01 20 (all ARG1 all OLD all NEW (disjointwith(ARG1,OLD) & genls(NEW,OLD) -> disjointwith(ARG1,NEW))) # label(just29) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.01 21 (all OLD all ARG2 all NEW (disjointwith(OLD,ARG2) & genls(NEW,OLD) -> disjointwith(NEW,ARG2))) # label(just30) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.01 22 (all X (isa(X,c_tptpcol_16_29490) -> tptpcol_16_29490(X))) # label(just31) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.01 23 (all X (tptpcol_16_29490(X) -> isa(X,c_tptpcol_16_29490))) # label(just32) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.01 24 (all X (isa(X,c_executionbyfiringsquad) -> executionbyfiringsquad(X))) # label(just33) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.01 25 (all X (executionbyfiringsquad(X) -> isa(X,c_executionbyfiringsquad))) # label(just34) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.01 26 (all ARG1 all INS (tptp_9_720(ARG1,INS) -> tptpcol_5_28674(INS))) # label(just35) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.01 27 (all INS all ARG2 (tptp_9_720(INS,ARG2) -> executionbyfiringsquad(INS))) # label(just36) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.01 28 (all ARG1 all ARG2 all INS (relationallexists(ARG1,ARG2,INS) -> collection(INS))) # label(just37) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.01 29 (all ARG1 all INS all ARG3 (relationallexists(ARG1,INS,ARG3) -> collection(INS))) # label(just38) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.01 30 (all INS all ARG2 all ARG3 (relationallexists(INS,ARG2,ARG3) -> binarypredicate(INS))) # label(just39) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.01 31 (all X (isa(X,c_transitivebinarypredicate) -> transitivebinarypredicate(X))) # label(just41) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.01 32 (all X (transitivebinarypredicate(X) -> isa(X,c_transitivebinarypredicate))) # label(just42) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.01 33 (all ARG1 all INS (isa(ARG1,INS) -> collection(INS))) # label(just43) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.01 34 (all ARG1 all INS (isa(ARG1,INS) -> collection(INS))) # label(just44) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.01 35 (all INS all ARG2 (isa(INS,ARG2) -> thing(INS))) # label(just45) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.01 36 (all INS all ARG2 (isa(INS,ARG2) -> thing(INS))) # label(just46) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.01 37 (all ARG1 all OLD all NEW (isa(ARG1,OLD) & genls(OLD,NEW) -> isa(ARG1,NEW))) # label(just47) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.01 38 (all SPECMT all GENLMT (mtvisible(SPECMT) & genlmt(SPECMT,GENLMT) -> mtvisible(GENLMT))) # label(just48) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.01 39 (all ARG1 all INS (genlmt(ARG1,INS) -> microtheory(INS))) # label(just49) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.01 40 (all ARG1 all INS (genlmt(ARG1,INS) -> microtheory(INS))) # label(just50) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.01 41 (all INS all ARG2 (genlmt(INS,ARG2) -> microtheory(INS))) # label(just51) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.01 42 (all INS all ARG2 (genlmt(INS,ARG2) -> microtheory(INS))) # label(just52) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.01 43 (all X all Y all Z (genlmt(X,Y) & genlmt(Y,Z) -> genlmt(X,Z))) # label(just53) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.01 44 (all X (microtheory(X) -> genlmt(X,X))) # label(just54) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.01 45 (all X (microtheory(X) -> genlmt(X,X))) # label(just55) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.01 46 (all ARG1 all ARG2 all ARG3 all ARG4 natfunction(f_relationallexistsfn(ARG1,ARG2,ARG3,ARG4),c_relationallexistsfn)) # label(just56) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.01 47 (all ARG1 all ARG2 all ARG3 all ARG4 natargument(f_relationallexistsfn(ARG1,ARG2,ARG3,ARG4),n_1,ARG1)) # label(just57) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.01 48 (all ARG1 all ARG2 all ARG3 all ARG4 natargument(f_relationallexistsfn(ARG1,ARG2,ARG3,ARG4),n_2,ARG2)) # label(just58) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.01 49 (all ARG1 all ARG2 all ARG3 all ARG4 natargument(f_relationallexistsfn(ARG1,ARG2,ARG3,ARG4),n_3,ARG3)) # label(just59) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.01 50 (all ARG1 all ARG2 all ARG3 all ARG4 natargument(f_relationallexistsfn(ARG1,ARG2,ARG3,ARG4),n_4,ARG4)) # label(just60) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.01 51 (all ARG1 all ARG2 all ARG3 all ARG4 thing(f_relationallexistsfn(ARG1,ARG2,ARG3,ARG4))) # label(just61) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.01 52 (all ARG1 all INS (resultisaarg(ARG1,INS) -> positiveinteger(INS))) # label(just62) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.01 53 (all INS all ARG2 (resultisaarg(INS,ARG2) -> function_denotational(INS))) # label(just63) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.01 54 -(exists X (mtvisible(c_tptp_member3633_mt) -> tptp_9_720(c_tptpexecutionbyfiringsquad_90,X) & tptpcol_16_29490(X))) # label(query44) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.75/1.01
% 0.75/1.01 ============================== end of process non-clausal formulas ===
% 0.75/1.01
% 0.75/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.75/1.01
% 0.75/1.01 ============================== PREDICATE ELIMINATION =================
% 0.75/1.01 55 -transitivebinarypredicate(A) | isa(A,c_transitivebinarypredicate) # label(just42) # label(axiom). [clausify(32)].
% 0.75/1.01 56 transitivebinarypredicate(c_genlmt) # label(just4) # label(axiom). [assumption].
% 0.75/1.01 57 -isa(A,c_transitivebinarypredicate) | transitivebinarypredicate(A) # label(just41) # label(axiom). [clausify(31)].
% 0.75/1.01 Derived: isa(c_genlmt,c_transitivebinarypredicate). [resolve(55,a,56,a)].
% 0.75/1.01 58 -executionbyfiringsquad(A) | isa(A,c_executionbyfiringsquad) # label(just34) # label(axiom). [clausify(25)].
% 0.75/1.01 59 executionbyfiringsquad(c_tptpexecutionbyfiringsquad_90) # label(just12) # label(axiom). [assumption].
% 0.75/1.01 60 -isa(A,c_executionbyfiringsquad) | executionbyfiringsquad(A) # label(just33) # label(axiom). [clausify(24)].
% 0.75/1.01 Derived: isa(c_tptpexecutionbyfiringsquad_90,c_executionbyfiringsquad). [resolve(58,a,59,a)].
% 0.75/1.01 61 -tptp_9_720(A,B) | executionbyfiringsquad(A) # label(just36) # label(axiom). [clausify(27)].
% 0.75/1.01 Derived: -tptp_9_720(A,B) | isa(A,c_executionbyfiringsquad). [resolve(61,b,58,a)].
% 0.75/1.01 62 -mtvisible(c_cyclistsmt) | -executionbyfiringsquad(A) | tptp_9_720(A,f_relationallexistsfn(A,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490)) # label(just10) # label(axiom). [clausify(2)].
% 0.75/1.01 Derived: -mtvisible(c_cyclistsmt) | tptp_9_720(c_tptpexecutionbyfiringsquad_90,f_relationallexistsfn(c_tptpexecutionbyfiringsquad_90,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490)). [resolve(62,b,59,a)].
% 0.75/1.01 Derived: -mtvisible(c_cyclistsmt) | tptp_9_720(A,f_relationallexistsfn(A,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490)) | -isa(A,c_executionbyfiringsquad). [resolve(62,b,60,b)].
% 0.75/1.01 Derived: -mtvisible(c_cyclistsmt) | tptp_9_720(A,f_relationallexistsfn(A,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490)) | -tptp_9_720(A,B). [resolve(62,b,61,b)].
% 0.75/1.01 63 -resultisaarg(A,B) | positiveinteger(B) # label(just62) # label(axiom). [clausify(52)].
% 0.75/1.01 64 resultisaarg(c_relationallexistsfn,n_4) # label(just2) # label(axiom). [assumption].
% 0.75/1.01 Derived: positiveinteger(n_4). [resolve(63,a,64,a)].
% 0.75/1.02 65 -resultisaarg(A,B) | function_denotational(A) # label(just63) # label(axiom). [clausify(53)].
% 0.75/1.02 Derived: function_denotational(c_relationallexistsfn). [resolve(65,a,64,a)].
% 0.75/1.02 66 -isa(A,c_tptpcol_16_29490) | tptpcol_16_29490(A) # label(just31) # label(axiom). [clausify(22)].
% 0.75/1.02 67 -tptp_9_720(c_tptpexecutionbyfiringsquad_90,A) | -tptpcol_16_29490(A) # label(query44) # label(negated_conjecture). [clausify(54)].
% 0.75/1.02 Derived: -isa(A,c_tptpcol_16_29490) | -tptp_9_720(c_tptpexecutionbyfiringsquad_90,A). [resolve(66,b,67,b)].
% 0.75/1.02 68 -tptpcol_16_29490(A) | isa(A,c_tptpcol_16_29490) # label(just32) # label(axiom). [clausify(23)].
% 0.75/1.02 69 -predicate(A) | genlpreds(A,A) # label(just20) # label(axiom). [clausify(11)].
% 0.75/1.02 70 -genlpreds(A,B) | predicate(B) # label(just15) # label(axiom). [clausify(6)].
% 0.75/1.02 71 -genlpreds(A,B) | predicate(B) # label(just16) # label(axiom). [clausify(7)].
% 0.75/1.02 72 -genlpreds(A,B) | predicate(A) # label(just17) # label(axiom). [clausify(8)].
% 0.75/1.02 73 -genlpreds(A,B) | predicate(A) # label(just18) # label(axiom). [clausify(9)].
% 0.75/1.02 Derived: genlpreds(A,A) | -genlpreds(B,A). [resolve(69,a,70,b)].
% 0.75/1.02 Derived: genlpreds(A,A) | -genlpreds(A,B). [resolve(69,a,72,b)].
% 0.75/1.02 74 -predicate(A) | genlpreds(A,A) # label(just21) # label(axiom). [clausify(12)].
% 0.75/1.02 75 -microtheory(A) | genlmt(A,A) # label(just54) # label(axiom). [clausify(44)].
% 0.75/1.02 76 -genlmt(A,B) | microtheory(B) # label(just49) # label(axiom). [clausify(39)].
% 0.75/1.02 77 -genlmt(A,B) | microtheory(B) # label(just50) # label(axiom). [clausify(40)].
% 0.75/1.02 78 -genlmt(A,B) | microtheory(A) # label(just51) # label(axiom). [clausify(41)].
% 0.75/1.02 79 -genlmt(A,B) | microtheory(A) # label(just52) # label(axiom). [clausify(42)].
% 0.75/1.02 Derived: genlmt(A,A) | -genlmt(B,A). [resolve(75,a,76,b)].
% 0.75/1.02 Derived: genlmt(A,A) | -genlmt(A,B). [resolve(75,a,78,b)].
% 0.75/1.02 80 -microtheory(A) | genlmt(A,A) # label(just55) # label(axiom). [clausify(45)].
% 0.75/1.02 81 -isa(A,B) | -relationallexists(C,B,D) | isa(f_relationallexistsfn(A,C,B,D),D) # label(just1) # label(axiom). [clausify(1)].
% 0.75/1.02 82 -mtvisible(c_cyclistsmt) | relationallexists(c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490) # label(just11) # label(axiom). [clausify(3)].
% 0.75/1.02 Derived: -isa(A,c_executionbyfiringsquad) | isa(f_relationallexistsfn(A,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490),c_tptpcol_16_29490) | -mtvisible(c_cyclistsmt). [resolve(81,b,82,b)].
% 0.75/1.02
% 0.75/1.02 ============================== end predicate elimination =============
% 0.75/1.02
% 0.75/1.02 Auto_denials:
% 0.75/1.02 % copying label just13 to answer in negative clause
% 0.75/1.02 % assign(max_proofs, 2). % (Horn set with more than one neg. clause)
% 0.75/1.02
% 0.75/1.02 Term ordering decisions:
% 0.75/1.02 Function symbol KB weights: c_executionbyfiringsquad=1. c_cyclistsmt=1. c_tptpcol_16_29490=1. c_tptp_9_720=1. c_basekb=1. c_tptpexecutionbyfiringsquad_90=1. c_calendarsmt=1. c_calendarsvocabularymt=1. c_tptp_member3633_mt=1. c_tptp_spindleheadmt=1. c_universalvocabularymt=1. c_genlmt=1. c_transitivebinarypredicate=1. f_relationallexistsfn=1.
% 0.75/1.02
% 0.75/1.02 ============================== end of process initial clauses ========
% 0.75/1.02
% 0.75/1.02 ============================== CLAUSES FOR SEARCH ====================
% 0.75/1.02
% 0.75/1.02 ============================== end of clauses for search =============
% 0.75/1.02
% 0.75/1.02 ============================== SEARCH ================================
% 0.75/1.02
% 0.75/1.02 % Starting search at 0.02 seconds.
% 0.75/1.02
% 0.75/1.02 ============================== PROOF =================================
% 0.75/1.02 % SZS status Theorem
% 0.75/1.02 % SZS output start Refutation
% 0.75/1.02
% 0.75/1.02 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.75/1.02 % Length of proof is 28.
% 0.75/1.02 % Level of proof is 5.
% 0.75/1.02 % Maximum clause weight is 12.000.
% 0.75/1.02 % Given clauses 51.
% 0.75/1.02
% 0.75/1.02 1 (all TERM all INDEPCOL all PRED all DEPCOL (isa(TERM,INDEPCOL) & relationallexists(PRED,INDEPCOL,DEPCOL) -> isa(f_relationallexistsfn(TERM,PRED,INDEPCOL,DEPCOL),DEPCOL))) # label(just1) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.02 2 (all TERM (mtvisible(c_cyclistsmt) & executionbyfiringsquad(TERM) -> tptp_9_720(TERM,f_relationallexistsfn(TERM,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490)))) # label(just10) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.02 3 mtvisible(c_cyclistsmt) -> relationallexists(c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490) # label(just11) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.03 22 (all X (isa(X,c_tptpcol_16_29490) -> tptpcol_16_29490(X))) # label(just31) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.03 25 (all X (executionbyfiringsquad(X) -> isa(X,c_executionbyfiringsquad))) # label(just34) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.03 38 (all SPECMT all GENLMT (mtvisible(SPECMT) & genlmt(SPECMT,GENLMT) -> mtvisible(GENLMT))) # label(just48) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.03 54 -(exists X (mtvisible(c_tptp_member3633_mt) -> tptp_9_720(c_tptpexecutionbyfiringsquad_90,X) & tptpcol_16_29490(X))) # label(query44) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.75/1.03 58 -executionbyfiringsquad(A) | isa(A,c_executionbyfiringsquad) # label(just34) # label(axiom). [clausify(25)].
% 0.75/1.03 59 executionbyfiringsquad(c_tptpexecutionbyfiringsquad_90) # label(just12) # label(axiom). [assumption].
% 0.75/1.03 62 -mtvisible(c_cyclistsmt) | -executionbyfiringsquad(A) | tptp_9_720(A,f_relationallexistsfn(A,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490)) # label(just10) # label(axiom). [clausify(2)].
% 0.75/1.03 66 -isa(A,c_tptpcol_16_29490) | tptpcol_16_29490(A) # label(just31) # label(axiom). [clausify(22)].
% 0.75/1.03 67 -tptp_9_720(c_tptpexecutionbyfiringsquad_90,A) | -tptpcol_16_29490(A) # label(query44) # label(negated_conjecture). [clausify(54)].
% 0.75/1.03 81 -isa(A,B) | -relationallexists(C,B,D) | isa(f_relationallexistsfn(A,C,B,D),D) # label(just1) # label(axiom). [clausify(1)].
% 0.75/1.03 82 -mtvisible(c_cyclistsmt) | relationallexists(c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490) # label(just11) # label(axiom). [clausify(3)].
% 0.75/1.03 85 mtvisible(c_tptp_member3633_mt) # label(query44) # label(negated_conjecture). [clausify(54)].
% 0.75/1.03 90 genlmt(c_tptp_spindleheadmt,c_cyclistsmt) # label(just8) # label(axiom). [assumption].
% 0.75/1.03 91 genlmt(c_tptp_member3633_mt,c_tptp_spindleheadmt) # label(just9) # label(axiom). [assumption].
% 0.75/1.03 94 -mtvisible(A) | -genlmt(A,B) | mtvisible(B) # label(just48) # label(axiom). [clausify(38)].
% 0.75/1.03 101 isa(c_tptpexecutionbyfiringsquad_90,c_executionbyfiringsquad). [resolve(58,a,59,a)].
% 0.75/1.03 103 -mtvisible(c_cyclistsmt) | tptp_9_720(c_tptpexecutionbyfiringsquad_90,f_relationallexistsfn(c_tptpexecutionbyfiringsquad_90,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490)). [resolve(62,b,59,a)].
% 0.75/1.03 106 -isa(A,c_tptpcol_16_29490) | -tptp_9_720(c_tptpexecutionbyfiringsquad_90,A). [resolve(66,b,67,b)].
% 0.75/1.03 111 -isa(A,c_executionbyfiringsquad) | isa(f_relationallexistsfn(A,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490),c_tptpcol_16_29490) | -mtvisible(c_cyclistsmt). [resolve(81,b,82,b)].
% 0.75/1.03 112 mtvisible(c_tptp_spindleheadmt). [ur(94,a,85,a,b,91,a)].
% 0.75/1.03 135 -isa(A,c_executionbyfiringsquad) | -mtvisible(c_cyclistsmt) | -tptp_9_720(c_tptpexecutionbyfiringsquad_90,f_relationallexistsfn(A,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490)). [resolve(111,b,106,a)].
% 0.75/1.03 138 mtvisible(c_cyclistsmt). [ur(94,a,112,a,b,90,a)].
% 0.75/1.03 141 -isa(A,c_executionbyfiringsquad) | -tptp_9_720(c_tptpexecutionbyfiringsquad_90,f_relationallexistsfn(A,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490)). [back_unit_del(135),unit_del(b,138)].
% 0.75/1.03 146 tptp_9_720(c_tptpexecutionbyfiringsquad_90,f_relationallexistsfn(c_tptpexecutionbyfiringsquad_90,c_tptp_9_720,c_executionbyfiringsquad,c_tptpcol_16_29490)). [back_unit_del(103),unit_del(a,138)].
% 0.75/1.03 159 $F. [resolve(141,a,101,a),unit_del(a,146)].
% 0.75/1.03
% 0.75/1.03 % SZS output end Refutation
% 0.75/1.03 ============================== end of proof ==========================
% 0.75/1.03 % Redundant proof: 160 $F. [ur(141,a,101,a),unit_del(a,146)].
% 0.75/1.03
% 0.75/1.03 % Disable descendants (x means already disabled):
% 0.75/1.03 0x 67x 106 126x 127x 135x 141 142 158
% 0.75/1.03
% 0.75/1.03 ============================== STATISTICS ============================
% 0.75/1.03
% 0.75/1.03 Given=85. Generated=358. Kept=92. proofs=1.
% 0.75/1.03 Usable=78. Sos=0. Demods=0. Limbo=0, Disabled=94. Hints=0.
% 0.75/1.03 Megabytes=0.15.
% 0.75/1.03 User_CPU=0.02, System_CPU=0.01, Wall_clock=0.
% 0.75/1.03
% 0.75/1.03 ============================== end of statistics =====================
% 0.75/1.03
% 0.75/1.03 ============================== end of search =========================
% 0.75/1.03
% 0.75/1.03 SEARCH FAILED
% 0.75/1.03
% 0.75/1.03 Exiting with 1 proof.
% 0.75/1.03
% 0.75/1.03 Process 2811 exit (sos_empty) Fri Jun 10 07:09:06 2022
% 0.75/1.03 Prover9 interrupted
%------------------------------------------------------------------------------