TSTP Solution File: SET003-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SET003-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n010.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:25:29 EDT 2022
% Result : Unsatisfiable 0.76s 1.03s
% Output : Refutation 0.76s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SET003-1 : TPTP v8.1.0. Released v1.0.0.
% 0.08/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.14/0.36 % Computer : n010.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36 % CPULimit : 300
% 0.14/0.36 % WCLimit : 600
% 0.14/0.36 % DateTime : Sun Jul 10 06:22:30 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.49/1.03 ============================== Prover9 ===============================
% 0.49/1.03 Prover9 (32) version 2009-11A, November 2009.
% 0.49/1.03 Process 15861 was started by sandbox2 on n010.cluster.edu,
% 0.49/1.03 Sun Jul 10 06:22:31 2022
% 0.49/1.03 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_15707_n010.cluster.edu".
% 0.49/1.03 ============================== end of head ===========================
% 0.49/1.03
% 0.49/1.03 ============================== INPUT =================================
% 0.49/1.03
% 0.49/1.03 % Reading from file /tmp/Prover9_15707_n010.cluster.edu
% 0.49/1.03
% 0.49/1.03 set(prolog_style_variables).
% 0.49/1.03 set(auto2).
% 0.49/1.03 % set(auto2) -> set(auto).
% 0.49/1.03 % set(auto) -> set(auto_inference).
% 0.49/1.03 % set(auto) -> set(auto_setup).
% 0.49/1.03 % set(auto_setup) -> set(predicate_elim).
% 0.49/1.03 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.49/1.03 % set(auto) -> set(auto_limits).
% 0.49/1.03 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.49/1.03 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.49/1.03 % set(auto) -> set(auto_denials).
% 0.49/1.03 % set(auto) -> set(auto_process).
% 0.49/1.03 % set(auto2) -> assign(new_constants, 1).
% 0.49/1.03 % set(auto2) -> assign(fold_denial_max, 3).
% 0.49/1.03 % set(auto2) -> assign(max_weight, "200.000").
% 0.49/1.03 % set(auto2) -> assign(max_hours, 1).
% 0.49/1.03 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.49/1.03 % set(auto2) -> assign(max_seconds, 0).
% 0.49/1.03 % set(auto2) -> assign(max_minutes, 5).
% 0.49/1.03 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.49/1.03 % set(auto2) -> set(sort_initial_sos).
% 0.49/1.03 % set(auto2) -> assign(sos_limit, -1).
% 0.49/1.03 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.49/1.03 % set(auto2) -> assign(max_megs, 400).
% 0.49/1.03 % set(auto2) -> assign(stats, some).
% 0.49/1.03 % set(auto2) -> clear(echo_input).
% 0.49/1.03 % set(auto2) -> set(quiet).
% 0.49/1.03 % set(auto2) -> clear(print_initial_clauses).
% 0.49/1.03 % set(auto2) -> clear(print_given).
% 0.49/1.03 assign(lrs_ticks,-1).
% 0.49/1.03 assign(sos_limit,10000).
% 0.49/1.03 assign(order,kbo).
% 0.49/1.03 set(lex_order_vars).
% 0.49/1.03 clear(print_given).
% 0.49/1.03
% 0.49/1.03 % formulas(sos). % not echoed (14 formulas)
% 0.49/1.03
% 0.49/1.03 ============================== end of input ==========================
% 0.49/1.03
% 0.49/1.03 % From the command line: assign(max_seconds, 300).
% 0.49/1.03
% 0.49/1.03 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.49/1.03
% 0.49/1.03 % Formulas that are not ordinary clauses:
% 0.49/1.03
% 0.49/1.03 ============================== end of process non-clausal formulas ===
% 0.49/1.03
% 0.49/1.03 ============================== PROCESS INITIAL CLAUSES ===============
% 0.49/1.03
% 0.49/1.03 ============================== PREDICATE ELIMINATION =================
% 0.49/1.03 1 -union(A,B,C) | -member(D,A) | member(D,C) # label(member_of_set1_is_member_of_union) # label(axiom). [assumption].
% 0.49/1.03 2 union(a,a,aUa) # label(a_union_a_is_aUa) # label(hypothesis). [assumption].
% 0.49/1.03 3 union(A,B,C) | member(g(A,B,C),A) | member(g(A,B,C),B) | member(g(A,B,C),C) # label(union_axiom1) # label(axiom). [assumption].
% 0.49/1.03 Derived: -member(A,a) | member(A,aUa). [resolve(1,a,2,a)].
% 0.49/1.03 Derived: -member(A,B) | member(A,C) | member(g(B,D,C),B) | member(g(B,D,C),D) | member(g(B,D,C),C). [resolve(1,a,3,a)].
% 0.49/1.03 4 -union(A,B,C) | -member(D,B) | member(D,C) # label(member_of_set2_is_member_of_union) # label(axiom). [assumption].
% 0.49/1.03 Derived: -member(A,B) | member(A,C) | member(g(D,B,C),D) | member(g(D,B,C),B) | member(g(D,B,C),C). [resolve(4,a,3,a)].
% 0.49/1.03 5 -union(A,B,C) | -member(D,C) | member(D,A) | member(D,B) # label(member_of_union_is_member_of_one_set) # label(axiom). [assumption].
% 0.49/1.03 Derived: -member(A,aUa) | member(A,a) | member(A,a). [resolve(5,a,2,a)].
% 0.49/1.03 Derived: -member(A,B) | member(A,C) | member(A,D) | member(g(C,D,B),C) | member(g(C,D,B),D) | member(g(C,D,B),B). [resolve(5,a,3,a)].
% 0.49/1.03 6 -member(g(A,B,C),A) | -member(g(A,B,C),C) | union(A,B,C) # label(union_axiom2) # label(axiom). [assumption].
% 0.49/1.03 Derived: -member(g(A,B,C),A) | -member(g(A,B,C),C) | -member(D,A) | member(D,C). [resolve(6,c,1,a)].
% 0.49/1.03 Derived: -member(g(A,B,C),A) | -member(g(A,B,C),C) | -member(D,B) | member(D,C). [resolve(6,c,4,a)].
% 0.49/1.03 Derived: -member(g(A,B,C),A) | -member(g(A,B,C),C) | -member(D,C) | member(D,A) | member(D,B). [resolve(6,c,5,a)].
% 0.49/1.03 7 -member(g(A,B,C),B) | -member(g(A,B,C),C) | union(A,B,C) # label(union_axiom3) # label(axiom). [assumption].
% 0.49/1.03 Derived: -member(g(A,B,C),B) | -member(g(A,B,C),C) | -member(D,A) | member(D,C). [resolve(7,c,1,a)].
% 0.49/1.03 Derived: -member(g(A,B,C),B) | -member(g(A,B,C),C) | -member(D,B) | member(D,C). [resolve(7,c,4,a)].
% 0.76/1.03 Derived: -member(g(A,B,C),B) | -member(g(A,B,C),C) | -member(D,C) | member(D,A) | member(D,B). [resolve(7,c,5,a)].
% 0.76/1.03 8 -subset(A,B) | -subset(B,A) | equal_sets(B,A) # label(subsets_are_set_equal_sets) # label(axiom). [assumption].
% 0.76/1.03 9 -equal_sets(A,B) | subset(A,B) # label(set_equal_sets_are_subsets1) # label(axiom). [assumption].
% 0.76/1.03 10 -equal_sets(A,B) | subset(B,A) # label(set_equal_sets_are_subsets2) # label(axiom). [assumption].
% 0.76/1.03 11 -subset(a,aUa) # label(prove_a_is_a_subset_of_aUa) # label(negated_conjecture). [assumption].
% 0.76/1.03 12 subset(A,B) | member(member_of_1_not_of_2(A,B),A) # label(subsets_axiom1) # label(axiom). [assumption].
% 0.76/1.03 Derived: member(member_of_1_not_of_2(a,aUa),a). [resolve(11,a,12,a)].
% 0.76/1.03 13 -member(member_of_1_not_of_2(A,B),B) | subset(A,B) # label(subsets_axiom2) # label(axiom). [assumption].
% 0.76/1.03 Derived: -member(member_of_1_not_of_2(a,aUa),aUa). [resolve(13,b,11,a)].
% 0.76/1.03 14 -member(A,B) | -subset(B,C) | member(A,C) # label(membership_in_subsets) # label(axiom). [assumption].
% 0.76/1.03 Derived: -member(A,B) | member(A,C) | member(member_of_1_not_of_2(B,C),B). [resolve(14,b,12,a)].
% 0.76/1.03 Derived: -member(A,B) | member(A,C) | -member(member_of_1_not_of_2(B,C),C). [resolve(14,b,13,b)].
% 0.76/1.03
% 0.76/1.03 ============================== end predicate elimination =============
% 0.76/1.03
% 0.76/1.03 Auto_denials: (non-Horn, no changes).
% 0.76/1.03
% 0.76/1.03 Term ordering decisions:
% 0.76/1.03 Function symbol KB weights: a=1. aUa=1. member_of_1_not_of_2=1. g=1.
% 0.76/1.03
% 0.76/1.03 ============================== end of process initial clauses ========
% 0.76/1.03
% 0.76/1.03 ============================== CLAUSES FOR SEARCH ====================
% 0.76/1.03
% 0.76/1.03 ============================== end of clauses for search =============
% 0.76/1.03
% 0.76/1.03 ============================== SEARCH ================================
% 0.76/1.03
% 0.76/1.03 % Starting search at 0.01 seconds.
% 0.76/1.03
% 0.76/1.03 ============================== PROOF =================================
% 0.76/1.03 % SZS status Unsatisfiable
% 0.76/1.03 % SZS output start Refutation
% 0.76/1.03
% 0.76/1.03 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.76/1.03 % Length of proof is 9.
% 0.76/1.03 % Level of proof is 2.
% 0.76/1.03 % Maximum clause weight is 6.000.
% 0.76/1.03 % Given clauses 12.
% 0.76/1.03
% 0.76/1.03 1 -union(A,B,C) | -member(D,A) | member(D,C) # label(member_of_set1_is_member_of_union) # label(axiom). [assumption].
% 0.76/1.03 2 union(a,a,aUa) # label(a_union_a_is_aUa) # label(hypothesis). [assumption].
% 0.76/1.03 11 -subset(a,aUa) # label(prove_a_is_a_subset_of_aUa) # label(negated_conjecture). [assumption].
% 0.76/1.03 12 subset(A,B) | member(member_of_1_not_of_2(A,B),A) # label(subsets_axiom1) # label(axiom). [assumption].
% 0.76/1.03 13 -member(member_of_1_not_of_2(A,B),B) | subset(A,B) # label(subsets_axiom2) # label(axiom). [assumption].
% 0.76/1.03 15 -member(A,a) | member(A,aUa). [resolve(1,a,2,a)].
% 0.76/1.03 27 member(member_of_1_not_of_2(a,aUa),a). [resolve(11,a,12,a)].
% 0.76/1.03 28 -member(member_of_1_not_of_2(a,aUa),aUa). [resolve(13,b,11,a)].
% 0.76/1.03 47 $F. [resolve(27,a,15,a),unit_del(a,28)].
% 0.76/1.03
% 0.76/1.03 % SZS output end Refutation
% 0.76/1.03 ============================== end of proof ==========================
% 0.76/1.03
% 0.76/1.03 ============================== STATISTICS ============================
% 0.76/1.03
% 0.76/1.03 Given=12. Generated=86. Kept=31. proofs=1.
% 0.76/1.03 Usable=12. Sos=10. Demods=0. Limbo=9, Disabled=29. Hints=0.
% 0.76/1.03 Megabytes=0.05.
% 0.76/1.03 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.76/1.03
% 0.76/1.03 ============================== end of statistics =====================
% 0.76/1.03
% 0.76/1.03 ============================== end of search =========================
% 0.76/1.03
% 0.76/1.03 THEOREM PROVED
% 0.76/1.03 % SZS status Unsatisfiable
% 0.76/1.03
% 0.76/1.03 Exiting with 1 proof.
% 0.76/1.03
% 0.76/1.03 Process 15861 exit (max_proofs) Sun Jul 10 06:22:31 2022
% 0.76/1.03 Prover9 interrupted
%------------------------------------------------------------------------------