TSTP Solution File: SEU142+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SEU142+1 : TPTP v8.1.0. Released v3.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 : 600s
% DateTime : Tue Jul 19 13:29:17 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.06/0.12 % Problem : SEU142+1 : TPTP v8.1.0. Released v3.3.0.
% 0.06/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n018.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jun 20 09:44:35 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.83/1.11 ============================== Prover9 ===============================
% 0.83/1.11 Prover9 (32) version 2009-11A, November 2009.
% 0.83/1.11 Process 31139 was started by sandbox on n018.cluster.edu,
% 0.83/1.11 Mon Jun 20 09:44:36 2022
% 0.83/1.11 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_30913_n018.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_30913_n018.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 (8 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 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.11 2 (all A all B unordered_pair(A,B) = unordered_pair(B,A)) # label(commutativity_k2_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.11 3 (all A all B (B = singleton(A) <-> (all C (in(C,B) <-> C = A)))) # label(d1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.11 4 (all A all B all C (C = unordered_pair(A,B) <-> (all D (in(D,C) <-> D = A | D = B)))) # label(d2_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.11 5 $T # label(dt_k1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.11 6 $T # label(dt_k2_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.11 7 (all A all B ((all C (in(C,A) <-> in(C,B))) -> A = B)) # label(t2_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.11 8 -(all A unordered_pair(A,A) = singleton(A)) # label(t69_enumset1) # 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
% 0.83/1.11 ============================== end predicate elimination =============
% 0.83/1.11
% 0.83/1.11 Auto_denials: (non-Horn, no changes).
% 0.83/1.11
% 0.83/1.11 Term ordering decisions:
% 0.83/1.11
% 0.83/1.11 % Assigning unary symbol singleton kb_weight 0 and highest precedence (8).
% 0.83/1.11 Function symbol KB weights: c1=1. unordered_pair=1. f1=1. f3=1. f2=1. singleton=0.
% 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 ============================== 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.12 (+ 0.01) seconds.
% 0.83/1.11 % Length of proof is 25.
% 0.83/1.11 % Level of proof is 9.
% 0.83/1.11 % Maximum clause weight is 27.000.
% 0.83/1.11 % Given clauses 99.
% 0.83/1.11
% 0.83/1.11 3 (all A all B (B = singleton(A) <-> (all C (in(C,B) <-> C = A)))) # label(d1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.11 4 (all A all B all C (C = unordered_pair(A,B) <-> (all D (in(D,C) <-> D = A | D = B)))) # label(d2_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.11 8 -(all A unordered_pair(A,A) = singleton(A)) # label(t69_enumset1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.83/1.11 12 unordered_pair(A,B) = C | in(f2(A,B,C),C) | f2(A,B,C) = A | f2(A,B,C) = B # label(d2_tarski) # label(axiom). [clausify(4)].
% 0.83/1.11 14 singleton(c1) != unordered_pair(c1,c1) # label(t69_enumset1) # label(negated_conjecture). [clausify(8)].
% 0.83/1.11 15 unordered_pair(c1,c1) != singleton(c1). [copy(14),flip(a)].
% 0.83/1.11 16 singleton(A) != B | -in(C,B) | C = A # label(d1_tarski) # label(axiom). [clausify(3)].
% 0.83/1.11 17 singleton(A) != B | in(C,B) | C != A # label(d1_tarski) # label(axiom). [clausify(3)].
% 0.83/1.11 19 unordered_pair(A,B) != C | in(D,C) | D != B # label(d2_tarski) # label(axiom). [clausify(4)].
% 0.83/1.11 22 unordered_pair(A,B) != C | -in(D,C) | D = A | D = B # label(d2_tarski) # label(axiom). [clausify(4)].
% 0.83/1.11 23 unordered_pair(A,B) = C | -in(f2(A,B,C),C) | f2(A,B,C) != A # label(d2_tarski) # label(axiom). [clausify(4)].
% 0.83/1.11 27 unordered_pair(c1,c1) = c_0. [new_symbol(15)].
% 0.83/1.11 31 unordered_pair(A,A) != B | -in(C,B) | C = A. [factor(22,c,d)].
% 0.83/1.11 32 singleton(c1) != c_0. [back_rewrite(15),rewrite([27(3)]),flip(a)].
% 0.83/1.11 38 singleton(A) != B | f2(C,D,B) = A | unordered_pair(C,D) = B | f2(C,D,B) = C | f2(C,D,B) = D. [resolve(16,b,12,b)].
% 0.83/1.11 46 in(A,singleton(B)) | A != B. [xx_res(17,a)].
% 0.83/1.11 80 in(A,c_0) | c1 != A. [resolve(27,a,19,a),flip(b)].
% 0.83/1.11 113 in(A,singleton(A)). [xx_res(46,b)].
% 0.83/1.11 410 f2(A,B,singleton(C)) = C | singleton(C) = unordered_pair(A,B) | f2(A,B,singleton(C)) = A | f2(A,B,singleton(C)) = B. [xx_res(38,a),flip(b)].
% 0.83/1.11 411 f2(A,B,singleton(A)) = A | unordered_pair(A,B) = singleton(A) | f2(A,B,singleton(A)) = B. [factor(410,a,c),flip(b)].
% 0.83/1.11 414 f2(A,A,singleton(A)) = A | unordered_pair(A,A) = singleton(A). [factor(411,a,c)].
% 0.83/1.11 478 in(f2(c1,c1,singleton(c1)),c_0). [resolve(414,a,80,b(flip)),rewrite([27(3)]),flip(a),unit_del(a,32)].
% 0.83/1.11 497 unordered_pair(A,A) != c_0 | f2(c1,c1,singleton(c1)) = A. [resolve(478,a,31,b)].
% 0.83/1.11 745 f2(c1,c1,singleton(c1)) = c1. [resolve(497,a,27,a)].
% 0.83/1.11 747 $F. [para(745(a,1),23(b,1)),rewrite([27(3),745(13)]),flip(a),xx(c),unit_del(a,32),unit_del(b,113)].
% 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 ============================== STATISTICS ============================
% 0.83/1.11
% 0.83/1.11 Given=99. Generated=4686. Kept=737. proofs=1.
% 0.83/1.11 Usable=91. Sos=545. Demods=3. Limbo=1, Disabled=115. Hints=0.
% 0.83/1.11 Megabytes=0.52.
% 0.83/1.11 User_CPU=0.12, System_CPU=0.01, 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 THEOREM PROVED
% 0.83/1.11 % SZS status Theorem
% 0.83/1.11
% 0.83/1.11 Exiting with 1 proof.
% 0.83/1.11
% 0.83/1.11 Process 31139 exit (max_proofs) Mon Jun 20 09:44:36 2022
% 0.83/1.11 Prover9 interrupted
%------------------------------------------------------------------------------