TSTP Solution File: CSR042+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : CSR042+1 : TPTP v8.1.0. Released v3.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n019.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:30 EDT 2022
% Result : Theorem 0.43s 0.99s
% Output : Refutation 0.43s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : CSR042+1 : TPTP v8.1.0. Released v3.4.0.
% 0.11/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.33 % Computer : n019.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Sat Jun 11 09:26:55 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.43/0.98 ============================== Prover9 ===============================
% 0.43/0.98 Prover9 (32) version 2009-11A, November 2009.
% 0.43/0.98 Process 22859 was started by sandbox2 on n019.cluster.edu,
% 0.43/0.98 Sat Jun 11 09:26:55 2022
% 0.43/0.98 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_22706_n019.cluster.edu".
% 0.43/0.98 ============================== end of head ===========================
% 0.43/0.98
% 0.43/0.98 ============================== INPUT =================================
% 0.43/0.98
% 0.43/0.98 % Reading from file /tmp/Prover9_22706_n019.cluster.edu
% 0.43/0.98
% 0.43/0.98 set(prolog_style_variables).
% 0.43/0.98 set(auto2).
% 0.43/0.98 % set(auto2) -> set(auto).
% 0.43/0.98 % set(auto) -> set(auto_inference).
% 0.43/0.98 % set(auto) -> set(auto_setup).
% 0.43/0.98 % set(auto_setup) -> set(predicate_elim).
% 0.43/0.98 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.43/0.98 % set(auto) -> set(auto_limits).
% 0.43/0.98 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.43/0.98 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.43/0.98 % set(auto) -> set(auto_denials).
% 0.43/0.98 % set(auto) -> set(auto_process).
% 0.43/0.98 % set(auto2) -> assign(new_constants, 1).
% 0.43/0.98 % set(auto2) -> assign(fold_denial_max, 3).
% 0.43/0.98 % set(auto2) -> assign(max_weight, "200.000").
% 0.43/0.98 % set(auto2) -> assign(max_hours, 1).
% 0.43/0.98 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.43/0.98 % set(auto2) -> assign(max_seconds, 0).
% 0.43/0.98 % set(auto2) -> assign(max_minutes, 5).
% 0.43/0.98 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.43/0.98 % set(auto2) -> set(sort_initial_sos).
% 0.43/0.98 % set(auto2) -> assign(sos_limit, -1).
% 0.43/0.98 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.43/0.98 % set(auto2) -> assign(max_megs, 400).
% 0.43/0.98 % set(auto2) -> assign(stats, some).
% 0.43/0.98 % set(auto2) -> clear(echo_input).
% 0.43/0.98 % set(auto2) -> set(quiet).
% 0.43/0.98 % set(auto2) -> clear(print_initial_clauses).
% 0.43/0.98 % set(auto2) -> clear(print_given).
% 0.43/0.98 assign(lrs_ticks,-1).
% 0.43/0.98 assign(sos_limit,10000).
% 0.43/0.98 assign(order,kbo).
% 0.43/0.98 set(lex_order_vars).
% 0.43/0.98 clear(print_given).
% 0.43/0.98
% 0.43/0.98 % formulas(sos). % not echoed (30 formulas)
% 0.43/0.98
% 0.43/0.98 ============================== end of input ==========================
% 0.43/0.98
% 0.43/0.98 % From the command line: assign(max_seconds, 300).
% 0.43/0.98
% 0.43/0.98 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.43/0.98
% 0.43/0.98 % Formulas that are not ordinary clauses:
% 0.43/0.98 1 mtvisible(c_tptpgeo_member7_mt) -> borderson(c_georegion_l4_x27_y64,c_georegion_l4_x27_y65) # label(just1) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.98 2 (all OBJ all COL1 all COL2 -(isa(OBJ,COL1) & isa(OBJ,COL2) & disjointwith(COL1,COL2))) # label(just2) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.98 3 (all SPECPRED all PRED all GENLPRED (genlinverse(SPECPRED,PRED) & genlinverse(PRED,GENLPRED) -> genlpreds(SPECPRED,GENLPRED))) # label(just3) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.98 4 (all ARG1 all INS (genlpreds(ARG1,INS) -> predicate(INS))) # label(just4) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.98 5 (all ARG1 all INS (genlpreds(ARG1,INS) -> predicate(INS))) # label(just5) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.98 6 (all INS all ARG2 (genlpreds(INS,ARG2) -> predicate(INS))) # label(just6) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.98 7 (all INS all ARG2 (genlpreds(INS,ARG2) -> predicate(INS))) # label(just7) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.98 8 (all X all Y all Z (genlpreds(X,Y) & genlpreds(Y,Z) -> genlpreds(X,Z))) # label(just8) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.98 9 (all X (predicate(X) -> genlpreds(X,X))) # label(just9) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.98 10 (all X (predicate(X) -> genlpreds(X,X))) # label(just10) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.98 11 (all ARG1 all INS (genlinverse(ARG1,INS) -> binarypredicate(INS))) # label(just11) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.98 12 (all INS all ARG2 (genlinverse(INS,ARG2) -> binarypredicate(INS))) # label(just12) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.98 13 (all OLD all ARG2 all NEW (genlinverse(OLD,ARG2) & genlpreds(NEW,OLD) -> genlinverse(NEW,ARG2))) # label(just13) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.98 14 (all ARG1 all OLD all NEW (genlinverse(ARG1,OLD) & genlpreds(OLD,NEW) -> genlinverse(ARG1,NEW))) # label(just14) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.99 15 (all ARG1 all INS (disjointwith(ARG1,INS) -> collection(INS))) # label(just15) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.99 16 (all INS all ARG2 (disjointwith(INS,ARG2) -> collection(INS))) # label(just16) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.99 17 (all X all Y (disjointwith(X,Y) -> disjointwith(Y,X))) # label(just17) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.99 18 (all ARG1 all OLD all NEW (disjointwith(ARG1,OLD) & genls(NEW,OLD) -> disjointwith(ARG1,NEW))) # label(just18) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.99 19 (all OLD all ARG2 all NEW (disjointwith(OLD,ARG2) & genls(NEW,OLD) -> disjointwith(NEW,ARG2))) # label(just19) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.99 20 (all ARG1 all INS (isa(ARG1,INS) -> collection(INS))) # label(just20) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.99 21 (all ARG1 all INS (isa(ARG1,INS) -> collection(INS))) # label(just21) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.99 22 (all INS all ARG2 (isa(INS,ARG2) -> thing(INS))) # label(just22) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.99 23 (all INS all ARG2 (isa(INS,ARG2) -> thing(INS))) # label(just23) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.99 24 (all ARG1 all OLD all NEW (isa(ARG1,OLD) & genls(OLD,NEW) -> isa(ARG1,NEW))) # label(just24) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.99 25 (all ARG1 all INS (borderson(ARG1,INS) -> geographicalregion(INS))) # label(just26) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.99 26 (all INS all ARG2 (borderson(INS,ARG2) -> geographicalregion(INS))) # label(just27) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.99 27 (all X all Y (borderson(X,Y) -> borderson(Y,X))) # label(just28) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.99 28 (all X -borderson(X,X)) # label(just29) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.99 29 -(exists ARG1 (mtvisible(c_tptpgeo_member7_mt) -> borderson(ARG1,c_georegion_l4_x27_y64))) # label(query42) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.43/0.99
% 0.43/0.99 ============================== end of process non-clausal formulas ===
% 0.43/0.99
% 0.43/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.43/0.99
% 0.43/0.99 ============================== PREDICATE ELIMINATION =================
% 0.43/0.99 30 -mtvisible(c_tptpgeo_member7_mt) | borderson(c_georegion_l4_x27_y64,c_georegion_l4_x27_y65) # label(just1) # label(axiom). [clausify(1)].
% 0.43/0.99 31 mtvisible(c_basekb) # label(just25) # label(axiom). [assumption].
% 0.43/0.99 32 mtvisible(c_tptpgeo_member7_mt) # label(query42) # label(negated_conjecture). [clausify(29)].
% 0.43/0.99 Derived: borderson(c_georegion_l4_x27_y64,c_georegion_l4_x27_y65). [resolve(30,a,32,a)].
% 0.43/0.99 33 -predicate(A) | genlpreds(A,A) # label(just9) # label(axiom). [clausify(9)].
% 0.43/0.99 34 -genlpreds(A,B) | predicate(B) # label(just4) # label(axiom). [clausify(4)].
% 0.43/0.99 35 -genlpreds(A,B) | predicate(B) # label(just5) # label(axiom). [clausify(5)].
% 0.43/0.99 36 -genlpreds(A,B) | predicate(A) # label(just6) # label(axiom). [clausify(6)].
% 0.43/0.99 37 -genlpreds(A,B) | predicate(A) # label(just7) # label(axiom). [clausify(7)].
% 0.43/0.99 Derived: genlpreds(A,A) | -genlpreds(B,A). [resolve(33,a,34,b)].
% 0.43/0.99 Derived: genlpreds(A,A) | -genlpreds(A,B). [resolve(33,a,36,b)].
% 0.43/0.99 38 -predicate(A) | genlpreds(A,A) # label(just10) # label(axiom). [clausify(10)].
% 0.43/0.99
% 0.43/0.99 ============================== end predicate elimination =============
% 0.43/0.99
% 0.43/0.99 Auto_denials:
% 0.43/0.99 % copying label just29 to answer in negative clause
% 0.43/0.99 % copying label query42 to answer in negative clause
% 0.43/0.99 % copying label just2 to answer in negative clause
% 0.43/0.99 % assign(max_proofs, 3). % (Horn set with more than one neg. clause)
% 0.43/0.99
% 0.43/0.99 Term ordering decisions:
% 0.43/0.99 Function symbol KB weights: c_georegion_l4_x27_y64=1. c_georegion_l4_x27_y65=1.
% 0.43/0.99
% 0.43/0.99 ============================== end of process initial clauses ========
% 0.43/0.99
% 0.43/0.99 ============================== CLAUSES FOR SEARCH ====================
% 0.43/0.99
% 0.43/0.99 ============================== end of clauses for search =============
% 0.43/0.99
% 0.43/0.99 ============================== SEARCH ================================
% 0.43/0.99
% 0.43/0.99 % Starting search at 0.02 seconds.
% 0.43/0.99
% 0.43/0.99 ============================== PROOF =================================
% 0.43/0.99 % SZS status Theorem
% 0.43/0.99 % SZS output start Refutation
% 0.43/0.99
% 0.43/0.99 % Proof 1 at 0.02 (+ 0.00) seconds: query42.
% 0.43/0.99 % Length of proof is 10.
% 0.43/0.99 % Level of proof is 3.
% 0.43/0.99 % Maximum clause weight is 6.000.
% 0.43/0.99 % Given clauses 5.
% 0.43/0.99
% 0.43/0.99 1 mtvisible(c_tptpgeo_member7_mt) -> borderson(c_georegion_l4_x27_y64,c_georegion_l4_x27_y65) # label(just1) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.99 27 (all X all Y (borderson(X,Y) -> borderson(Y,X))) # label(just28) # label(axiom) # label(non_clause). [assumption].
% 0.43/0.99 29 -(exists ARG1 (mtvisible(c_tptpgeo_member7_mt) -> borderson(ARG1,c_georegion_l4_x27_y64))) # label(query42) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.43/0.99 30 -mtvisible(c_tptpgeo_member7_mt) | borderson(c_georegion_l4_x27_y64,c_georegion_l4_x27_y65) # label(just1) # label(axiom). [clausify(1)].
% 0.43/0.99 32 mtvisible(c_tptpgeo_member7_mt) # label(query42) # label(negated_conjecture). [clausify(29)].
% 0.43/0.99 40 -borderson(A,c_georegion_l4_x27_y64) # label(query42) # label(negated_conjecture) # answer(query42). [clausify(29)].
% 0.43/0.99 43 -borderson(A,B) | borderson(B,A) # label(just28) # label(axiom). [clausify(27)].
% 0.43/0.99 48 borderson(c_georegion_l4_x27_y64,c_georegion_l4_x27_y65). [resolve(30,a,32,a)].
% 0.43/0.99 51 -borderson(c_georegion_l4_x27_y64,A) # answer(query42). [resolve(43,b,40,a)].
% 0.43/0.99 52 $F # answer(query42). [resolve(51,a,48,a)].
% 0.43/0.99
% 0.43/0.99 % SZS output end Refutation
% 0.43/0.99 ============================== end of proof ==========================
% 0.43/0.99
% 0.43/0.99 % Disable descendants (x means already disabled):
% 0.43/0.99 40 51
% 0.43/0.99
% 0.43/0.99 ============================== STATISTICS ============================
% 0.43/0.99
% 0.43/0.99 Given=13. Generated=19. Kept=14. proofs=1.
% 0.43/0.99 Usable=12. Sos=0. Demods=0. Limbo=0, Disabled=36. Hints=0.
% 0.43/0.99 Megabytes=0.06.
% 0.43/0.99 User_CPU=0.02, System_CPU=0.00, Wall_clock=0.
% 0.43/0.99
% 0.43/0.99 ============================== end of statistics =====================
% 0.43/0.99
% 0.43/0.99 ============================== end of search =========================
% 0.43/0.99
% 0.43/0.99 SEARCH FAILED
% 0.43/0.99
% 0.43/0.99 Exiting with 1 proof.
% 0.43/0.99
% 0.43/0.99 Process 22859 exit (sos_empty) Sat Jun 11 09:26:55 2022
% 0.43/0.99 Prover9 interrupted
%------------------------------------------------------------------------------