TSTP Solution File: SYN013-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SYN013-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n012.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 : Thu Jul 21 11:15:27 EDT 2022
% Result : Unsatisfiable 0.77s 1.05s
% Output : Refutation 0.77s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14 % Problem : SYN013-1 : TPTP v8.1.0. Released v1.0.0.
% 0.04/0.15 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.36 % Computer : n012.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Mon Jul 11 17:10:58 EDT 2022
% 0.14/0.37 % CPUTime :
% 0.77/1.05 ============================== Prover9 ===============================
% 0.77/1.05 Prover9 (32) version 2009-11A, November 2009.
% 0.77/1.05 Process 20984 was started by sandbox on n012.cluster.edu,
% 0.77/1.05 Mon Jul 11 17:10:58 2022
% 0.77/1.05 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_20830_n012.cluster.edu".
% 0.77/1.05 ============================== end of head ===========================
% 0.77/1.05
% 0.77/1.05 ============================== INPUT =================================
% 0.77/1.05
% 0.77/1.05 % Reading from file /tmp/Prover9_20830_n012.cluster.edu
% 0.77/1.05
% 0.77/1.05 set(prolog_style_variables).
% 0.77/1.05 set(auto2).
% 0.77/1.05 % set(auto2) -> set(auto).
% 0.77/1.05 % set(auto) -> set(auto_inference).
% 0.77/1.05 % set(auto) -> set(auto_setup).
% 0.77/1.05 % set(auto_setup) -> set(predicate_elim).
% 0.77/1.05 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.77/1.05 % set(auto) -> set(auto_limits).
% 0.77/1.05 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.77/1.05 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.77/1.05 % set(auto) -> set(auto_denials).
% 0.77/1.05 % set(auto) -> set(auto_process).
% 0.77/1.05 % set(auto2) -> assign(new_constants, 1).
% 0.77/1.05 % set(auto2) -> assign(fold_denial_max, 3).
% 0.77/1.05 % set(auto2) -> assign(max_weight, "200.000").
% 0.77/1.05 % set(auto2) -> assign(max_hours, 1).
% 0.77/1.05 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.77/1.05 % set(auto2) -> assign(max_seconds, 0).
% 0.77/1.05 % set(auto2) -> assign(max_minutes, 5).
% 0.77/1.05 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.77/1.05 % set(auto2) -> set(sort_initial_sos).
% 0.77/1.05 % set(auto2) -> assign(sos_limit, -1).
% 0.77/1.05 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.77/1.05 % set(auto2) -> assign(max_megs, 400).
% 0.77/1.05 % set(auto2) -> assign(stats, some).
% 0.77/1.05 % set(auto2) -> clear(echo_input).
% 0.77/1.05 % set(auto2) -> set(quiet).
% 0.77/1.05 % set(auto2) -> clear(print_initial_clauses).
% 0.77/1.05 % set(auto2) -> clear(print_given).
% 0.77/1.05 assign(lrs_ticks,-1).
% 0.77/1.05 assign(sos_limit,10000).
% 0.77/1.05 assign(order,kbo).
% 0.77/1.05 set(lex_order_vars).
% 0.77/1.05 clear(print_given).
% 0.77/1.05
% 0.77/1.05 % formulas(sos). % not echoed (16 formulas)
% 0.77/1.05
% 0.77/1.05 ============================== end of input ==========================
% 0.77/1.05
% 0.77/1.05 % From the command line: assign(max_seconds, 300).
% 0.77/1.05
% 0.77/1.05 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.77/1.05
% 0.77/1.05 % Formulas that are not ordinary clauses:
% 0.77/1.05
% 0.77/1.05 ============================== end of process non-clausal formulas ===
% 0.77/1.05
% 0.77/1.05 ============================== PROCESS INITIAL CLAUSES ===============
% 0.77/1.05
% 0.77/1.05 ============================== PREDICATE ELIMINATION =================
% 0.77/1.05
% 0.77/1.05 ============================== end predicate elimination =============
% 0.77/1.05
% 0.77/1.05 Auto_denials: (non-Horn, no changes).
% 0.77/1.05
% 0.77/1.05 Term ordering decisions:
% 0.77/1.05 Function symbol KB weights: m=1. n=1. k=1. f=1. g=1.
% 0.77/1.05
% 0.77/1.05 ============================== end of process initial clauses ========
% 0.77/1.05
% 0.77/1.05 ============================== CLAUSES FOR SEARCH ====================
% 0.77/1.05
% 0.77/1.05 ============================== end of clauses for search =============
% 0.77/1.05
% 0.77/1.05 ============================== SEARCH ================================
% 0.77/1.05
% 0.77/1.05 % Starting search at 0.01 seconds.
% 0.77/1.05
% 0.77/1.05 ============================== PROOF =================================
% 0.77/1.05 % SZS status Unsatisfiable
% 0.77/1.05 % SZS output start Refutation
% 0.77/1.05
% 0.77/1.05 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.77/1.05 % Length of proof is 56.
% 0.77/1.05 % Level of proof is 16.
% 0.77/1.05 % Maximum clause weight is 18.000.
% 0.77/1.05 % Given clauses 48.
% 0.77/1.05
% 0.77/1.05 1 A = n | element(A,n) | element(A,g(A)) # label(c_11) # label(negated_conjecture). [assumption].
% 0.77/1.05 2 n = A | element(A,n) | element(A,g(A)). [copy(1),flip(a)].
% 0.77/1.05 3 A = n | element(A,n) | element(g(A),A) # label(c_12) # label(negated_conjecture). [assumption].
% 0.77/1.05 4 n = A | element(A,n) | element(g(A),A). [copy(3),flip(a)].
% 0.77/1.05 5 m != n # label(c_1) # label(negated_conjecture). [assumption].
% 0.77/1.05 6 n != m. [copy(5),flip(a)].
% 0.77/1.05 7 n != k # label(c_2) # label(negated_conjecture). [assumption].
% 0.77/1.05 8 k != n. [copy(7),flip(a)].
% 0.77/1.05 9 k != m # label(c_3) # label(negated_conjecture). [assumption].
% 0.77/1.05 10 A = k | A != m | element(A,k) # label(c_14) # label(negated_conjecture). [assumption].
% 0.77/1.05 11 k = A | m != A | element(A,k). [copy(10),flip(a),flip(b)].
% 0.77/1.05 12 A = k | A != n | element(A,k) # label(c_15) # label(negated_conjecture). [assumption].
% 0.77/1.05 13 k = A | n != A | element(A,k). [copy(12),flip(a),flip(b)].
% 0.77/1.05 14 A = m | -element(A,m) | f(A) != m # label(c_4) # label(negated_conjecture). [assumption].
% 0.77/1.06 15 m = A | -element(A,m) | f(A) != m. [copy(14),flip(a)].
% 0.77/1.06 16 A = m | -element(A,m) | f(A) != A # label(c_5) # label(negated_conjecture). [assumption].
% 0.77/1.06 17 m = A | -element(A,m) | f(A) != A. [copy(16),flip(a)].
% 0.77/1.06 18 A = m | -element(A,m) | element(A,f(A)) # label(c_6) # label(negated_conjecture). [assumption].
% 0.77/1.06 19 m = A | -element(A,m) | element(A,f(A)). [copy(18),flip(a)].
% 0.77/1.06 20 A = m | -element(A,m) | element(f(A),A) # label(c_7) # label(negated_conjecture). [assumption].
% 0.77/1.06 21 m = A | -element(A,m) | element(f(A),A). [copy(20),flip(a)].
% 0.77/1.06 22 A = n | element(A,n) | g(A) != n # label(c_9) # label(negated_conjecture). [assumption].
% 0.77/1.06 23 n = A | element(A,n) | g(A) != n. [copy(22),flip(a)].
% 0.77/1.06 24 A = n | element(A,n) | g(A) != A # label(c_10) # label(negated_conjecture). [assumption].
% 0.77/1.06 25 n = A | element(A,n) | g(A) != A. [copy(24),flip(a)].
% 0.77/1.06 26 A = k | A = m | A = n | -element(A,k) # label(c_16) # label(negated_conjecture). [assumption].
% 0.77/1.06 27 k = A | m = A | n = A | -element(A,k). [copy(26),flip(a),flip(b),flip(c)].
% 0.77/1.06 28 A = m | element(A,m) | B = m | B = A | -element(A,B) | -element(B,A) # label(c_8) # label(negated_conjecture). [assumption].
% 0.77/1.06 29 m = A | element(A,m) | m = B | B = A | -element(A,B) | -element(B,A). [copy(28),flip(a),flip(c)].
% 0.77/1.06 30 A = n | -element(A,n) | B = n | B = A | -element(A,B) | -element(B,A) # label(c_13) # label(negated_conjecture). [assumption].
% 0.77/1.06 31 n = A | -element(A,n) | n = B | B = A | -element(A,B) | -element(B,A). [copy(30),flip(a),flip(c)].
% 0.77/1.06 32 element(m,k). [xx_res(11,b),unit_del(a,9)].
% 0.77/1.06 33 element(n,k). [xx_res(13,b),unit_del(a,8)].
% 0.77/1.06 38 g(k) = k | g(k) = m | g(k) = n | element(k,n). [resolve(27,d,4,c),flip(a),flip(b),flip(c),flip(d),unit_del(d,8)].
% 0.77/1.06 45 -element(k,n) | -element(k,m). [resolve(32,a,31,f),flip(a),flip(d),unit_del(a,8),unit_del(c,6),unit_del(d,9)].
% 0.77/1.06 47 element(k,m) | -element(k,n). [resolve(33,a,29,f),flip(a),flip(c),flip(d),unit_del(a,9),unit_del(c,6),unit_del(d,8)].
% 0.77/1.06 58 g(k) = k | g(k) = m | g(k) = n | element(k,m). [resolve(38,d,47,b)].
% 0.77/1.06 59 g(k) = k | g(k) = m | g(k) = n | -element(k,m). [resolve(38,d,45,a)].
% 0.77/1.06 72 g(k) = k | g(k) = m | g(k) = n. [resolve(59,d,58,d),merge(d),merge(e),merge(f)].
% 0.77/1.06 73 g(k) = m | g(k) = n | element(k,n). [resolve(72,a,25,c),flip(c),unit_del(c,8)].
% 0.77/1.06 75 g(k) = m | g(k) = n | element(k,m). [resolve(73,c,47,b)].
% 0.77/1.06 76 g(k) = m | g(k) = n | -element(k,m). [resolve(73,c,45,a)].
% 0.77/1.06 89 g(k) = m | g(k) = n. [resolve(76,c,75,c),merge(c),merge(d)].
% 0.77/1.06 90 g(k) = m | element(k,n). [resolve(89,b,23,c),flip(b),unit_del(b,8)].
% 0.77/1.06 94 g(k) = m | element(k,m). [resolve(90,b,47,b)].
% 0.77/1.06 95 g(k) = m | -element(k,m). [resolve(90,b,45,a)].
% 0.77/1.06 107 g(k) = m. [resolve(95,b,94,b),merge(b)].
% 0.77/1.06 109 element(k,n) | element(k,m). [para(107(a,1),2(c,2)),flip(a),unit_del(a,8)].
% 0.77/1.06 111 element(k,m). [resolve(109,a,47,b),merge(b)].
% 0.77/1.06 113 -element(k,n). [back_unit_del(45),unit_del(b,111)].
% 0.77/1.06 125 element(f(k),k). [resolve(111,a,21,b),flip(a),unit_del(a,9)].
% 0.77/1.06 126 element(k,f(k)). [resolve(111,a,19,b),flip(a),unit_del(a,9)].
% 0.77/1.06 127 f(k) != k. [resolve(111,a,17,b),flip(a),unit_del(a,9)].
% 0.77/1.06 128 f(k) != m. [resolve(111,a,15,b),flip(a),unit_del(a,9)].
% 0.77/1.06 131 f(k) = n. [resolve(125,a,27,d),flip(a),flip(b),flip(c),unit_del(a,127),unit_del(b,128)].
% 0.77/1.06 133 $F. [back_rewrite(126),rewrite([131(3)]),unit_del(a,113)].
% 0.77/1.06
% 0.77/1.06 % SZS output end Refutation
% 0.77/1.06 ============================== end of proof ==========================
% 0.77/1.06
% 0.77/1.06 ============================== STATISTICS ============================
% 0.77/1.06
% 0.77/1.06 Given=48. Generated=220. Kept=117. proofs=1.
% 0.77/1.06 Usable=21. Sos=16. Demods=2. Limbo=2, Disabled=94. Hints=0.
% 0.77/1.06 Megabytes=0.11.
% 0.77/1.06 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.77/1.06
% 0.77/1.06 ============================== end of statistics =====================
% 0.77/1.06
% 0.77/1.06 ============================== end of search =========================
% 0.77/1.06
% 0.77/1.06 THEOREM PROVED
% 0.77/1.06 % SZS status Unsatisfiable
% 0.77/1.06
% 0.77/1.06 Exiting with 1 proof.
% 0.77/1.06
% 0.77/1.06 Process 20984 exit (max_proofs) Mon Jul 11 17:10:58 2022
% 0.77/1.06 Prover9 interrupted
%------------------------------------------------------------------------------