TSTP Solution File: SET006-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SET006-1 : TPTP v8.1.0. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n023.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:31 EDT 2022
% Result : Unsatisfiable 0.80s 1.08s
% Output : Refutation 0.80s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : SET006-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 : n023.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 04:33:40 EDT 2022
% 0.14/0.36 % CPUTime :
% 0.80/1.08 ============================== Prover9 ===============================
% 0.80/1.08 Prover9 (32) version 2009-11A, November 2009.
% 0.80/1.08 Process 13634 was started by sandbox2 on n023.cluster.edu,
% 0.80/1.08 Sun Jul 10 04:33:41 2022
% 0.80/1.08 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_13480_n023.cluster.edu".
% 0.80/1.08 ============================== end of head ===========================
% 0.80/1.08
% 0.80/1.08 ============================== INPUT =================================
% 0.80/1.08
% 0.80/1.08 % Reading from file /tmp/Prover9_13480_n023.cluster.edu
% 0.80/1.08
% 0.80/1.08 set(prolog_style_variables).
% 0.80/1.08 set(auto2).
% 0.80/1.08 % set(auto2) -> set(auto).
% 0.80/1.08 % set(auto) -> set(auto_inference).
% 0.80/1.08 % set(auto) -> set(auto_setup).
% 0.80/1.08 % set(auto_setup) -> set(predicate_elim).
% 0.80/1.08 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.80/1.08 % set(auto) -> set(auto_limits).
% 0.80/1.08 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.80/1.08 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.80/1.08 % set(auto) -> set(auto_denials).
% 0.80/1.08 % set(auto) -> set(auto_process).
% 0.80/1.08 % set(auto2) -> assign(new_constants, 1).
% 0.80/1.08 % set(auto2) -> assign(fold_denial_max, 3).
% 0.80/1.08 % set(auto2) -> assign(max_weight, "200.000").
% 0.80/1.08 % set(auto2) -> assign(max_hours, 1).
% 0.80/1.08 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.80/1.08 % set(auto2) -> assign(max_seconds, 0).
% 0.80/1.08 % set(auto2) -> assign(max_minutes, 5).
% 0.80/1.08 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.80/1.08 % set(auto2) -> set(sort_initial_sos).
% 0.80/1.08 % set(auto2) -> assign(sos_limit, -1).
% 0.80/1.08 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.80/1.08 % set(auto2) -> assign(max_megs, 400).
% 0.80/1.08 % set(auto2) -> assign(stats, some).
% 0.80/1.08 % set(auto2) -> clear(echo_input).
% 0.80/1.08 % set(auto2) -> set(quiet).
% 0.80/1.08 % set(auto2) -> clear(print_initial_clauses).
% 0.80/1.08 % set(auto2) -> clear(print_given).
% 0.80/1.08 assign(lrs_ticks,-1).
% 0.80/1.08 assign(sos_limit,10000).
% 0.80/1.08 assign(order,kbo).
% 0.80/1.08 set(lex_order_vars).
% 0.80/1.08 clear(print_given).
% 0.80/1.08
% 0.80/1.08 % formulas(sos). % not echoed (14 formulas)
% 0.80/1.08
% 0.80/1.08 ============================== end of input ==========================
% 0.80/1.08
% 0.80/1.08 % From the command line: assign(max_seconds, 300).
% 0.80/1.08
% 0.80/1.08 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.80/1.08
% 0.80/1.08 % Formulas that are not ordinary clauses:
% 0.80/1.08
% 0.80/1.08 ============================== end of process non-clausal formulas ===
% 0.80/1.08
% 0.80/1.08 ============================== PROCESS INITIAL CLAUSES ===============
% 0.80/1.08
% 0.80/1.08 ============================== PREDICATE ELIMINATION =================
% 0.80/1.08 1 -intersection(A,B,C) | -member(D,C) | member(D,A) # label(member_of_intersection_is_member_of_set1) # label(axiom). [assumption].
% 0.80/1.08 2 intersection(d,a,d) # label(d_intersection_a_is_d) # label(hypothesis). [assumption].
% 0.80/1.08 3 member(h(A,B,C),C) | intersection(A,B,C) | member(h(A,B,C),A) # label(intersection_axiom1) # label(axiom). [assumption].
% 0.80/1.08 4 member(h(A,B,C),C) | intersection(A,B,C) | member(h(A,B,C),B) # label(intersection_axiom2) # label(axiom). [assumption].
% 0.80/1.08 Derived: -member(A,B) | member(A,C) | member(h(C,D,B),B) | member(h(C,D,B),C). [resolve(1,a,3,b)].
% 0.80/1.08 Derived: -member(A,B) | member(A,C) | member(h(C,D,B),B) | member(h(C,D,B),D). [resolve(1,a,4,b)].
% 0.80/1.08 5 -intersection(A,B,C) | -member(D,C) | member(D,B) # label(member_of_intersection_is_member_of_set2) # label(axiom). [assumption].
% 0.80/1.08 Derived: -member(A,d) | member(A,a). [resolve(5,a,2,a)].
% 0.80/1.08 Derived: -member(A,B) | member(A,C) | member(h(D,C,B),B) | member(h(D,C,B),D). [resolve(5,a,3,b)].
% 0.80/1.08 Derived: -member(A,B) | member(A,C) | member(h(D,C,B),B) | member(h(D,C,B),C). [resolve(5,a,4,b)].
% 0.80/1.08 6 -intersection(A,B,C) | -member(D,B) | -member(D,A) | member(D,C) # label(member_of_both_is_member_of_intersection) # label(axiom). [assumption].
% 0.80/1.08 Derived: -member(A,B) | -member(A,C) | member(A,D) | member(h(C,B,D),D) | member(h(C,B,D),C). [resolve(6,a,3,b)].
% 0.80/1.08 Derived: -member(A,B) | -member(A,C) | member(A,D) | member(h(C,B,D),D) | member(h(C,B,D),B). [resolve(6,a,4,b)].
% 0.80/1.08 7 -member(h(A,B,C),C) | -member(h(A,B,C),B) | -member(h(A,B,C),A) | intersection(A,B,C) # label(intersection_axiom3) # label(axiom). [assumption].
% 0.80/1.08 Derived: -member(h(A,B,C),C) | -member(h(A,B,C),B) | -member(h(A,B,C),A) | -member(D,C) | member(D,A). [resolve(7,d,1,a)].
% 0.80/1.08 Derived: -member(h(A,B,C),C) | -member(h(A,B,C),B) | -member(h(A,B,C),A) | -member(D,C) | member(D,B). [resolve(7,d,5,a)].
% 0.80/1.08 Derived: -member(h(A,B,C),C) | -member(h(A,B,C),B) | -member(h(A,B,C),A) | -member(D,B) | -member(D,A) | member(D,C). [resolve(7,d,6,a)].
% 0.80/1.08 8 -subset(A,B) | -subset(B,A) | equal_sets(B,A) # label(subsets_are_set_equal_sets) # label(axiom). [assumption].
% 0.80/1.08 9 -equal_sets(A,B) | subset(A,B) # label(set_equal_sets_are_subsets1) # label(axiom). [assumption].
% 0.80/1.08 10 -equal_sets(A,B) | subset(B,A) # label(set_equal_sets_are_subsets2) # label(axiom). [assumption].
% 0.80/1.08 11 -subset(d,a) # label(prove_d_is_a_subset_of_a) # label(negated_conjecture). [assumption].
% 0.80/1.08 12 subset(A,B) | member(member_of_1_not_of_2(A,B),A) # label(subsets_axiom1) # label(axiom). [assumption].
% 0.80/1.08 Derived: member(member_of_1_not_of_2(d,a),d). [resolve(11,a,12,a)].
% 0.80/1.08 13 -member(member_of_1_not_of_2(A,B),B) | subset(A,B) # label(subsets_axiom2) # label(axiom). [assumption].
% 0.80/1.08 Derived: -member(member_of_1_not_of_2(d,a),a). [resolve(13,b,11,a)].
% 0.80/1.08 14 -member(A,B) | -subset(B,C) | member(A,C) # label(membership_in_subsets) # label(axiom). [assumption].
% 0.80/1.08 Derived: -member(A,B) | member(A,C) | member(member_of_1_not_of_2(B,C),B). [resolve(14,b,12,a)].
% 0.80/1.08 Derived: -member(A,B) | member(A,C) | -member(member_of_1_not_of_2(B,C),C). [resolve(14,b,13,b)].
% 0.80/1.08
% 0.80/1.08 ============================== end predicate elimination =============
% 0.80/1.08
% 0.80/1.08 Auto_denials: (non-Horn, no changes).
% 0.80/1.08
% 0.80/1.08 Term ordering decisions:
% 0.80/1.08 Function symbol KB weights: d=1. a=1. member_of_1_not_of_2=1. h=1.
% 0.80/1.08
% 0.80/1.08 ============================== end of process initial clauses ========
% 0.80/1.08
% 0.80/1.08 ============================== CLAUSES FOR SEARCH ====================
% 0.80/1.08
% 0.80/1.08 ============================== end of clauses for search =============
% 0.80/1.08
% 0.80/1.08 ============================== SEARCH ================================
% 0.80/1.08
% 0.80/1.08 % Starting search at 0.01 seconds.
% 0.80/1.08
% 0.80/1.08 ============================== PROOF =================================
% 0.80/1.08 % SZS status Unsatisfiable
% 0.80/1.08 % SZS output start Refutation
% 0.80/1.08
% 0.80/1.08 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.80/1.08 % Length of proof is 9.
% 0.80/1.08 % Level of proof is 2.
% 0.80/1.08 % Maximum clause weight is 6.000.
% 0.80/1.08 % Given clauses 11.
% 0.80/1.08
% 0.80/1.08 2 intersection(d,a,d) # label(d_intersection_a_is_d) # label(hypothesis). [assumption].
% 0.80/1.08 5 -intersection(A,B,C) | -member(D,C) | member(D,B) # label(member_of_intersection_is_member_of_set2) # label(axiom). [assumption].
% 0.80/1.08 11 -subset(d,a) # label(prove_d_is_a_subset_of_a) # label(negated_conjecture). [assumption].
% 0.80/1.08 12 subset(A,B) | member(member_of_1_not_of_2(A,B),A) # label(subsets_axiom1) # label(axiom). [assumption].
% 0.80/1.08 13 -member(member_of_1_not_of_2(A,B),B) | subset(A,B) # label(subsets_axiom2) # label(axiom). [assumption].
% 0.80/1.08 17 -member(A,d) | member(A,a). [resolve(5,a,2,a)].
% 0.80/1.08 25 member(member_of_1_not_of_2(d,a),d). [resolve(11,a,12,a)].
% 0.80/1.08 26 -member(member_of_1_not_of_2(d,a),a). [resolve(13,b,11,a)].
% 0.80/1.08 46 $F. [resolve(25,a,17,a),unit_del(a,26)].
% 0.80/1.08
% 0.80/1.08 % SZS output end Refutation
% 0.80/1.08 ============================== end of proof ==========================
% 0.80/1.08
% 0.80/1.08 ============================== STATISTICS ============================
% 0.80/1.08
% 0.80/1.08 Given=11. Generated=86. Kept=31. proofs=1.
% 0.80/1.08 Usable=11. Sos=10. Demods=0. Limbo=10, Disabled=28. Hints=0.
% 0.80/1.08 Megabytes=0.05.
% 0.80/1.08 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.80/1.08
% 0.80/1.08 ============================== end of statistics =====================
% 0.80/1.08
% 0.80/1.08 ============================== end of search =========================
% 0.80/1.08
% 0.80/1.08 THEOREM PROVED
% 0.80/1.08 % SZS status Unsatisfiable
% 0.80/1.08
% 0.80/1.08 Exiting with 1 proof.
% 0.80/1.08
% 0.80/1.08 Process 13634 exit (max_proofs) Sun Jul 10 04:33:41 2022
% 0.80/1.08 Prover9 interrupted
%------------------------------------------------------------------------------