TSTP Solution File: SEU320+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SEU320+1 : TPTP v8.1.0. Released v3.3.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 13:30:56 EDT 2022
% Result : Theorem 0.71s 0.99s
% Output : Refutation 0.71s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SEU320+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.34 % Computer : n027.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jun 20 11:31:55 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.71/0.99 ============================== Prover9 ===============================
% 0.71/0.99 Prover9 (32) version 2009-11A, November 2009.
% 0.71/0.99 Process 14226 was started by sandbox on n027.cluster.edu,
% 0.71/0.99 Mon Jun 20 11:31:55 2022
% 0.71/0.99 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_13775_n027.cluster.edu".
% 0.71/0.99 ============================== end of head ===========================
% 0.71/0.99
% 0.71/0.99 ============================== INPUT =================================
% 0.71/0.99
% 0.71/0.99 % Reading from file /tmp/Prover9_13775_n027.cluster.edu
% 0.71/0.99
% 0.71/0.99 set(prolog_style_variables).
% 0.71/0.99 set(auto2).
% 0.71/0.99 % set(auto2) -> set(auto).
% 0.71/0.99 % set(auto) -> set(auto_inference).
% 0.71/0.99 % set(auto) -> set(auto_setup).
% 0.71/0.99 % set(auto_setup) -> set(predicate_elim).
% 0.71/0.99 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.71/0.99 % set(auto) -> set(auto_limits).
% 0.71/0.99 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.71/0.99 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.71/0.99 % set(auto) -> set(auto_denials).
% 0.71/0.99 % set(auto) -> set(auto_process).
% 0.71/0.99 % set(auto2) -> assign(new_constants, 1).
% 0.71/0.99 % set(auto2) -> assign(fold_denial_max, 3).
% 0.71/0.99 % set(auto2) -> assign(max_weight, "200.000").
% 0.71/0.99 % set(auto2) -> assign(max_hours, 1).
% 0.71/0.99 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.71/0.99 % set(auto2) -> assign(max_seconds, 0).
% 0.71/0.99 % set(auto2) -> assign(max_minutes, 5).
% 0.71/0.99 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.71/0.99 % set(auto2) -> set(sort_initial_sos).
% 0.71/0.99 % set(auto2) -> assign(sos_limit, -1).
% 0.71/0.99 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.71/0.99 % set(auto2) -> assign(max_megs, 400).
% 0.71/0.99 % set(auto2) -> assign(stats, some).
% 0.71/0.99 % set(auto2) -> clear(echo_input).
% 0.71/0.99 % set(auto2) -> set(quiet).
% 0.71/0.99 % set(auto2) -> clear(print_initial_clauses).
% 0.71/0.99 % set(auto2) -> clear(print_given).
% 0.71/0.99 assign(lrs_ticks,-1).
% 0.71/0.99 assign(sos_limit,10000).
% 0.71/0.99 assign(order,kbo).
% 0.71/0.99 set(lex_order_vars).
% 0.71/0.99 clear(print_given).
% 0.71/0.99
% 0.71/0.99 % formulas(sos). % not echoed (14 formulas)
% 0.71/0.99
% 0.71/0.99 ============================== end of input ==========================
% 0.71/0.99
% 0.71/0.99 % From the command line: assign(max_seconds, 300).
% 0.71/0.99
% 0.71/0.99 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.71/0.99
% 0.71/0.99 % Formulas that are not ordinary clauses:
% 0.71/0.99 1 $T # label(dt_k1_zfmisc_1) # label(axiom) # label(non_clause). [assumption].
% 0.71/0.99 2 (all A all B (element(B,powerset(A)) -> element(subset_complement(A,B),powerset(A)))) # label(dt_k3_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.71/0.99 3 (all A (top_str(A) -> one_sorted_str(A))) # label(dt_l1_pre_topc) # label(axiom) # label(non_clause). [assumption].
% 0.71/0.99 4 $T # label(dt_l1_struct_0) # label(axiom) # label(non_clause). [assumption].
% 0.71/0.99 5 $T # label(dt_m1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.71/0.99 6 $T # label(dt_u1_struct_0) # label(axiom) # label(non_clause). [assumption].
% 0.71/0.99 7 (exists A top_str(A)) # label(existence_l1_pre_topc) # label(axiom) # label(non_clause). [assumption].
% 0.71/0.99 8 (exists A one_sorted_str(A)) # label(existence_l1_struct_0) # label(axiom) # label(non_clause). [assumption].
% 0.71/0.99 9 (all A exists B element(B,A)) # label(existence_m1_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.71/0.99 10 (all A all B (element(B,powerset(A)) -> subset_complement(A,subset_complement(A,B)) = B)) # label(involutiveness_k3_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.71/0.99 11 (all A all B subset(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.71/0.99 12 (all A (top_str(A) -> (all B (element(B,powerset(the_carrier(A))) -> (closed_subset(B,A) <-> open_subset(subset_complement(the_carrier(A),B),A)))))) # label(t29_tops_1) # label(axiom) # label(non_clause). [assumption].
% 0.71/0.99 13 (all A all B (element(A,powerset(B)) <-> subset(A,B))) # label(t3_subset) # label(axiom) # label(non_clause). [assumption].
% 0.71/0.99 14 -(all A (top_str(A) -> (all B (element(B,powerset(the_carrier(A))) -> (open_subset(B,A) <-> closed_subset(subset_complement(the_carrier(A),B),A)))))) # label(t30_tops_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.71/0.99
% 0.71/0.99 ============================== end of process non-clausal formulas ===
% 0.71/0.99
% 0.71/0.99 ============================== PROCESS INITIAL CLAUSES ===============
% 0.71/0.99
% 0.71/0.99 ============================== PREDICATE ELIMINATION =================
% 0.71/0.99 15 -top_str(A) | one_sorted_str(A) # label(dt_l1_pre_topc) # label(axiom). [clausify(3)].
% 0.71/0.99 16 top_str(c1) # label(existence_l1_pre_topc) # label(axiom). [clausify(7)].
% 0.71/0.99 17 top_str(c3) # label(t30_tops_1) # label(negated_conjecture). [clausify(14)].
% 0.71/0.99 Derived: one_sorted_str(c1). [resolve(15,a,16,a)].
% 0.71/0.99 Derived: one_sorted_str(c3). [resolve(15,a,17,a)].
% 0.71/0.99 18 -top_str(A) | -element(B,powerset(the_carrier(A))) | -closed_subset(B,A) | open_subset(subset_complement(the_carrier(A),B),A) # label(t29_tops_1) # label(axiom). [clausify(12)].
% 0.71/0.99 Derived: -element(A,powerset(the_carrier(c1))) | -closed_subset(A,c1) | open_subset(subset_complement(the_carrier(c1),A),c1). [resolve(18,a,16,a)].
% 0.71/0.99 Derived: -element(A,powerset(the_carrier(c3))) | -closed_subset(A,c3) | open_subset(subset_complement(the_carrier(c3),A),c3). [resolve(18,a,17,a)].
% 0.71/0.99 19 -top_str(A) | -element(B,powerset(the_carrier(A))) | closed_subset(B,A) | -open_subset(subset_complement(the_carrier(A),B),A) # label(t29_tops_1) # label(axiom). [clausify(12)].
% 0.71/0.99 Derived: -element(A,powerset(the_carrier(c1))) | closed_subset(A,c1) | -open_subset(subset_complement(the_carrier(c1),A),c1). [resolve(19,a,16,a)].
% 0.71/0.99 Derived: -element(A,powerset(the_carrier(c3))) | closed_subset(A,c3) | -open_subset(subset_complement(the_carrier(c3),A),c3). [resolve(19,a,17,a)].
% 0.71/0.99 20 element(A,powerset(B)) | -subset(A,B) # label(t3_subset) # label(axiom). [clausify(13)].
% 0.71/0.99 21 subset(A,A) # label(reflexivity_r1_tarski) # label(axiom). [clausify(11)].
% 0.71/0.99 22 -element(A,powerset(B)) | subset(A,B) # label(t3_subset) # label(axiom). [clausify(13)].
% 0.71/0.99 Derived: element(A,powerset(A)). [resolve(20,b,21,a)].
% 0.71/0.99
% 0.71/0.99 ============================== end predicate elimination =============
% 0.71/0.99
% 0.71/0.99 Auto_denials: (non-Horn, no changes).
% 0.71/0.99
% 0.71/0.99 Term ordering decisions:
% 0.71/0.99 Function symbol KB weights: c1=1. c3=1. c4=1. subset_complement=1. the_carrier=1. powerset=1. f1=1.
% 0.71/0.99
% 0.71/0.99 ============================== end of process initial clauses ========
% 0.71/0.99
% 0.71/0.99 ============================== CLAUSES FOR SEARCH ====================
% 0.71/0.99
% 0.71/0.99 ============================== end of clauses for search =============
% 0.71/0.99
% 0.71/0.99 ============================== SEARCH ================================
% 0.71/0.99
% 0.71/0.99 % Starting search at 0.01 seconds.
% 0.71/0.99
% 0.71/0.99 ============================== PROOF =================================
% 0.71/0.99 % SZS status Theorem
% 0.71/0.99 % SZS output start Refutation
% 0.71/0.99
% 0.71/0.99 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.71/0.99 % Length of proof is 20.
% 0.71/0.99 % Level of proof is 6.
% 0.71/0.99 % Maximum clause weight is 14.000.
% 0.71/0.99 % Given clauses 19.
% 0.71/0.99
% 0.71/0.99 2 (all A all B (element(B,powerset(A)) -> element(subset_complement(A,B),powerset(A)))) # label(dt_k3_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.71/0.99 10 (all A all B (element(B,powerset(A)) -> subset_complement(A,subset_complement(A,B)) = B)) # label(involutiveness_k3_subset_1) # label(axiom) # label(non_clause). [assumption].
% 0.71/0.99 12 (all A (top_str(A) -> (all B (element(B,powerset(the_carrier(A))) -> (closed_subset(B,A) <-> open_subset(subset_complement(the_carrier(A),B),A)))))) # label(t29_tops_1) # label(axiom) # label(non_clause). [assumption].
% 0.71/0.99 14 -(all A (top_str(A) -> (all B (element(B,powerset(the_carrier(A))) -> (open_subset(B,A) <-> closed_subset(subset_complement(the_carrier(A),B),A)))))) # label(t30_tops_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.71/0.99 17 top_str(c3) # label(t30_tops_1) # label(negated_conjecture). [clausify(14)].
% 0.71/0.99 18 -top_str(A) | -element(B,powerset(the_carrier(A))) | -closed_subset(B,A) | open_subset(subset_complement(the_carrier(A),B),A) # label(t29_tops_1) # label(axiom). [clausify(12)].
% 0.71/0.99 19 -top_str(A) | -element(B,powerset(the_carrier(A))) | closed_subset(B,A) | -open_subset(subset_complement(the_carrier(A),B),A) # label(t29_tops_1) # label(axiom). [clausify(12)].
% 0.71/0.99 24 element(c4,powerset(the_carrier(c3))) # label(t30_tops_1) # label(negated_conjecture). [clausify(14)].
% 0.71/0.99 25 open_subset(c4,c3) | closed_subset(subset_complement(the_carrier(c3),c4),c3) # label(t30_tops_1) # label(negated_conjecture). [clausify(14)].
% 0.71/0.99 26 -open_subset(c4,c3) | -closed_subset(subset_complement(the_carrier(c3),c4),c3) # label(t30_tops_1) # label(negated_conjecture). [clausify(14)].
% 0.71/0.99 27 -element(A,powerset(B)) | element(subset_complement(B,A),powerset(B)) # label(dt_k3_subset_1) # label(axiom). [clausify(2)].
% 0.71/0.99 28 -element(A,powerset(B)) | subset_complement(B,subset_complement(B,A)) = A # label(involutiveness_k3_subset_1) # label(axiom). [clausify(10)].
% 0.71/0.99 30 -element(A,powerset(the_carrier(c3))) | -closed_subset(A,c3) | open_subset(subset_complement(the_carrier(c3),A),c3). [resolve(18,a,17,a)].
% 0.71/0.99 32 -element(A,powerset(the_carrier(c3))) | closed_subset(A,c3) | -open_subset(subset_complement(the_carrier(c3),A),c3). [resolve(19,a,17,a)].
% 0.71/0.99 34 element(subset_complement(the_carrier(c3),c4),powerset(the_carrier(c3))). [resolve(27,a,24,a)].
% 0.71/0.99 36 subset_complement(the_carrier(c3),subset_complement(the_carrier(c3),c4)) = c4. [resolve(28,a,24,a)].
% 0.71/0.99 42 closed_subset(subset_complement(the_carrier(c3),c4),c3) | -open_subset(c4,c3). [para(36(a,1),32(c,1)),unit_del(a,34)].
% 0.71/0.99 45 closed_subset(subset_complement(the_carrier(c3),c4),c3). [resolve(42,b,25,a),merge(b)].
% 0.71/0.99 46 -open_subset(c4,c3). [back_unit_del(26),unit_del(b,45)].
% 0.71/0.99 47 $F. [resolve(45,a,30,b),rewrite([36(15)]),unit_del(a,34),unit_del(b,46)].
% 0.71/0.99
% 0.71/0.99 % SZS output end Refutation
% 0.71/0.99 ============================== end of proof ==========================
% 0.71/0.99
% 0.71/0.99 ============================== STATISTICS ============================
% 0.71/0.99
% 0.71/0.99 Given=19. Generated=35. Kept=24. proofs=1.
% 0.71/0.99 Usable=16. Sos=5. Demods=3. Limbo=0, Disabled=25. Hints=0.
% 0.71/0.99 Megabytes=0.06.
% 0.71/0.99 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.71/0.99
% 0.71/0.99 ============================== end of statistics =====================
% 0.71/0.99
% 0.71/0.99 ============================== end of search =========================
% 0.71/0.99
% 0.71/0.99 THEOREM PROVED
% 0.71/0.99 % SZS status Theorem
% 0.71/0.99
% 0.71/0.99 Exiting with 1 proof.
% 0.71/0.99
% 0.71/0.99 Process 14226 exit (max_proofs) Mon Jun 20 11:31:55 2022
% 0.71/0.99 Prover9 interrupted
%------------------------------------------------------------------------------