TSTP Solution File: SET577+3 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SET577+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n020.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:30:22 EDT 2022
% Result : Theorem 0.97s 1.25s
% Output : Refutation 0.97s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : SET577+3 : TPTP v8.1.0. Released v2.2.0.
% 0.06/0.11 % Command : tptp2X_and_run_prover9 %d %s
% 0.11/0.32 % Computer : n020.cluster.edu
% 0.11/0.32 % Model : x86_64 x86_64
% 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32 % Memory : 8042.1875MB
% 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32 % CPULimit : 300
% 0.11/0.32 % WCLimit : 600
% 0.11/0.32 % DateTime : Sun Jul 10 02:00:13 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.97/1.25 ============================== Prover9 ===============================
% 0.97/1.25 Prover9 (32) version 2009-11A, November 2009.
% 0.97/1.25 Process 8089 was started by sandbox2 on n020.cluster.edu,
% 0.97/1.25 Sun Jul 10 02:00:14 2022
% 0.97/1.25 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_7901_n020.cluster.edu".
% 0.97/1.25 ============================== end of head ===========================
% 0.97/1.25
% 0.97/1.25 ============================== INPUT =================================
% 0.97/1.25
% 0.97/1.25 % Reading from file /tmp/Prover9_7901_n020.cluster.edu
% 0.97/1.25
% 0.97/1.25 set(prolog_style_variables).
% 0.97/1.25 set(auto2).
% 0.97/1.25 % set(auto2) -> set(auto).
% 0.97/1.25 % set(auto) -> set(auto_inference).
% 0.97/1.25 % set(auto) -> set(auto_setup).
% 0.97/1.25 % set(auto_setup) -> set(predicate_elim).
% 0.97/1.25 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.97/1.25 % set(auto) -> set(auto_limits).
% 0.97/1.25 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.97/1.25 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.97/1.25 % set(auto) -> set(auto_denials).
% 0.97/1.25 % set(auto) -> set(auto_process).
% 0.97/1.25 % set(auto2) -> assign(new_constants, 1).
% 0.97/1.25 % set(auto2) -> assign(fold_denial_max, 3).
% 0.97/1.25 % set(auto2) -> assign(max_weight, "200.000").
% 0.97/1.25 % set(auto2) -> assign(max_hours, 1).
% 0.97/1.25 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.97/1.25 % set(auto2) -> assign(max_seconds, 0).
% 0.97/1.25 % set(auto2) -> assign(max_minutes, 5).
% 0.97/1.25 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.97/1.25 % set(auto2) -> set(sort_initial_sos).
% 0.97/1.25 % set(auto2) -> assign(sos_limit, -1).
% 0.97/1.25 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.97/1.25 % set(auto2) -> assign(max_megs, 400).
% 0.97/1.25 % set(auto2) -> assign(stats, some).
% 0.97/1.25 % set(auto2) -> clear(echo_input).
% 0.97/1.25 % set(auto2) -> set(quiet).
% 0.97/1.25 % set(auto2) -> clear(print_initial_clauses).
% 0.97/1.25 % set(auto2) -> clear(print_given).
% 0.97/1.25 assign(lrs_ticks,-1).
% 0.97/1.25 assign(sos_limit,10000).
% 0.97/1.25 assign(order,kbo).
% 0.97/1.25 set(lex_order_vars).
% 0.97/1.25 clear(print_given).
% 0.97/1.25
% 0.97/1.25 % formulas(sos). % not echoed (7 formulas)
% 0.97/1.25
% 0.97/1.25 ============================== end of input ==========================
% 0.97/1.25
% 0.97/1.25 % From the command line: assign(max_seconds, 300).
% 0.97/1.25
% 0.97/1.25 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.97/1.25
% 0.97/1.25 % Formulas that are not ordinary clauses:
% 0.97/1.25 1 (all B all C all D (member(D,union(B,C)) <-> member(D,B) | member(D,C))) # label(union_defn) # label(axiom) # label(non_clause). [assumption].
% 0.97/1.25 2 (all B all C (B = C <-> subset(B,C) & subset(C,B))) # label(equal_defn) # label(axiom) # label(non_clause). [assumption].
% 0.97/1.25 3 (all B all C union(B,C) = union(C,B)) # label(commutativity_of_union) # label(axiom) # label(non_clause). [assumption].
% 0.97/1.25 4 (all B all C (subset(B,C) <-> (all D (member(D,B) -> member(D,C))))) # label(subset_defn) # label(axiom) # label(non_clause). [assumption].
% 0.97/1.25 5 (all B subset(B,B)) # label(reflexivity_of_subset) # label(axiom) # label(non_clause). [assumption].
% 0.97/1.25 6 (all B all C (B = C <-> (all D (member(D,B) <-> member(D,C))))) # label(equal_member_defn) # label(axiom) # label(non_clause). [assumption].
% 0.97/1.25 7 -(all B all C all D ((all E (member(E,B) <-> member(E,C) | member(E,D))) -> B = union(C,D))) # label(prove_th18) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.97/1.25
% 0.97/1.25 ============================== end of process non-clausal formulas ===
% 0.97/1.25
% 0.97/1.25 ============================== PROCESS INITIAL CLAUSES ===============
% 0.97/1.25
% 0.97/1.25 ============================== PREDICATE ELIMINATION =================
% 0.97/1.25
% 0.97/1.25 ============================== end predicate elimination =============
% 0.97/1.25
% 0.97/1.25 Auto_denials: (non-Horn, no changes).
% 0.97/1.25
% 0.97/1.25 Term ordering decisions:
% 0.97/1.25 Function symbol KB weights: c1=1. c2=1. c3=1. union=1. f1=1. f2=1.
% 0.97/1.25
% 0.97/1.25 ============================== end of process initial clauses ========
% 0.97/1.25
% 0.97/1.25 ============================== CLAUSES FOR SEARCH ====================
% 0.97/1.25
% 0.97/1.25 ============================== end of clauses for search =============
% 0.97/1.25
% 0.97/1.25 ============================== SEARCH ================================
% 0.97/1.25
% 0.97/1.25 % Starting search at 0.01 seconds.
% 0.97/1.25
% 0.97/1.25 ============================== PROOF =================================
% 0.97/1.25 % SZS status Theorem
% 0.97/1.25 % SZS output start Refutation
% 0.97/1.25
% 0.97/1.25 % Proof 1 at 0.26 (+ 0.01) seconds.
% 0.97/1.25 % Length of proof is 24.
% 0.97/1.25 % Level of proof is 10.
% 0.97/1.25 % Maximum clause weight is 33.000.
% 0.97/1.25 % Given clauses 387.
% 0.97/1.25
% 0.97/1.25 1 (all B all C all D (member(D,union(B,C)) <-> member(D,B) | member(D,C))) # label(union_defn) # label(axiom) # label(non_clause). [assumption].
% 0.97/1.25 3 (all B all C union(B,C) = union(C,B)) # label(commutativity_of_union) # label(axiom) # label(non_clause). [assumption].
% 0.97/1.25 6 (all B all C (B = C <-> (all D (member(D,B) <-> member(D,C))))) # label(equal_member_defn) # label(axiom) # label(non_clause). [assumption].
% 0.97/1.25 7 -(all B all C all D ((all E (member(E,B) <-> member(E,C) | member(E,D))) -> B = union(C,D))) # label(prove_th18) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.97/1.25 9 union(A,B) = union(B,A) # label(commutativity_of_union) # label(axiom). [clausify(3)].
% 0.97/1.25 11 A = B | member(f2(B,A),B) | member(f2(B,A),A) # label(equal_member_defn) # label(axiom). [clausify(6)].
% 0.97/1.25 12 union(c2,c3) != c1 # label(prove_th18) # label(negated_conjecture). [clausify(7)].
% 0.97/1.25 15 member(A,c1) | -member(A,c2) # label(prove_th18) # label(negated_conjecture). [clausify(7)].
% 0.97/1.25 16 member(A,c1) | -member(A,c3) # label(prove_th18) # label(negated_conjecture). [clausify(7)].
% 0.97/1.25 17 member(A,union(B,C)) | -member(A,B) # label(union_defn) # label(axiom). [clausify(1)].
% 0.97/1.25 18 member(A,union(B,C)) | -member(A,C) # label(union_defn) # label(axiom). [clausify(1)].
% 0.97/1.25 24 -member(A,c1) | member(A,c2) | member(A,c3) # label(prove_th18) # label(negated_conjecture). [clausify(7)].
% 0.97/1.25 25 -member(A,union(B,C)) | member(A,B) | member(A,C) # label(union_defn) # label(axiom). [clausify(1)].
% 0.97/1.25 26 A = B | -member(f2(B,A),B) | -member(f2(B,A),A) # label(equal_member_defn) # label(axiom). [clausify(6)].
% 0.97/1.25 49 member(f2(A,c1),c2) | member(f2(A,c1),c3) | c1 = A | member(f2(A,c1),A). [resolve(24,a,11,c)].
% 0.97/1.25 282 member(f2(union(A,B),c1),c2) | member(f2(union(A,B),c1),c3) | union(A,B) = c1 | member(f2(union(A,B),c1),A) | member(f2(union(A,B),c1),B). [resolve(49,d,25,a),flip(c)].
% 0.97/1.25 295 member(f2(union(A,c2),c1),c2) | member(f2(union(A,c2),c1),c3) | union(A,c2) = c1 | member(f2(union(A,c2),c1),A). [factor(282,a,d),rewrite([9(2),9(8),9(14),9(18)])].
% 0.97/1.25 301 member(f2(union(c2,c3),c1),c2) | member(f2(union(c2,c3),c1),c3). [factor(295,b,d),rewrite([9(3),9(10),9(17)]),unit_del(c,12)].
% 0.97/1.25 1555 member(f2(union(c2,c3),c1),c2) | member(f2(union(c2,c3),c1),c1). [resolve(301,b,16,b)].
% 0.97/1.25 1906 member(f2(union(c2,c3),c1),c1). [resolve(1555,a,15,b),merge(b)].
% 0.97/1.25 1909 -member(f2(union(c2,c3),c1),union(c2,c3)). [resolve(1906,a,26,c),flip(a),unit_del(a,12)].
% 0.97/1.25 1936 -member(f2(union(c2,c3),c1),c3). [ur(18,a,1909,a)].
% 0.97/1.25 1937 -member(f2(union(c2,c3),c1),c2). [ur(17,a,1909,a)].
% 0.97/1.25 1938 $F. [back_unit_del(301),unit_del(a,1937),unit_del(b,1936)].
% 0.97/1.25
% 0.97/1.25 % SZS output end Refutation
% 0.97/1.25 ============================== end of proof ==========================
% 0.97/1.25
% 0.97/1.25 ============================== STATISTICS ============================
% 0.97/1.25
% 0.97/1.25 Given=387. Generated=6803. Kept=1930. proofs=1.
% 0.97/1.25 Usable=359. Sos=1383. Demods=7. Limbo=2, Disabled=205. Hints=0.
% 0.97/1.25 Megabytes=1.40.
% 0.97/1.25 User_CPU=0.26, System_CPU=0.01, Wall_clock=0.
% 0.97/1.25
% 0.97/1.25 ============================== end of statistics =====================
% 0.97/1.25
% 0.97/1.25 ============================== end of search =========================
% 0.97/1.25
% 0.97/1.25 THEOREM PROVED
% 0.97/1.25 % SZS status Theorem
% 0.97/1.25
% 0.97/1.25 Exiting with 1 proof.
% 0.97/1.25
% 0.97/1.25 Process 8089 exit (max_proofs) Sun Jul 10 02:00:14 2022
% 0.97/1.25 Prover9 interrupted
%------------------------------------------------------------------------------