%------------------------------------------------------------------------------ % File : Prover9---1109a % Problem : MGT112+1 : TPTP v9.3.0. Released v9.3.0. % Transfm : none % Format : tptp:raw % Command : tptp2X_and_run_prover9 %d %s % Computer : n018.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 : 300s % DateTime : Wed Apr 29 02:10:30 PM UTC 2026 % Result : Unsatisfiable 0.47s 1.03s % Output : Refutation 0.47s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.12/0.13 % Problem : MGT112+1 : TPTP v9.3.0. Released v9.3.0. % 0.12/0.14 % Command : tptp2X_and_run_prover9 %d %s % 0.18/0.35 % Computer : n018.cluster.edu % 0.18/0.35 % Model : x86_64 x86_64 % 0.18/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.18/0.35 % Memory : 8042.1875MB % 0.18/0.35 % OS : Linux 3.10.0-693.el7.x86_64 % 0.18/0.35 % CPULimit : 300 % 0.18/0.35 % WCLimit : 300 % 0.18/0.35 % DateTime : Tue Apr 28 19:29:46 EDT 2026 % 0.18/0.35 % CPUTime : % 0.47/1.03 ============================== Prover9 =============================== % 0.47/1.03 Prover9 (32) version 2009-11A, November 2009. % 0.47/1.03 Process 6272 was started by sandbox2 on n018.cluster.edu, % 0.47/1.03 Tue Apr 28 19:29:47 2026 % 0.47/1.03 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_6119_n018.cluster.edu". % 0.47/1.03 ============================== end of head =========================== % 0.47/1.03 % 0.47/1.03 ============================== INPUT ================================= % 0.47/1.03 % 0.47/1.03 % Reading from file /tmp/Prover9_6119_n018.cluster.edu % 0.47/1.03 % 0.47/1.03 set(prolog_style_variables). % 0.47/1.03 set(auto2). % 0.47/1.03 % set(auto2) -> set(auto). % 0.47/1.03 % set(auto) -> set(auto_inference). % 0.47/1.03 % set(auto) -> set(auto_setup). % 0.47/1.03 % set(auto_setup) -> set(predicate_elim). % 0.47/1.03 % set(auto_setup) -> assign(eq_defs, unfold). % 0.47/1.03 % set(auto) -> set(auto_limits). % 0.47/1.03 % set(auto_limits) -> assign(max_weight, "100.000"). % 0.47/1.03 % set(auto_limits) -> assign(sos_limit, 20000). % 0.47/1.03 % set(auto) -> set(auto_denials). % 0.47/1.03 % set(auto) -> set(auto_process). % 0.47/1.03 % set(auto2) -> assign(new_constants, 1). % 0.47/1.03 % set(auto2) -> assign(fold_denial_max, 3). % 0.47/1.03 % set(auto2) -> assign(max_weight, "200.000"). % 0.47/1.03 % set(auto2) -> assign(max_hours, 1). % 0.47/1.03 % assign(max_hours, 1) -> assign(max_seconds, 3600). % 0.47/1.03 % set(auto2) -> assign(max_seconds, 0). % 0.47/1.03 % set(auto2) -> assign(max_minutes, 5). % 0.47/1.03 % assign(max_minutes, 5) -> assign(max_seconds, 300). % 0.47/1.03 % set(auto2) -> set(sort_initial_sos). % 0.47/1.03 % set(auto2) -> assign(sos_limit, -1). % 0.47/1.03 % set(auto2) -> assign(lrs_ticks, 3000). % 0.47/1.03 % set(auto2) -> assign(max_megs, 400). % 0.47/1.03 % set(auto2) -> assign(stats, some). % 0.47/1.03 % set(auto2) -> clear(echo_input). % 0.47/1.03 % set(auto2) -> set(quiet). % 0.47/1.03 % set(auto2) -> clear(print_initial_clauses). % 0.47/1.03 % set(auto2) -> clear(print_given). % 0.47/1.03 assign(lrs_ticks,-1). % 0.47/1.03 assign(sos_limit,10000). % 0.47/1.03 assign(order,kbo). % 0.47/1.03 set(lex_order_vars). % 0.47/1.03 clear(print_given). % 0.47/1.03 % 0.47/1.03 % formulas(sos). % not echoed (29 formulas) % 0.47/1.03 % 0.47/1.03 ============================== end of input ========================== % 0.47/1.03 % 0.47/1.03 % From the command line: assign(max_seconds, 300). % 0.47/1.03 % 0.47/1.03 ============================== PROCESS NON-CLAUSAL FORMULAS ========== % 0.47/1.03 % 0.47/1.03 % Formulas that are not ordinary clauses: % 0.47/1.03 1 (all F all X all Y all A all T (proh(F) & aee(F,X) & aer(F,Y) & act(F,A) & tgt(F,T) -> -(exists Db (disability(Db) & bearer(Db,Y) & cnt(Db,A,T))))) # label(ax_disability_block) # label(axiom) # label(non_clause). [assumption]. % 0.47/1.03 % 0.47/1.03 ============================== end of process non-clausal formulas === % 0.47/1.03 % 0.47/1.03 ============================== PROCESS INITIAL CLAUSES =============== % 0.47/1.03 % 0.47/1.03 ============================== PREDICATE ELIMINATION ================= % 0.47/1.03 2 -proh(A) | -aee(A,B) | -aer(A,C) | -act(A,D) | -tgt(A,E) | -disability(F) | -bearer(F,C) | -cnt(F,D,E) # label(ax_disability_block) # label(axiom). [clausify(1)]. % 0.47/1.03 3 disability(db) # label(disability_db) # label(axiom). [assumption]. % 0.47/1.03 Derived: -proh(A) | -aee(A,B) | -aer(A,C) | -act(A,D) | -tgt(A,E) | -bearer(db,C) | -cnt(db,D,E). [resolve(2,f,3,a)]. % 0.47/1.03 4 -proh(A) | -aee(A,B) | -aer(A,C) | -act(A,D) | -tgt(A,E) | -bearer(db,C) | -cnt(db,D,E). [resolve(2,f,3,a)]. % 0.47/1.03 5 proh(f2) # label(proh_f2) # label(axiom). [assumption]. % 0.47/1.03 Derived: -aee(f2,A) | -aer(f2,B) | -act(f2,C) | -tgt(f2,D) | -bearer(db,B) | -cnt(db,C,D). [resolve(4,a,5,a)]. % 0.47/1.03 6 -aee(f2,A) | -aer(f2,B) | -act(f2,C) | -tgt(f2,D) | -bearer(db,B) | -cnt(db,C,D). [resolve(4,a,5,a)]. % 0.47/1.03 7 bearer(l,bibliothek) # label(bearer_l) # label(axiom). [assumption]. % 0.47/1.03 8 bearer(n,museen) # label(bearer_n) # label(axiom). [assumption]. % 0.47/1.03 9 bearer(im,bibliothek) # label(bearer_im) # label(axiom). [assumption]. % 0.47/1.03 10 bearer(db,museen) # label(bearer_db) # label(axiom). [assumption]. % 0.47/1.03 Derived: -aee(f2,A) | -aer(f2,museen) | -act(f2,B) | -tgt(f2,C) | -cnt(db,B,C). [resolve(6,e,10,a)]. % 0.47/1.03 11 -aee(f2,A) | -aer(f2,museen) | -act(f2,B) | -tgt(f2,C) | -cnt(db,B,C). [resolve(6,e,10,a)]. % 0.47/1.03 12 aee(f2,bibliothek) # label(aee_f2) # label(axiom). [assumption]. % 0.47/1.03 Derived: -aer(f2,museen) | -act(f2,A) | -tgt(f2,B) | -cnt(db,A,B). [resolve(11,a,12,a)]. % 0.47/1.03 13 -aer(f2,museen) | -act(f2,A) | -tgt(f2,B) | -cnt(db,A,B). [resolve(11,a,12,a)]. % 0.47/1.03 14 aer(f2,museen) # label(aer_f2) # label(axiom). [assumption]. % 0.47/1.03 Derived: -act(f2,A) | -tgt(f2,B) | -cnt(db,A,B). [resolve(13,a,14,a)]. % 0.47/1.03 15 -act(f2,A) | -tgt(f2,B) | -cnt(db,A,B). [resolve(13,a,14,a)]. % 0.47/1.03 16 act(f2,read) # label(act_f2) # label(axiom). [assumption]. % 0.47/1.03 Derived: -tgt(f2,A) | -cnt(db,read,A). [resolve(15,a,16,a)]. % 0.47/1.03 17 -tgt(f2,A) | -cnt(db,read,A). [resolve(15,a,16,a)]. % 0.47/1.03 18 tgt(f2,museum_api) # label(tgt_f2) # label(axiom). [assumption]. % 0.47/1.03 Derived: -cnt(db,read,museum_api). [resolve(17,a,18,a)]. % 0.47/1.03 19 -cnt(db,read,museum_api). [resolve(17,a,18,a)]. % 0.47/1.03 20 cnt(l,read,museum_api) # label(cnt_l) # label(axiom). [assumption]. % 0.47/1.03 21 cnt(n,read,museum_api) # label(cnt_n) # label(axiom). [assumption]. % 0.47/1.03 22 cnt(im,read,museum_api) # label(cnt_im) # label(axiom). [assumption]. % 0.47/1.03 23 cnt(db,read,museum_api) # label(cnt_db) # label(axiom). [assumption]. % 0.47/1.03 Derived: $F. [resolve(19,a,23,a)]. % 0.47/1.03 % 0.47/1.03 ============================== end predicate elimination ============= % 0.47/1.03 % 0.47/1.03 Auto_denials: (no changes). % 0.47/1.03 % 0.47/1.03 Term ordering decisions: % 0.47/1.03 Function symbol KB weights: % 0.47/1.03 % 0.47/1.03 ============================== PROOF ================================= % 0.47/1.03 % SZS status Unsatisfiable % 0.47/1.03 % SZS output start Refutation % 0.47/1.03 % 0.47/1.03 % Proof 1 at 0.01 (+ 0.00) seconds. % 0.47/1.03 % Length of proof is 18. % 0.47/1.03 % Level of proof is 9. % 0.47/1.03 % Maximum clause weight is 0.000. % 0.47/1.03 % Given clauses 0. % 0.47/1.03 % 0.47/1.03 1 (all F all X all Y all A all T (proh(F) & aee(F,X) & aer(F,Y) & act(F,A) & tgt(F,T) -> -(exists Db (disability(Db) & bearer(Db,Y) & cnt(Db,A,T))))) # label(ax_disability_block) # label(axiom) # label(non_clause). [assumption]. % 0.47/1.03 2 -proh(A) | -aee(A,B) | -aer(A,C) | -act(A,D) | -tgt(A,E) | -disability(F) | -bearer(F,C) | -cnt(F,D,E) # label(ax_disability_block) # label(axiom). [clausify(1)]. % 0.47/1.03 3 disability(db) # label(disability_db) # label(axiom). [assumption]. % 0.47/1.03 4 -proh(A) | -aee(A,B) | -aer(A,C) | -act(A,D) | -tgt(A,E) | -bearer(db,C) | -cnt(db,D,E). [resolve(2,f,3,a)]. % 0.47/1.03 5 proh(f2) # label(proh_f2) # label(axiom). [assumption]. % 0.47/1.03 6 -aee(f2,A) | -aer(f2,B) | -act(f2,C) | -tgt(f2,D) | -bearer(db,B) | -cnt(db,C,D). [resolve(4,a,5,a)]. % 0.47/1.03 10 bearer(db,museen) # label(bearer_db) # label(axiom). [assumption]. % 0.47/1.03 11 -aee(f2,A) | -aer(f2,museen) | -act(f2,B) | -tgt(f2,C) | -cnt(db,B,C). [resolve(6,e,10,a)]. % 0.47/1.03 12 aee(f2,bibliothek) # label(aee_f2) # label(axiom). [assumption]. % 0.47/1.03 13 -aer(f2,museen) | -act(f2,A) | -tgt(f2,B) | -cnt(db,A,B). [resolve(11,a,12,a)]. % 0.47/1.03 14 aer(f2,museen) # label(aer_f2) # label(axiom). [assumption]. % 0.47/1.03 15 -act(f2,A) | -tgt(f2,B) | -cnt(db,A,B). [resolve(13,a,14,a)]. % 0.47/1.03 16 act(f2,read) # label(act_f2) # label(axiom). [assumption]. % 0.47/1.03 17 -tgt(f2,A) | -cnt(db,read,A). [resolve(15,a,16,a)]. % 0.47/1.03 18 tgt(f2,museum_api) # label(tgt_f2) # label(axiom). [assumption]. % 0.47/1.03 19 -cnt(db,read,museum_api). [resolve(17,a,18,a)]. % 0.47/1.03 23 cnt(db,read,museum_api) # label(cnt_db) # label(axiom). [assumption]. % 0.47/1.03 24 $F. [resolve(19,a,23,a)]. % 0.47/1.03 % 0.47/1.03 % SZS output end Refutation % 0.47/1.03 ============================== end of proof ========================== % 0.47/1.03 % 0.47/1.03 ============================== STATISTICS ============================ % 0.47/1.03 % 0.47/1.03 Given=0. Generated=1. Kept=0. proofs=1. % 0.47/1.03 Usable=0. Sos=0. Demods=0. Limbo=0, Disabled=37. Hints=0. % 0.47/1.03 Megabytes=0.03. % 0.47/1.03 User_CPU=0.01, System_CPU=0.00, Wall_clock=0. % 0.47/1.03 % 0.47/1.03 ============================== end of statistics ===================== % 0.47/1.03 % 0.47/1.03 ============================== end of search ========================= % 0.47/1.03 % 0.47/1.03 THEOREM PROVED % 0.47/1.03 % SZS status Unsatisfiable % 0.47/1.03 % 0.47/1.03 Exiting with 1 proof. % 0.47/1.03 % 0.47/1.03 Process 6272 exit (max_proofs) Tue Apr 28 19:29:47 2026 % 0.47/1.03 Prover9 interrupted %------------------------------------------------------------------------------