TSTP Solution File: SET958+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SET958+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n027.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:41 EDT 2022
% Result : Theorem 0.75s 1.02s
% Output : Refutation 0.75s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : SET958+1 : TPTP v8.1.0. Released v3.2.0.
% 0.08/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.35 % Computer : n027.cluster.edu
% 0.14/0.35 % Model : x86_64 x86_64
% 0.14/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35 % Memory : 8042.1875MB
% 0.14/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35 % CPULimit : 300
% 0.14/0.35 % WCLimit : 600
% 0.14/0.35 % DateTime : Mon Jul 11 08:20:33 EDT 2022
% 0.14/0.35 % CPUTime :
% 0.75/1.02 ============================== Prover9 ===============================
% 0.75/1.02 Prover9 (32) version 2009-11A, November 2009.
% 0.75/1.02 Process 29383 was started by sandbox on n027.cluster.edu,
% 0.75/1.02 Mon Jul 11 08:20:34 2022
% 0.75/1.02 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_29230_n027.cluster.edu".
% 0.75/1.02 ============================== end of head ===========================
% 0.75/1.02
% 0.75/1.02 ============================== INPUT =================================
% 0.75/1.02
% 0.75/1.02 % Reading from file /tmp/Prover9_29230_n027.cluster.edu
% 0.75/1.02
% 0.75/1.02 set(prolog_style_variables).
% 0.75/1.02 set(auto2).
% 0.75/1.02 % set(auto2) -> set(auto).
% 0.75/1.02 % set(auto) -> set(auto_inference).
% 0.75/1.02 % set(auto) -> set(auto_setup).
% 0.75/1.02 % set(auto_setup) -> set(predicate_elim).
% 0.75/1.02 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.75/1.02 % set(auto) -> set(auto_limits).
% 0.75/1.02 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.75/1.02 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.75/1.02 % set(auto) -> set(auto_denials).
% 0.75/1.02 % set(auto) -> set(auto_process).
% 0.75/1.02 % set(auto2) -> assign(new_constants, 1).
% 0.75/1.02 % set(auto2) -> assign(fold_denial_max, 3).
% 0.75/1.02 % set(auto2) -> assign(max_weight, "200.000").
% 0.75/1.02 % set(auto2) -> assign(max_hours, 1).
% 0.75/1.02 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.75/1.02 % set(auto2) -> assign(max_seconds, 0).
% 0.75/1.02 % set(auto2) -> assign(max_minutes, 5).
% 0.75/1.02 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.75/1.02 % set(auto2) -> set(sort_initial_sos).
% 0.75/1.02 % set(auto2) -> assign(sos_limit, -1).
% 0.75/1.02 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.75/1.02 % set(auto2) -> assign(max_megs, 400).
% 0.75/1.02 % set(auto2) -> assign(stats, some).
% 0.75/1.02 % set(auto2) -> clear(echo_input).
% 0.75/1.02 % set(auto2) -> set(quiet).
% 0.75/1.02 % set(auto2) -> clear(print_initial_clauses).
% 0.75/1.02 % set(auto2) -> clear(print_given).
% 0.75/1.02 assign(lrs_ticks,-1).
% 0.75/1.02 assign(sos_limit,10000).
% 0.75/1.02 assign(order,kbo).
% 0.75/1.02 set(lex_order_vars).
% 0.75/1.02 clear(print_given).
% 0.75/1.02
% 0.75/1.02 % formulas(sos). % not echoed (9 formulas)
% 0.75/1.02
% 0.75/1.02 ============================== end of input ==========================
% 0.75/1.02
% 0.75/1.02 % From the command line: assign(max_seconds, 300).
% 0.75/1.02
% 0.75/1.02 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.75/1.02
% 0.75/1.02 % Formulas that are not ordinary clauses:
% 0.75/1.02 1 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.02 2 (all A all B unordered_pair(A,B) = unordered_pair(B,A)) # label(commutativity_k2_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.02 3 (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.75/1.02 4 (all A all B ordered_pair(A,B) = unordered_pair(unordered_pair(A,B),singleton(A))) # label(d5_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.02 5 (all A all B -empty(ordered_pair(A,B))) # label(fc1_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.02 6 (exists A empty(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.02 7 (exists A -empty(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.02 8 (all A all B subset(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.02 9 -(all A all B ((all C -(in(C,A) & (all D all E C != ordered_pair(D,E)))) & (all C all D (in(ordered_pair(C,D),A) -> in(ordered_pair(C,D),B))) -> subset(A,B))) # label(t111_zfmisc_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.75/1.02
% 0.75/1.02 ============================== end of process non-clausal formulas ===
% 0.75/1.02
% 0.75/1.02 ============================== PROCESS INITIAL CLAUSES ===============
% 0.75/1.02
% 0.75/1.02 ============================== PREDICATE ELIMINATION =================
% 0.75/1.02
% 0.75/1.02 ============================== end predicate elimination =============
% 0.75/1.02
% 0.75/1.02 Auto_denials: (non-Horn, no changes).
% 0.75/1.02
% 0.75/1.02 Term ordering decisions:
% 0.75/1.02 Function symbol KB weights: c1=1. c2=1. c3=1. c4=1. ordered_pair=1. unordered_pair=1. f1=1. singleton=1. f2=1. f3=1.
% 0.75/1.02
% 0.75/1.02 ============================== end of process initial clauses ========
% 0.75/1.02
% 0.75/1.02 ============================== CLAUSES FOR SEARCH ====================
% 0.75/1.02
% 0.75/1.02 ============================== end of clauses for search =============
% 0.75/1.02
% 0.75/1.02 ============================== SEARCH ================================
% 0.75/1.02
% 0.75/1.02 % Starting search at 0.01 seconds.
% 0.75/1.02
% 0.75/1.02 ============================== PROOF =================================
% 0.75/1.02 % SZS status Theorem
% 0.75/1.02 % SZS output start Refutation
% 0.75/1.02
% 0.75/1.02 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.75/1.02 % Length of proof is 18.
% 0.75/1.02 % Level of proof is 5.
% 0.75/1.02 % Maximum clause weight is 19.000.
% 0.75/1.02 % Given clauses 24.
% 0.75/1.02
% 0.75/1.02 2 (all A all B unordered_pair(A,B) = unordered_pair(B,A)) # label(commutativity_k2_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.02 3 (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.75/1.02 4 (all A all B ordered_pair(A,B) = unordered_pair(unordered_pair(A,B),singleton(A))) # label(d5_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.75/1.02 9 -(all A all B ((all C -(in(C,A) & (all D all E C != ordered_pair(D,E)))) & (all C all D (in(ordered_pair(C,D),A) -> in(ordered_pair(C,D),B))) -> subset(A,B))) # label(t111_zfmisc_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.75/1.02 12 unordered_pair(A,B) = unordered_pair(B,A) # label(commutativity_k2_tarski) # label(axiom). [clausify(2)].
% 0.75/1.02 13 subset(A,B) | in(f1(A,B),A) # label(d3_tarski) # label(axiom). [clausify(3)].
% 0.75/1.02 14 ordered_pair(A,B) = unordered_pair(unordered_pair(A,B),singleton(A)) # label(d5_tarski) # label(axiom). [clausify(4)].
% 0.75/1.02 15 ordered_pair(A,B) = unordered_pair(singleton(A),unordered_pair(A,B)). [copy(14),rewrite([12(4)])].
% 0.75/1.02 17 -subset(c3,c4) # label(t111_zfmisc_1) # label(negated_conjecture). [clausify(9)].
% 0.75/1.02 21 subset(A,B) | -in(f1(A,B),B) # label(d3_tarski) # label(axiom). [clausify(3)].
% 0.75/1.02 23 -in(A,c3) | ordered_pair(f2(A),f3(A)) = A # label(t111_zfmisc_1) # label(negated_conjecture). [clausify(9)].
% 0.75/1.02 24 -in(A,c3) | unordered_pair(singleton(f2(A)),unordered_pair(f2(A),f3(A))) = A. [copy(23),rewrite([15(5)])].
% 0.75/1.02 25 -in(ordered_pair(A,B),c3) | in(ordered_pair(A,B),c4) # label(t111_zfmisc_1) # label(negated_conjecture). [clausify(9)].
% 0.75/1.02 26 -in(unordered_pair(singleton(A),unordered_pair(A,B)),c3) | in(unordered_pair(singleton(A),unordered_pair(A,B)),c4). [copy(25),rewrite([15(1),15(6)])].
% 0.75/1.02 28 in(f1(c3,c4),c3). [resolve(17,a,13,a)].
% 0.75/1.02 29 -in(f1(c3,c4),c4). [ur(21,a,17,a)].
% 0.75/1.02 31 unordered_pair(singleton(f2(f1(c3,c4))),unordered_pair(f2(f1(c3,c4)),f3(f1(c3,c4)))) = f1(c3,c4). [resolve(28,a,24,a)].
% 0.75/1.02 49 $F. [para(31(a,1),26(a,1)),rewrite([31(20)]),unit_del(a,28),unit_del(b,29)].
% 0.75/1.02
% 0.75/1.02 % SZS output end Refutation
% 0.75/1.02 ============================== end of proof ==========================
% 0.75/1.02
% 0.75/1.02 ============================== STATISTICS ============================
% 0.75/1.02
% 0.75/1.02 Given=24. Generated=78. Kept=35. proofs=1.
% 0.75/1.02 Usable=24. Sos=8. Demods=4. Limbo=3, Disabled=13. Hints=0.
% 0.75/1.02 Megabytes=0.08.
% 0.75/1.02 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.75/1.02
% 0.75/1.02 ============================== end of statistics =====================
% 0.75/1.02
% 0.75/1.02 ============================== end of search =========================
% 0.75/1.02
% 0.75/1.02 THEOREM PROVED
% 0.75/1.02 % SZS status Theorem
% 0.75/1.02
% 0.75/1.02 Exiting with 1 proof.
% 0.75/1.02
% 0.75/1.02 Process 29383 exit (max_proofs) Mon Jul 11 08:20:34 2022
% 0.75/1.02 Prover9 interrupted
%------------------------------------------------------------------------------