%------------------------------------------------------------------------------ % File : Prover9---1109a % Problem : MGT075+1 : TPTP v9.3.0. Released v9.3.0. % Transfm : none % Format : tptp:raw % Command : tptp2X_and_run_prover9 %d %s % Computer : n005.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:27 PM UTC 2026 % Result : Theorem 0.44s 1.02s % Output : Refutation 0.44s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.00/0.12 % Problem : MGT075+1 : TPTP v9.3.0. Released v9.3.0. % 0.12/0.13 % Command : tptp2X_and_run_prover9 %d %s % 0.16/0.34 % Computer : n005.cluster.edu % 0.16/0.34 % Model : x86_64 x86_64 % 0.16/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.16/0.34 % Memory : 8042.1875MB % 0.16/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.16/0.34 % CPULimit : 300 % 0.16/0.34 % WCLimit : 300 % 0.16/0.34 % DateTime : Tue Apr 28 18:45:15 EDT 2026 % 0.16/0.34 % CPUTime : % 0.44/1.02 ============================== Prover9 =============================== % 0.44/1.02 Prover9 (32) version 2009-11A, November 2009. % 0.44/1.02 Process 24103 was started by sandbox on n005.cluster.edu, % 0.44/1.02 Tue Apr 28 18:45:16 2026 % 0.44/1.02 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_23922_n005.cluster.edu". % 0.44/1.02 ============================== end of head =========================== % 0.44/1.02 % 0.44/1.02 ============================== INPUT ================================= % 0.44/1.02 % 0.44/1.02 % Reading from file /tmp/Prover9_23922_n005.cluster.edu % 0.44/1.02 % 0.44/1.02 set(prolog_style_variables). % 0.44/1.02 set(auto2). % 0.44/1.02 % set(auto2) -> set(auto). % 0.44/1.02 % set(auto) -> set(auto_inference). % 0.44/1.02 % set(auto) -> set(auto_setup). % 0.44/1.02 % set(auto_setup) -> set(predicate_elim). % 0.44/1.02 % set(auto_setup) -> assign(eq_defs, unfold). % 0.44/1.02 % set(auto) -> set(auto_limits). % 0.44/1.02 % set(auto_limits) -> assign(max_weight, "100.000"). % 0.44/1.02 % set(auto_limits) -> assign(sos_limit, 20000). % 0.44/1.02 % set(auto) -> set(auto_denials). % 0.44/1.02 % set(auto) -> set(auto_process). % 0.44/1.02 % set(auto2) -> assign(new_constants, 1). % 0.44/1.02 % set(auto2) -> assign(fold_denial_max, 3). % 0.44/1.02 % set(auto2) -> assign(max_weight, "200.000"). % 0.44/1.02 % set(auto2) -> assign(max_hours, 1). % 0.44/1.02 % assign(max_hours, 1) -> assign(max_seconds, 3600). % 0.44/1.02 % set(auto2) -> assign(max_seconds, 0). % 0.44/1.02 % set(auto2) -> assign(max_minutes, 5). % 0.44/1.02 % assign(max_minutes, 5) -> assign(max_seconds, 300). % 0.44/1.02 % set(auto2) -> set(sort_initial_sos). % 0.44/1.02 % set(auto2) -> assign(sos_limit, -1). % 0.44/1.02 % set(auto2) -> assign(lrs_ticks, 3000). % 0.44/1.02 % set(auto2) -> assign(max_megs, 400). % 0.44/1.02 % set(auto2) -> assign(stats, some). % 0.44/1.02 % set(auto2) -> clear(echo_input). % 0.44/1.02 % set(auto2) -> set(quiet). % 0.44/1.02 % set(auto2) -> clear(print_initial_clauses). % 0.44/1.02 % set(auto2) -> clear(print_given). % 0.44/1.02 assign(lrs_ticks,-1). % 0.44/1.02 assign(sos_limit,10000). % 0.44/1.02 assign(order,kbo). % 0.44/1.02 set(lex_order_vars). % 0.44/1.02 clear(print_given). % 0.44/1.02 % 0.44/1.02 % formulas(sos). % not echoed (32 formulas) % 0.44/1.02 % 0.44/1.02 ============================== end of input ========================== % 0.44/1.02 % 0.44/1.02 % From the command line: assign(max_seconds, 300). % 0.44/1.02 % 0.44/1.02 ============================== PROCESS NON-CLAUSAL FORMULAS ========== % 0.44/1.02 % 0.44/1.02 % Formulas that are not ordinary clauses: % 0.44/1.02 1 (all X -less(X,X)) # label(irreflexive) # label(axiom) # label(non_clause). [assumption]. % 0.44/1.02 2 (all X all Y all Z (less(X,Y) & less(Y,Z) -> less(X,Z))) # label(transitive) # label(axiom) # label(non_clause). [assumption]. % 0.44/1.02 3 (all X all Y (less(X,Y) | X = Y | less(Y,X))) # label(trichotomy) # label(axiom) # label(non_clause). [assumption]. % 0.44/1.02 4 (all X all Y (leq(X,Y) <-> less(X,Y) | X = Y)) # label(leq_def) # label(axiom) # label(non_clause). [assumption]. % 0.44/1.02 5 (all X all Y (leq(X,Y) & leq(Y,X) -> X = Y)) # label(leq_antisym) # label(axiom) # label(non_clause). [assumption]. % 0.44/1.02 6 (all X all Y (less(X,Y) -> leq(X,Y))) # label(less_implies_leq) # label(axiom) # label(non_clause). [assumption]. % 0.44/1.02 7 (all X all Y all Z (leq(X,Y) & less(Y,Z) -> less(X,Z))) # label(leq_less_trans) # label(axiom) # label(non_clause). [assumption]. % 0.44/1.02 8 (all X all Y all Z (less(X,Y) & leq(Y,Z) -> less(X,Z))) # label(less_leq_trans) # label(axiom) # label(non_clause). [assumption]. % 0.44/1.02 9 (all X all Y all Z (leq(X,Y) & leq(Y,Z) -> leq(X,Z))) # label(leq_trans) # label(axiom) # label(non_clause). [assumption]. % 0.44/1.02 10 (all X all A all B (in_closed(X,A,B) <-> leq(A,X) & leq(X,B))) # label(in_closed) # label(axiom) # label(non_clause). [assumption]. % 0.44/1.02 11 (all X all A all B (in_lopen(X,A,B) <-> less(A,X) & leq(X,B))) # label(in_lopen) # label(axiom) # label(non_clause). [assumption]. % 0.44/1.02 12 (all X all A all B (in_ropen(X,A,B) <-> leq(A,X) & less(X,B))) # label(in_ropen) # label(axiom) # label(non_clause). [assumption]. % 0.44/1.02 13 (all X all A all B (in_open(X,A,B) <-> less(A,X) & less(X,B))) # label(in_open) # label(axiom) # label(non_clause). [assumption]. % 0.44/1.02 14 (all I1lo all I1hi all I2lo all I2hi (axis_conflict(I1lo,I1hi,I2lo,I2hi) <-> -(exists X (in_closed(X,I1lo,I1hi) & in_closed(X,I2lo,I2hi))))) # label(axis_conflict_def) # label(axiom) # label(non_clause). [assumption]. % 0.44/1.02 15 (all I1lo all I1hi all I2lo all I2hi (axis_compatible(I1lo,I1hi,I2lo,I2hi) <-> (exists X (in_closed(X,I1lo,I1hi) & in_closed(X,I2lo,I2hi))))) # label(axis_compatible_def) # label(axiom) # label(non_clause). [assumption]. % 0.44/1.02 16 (all I1lo all I1hi all I2lo all I2hi (axis_subsumes(I1lo,I1hi,I2lo,I2hi) <-> (all X (in_closed(X,I1lo,I1hi) -> in_closed(X,I2lo,I2hi))))) # label(axis_subsumes_def) # label(axiom) # label(non_clause). [assumption]. % 0.44/1.02 17 (all V (is_verdict(V) -> V = conflict | V = compatible | V = unknown)) # label(verdict_enum) # label(axiom) # label(non_clause). [assumption]. % 0.44/1.02 18 (all V1 all V2 (is_verdict(V1) & is_verdict(V2) & (V1 = conflict | V2 = conflict) -> box_verdict(V1,V2) = conflict)) # label(box_conflict) # label(axiom) # label(non_clause). [assumption]. % 0.44/1.02 19 (all V1 all V2 (is_verdict(V1) & is_verdict(V2) & V1 = compatible & V2 = compatible -> box_verdict(V1,V2) = compatible)) # label(box_compatible) # label(axiom) # label(non_clause). [assumption]. % 0.44/1.02 20 (all V1 all V2 (is_verdict(V1) & is_verdict(V2) & (V1 = unknown | V2 = unknown) & V1 != conflict & V2 != conflict -> box_verdict(V1,V2) = unknown)) # label(box_unknown) # label(axiom) # label(non_clause). [assumption]. % 0.44/1.02 21 (all V1 all V2 (is_verdict(V1) & is_verdict(V2) -> box_verdict(V1,V2) = conflict | box_verdict(V1,V2) = compatible | box_verdict(V1,V2) = unknown)) # label(box_verdict_total) # label(axiom) # label(non_clause). [assumption]. % 0.44/1.02 22 --(exists X (in_open(X,v0,v600) & leq(v600,X))) # label(odrl302) # label(negated_conjecture) # label(non_clause). [assumption]. % 0.44/1.02 % 0.44/1.02 ============================== end of process non-clausal formulas === % 0.44/1.02 % 0.44/1.02 ============================== PROCESS INITIAL CLAUSES =============== % 0.44/1.02 % 0.44/1.02 ============================== PREDICATE ELIMINATION ================= % 0.44/1.02 23 -in_open(A,B,C) | less(B,A) # label(in_open) # label(axiom). [clausify(13)]. % 0.44/1.02 24 in_open(c1,v0,v600) # label(odrl302) # label(negated_conjecture). [clausify(22)]. % 0.44/1.02 Derived: less(v0,c1). [resolve(23,a,24,a)]. % 0.44/1.02 25 -in_open(A,B,C) | less(A,C) # label(in_open) # label(axiom). [clausify(13)]. % 0.44/1.02 Derived: less(c1,v600). [resolve(25,a,24,a)]. % 0.44/1.02 26 in_open(A,B,C) | -less(B,A) | -less(A,C) # label(in_open) # label(axiom). [clausify(13)]. % 0.44/1.02 27 -axis_conflict(A,B,C,D) | -in_closed(E,A,B) | -in_closed(E,C,D) # label(axis_conflict_def) # label(axiom). [clausify(14)]. % 0.44/1.02 28 axis_conflict(A,B,C,D) | in_closed(f1(A,B,C,D),A,B) # label(axis_conflict_def) # label(axiom). [clausify(14)]. % 0.44/1.02 29 axis_conflict(A,B,C,D) | in_closed(f1(A,B,C,D),C,D) # label(axis_conflict_def) # label(axiom). [clausify(14)]. % 0.44/1.02 Derived: -in_closed(A,B,C) | -in_closed(A,D,E) | in_closed(f1(B,C,D,E),B,C). [resolve(27,a,28,a)]. % 0.44/1.02 Derived: -in_closed(A,B,C) | -in_closed(A,D,E) | in_closed(f1(B,C,D,E),D,E). [resolve(27,a,29,a)]. % 0.44/1.02 30 -axis_subsumes(A,B,C,D) | -in_closed(E,A,B) | in_closed(E,C,D) # label(axis_subsumes_def) # label(axiom). [clausify(16)]. % 0.44/1.02 31 axis_subsumes(A,B,C,D) | in_closed(f3(A,B,C,D),A,B) # label(axis_subsumes_def) # label(axiom). [clausify(16)]. % 0.44/1.02 Derived: -in_closed(A,B,C) | in_closed(A,D,E) | in_closed(f3(B,C,D,E),B,C). [resolve(30,a,31,a)]. % 0.44/1.02 32 axis_subsumes(A,B,C,D) | -in_closed(f3(A,B,C,D),C,D) # label(axis_subsumes_def) # label(axiom). [clausify(16)]. % 0.44/1.02 Derived: -in_closed(f3(A,B,C,D),C,D) | -in_closed(E,A,B) | in_closed(E,C,D). [resolve(32,a,30,a)]. % 0.44/1.02 33 in_lopen(A,B,C) | -less(B,A) | -leq(A,C) # label(in_lopen) # label(axiom). [clausify(11)]. % 0.44/1.02 34 -in_lopen(A,B,C) | less(B,A) # label(in_lopen) # label(axiom). [clausify(11)]. % 0.44/1.02 35 -in_lopen(A,B,C) | leq(A,C) # label(in_lopen) # label(axiom). [clausify(11)]. % 0.44/1.02 36 in_ropen(A,B,C) | -leq(B,A) | -less(A,C) # label(in_ropen) # label(axiom). [clausify(12)]. % 0.44/1.02 37 -in_ropen(A,B,C) | leq(B,A) # label(in_ropen) # label(axiom). [clausify(12)]. % 0.44/1.02 38 -in_ropen(A,B,C) | less(A,C) # label(in_ropen) # label(axiom). [clausify(12)]. % 0.44/1.02 39 axis_compatible(A,B,C,D) | -in_closed(E,A,B) | -in_closed(E,C,D) # label(axis_compatible_def) # label(axiom). [clausify(15)]. % 0.44/1.02 40 -axis_compatible(A,B,C,D) | in_closed(f2(A,B,C,D),A,B) # label(axis_compatible_def) # label(axiom). [clausify(15)]. % 0.44/1.02 41 -axis_compatible(A,B,C,D) | in_closed(f2(A,B,C,D),C,D) # label(axis_compatible_def) # label(axiom). [clausify(15)]. % 0.44/1.02 Derived: -in_closed(A,B,C) | -in_closed(A,D,E) | in_closed(f2(B,C,D,E),B,C). [resolve(39,a,40,a)]. % 0.44/1.02 Derived: -in_closed(A,B,C) | -in_closed(A,D,E) | in_closed(f2(B,C,D,E),D,E). [resolve(39,a,41,a)]. % 0.44/1.02 % 0.44/1.02 ============================== end predicate elimination ============= % 0.44/1.02 % 0.44/1.02 Auto_denials: (non-Horn, no changes). % 0.44/1.02 % 0.44/1.02 Term ordering decisions: % 0.44/1.02 Function symbol KB weights: conflict=1. unknown=1. compatible=1. v600=1. v0=1. c1=1. box_verdict=1. f1=1. f2=1. f3=1. % 0.44/1.02 % 0.44/1.02 ============================== end of process initial clauses ======== % 0.44/1.02 % 0.44/1.02 ============================== CLAUSES FOR SEARCH ==================== % 0.44/1.02 % 0.44/1.02 ============================== end of clauses for search ============= % 0.44/1.02 % 0.44/1.02 ============================== SEARCH ================================ % 0.44/1.02 % 0.44/1.02 % Starting search at 0.01 seconds. % 0.44/1.02 % 0.44/1.02 ============================== PROOF ================================= % 0.44/1.02 % SZS status Theorem % 0.44/1.02 % SZS output start Refutation % 0.44/1.02 % 0.44/1.02 % Proof 1 at 0.01 (+ 0.00) seconds. % 0.44/1.02 % Length of proof is 11. % 0.44/1.02 % Level of proof is 3. % 0.44/1.02 % Maximum clause weight is 9.000. % 0.44/1.02 % Given clauses 18. % 0.44/1.02 % 0.44/1.02 1 (all X -less(X,X)) # label(irreflexive) # label(axiom) # label(non_clause). [assumption]. % 0.44/1.02 7 (all X all Y all Z (leq(X,Y) & less(Y,Z) -> less(X,Z))) # label(leq_less_trans) # label(axiom) # label(non_clause). [assumption]. % 0.44/1.02 13 (all X all A all B (in_open(X,A,B) <-> less(A,X) & less(X,B))) # label(in_open) # label(axiom) # label(non_clause). [assumption]. % 0.44/1.02 22 --(exists X (in_open(X,v0,v600) & leq(v600,X))) # label(odrl302) # label(negated_conjecture) # label(non_clause). [assumption]. % 0.44/1.02 24 in_open(c1,v0,v600) # label(odrl302) # label(negated_conjecture). [clausify(22)]. % 0.44/1.02 25 -in_open(A,B,C) | less(A,C) # label(in_open) # label(axiom). [clausify(13)]. % 0.44/1.02 46 leq(v600,c1) # label(odrl302) # label(negated_conjecture). [clausify(22)]. % 0.44/1.02 48 -less(A,A) # label(irreflexive) # label(axiom). [clausify(1)]. % 0.44/1.02 61 -leq(A,B) | -less(B,C) | less(A,C) # label(leq_less_trans) # label(axiom). [clausify(7)]. % 0.44/1.02 79 less(c1,v600). [resolve(25,a,24,a)]. % 0.44/1.02 111 $F. [ur(61,a,46,a,c,48,a),unit_del(a,79)]. % 0.44/1.02 % 0.44/1.02 % SZS output end Refutation % 0.44/1.02 ============================== end of proof ========================== % 0.44/1.02 % 0.44/1.02 ============================== STATISTICS ============================ % 0.44/1.02 % 0.44/1.02 Given=18. Generated=84. Kept=61. proofs=1. % 0.44/1.02 Usable=18. Sos=38. Demods=0. Limbo=4, Disabled=60. Hints=0. % 0.44/1.02 Megabytes=0.11. % 0.44/1.02 User_CPU=0.01, System_CPU=0.00, Wall_clock=0. % 0.44/1.02 % 0.44/1.02 ============================== end of statistics ===================== % 0.44/1.02 % 0.44/1.02 ============================== end of search ========================= % 0.44/1.02 % 0.44/1.02 THEOREM PROVED % 0.44/1.02 % SZS status Theorem % 0.44/1.02 % 0.44/1.02 Exiting with 1 proof. % 0.44/1.02 % 0.44/1.02 Process 24103 exit (max_proofs) Tue Apr 28 18:45:16 2026 % 0.44/1.02 Prover9 interrupted %------------------------------------------------------------------------------