TSTP Solution File: CSR046+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : CSR046+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n022.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:42 EDT 2022
% Result : Timeout 300.03s 300.30s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : CSR046+1 : TPTP v8.1.0. Released v3.4.0.
% 0.15/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.15/0.35 % Computer : n022.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 600
% 0.15/0.35 % DateTime : Fri Jun 10 10:32:04 EDT 2022
% 0.15/0.35 % CPUTime :
% 0.49/1.06 ============================== Prover9 ===============================
% 0.49/1.06 Prover9 (32) version 2009-11A, November 2009.
% 0.49/1.06 Process 11221 was started by sandbox2 on n022.cluster.edu,
% 0.49/1.06 Fri Jun 10 10:32:05 2022
% 0.49/1.06 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_11068_n022.cluster.edu".
% 0.49/1.06 ============================== end of head ===========================
% 0.49/1.06
% 0.49/1.06 ============================== INPUT =================================
% 0.49/1.06
% 0.49/1.06 % Reading from file /tmp/Prover9_11068_n022.cluster.edu
% 0.49/1.06
% 0.49/1.06 set(prolog_style_variables).
% 0.49/1.06 set(auto2).
% 0.49/1.06 % set(auto2) -> set(auto).
% 0.49/1.06 % set(auto) -> set(auto_inference).
% 0.49/1.06 % set(auto) -> set(auto_setup).
% 0.49/1.06 % set(auto_setup) -> set(predicate_elim).
% 0.49/1.06 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.49/1.06 % set(auto) -> set(auto_limits).
% 0.49/1.06 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.49/1.06 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.49/1.06 % set(auto) -> set(auto_denials).
% 0.49/1.06 % set(auto) -> set(auto_process).
% 0.49/1.06 % set(auto2) -> assign(new_constants, 1).
% 0.49/1.06 % set(auto2) -> assign(fold_denial_max, 3).
% 0.49/1.06 % set(auto2) -> assign(max_weight, "200.000").
% 0.49/1.06 % set(auto2) -> assign(max_hours, 1).
% 0.49/1.06 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.49/1.06 % set(auto2) -> assign(max_seconds, 0).
% 0.49/1.06 % set(auto2) -> assign(max_minutes, 5).
% 0.49/1.06 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.49/1.06 % set(auto2) -> set(sort_initial_sos).
% 0.49/1.06 % set(auto2) -> assign(sos_limit, -1).
% 0.49/1.06 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.49/1.06 % set(auto2) -> assign(max_megs, 400).
% 0.49/1.06 % set(auto2) -> assign(stats, some).
% 0.49/1.06 % set(auto2) -> clear(echo_input).
% 0.49/1.06 % set(auto2) -> set(quiet).
% 0.49/1.06 % set(auto2) -> clear(print_initial_clauses).
% 0.49/1.06 % set(auto2) -> clear(print_given).
% 0.49/1.06 assign(lrs_ticks,-1).
% 0.49/1.06 assign(sos_limit,10000).
% 0.49/1.06 assign(order,kbo).
% 0.49/1.06 set(lex_order_vars).
% 0.49/1.06 clear(print_given).
% 0.49/1.06
% 0.49/1.06 % formulas(sos). % not echoed (67 formulas)
% 0.49/1.06
% 0.49/1.06 ============================== end of input ==========================
% 0.49/1.06
% 0.49/1.06 % From the command line: assign(max_seconds, 300).
% 0.49/1.06
% 0.49/1.06 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.49/1.06
% 0.49/1.06 % Formulas that are not ordinary clauses:
% 0.49/1.06 1 (all OBJ (tptpcol_16_50958(OBJ) -> tptpcol_15_50957(OBJ))) # label(just8) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 2 (all OBJ all COL1 all COL2 -(isa(OBJ,COL1) & isa(OBJ,COL2) & disjointwith(COL1,COL2))) # label(just9) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 3 (all SPECPRED all PRED all GENLPRED (genlinverse(SPECPRED,PRED) & genlinverse(PRED,GENLPRED) -> genlpreds(SPECPRED,GENLPRED))) # label(just10) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 4 (all ARG1 all INS (genlpreds(ARG1,INS) -> predicate(INS))) # label(just11) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 5 (all ARG1 all INS (genlpreds(ARG1,INS) -> predicate(INS))) # label(just12) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 6 (all INS all ARG2 (genlpreds(INS,ARG2) -> predicate(INS))) # label(just13) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 7 (all INS all ARG2 (genlpreds(INS,ARG2) -> predicate(INS))) # label(just14) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 8 (all X all Y all Z (genlpreds(X,Y) & genlpreds(Y,Z) -> genlpreds(X,Z))) # label(just15) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 9 (all X (predicate(X) -> genlpreds(X,X))) # label(just16) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 10 (all X (predicate(X) -> genlpreds(X,X))) # label(just17) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 11 (all ARG1 all INS (genlinverse(ARG1,INS) -> binarypredicate(INS))) # label(just18) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 12 (all INS all ARG2 (genlinverse(INS,ARG2) -> binarypredicate(INS))) # label(just19) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 13 (all OLD all ARG2 all NEW (genlinverse(OLD,ARG2) & genlpreds(NEW,OLD) -> genlinverse(NEW,ARG2))) # label(just20) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 14 (all ARG1 all OLD all NEW (genlinverse(ARG1,OLD) & genlpreds(OLD,NEW) -> genlinverse(ARG1,NEW))) # label(just21) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 15 (all ARG1 all INS (disjointwith(ARG1,INS) -> collection(INS))) # label(just22) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 16 (all INS all ARG2 (disjointwith(INS,ARG2) -> collection(INS))) # label(just23) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 17 (all X all Y (disjointwith(X,Y) -> disjointwith(Y,X))) # label(just24) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 18 (all ARG1 all OLD all NEW (disjointwith(ARG1,OLD) & genls(NEW,OLD) -> disjointwith(ARG1,NEW))) # label(just25) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 19 (all OLD all ARG2 all NEW (disjointwith(OLD,ARG2) & genls(NEW,OLD) -> disjointwith(NEW,ARG2))) # label(just26) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 20 (all X (isa(X,c_tptpcol_15_50957) -> tptpcol_15_50957(X))) # label(just27) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 21 (all X (tptpcol_15_50957(X) -> isa(X,c_tptpcol_15_50957))) # label(just28) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 22 (all X (isa(X,c_tptpcol_16_50958) -> tptpcol_16_50958(X))) # label(just29) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 23 (all X (tptpcol_16_50958(X) -> isa(X,c_tptpcol_16_50958))) # label(just30) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 24 (all ARG1 all INS (genls(ARG1,INS) -> collection(INS))) # label(just31) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 25 (all ARG1 all INS (genls(ARG1,INS) -> collection(INS))) # label(just32) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 26 (all INS all ARG2 (genls(INS,ARG2) -> collection(INS))) # label(just33) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 27 (all INS all ARG2 (genls(INS,ARG2) -> collection(INS))) # label(just34) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 28 (all X all Y all Z (genls(X,Y) & genls(Y,Z) -> genls(X,Z))) # label(just35) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 29 (all X (collection(X) -> genls(X,X))) # label(just36) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 30 (all X (collection(X) -> genls(X,X))) # label(just37) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 31 (all OLD all ARG2 all NEW (genls(OLD,ARG2) & genls(NEW,OLD) -> genls(NEW,ARG2))) # label(just38) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 32 (all ARG1 all OLD all NEW (genls(ARG1,OLD) & genls(OLD,NEW) -> genls(ARG1,NEW))) # label(just39) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 33 (all X (isa(X,c_transitivebinarypredicate) -> transitivebinarypredicate(X))) # label(just40) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 34 (all X (transitivebinarypredicate(X) -> isa(X,c_transitivebinarypredicate))) # label(just41) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 35 (all ARG1 all INS (isa(ARG1,INS) -> collection(INS))) # label(just42) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 36 (all ARG1 all INS (isa(ARG1,INS) -> collection(INS))) # label(just43) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 37 (all INS all ARG2 (isa(INS,ARG2) -> thing(INS))) # label(just44) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 38 (all INS all ARG2 (isa(INS,ARG2) -> thing(INS))) # label(just45) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 39 (all ARG1 all OLD all NEW (isa(ARG1,OLD) & genls(OLD,NEW) -> isa(ARG1,NEW))) # label(just46) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 40 (all ARG1 natfunction(f_urlfn(ARG1),c_urlfn)) # label(just47) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 41 (all ARG1 natargument(f_urlfn(ARG1),n_1,ARG1)) # label(just48) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 42 (all ARG1 uniformresourcelocator(f_urlfn(ARG1))) # label(just49) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 43 (all ARG1 natfunction(f_urlreferentfn(ARG1),c_urlreferentfn)) # label(just50) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 44 (all ARG1 natargument(f_urlreferentfn(ARG1),n_1,ARG1)) # label(just51) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 45 (all ARG1 computerdataartifact(f_urlreferentfn(ARG1))) # label(just52) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.06 46 (all ARG1 all ARG2 natfunction(f_contentmtofcdafromeventfn(ARG1,ARG2),c_contentmtofcdafromeventfn)) # label(just53) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.07 47 (all ARG1 all ARG2 natargument(f_contentmtofcdafromeventfn(ARG1,ARG2),n_1,ARG1)) # label(just54) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.07 48 (all ARG1 all ARG2 natargument(f_contentmtofcdafromeventfn(ARG1,ARG2),n_2,ARG2)) # label(just55) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.07 49 (all ARG1 all ARG2 microtheory(f_contentmtofcdafromeventfn(ARG1,ARG2))) # label(just56) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.07 50 (all SPECMT all GENLMT (mtvisible(SPECMT) & genlmt(SPECMT,GENLMT) -> mtvisible(GENLMT))) # label(just58) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.07 51 (all ARG1 all INS (genlmt(ARG1,INS) -> microtheory(INS))) # label(just59) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.07 52 (all ARG1 all INS (genlmt(ARG1,INS) -> microtheory(INS))) # label(just60) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.07 53 (all INS all ARG2 (genlmt(INS,ARG2) -> microtheory(INS))) # label(just61) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.07 54 (all INS all ARG2 (genlmt(INS,ARG2) -> microtheory(INS))) # label(just62) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.07 55 (all X all Y all Z (genlmt(X,Y) & genlmt(Y,Z) -> genlmt(X,Z))) # label(just63) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.07 56 (all X (microtheory(X) -> genlmt(X,X))) # label(just64) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.07 57 (all X (microtheory(X) -> genlmt(X,X))) # label(just65) # label(axiom) # label(non_clause). [assumption].
% 0.49/1.07 58 -(mtvisible(f_contentmtofcdafromeventfn(f_urlreferentfn(f_urlfn(s_http_wwwfuntriviacomplayquizcfmqid60926origin)),c_translation_0_885)) -> genls(c_tptpcol_16_50958,c_tptpcol_15_50957)) # label(query46) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.49/1.07
% 0.49/1.07 ============================== end of process non-clausal formulas ===
% 0.49/1.07
% 0.49/1.07 ============================== PROCESS INITIAL CLAUSES ===============
% 0.49/1.07
% 0.49/1.07 ============================== PREDICATE ELIMINATION =================
% 0.49/1.07 59 -transitivebinarypredicate(A) | isa(A,c_transitivebinarypredicate) # label(just41) # label(axiom). [clausify(34)].
% 0.49/1.07 60 transitivebinarypredicate(c_genlmt) # label(just4) # label(axiom). [assumption].
% 0.49/1.07 61 -isa(A,c_transitivebinarypredicate) | transitivebinarypredicate(A) # label(just40) # label(axiom). [clausify(33)].
% 0.49/1.07 Derived: isa(c_genlmt,c_transitivebinarypredicate). [resolve(59,a,60,a)].
% 0.49/1.07 62 -microtheory(A) | genlmt(A,A) # label(just64) # label(axiom). [clausify(56)].
% 0.49/1.07 63 microtheory(f_contentmtofcdafromeventfn(A,B)) # label(just56) # label(axiom). [clausify(49)].
% 0.49/1.07 64 -genlmt(A,B) | microtheory(B) # label(just59) # label(axiom). [clausify(51)].
% 0.49/1.07 65 -genlmt(A,B) | microtheory(B) # label(just60) # label(axiom). [clausify(52)].
% 0.49/1.07 66 -genlmt(A,B) | microtheory(A) # label(just61) # label(axiom). [clausify(53)].
% 0.49/1.07 67 -genlmt(A,B) | microtheory(A) # label(just62) # label(axiom). [clausify(54)].
% 0.49/1.07 Derived: genlmt(f_contentmtofcdafromeventfn(A,B),f_contentmtofcdafromeventfn(A,B)). [resolve(62,a,63,a)].
% 0.49/1.07 Derived: genlmt(A,A) | -genlmt(B,A). [resolve(62,a,64,b)].
% 0.49/1.07 Derived: genlmt(A,A) | -genlmt(A,B). [resolve(62,a,66,b)].
% 0.49/1.07 68 -microtheory(A) | genlmt(A,A) # label(just65) # label(axiom). [clausify(57)].
% 0.49/1.07 69 -isa(A,c_tptpcol_16_50958) | tptpcol_16_50958(A) # label(just29) # label(axiom). [clausify(22)].
% 0.49/1.07 70 -tptpcol_16_50958(A) | tptpcol_15_50957(A) # label(just8) # label(axiom). [clausify(1)].
% 0.49/1.07 Derived: -isa(A,c_tptpcol_16_50958) | tptpcol_15_50957(A). [resolve(69,b,70,a)].
% 0.49/1.07 71 -tptpcol_16_50958(A) | isa(A,c_tptpcol_16_50958) # label(just30) # label(axiom). [clausify(23)].
% 0.49/1.07 72 -predicate(A) | genlpreds(A,A) # label(just16) # label(axiom). [clausify(9)].
% 0.49/1.07 73 -genlpreds(A,B) | predicate(B) # label(just11) # label(axiom). [clausify(4)].
% 0.49/1.07 74 -genlpreds(A,B) | predicate(B) # label(just12) # label(axiom). [clausify(5)].
% 0.49/1.07 75 -genlpreds(A,B) | predicate(A) # label(just13) # label(axiom). [clausify(6)].
% 0.49/1.07 76 -genlpreds(A,B) | predicate(A) # label(just14) # label(axiom). [clausify(7)].
% 0.49/1.07 Derived: genlpredCputime limit exceeded (core dumped)
%------------------------------------------------------------------------------