TSTP Solution File: CSR068+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : CSR068+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n015.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:54 EDT 2022
% Result : Theorem 0.43s 1.03s
% Output : Refutation 0.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : CSR068+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 : n015.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 : Sat Jun 11 12:35:20 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.43/1.02 ============================== Prover9 ===============================
% 0.43/1.02 Prover9 (32) version 2009-11A, November 2009.
% 0.43/1.02 Process 19994 was started by sandbox2 on n015.cluster.edu,
% 0.43/1.02 Sat Jun 11 12:35:21 2022
% 0.43/1.02 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_19840_n015.cluster.edu".
% 0.43/1.02 ============================== end of head ===========================
% 0.43/1.02
% 0.43/1.02 ============================== INPUT =================================
% 0.43/1.02
% 0.43/1.02 % Reading from file /tmp/Prover9_19840_n015.cluster.edu
% 0.43/1.02
% 0.43/1.02 set(prolog_style_variables).
% 0.43/1.02 set(auto2).
% 0.43/1.02 % set(auto2) -> set(auto).
% 0.43/1.02 % set(auto) -> set(auto_inference).
% 0.43/1.02 % set(auto) -> set(auto_setup).
% 0.43/1.02 % set(auto_setup) -> set(predicate_elim).
% 0.43/1.02 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/1.02 % set(auto) -> set(auto_limits).
% 0.43/1.02 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/1.02 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/1.02 % set(auto) -> set(auto_denials).
% 0.43/1.02 % set(auto) -> set(auto_process).
% 0.43/1.02 % set(auto2) -> assign(new_constants, 1).
% 0.43/1.02 % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/1.02 % set(auto2) -> assign(max_weight, "200.000").
% 0.43/1.02 % set(auto2) -> assign(max_hours, 1).
% 0.43/1.02 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/1.02 % set(auto2) -> assign(max_seconds, 0).
% 0.43/1.02 % set(auto2) -> assign(max_minutes, 5).
% 0.43/1.02 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/1.02 % set(auto2) -> set(sort_initial_sos).
% 0.43/1.02 % set(auto2) -> assign(sos_limit, -1).
% 0.43/1.02 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/1.02 % set(auto2) -> assign(max_megs, 400).
% 0.43/1.02 % set(auto2) -> assign(stats, some).
% 0.43/1.02 % set(auto2) -> clear(echo_input).
% 0.43/1.02 % set(auto2) -> set(quiet).
% 0.43/1.02 % set(auto2) -> clear(print_initial_clauses).
% 0.43/1.02 % set(auto2) -> clear(print_given).
% 0.43/1.02 assign(lrs_ticks,-1).
% 0.43/1.02 assign(sos_limit,10000).
% 0.43/1.02 assign(order,kbo).
% 0.43/1.02 set(lex_order_vars).
% 0.43/1.02 clear(print_given).
% 0.43/1.02
% 0.43/1.02 % formulas(sos). % not echoed (56 formulas)
% 0.43/1.02
% 0.43/1.02 ============================== end of input ==========================
% 0.43/1.02
% 0.43/1.02 % From the command line: assign(max_seconds, 300).
% 0.43/1.02
% 0.43/1.02 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/1.02
% 0.43/1.02 % Formulas that are not ordinary clauses:
% 0.43/1.02 1 (all INS (mtvisible(c_tptp_spindleheadmt) & furpelt(INS) -> tptpofobject(INS,f_tptpquantityfn_1(n_328)))) # label(just9) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.02 2 mtvisible(c_tptp_spindleheadmt) -> relationallinstance(c_tptpofobject,c_furpelt,f_tptpquantityfn_1(n_328)) # label(just10) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.02 3 (all OBJ all COL1 all COL2 -(isa(OBJ,COL1) & isa(OBJ,COL2) & disjointwith(COL1,COL2))) # label(just11) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.02 4 (all SPECPRED all PRED all GENLPRED (genlinverse(SPECPRED,PRED) & genlinverse(PRED,GENLPRED) -> genlpreds(SPECPRED,GENLPRED))) # label(just12) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.02 5 (all ARG1 all INS (genlpreds(ARG1,INS) -> predicate(INS))) # label(just13) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.02 6 (all ARG1 all INS (genlpreds(ARG1,INS) -> predicate(INS))) # label(just14) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.02 7 (all INS all ARG2 (genlpreds(INS,ARG2) -> predicate(INS))) # label(just15) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.02 8 (all INS all ARG2 (genlpreds(INS,ARG2) -> predicate(INS))) # label(just16) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.02 9 (all X all Y all Z (genlpreds(X,Y) & genlpreds(Y,Z) -> genlpreds(X,Z))) # label(just17) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.02 10 (all X (predicate(X) -> genlpreds(X,X))) # label(just18) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.02 11 (all X (predicate(X) -> genlpreds(X,X))) # label(just19) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.02 12 (all ARG1 all INS (genlinverse(ARG1,INS) -> binarypredicate(INS))) # label(just20) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.02 13 (all INS all ARG2 (genlinverse(INS,ARG2) -> binarypredicate(INS))) # label(just21) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.02 14 (all OLD all ARG2 all NEW (genlinverse(OLD,ARG2) & genlpreds(NEW,OLD) -> genlinverse(NEW,ARG2))) # label(just22) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.02 15 (all ARG1 all OLD all NEW (genlinverse(ARG1,OLD) & genlpreds(OLD,NEW) -> genlinverse(ARG1,NEW))) # label(just23) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.02 16 (all ARG1 all INS (disjointwith(ARG1,INS) -> collection(INS))) # label(just24) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.02 17 (all INS all ARG2 (disjointwith(INS,ARG2) -> collection(INS))) # label(just25) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.02 18 (all X all Y (disjointwith(X,Y) -> disjointwith(Y,X))) # label(just26) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.02 19 (all ARG1 all OLD all NEW (disjointwith(ARG1,OLD) & genls(NEW,OLD) -> disjointwith(ARG1,NEW))) # label(just27) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.02 20 (all OLD all ARG2 all NEW (disjointwith(OLD,ARG2) & genls(NEW,OLD) -> disjointwith(NEW,ARG2))) # label(just28) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.02 21 (all ARG1 natfunction(f_tptpquantityfn_1(ARG1),c_tptpquantityfn_1)) # label(just29) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.02 22 (all ARG1 natargument(f_tptpquantityfn_1(ARG1),n_1,ARG1)) # label(just30) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.02 23 (all ARG1 tptpquantity(f_tptpquantityfn_1(ARG1))) # label(just31) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.02 24 (all ARG1 all INS (tptpofobject(ARG1,INS) -> tptpquantity(INS))) # label(just32) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.02 25 (all INS all ARG2 (tptpofobject(INS,ARG2) -> partiallytangible(INS))) # label(just33) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.02 26 (all ARG1 all ARG2 all INS (relationallinstance(ARG1,ARG2,INS) -> thing(INS))) # label(just34) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.02 27 (all ARG1 all INS all ARG3 (relationallinstance(ARG1,INS,ARG3) -> collection(INS))) # label(just35) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.02 28 (all INS all ARG2 all ARG3 (relationallinstance(INS,ARG2,ARG3) -> binarypredicate(INS))) # label(just36) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.02 29 (all X (isa(X,c_furpelt) -> furpelt(X))) # label(just37) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.02 30 (all X (furpelt(X) -> isa(X,c_furpelt))) # label(just38) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.02 31 (all X (isa(X,c_transitivebinarypredicate) -> transitivebinarypredicate(X))) # label(just40) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.02 32 (all X (transitivebinarypredicate(X) -> isa(X,c_transitivebinarypredicate))) # label(just41) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.02 33 (all ARG1 all INS (isa(ARG1,INS) -> collection(INS))) # label(just42) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.02 34 (all ARG1 all INS (isa(ARG1,INS) -> collection(INS))) # label(just43) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.02 35 (all INS all ARG2 (isa(INS,ARG2) -> thing(INS))) # label(just44) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.02 36 (all INS all ARG2 (isa(INS,ARG2) -> thing(INS))) # label(just45) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.02 37 (all ARG1 all OLD all NEW (isa(ARG1,OLD) & genls(OLD,NEW) -> isa(ARG1,NEW))) # label(just46) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.02 38 (all SPECMT all GENLMT (mtvisible(SPECMT) & genlmt(SPECMT,GENLMT) -> mtvisible(GENLMT))) # label(just47) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.02 39 (all ARG1 all INS (genlmt(ARG1,INS) -> microtheory(INS))) # label(just48) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.02 40 (all ARG1 all INS (genlmt(ARG1,INS) -> microtheory(INS))) # label(just49) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.02 41 (all INS all ARG2 (genlmt(INS,ARG2) -> microtheory(INS))) # label(just50) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.02 42 (all INS all ARG2 (genlmt(INS,ARG2) -> microtheory(INS))) # label(just51) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.02 43 (all X all Y all Z (genlmt(X,Y) & genlmt(Y,Z) -> genlmt(X,Z))) # label(just52) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.02 44 (all X (microtheory(X) -> genlmt(X,X))) # label(just53) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.03 45 (all X (microtheory(X) -> genlmt(X,X))) # label(just54) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.03 46 -(mtvisible(c_tptp_member2356_mt) -> tptpofobject(c_theprototypicalfurpelt,f_tptpquantityfn_1(n_328))) # label(query68) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.43/1.03
% 0.43/1.03 ============================== end of process non-clausal formulas ===
% 0.43/1.03
% 0.43/1.03 ============================== PROCESS INITIAL CLAUSES ===============
% 0.43/1.03
% 0.43/1.03 ============================== PREDICATE ELIMINATION =================
% 0.43/1.03 47 -transitivebinarypredicate(A) | isa(A,c_transitivebinarypredicate) # label(just41) # label(axiom). [clausify(32)].
% 0.43/1.03 48 transitivebinarypredicate(c_genlmt) # label(just2) # label(axiom). [assumption].
% 0.43/1.03 49 -isa(A,c_transitivebinarypredicate) | transitivebinarypredicate(A) # label(just40) # label(axiom). [clausify(31)].
% 0.43/1.03 Derived: isa(c_genlmt,c_transitivebinarypredicate). [resolve(47,a,48,a)].
% 0.43/1.03 50 -furpelt(A) | isa(A,c_furpelt) # label(just38) # label(axiom). [clausify(30)].
% 0.43/1.03 51 furpelt(c_theprototypicalfurpelt) # label(just8) # label(axiom). [assumption].
% 0.43/1.03 52 -isa(A,c_furpelt) | furpelt(A) # label(just37) # label(axiom). [clausify(29)].
% 0.43/1.03 Derived: isa(c_theprototypicalfurpelt,c_furpelt). [resolve(50,a,51,a)].
% 0.43/1.03 53 -mtvisible(c_tptp_spindleheadmt) | -furpelt(A) | tptpofobject(A,f_tptpquantityfn_1(n_328)) # label(just9) # label(axiom). [clausify(1)].
% 0.43/1.03 Derived: -mtvisible(c_tptp_spindleheadmt) | tptpofobject(c_theprototypicalfurpelt,f_tptpquantityfn_1(n_328)). [resolve(53,b,51,a)].
% 0.43/1.03 Derived: -mtvisible(c_tptp_spindleheadmt) | tptpofobject(A,f_tptpquantityfn_1(n_328)) | -isa(A,c_furpelt). [resolve(53,b,52,b)].
% 0.43/1.03 54 -mtvisible(c_tptp_spindleheadmt) | tptpofobject(c_theprototypicalfurpelt,f_tptpquantityfn_1(n_328)). [resolve(53,b,51,a)].
% 0.43/1.03 55 -tptpofobject(c_theprototypicalfurpelt,f_tptpquantityfn_1(n_328)) # label(query68) # label(negated_conjecture). [clausify(46)].
% 0.43/1.03 56 -tptpofobject(A,B) | partiallytangible(A) # label(just33) # label(axiom). [clausify(25)].
% 0.43/1.03 Derived: -mtvisible(c_tptp_spindleheadmt). [resolve(54,b,55,a)].
% 0.43/1.03 57 -mtvisible(c_tptp_spindleheadmt) | tptpofobject(A,f_tptpquantityfn_1(n_328)) | -isa(A,c_furpelt). [resolve(53,b,52,b)].
% 0.43/1.03 58 -predicate(A) | genlpreds(A,A) # label(just18) # label(axiom). [clausify(10)].
% 0.43/1.03 59 -genlpreds(A,B) | predicate(B) # label(just13) # label(axiom). [clausify(5)].
% 0.43/1.03 60 -genlpreds(A,B) | predicate(B) # label(just14) # label(axiom). [clausify(6)].
% 0.43/1.03 61 -genlpreds(A,B) | predicate(A) # label(just15) # label(axiom). [clausify(7)].
% 0.43/1.03 62 -genlpreds(A,B) | predicate(A) # label(just16) # label(axiom). [clausify(8)].
% 0.43/1.03 Derived: genlpreds(A,A) | -genlpreds(B,A). [resolve(58,a,59,b)].
% 0.43/1.03 Derived: genlpreds(A,A) | -genlpreds(A,B). [resolve(58,a,61,b)].
% 0.43/1.03 63 -predicate(A) | genlpreds(A,A) # label(just19) # label(axiom). [clausify(11)].
% 0.43/1.03 64 -microtheory(A) | genlmt(A,A) # label(just53) # label(axiom). [clausify(44)].
% 0.43/1.03 65 -genlmt(A,B) | microtheory(B) # label(just48) # label(axiom). [clausify(39)].
% 0.43/1.03 66 -genlmt(A,B) | microtheory(B) # label(just49) # label(axiom). [clausify(40)].
% 0.43/1.03 67 -genlmt(A,B) | microtheory(A) # label(just50) # label(axiom). [clausify(41)].
% 0.43/1.03 68 -genlmt(A,B) | microtheory(A) # label(just51) # label(axiom). [clausify(42)].
% 0.43/1.03 Derived: genlmt(A,A) | -genlmt(B,A). [resolve(64,a,65,b)].
% 0.43/1.03 Derived: genlmt(A,A) | -genlmt(A,B). [resolve(64,a,67,b)].
% 0.43/1.03 69 -microtheory(A) | genlmt(A,A) # label(just54) # label(axiom). [clausify(45)].
% 0.43/1.03
% 0.43/1.03 ============================== end predicate elimination =============
% 0.43/1.03
% 0.43/1.03 Auto_denials:
% 0.43/1.03 % copying label just11 to answer in negative clause
% 0.43/1.03 % assign(max_proofs, 2). % (Horn set with more than one neg. clause)
% 0.43/1.03
% 0.43/1.03 Term ordering decisions:
% 0.43/1.03 Function symbol KB weights: c_basekb=1. c_calendarsmt=1. c_calendarsvocabularymt=1. c_cyclistsmt=1. c_tptp_member2356_mt=1. c_tptp_spindleheadmt=1. c_universalvocabularymt=1. c_furpelt=1. c_genlmt=1. c_theprototypicalfurpelt=1. c_transitivebinarypredicate=1.
% 0.43/1.03
% 0.43/1.03 ============================== end of process initial clauses ========
% 0.43/1.03
% 0.43/1.03 ============================== CLAUSES FOR SEARCH ====================
% 0.43/1.03
% 0.43/1.03 ============================== end of clauses for search =============
% 0.43/1.03
% 0.43/1.03 ============================== SEARCH ================================
% 0.43/1.03
% 0.43/1.03 % Starting search at 0.02 seconds.
% 0.43/1.03
% 0.43/1.03 ============================== PROOF =================================
% 0.43/1.03 % SZS status Theorem
% 0.43/1.03 % SZS output start Refutation
% 0.43/1.03
% 0.43/1.03 % Proof 1 at 0.02 (+ 0.00) seconds.
% 0.43/1.03 % Length of proof is 12.
% 0.43/1.03 % Level of proof is 4.
% 0.43/1.03 % Maximum clause weight is 7.000.
% 0.43/1.03 % Given clauses 12.
% 0.43/1.03
% 0.43/1.03 1 (all INS (mtvisible(c_tptp_spindleheadmt) & furpelt(INS) -> tptpofobject(INS,f_tptpquantityfn_1(n_328)))) # label(just9) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.03 38 (all SPECMT all GENLMT (mtvisible(SPECMT) & genlmt(SPECMT,GENLMT) -> mtvisible(GENLMT))) # label(just47) # label(axiom) # label(non_clause). [assumption].
% 0.43/1.03 46 -(mtvisible(c_tptp_member2356_mt) -> tptpofobject(c_theprototypicalfurpelt,f_tptpquantityfn_1(n_328))) # label(query68) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.43/1.03 51 furpelt(c_theprototypicalfurpelt) # label(just8) # label(axiom). [assumption].
% 0.43/1.03 53 -mtvisible(c_tptp_spindleheadmt) | -furpelt(A) | tptpofobject(A,f_tptpquantityfn_1(n_328)) # label(just9) # label(axiom). [clausify(1)].
% 0.43/1.03 54 -mtvisible(c_tptp_spindleheadmt) | tptpofobject(c_theprototypicalfurpelt,f_tptpquantityfn_1(n_328)). [resolve(53,b,51,a)].
% 0.43/1.03 55 -tptpofobject(c_theprototypicalfurpelt,f_tptpquantityfn_1(n_328)) # label(query68) # label(negated_conjecture). [clausify(46)].
% 0.43/1.03 72 mtvisible(c_tptp_member2356_mt) # label(query68) # label(negated_conjecture). [clausify(46)].
% 0.43/1.03 78 genlmt(c_tptp_member2356_mt,c_tptp_spindleheadmt) # label(just7) # label(axiom). [assumption].
% 0.43/1.03 81 -mtvisible(A) | -genlmt(A,B) | mtvisible(B) # label(just47) # label(axiom). [clausify(38)].
% 0.43/1.03 89 -mtvisible(c_tptp_spindleheadmt). [resolve(54,b,55,a)].
% 0.43/1.03 94 $F. [ur(81,a,72,a,b,78,a),unit_del(a,89)].
% 0.43/1.03
% 0.43/1.03 % SZS output end Refutation
% 0.43/1.03 ============================== end of proof ==========================
% 0.43/1.03
% 0.43/1.03 % Disable descendants (x means already disabled):
% 0.43/1.03 0x 55x 89
% 0.43/1.03
% 0.43/1.03 ============================== STATISTICS ============================
% 0.43/1.03
% 0.43/1.03 Given=54. Generated=218. Kept=55. proofs=1.
% 0.43/1.03 Usable=54. Sos=0. Demods=0. Limbo=0, Disabled=67. Hints=0.
% 0.43/1.03 Megabytes=0.10.
% 0.43/1.03 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.43/1.03
% 0.43/1.03 ============================== end of statistics =====================
% 0.43/1.03
% 0.43/1.03 ============================== end of search =========================
% 0.43/1.03
% 0.43/1.03 SEARCH FAILED
% 0.43/1.03
% 0.43/1.03 Exiting with 1 proof.
% 0.43/1.03
% 0.43/1.03 Process 19994 exit (sos_empty) Sat Jun 11 12:35:21 2022
% 0.43/1.03 Prover9 interrupted
%------------------------------------------------------------------------------