TSTP Solution File: SET872+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SET872+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n019.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 04:33:05 EDT 2022
% Result : Theorem 0.94s 1.17s
% Output : Refutation 0.94s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SET872+1 : TPTP v8.1.0. Released v3.2.0.
% 0.14/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.34 % Computer : n019.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Sun Jul 10 14:07:53 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.47/0.99 ============================== Prover9 ===============================
% 0.47/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.47/0.99 Process 23778 was started by sandbox2 on n019.cluster.edu,
% 0.47/0.99 Sun Jul 10 14:07:54 2022
% 0.47/0.99 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_23624_n019.cluster.edu".
% 0.47/0.99 ============================== end of head ===========================
% 0.47/0.99
% 0.47/0.99 ============================== INPUT =================================
% 0.47/0.99
% 0.47/0.99 % Reading from file /tmp/Prover9_23624_n019.cluster.edu
% 0.47/0.99
% 0.47/0.99 set(prolog_style_variables).
% 0.47/0.99 set(auto2).
% 0.47/0.99 % set(auto2) -> set(auto).
% 0.47/0.99 % set(auto) -> set(auto_inference).
% 0.47/0.99 % set(auto) -> set(auto_setup).
% 0.47/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.47/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.47/0.99 % set(auto) -> set(auto_limits).
% 0.47/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.47/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.47/0.99 % set(auto) -> set(auto_denials).
% 0.47/0.99 % set(auto) -> set(auto_process).
% 0.47/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.47/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.47/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.47/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.47/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.47/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.47/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.47/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.47/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.47/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.47/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.47/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.47/0.99 % set(auto2) -> assign(stats, some).
% 0.47/0.99 % set(auto2) -> clear(echo_input).
% 0.47/0.99 % set(auto2) -> set(quiet).
% 0.47/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.47/0.99 % set(auto2) -> clear(print_given).
% 0.47/0.99 assign(lrs_ticks,-1).
% 0.47/0.99 assign(sos_limit,10000).
% 0.47/0.99 assign(order,kbo).
% 0.47/0.99 set(lex_order_vars).
% 0.47/0.99 clear(print_given).
% 0.47/0.99
% 0.47/0.99 % formulas(sos). % not echoed (9 formulas)
% 0.47/0.99
% 0.47/0.99 ============================== end of input ==========================
% 0.47/0.99
% 0.47/0.99 % From the command line: assign(max_seconds, 300).
% 0.47/0.99
% 0.47/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.47/0.99
% 0.47/0.99 % Formulas that are not ordinary clauses:
% 0.47/0.99 1 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause). [assumption].
% 0.47/0.99 2 (all A all B unordered_pair(A,B) = unordered_pair(B,A)) # label(commutativity_k2_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.47/0.99 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.47/0.99 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.47/0.99 5 (all A all B (subset(A,B) <-> (all C (in(C,A) -> in(C,B))))) # label(d3_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.47/0.99 6 (exists A empty(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.47/0.99 7 (exists A -empty(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.47/0.99 8 (all A all B subset(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.47/0.99 9 -(all A all B subset(singleton(A),unordered_pair(A,B))) # label(t12_zfmisc_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.47/0.99
% 0.47/0.99 ============================== end of process non-clausal formulas ===
% 0.47/0.99
% 0.47/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.47/0.99
% 0.47/0.99 ============================== PREDICATE ELIMINATION =================
% 0.47/0.99
% 0.47/0.99 ============================== end predicate elimination =============
% 0.47/0.99
% 0.47/0.99 Auto_denials: (non-Horn, no changes).
% 0.47/0.99
% 0.47/0.99 Term ordering decisions:
% 0.47/0.99
% 0.47/0.99 % Assigning unary symbol singleton kb_weight 0 and highest precedence (13).
% 0.47/0.99 Function symbol KB weights: c1=1. c2=1. c3=1. c4=1. unordered_pair=1. f1=1. f3=1. f2=1. singleton=0.
% 0.47/0.99
% 0.47/0.99 ============================== end of process initial clauses ========
% 0.47/0.99
% 0.47/0.99 ============================== CLAUSES FOR SEARCH ====================
% 0.47/0.99
% 0.47/0.99 ============================== end of clauses for search =============
% 0.47/0.99
% 0.47/0.99 ============================== SEARCH ================================
% 0.47/0.99
% 0.47/0.99 % Starting search at 0.01 seconds.
% 0.94/1.17
% 0.94/1.17 ============================== PROOF =================================
% 0.94/1.17 % SZS status Theorem
% 0.94/1.17 % SZS output start Refutation
% 0.94/1.17
% 0.94/1.17 % Proof 1 at 0.18 (+ 0.01) seconds.
% 0.94/1.17 % Length of proof is 15.
% 0.94/1.17 % Level of proof is 4.
% 0.94/1.17 % Maximum clause weight is 13.000.
% 0.94/1.17 % Given clauses 102.
% 0.94/1.17
% 0.94/1.17 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.94/1.17 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.94/1.17 5 (all A all B (subset(A,B) <-> (all C (in(C,A) -> in(C,B))))) # label(d3_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.94/1.17 9 -(all A all B subset(singleton(A),unordered_pair(A,B))) # label(t12_zfmisc_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.94/1.17 13 subset(A,B) | in(f3(A,B),A) # label(d3_tarski) # label(axiom). [clausify(5)].
% 0.94/1.17 18 -subset(singleton(c3),unordered_pair(c3,c4)) # label(t12_zfmisc_1) # label(negated_conjecture). [clausify(9)].
% 0.94/1.17 19 subset(A,B) | -in(f3(A,B),B) # label(d3_tarski) # label(axiom). [clausify(5)].
% 0.94/1.17 21 singleton(A) != B | -in(C,B) | C = A # label(d1_tarski) # label(axiom). [clausify(3)].
% 0.94/1.17 23 unordered_pair(A,B) != C | in(D,C) | D != A # label(d2_tarski) # label(axiom). [clausify(4)].
% 0.94/1.17 38 in(f3(singleton(c3),unordered_pair(c3,c4)),singleton(c3)). [resolve(18,a,13,a)].
% 0.94/1.17 39 -in(f3(singleton(c3),unordered_pair(c3,c4)),unordered_pair(c3,c4)). [ur(19,a,18,a)].
% 0.94/1.17 51 in(A,unordered_pair(B,C)) | A != B. [xx_res(23,a)].
% 0.94/1.17 209 singleton(c3) != singleton(A) | f3(singleton(c3),unordered_pair(c3,c4)) = A. [resolve(38,a,21,b),flip(a)].
% 0.94/1.17 224 f3(singleton(c3),unordered_pair(c3,c4)) != c3. [ur(51,a,39,a)].
% 0.94/1.17 1256 $F. [xx_res(209,a),unit_del(a,224)].
% 0.94/1.17
% 0.94/1.17 % SZS output end Refutation
% 0.94/1.17 ============================== end of proof ==========================
% 0.94/1.17
% 0.94/1.17 ============================== STATISTICS ============================
% 0.94/1.17
% 0.94/1.17 Given=102. Generated=6135. Kept=1246. proofs=1.
% 0.94/1.17 Usable=99. Sos=1011. Demods=2. Limbo=0, Disabled=155. Hints=0.
% 0.94/1.17 Megabytes=1.01.
% 0.94/1.17 User_CPU=0.18, System_CPU=0.01, Wall_clock=0.
% 0.94/1.17
% 0.94/1.17 ============================== end of statistics =====================
% 0.94/1.17
% 0.94/1.17 ============================== end of search =========================
% 0.94/1.17
% 0.94/1.17 THEOREM PROVED
% 0.94/1.17 % SZS status Theorem
% 0.94/1.17
% 0.94/1.17 Exiting with 1 proof.
% 0.94/1.17
% 0.94/1.17 Process 23778 exit (max_proofs) Sun Jul 10 14:07:54 2022
% 0.94/1.17 Prover9 interrupted
%------------------------------------------------------------------------------