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