%------------------------------------------------------------------------------ % File : Prover9---1109a % Problem : MGT115+1 : TPTP v9.3.0. Released v9.3.0. % Transfm : none % Format : tptp:raw % Command : tptp2X_and_run_prover9 %d %s % Computer : n013.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 : Theorem 0.43s 1.02s % Output : Refutation 0.43s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : MGT115+1 : TPTP v9.3.0. Released v9.3.0. % 0.13/0.13 % Command : tptp2X_and_run_prover9 %d %s % 0.16/0.33 % Computer : n013.cluster.edu % 0.16/0.33 % Model : x86_64 x86_64 % 0.16/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.16/0.33 % Memory : 8042.1875MB % 0.16/0.33 % OS : Linux 3.10.0-693.el7.x86_64 % 0.16/0.33 % CPULimit : 300 % 0.16/0.33 % WCLimit : 300 % 0.16/0.33 % DateTime : Tue Apr 28 19:31:55 EDT 2026 % 0.16/0.33 % CPUTime : % 0.43/1.02 ============================== Prover9 =============================== % 0.43/1.02 Prover9 (32) version 2009-11A, November 2009. % 0.43/1.02 Process 388 was started by sandbox2 on n013.cluster.edu, % 0.43/1.02 Tue Apr 28 19:31:56 2026 % 0.43/1.02 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_32480_n013.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_32480_n013.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 (5 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 A all B (issue(A) = issue(B) -> A = B)) # label(issue_injective) # label(axiom) # label(non_clause). [assumption]. % 0.43/1.02 2 -(issue(pi1) != issue(pi2)) # label(conjecture) # label(negated_conjecture) # label(non_clause). [assumption]. % 0.43/1.02 % 0.43/1.02 ============================== end of process non-clausal formulas === % 0.43/1.02 % 0.43/1.02 ============================== PROCESS INITIAL CLAUSES =============== % 0.43/1.02 % 0.43/1.02 ============================== PREDICATE ELIMINATION ================= % 0.43/1.02 % 0.43/1.02 ============================== end predicate elimination ============= % 0.43/1.02 % 0.43/1.02 Auto_denials: % 0.43/1.02 % copying label pi1_neq_pi2 to answer in negative clause % 0.43/1.02 % 0.43/1.02 Term ordering decisions: % 0.43/1.02 % 0.43/1.02 % Assigning unary symbol issue kb_weight 0 and highest precedence (4). % 0.43/1.02 Function symbol KB weights: pi1=1. pi2=1. issue=0. % 0.43/1.02 % 0.43/1.02 ============================== end of process initial clauses ======== % 0.43/1.02 % 0.43/1.02 ============================== CLAUSES FOR SEARCH ==================== % 0.43/1.02 % 0.43/1.02 ============================== end of clauses for search ============= % 0.43/1.02 % 0.43/1.02 ============================== SEARCH ================================ % 0.43/1.02 % 0.43/1.02 % Starting search at 0.01 seconds. % 0.43/1.02 % 0.43/1.02 ============================== PROOF ================================= % 0.43/1.02 % SZS status Theorem % 0.43/1.02 % SZS output start Refutation % 0.43/1.02 % 0.43/1.02 % Proof 1 at 0.01 (+ 0.00) seconds: pi1_neq_pi2. % 0.43/1.02 % Length of proof is 8. % 0.43/1.02 % Level of proof is 3. % 0.43/1.02 % Maximum clause weight is 8.000. % 0.43/1.02 % Given clauses 3. % 0.43/1.02 % 0.43/1.02 1 (all A all B (issue(A) = issue(B) -> A = B)) # label(issue_injective) # label(axiom) # label(non_clause). [assumption]. % 0.43/1.02 2 -(issue(pi1) != issue(pi2)) # label(conjecture) # label(negated_conjecture) # label(non_clause). [assumption]. % 0.43/1.02 3 issue(pi2) = issue(pi1) # label(conjecture) # label(negated_conjecture). [clausify(2)]. % 0.43/1.02 4 pi1 != pi2 # label(pi1_neq_pi2) # label(axiom) # answer(pi1_neq_pi2). [assumption]. % 0.43/1.02 5 pi2 != pi1 # answer(pi1_neq_pi2). [copy(4),flip(a)]. % 0.43/1.02 6 issue(A) != issue(B) | A = B # label(issue_injective) # label(axiom). [clausify(1)]. % 0.43/1.02 7 pi2 = pi1. [hyper(6,a,3,a)]. % 0.43/1.02 8 $F # answer(pi1_neq_pi2). [resolve(7,a,5,a)]. % 0.43/1.02 % 0.43/1.02 % SZS output end Refutation % 0.43/1.02 ============================== end of proof ========================== % 0.43/1.02 % 0.43/1.02 ============================== STATISTICS ============================ % 0.43/1.02 % 0.43/1.02 Given=3. Generated=5. Kept=4. proofs=1. % 0.43/1.02 Usable=3. Sos=0. Demods=1. Limbo=0, Disabled=5. Hints=0. % 0.43/1.02 Megabytes=0.02. % 0.43/1.02 User_CPU=0.01, System_CPU=0.00, Wall_clock=0. % 0.43/1.02 % 0.43/1.02 ============================== end of statistics ===================== % 0.43/1.02 % 0.43/1.02 ============================== end of search ========================= % 0.43/1.02 % 0.43/1.02 THEOREM PROVED % 0.43/1.02 % SZS status Theorem % 0.43/1.02 % 0.43/1.02 Exiting with 1 proof. % 0.43/1.02 % 0.43/1.02 Process 388 exit (max_proofs) Tue Apr 28 19:31:56 2026 % 0.43/1.02 Prover9 interrupted %------------------------------------------------------------------------------