TSTP Solution File: SEV436-1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SEV436-1 : TPTP v8.1.0. Released v6.4.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n008.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 17:59:53 EDT 2022
% Result : Unknown 0.47s 1.02s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : SEV436-1 : TPTP v8.1.0. Released v6.4.0.
% 0.07/0.14 % Command : tptp2X_and_run_prover9 %d %s
% 0.15/0.35 % Computer : n008.cluster.edu
% 0.15/0.35 % Model : x86_64 x86_64
% 0.15/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35 % Memory : 8042.1875MB
% 0.15/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35 % CPULimit : 300
% 0.15/0.35 % WCLimit : 600
% 0.15/0.35 % DateTime : Tue Jun 28 09:33:53 EDT 2022
% 0.15/0.35 % CPUTime :
% 0.47/1.01 ============================== Prover9 ===============================
% 0.47/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.47/1.01 Process 12382 was started by sandbox on n008.cluster.edu,
% 0.47/1.01 Tue Jun 28 09:33:53 2022
% 0.47/1.01 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_12229_n008.cluster.edu".
% 0.47/1.01 ============================== end of head ===========================
% 0.47/1.01
% 0.47/1.01 ============================== INPUT =================================
% 0.47/1.01
% 0.47/1.01 % Reading from file /tmp/Prover9_12229_n008.cluster.edu
% 0.47/1.01
% 0.47/1.01 set(prolog_style_variables).
% 0.47/1.01 set(auto2).
% 0.47/1.01 % set(auto2) -> set(auto).
% 0.47/1.01 % set(auto) -> set(auto_inference).
% 0.47/1.01 % set(auto) -> set(auto_setup).
% 0.47/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.47/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.47/1.01 % set(auto) -> set(auto_limits).
% 0.47/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.47/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.47/1.01 % set(auto) -> set(auto_denials).
% 0.47/1.01 % set(auto) -> set(auto_process).
% 0.47/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.47/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.47/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.47/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.47/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.47/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.47/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.47/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.47/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.47/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.47/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.47/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.47/1.01 % set(auto2) -> assign(stats, some).
% 0.47/1.01 % set(auto2) -> clear(echo_input).
% 0.47/1.01 % set(auto2) -> set(quiet).
% 0.47/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.47/1.01 % set(auto2) -> clear(print_given).
% 0.47/1.01 assign(lrs_ticks,-1).
% 0.47/1.01 assign(sos_limit,10000).
% 0.47/1.01 assign(order,kbo).
% 0.47/1.01 set(lex_order_vars).
% 0.47/1.01 clear(print_given).
% 0.47/1.01
% 0.47/1.01 % formulas(sos). % not echoed (24 formulas)
% 0.47/1.01
% 0.47/1.01 ============================== end of input ==========================
% 0.47/1.01
% 0.47/1.01 % From the command line: assign(max_seconds, 300).
% 0.47/1.01
% 0.47/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.47/1.01
% 0.47/1.01 % Formulas that are not ordinary clauses:
% 0.47/1.01
% 0.47/1.01 ============================== end of process non-clausal formulas ===
% 0.47/1.01
% 0.47/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.47/1.01
% 0.47/1.01 ============================== PREDICATE ELIMINATION =================
% 0.47/1.01 1 -intersection(A,B,C) | -member(D,C) | member(D,A) # label(member_of_intersection_is_member_of_set1) # label(axiom). [assumption].
% 0.47/1.01 2 member(h(A,B,C),C) | intersection(A,B,C) | member(h(A,B,C),A) # label(intersection_axiom1) # label(axiom). [assumption].
% 0.47/1.01 3 member(h(A,B,C),C) | intersection(A,B,C) | member(h(A,B,C),B) # label(intersection_axiom2) # label(axiom). [assumption].
% 0.47/1.01 Derived: -member(A,B) | member(A,C) | member(h(C,D,B),B) | member(h(C,D,B),C). [resolve(1,a,2,b)].
% 0.47/1.01 Derived: -member(A,B) | member(A,C) | member(h(C,D,B),B) | member(h(C,D,B),D). [resolve(1,a,3,b)].
% 0.47/1.01 4 -intersection(A,B,C) | -member(D,C) | member(D,B) # label(member_of_intersection_is_member_of_set2) # label(axiom). [assumption].
% 0.47/1.01 Derived: -member(A,B) | member(A,C) | member(h(D,C,B),B) | member(h(D,C,B),D). [resolve(4,a,2,b)].
% 0.47/1.01 Derived: -member(A,B) | member(A,C) | member(h(D,C,B),B) | member(h(D,C,B),C). [resolve(4,a,3,b)].
% 0.47/1.01 5 -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.47/1.01 Derived: -member(A,B) | -member(A,C) | member(A,D) | member(h(C,B,D),D) | member(h(C,B,D),C). [resolve(5,a,2,b)].
% 0.47/1.01 Derived: -member(A,B) | -member(A,C) | member(A,D) | member(h(C,B,D),D) | member(h(C,B,D),B). [resolve(5,a,3,b)].
% 0.47/1.01 6 -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.47/1.01 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(6,d,1,a)].
% 0.47/1.01 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(6,d,4,a)].
% 0.47/1.01 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(6,d,5,a)].
% 0.47/1.01 7 -member(A,B) | -member(A,C) | -difference(D,B,C) # label(not_member_of_difference) # label(axiom). [assumption].
% 0.47/1.01 8 difference(A,B,C) | member(k(A,B,C),A) | member(k(A,B,C),C) # label(difference_axiom2) # label(axiom). [assumption].
% 0.47/1.01 Derived: -member(A,B) | -member(A,C) | member(k(D,B,C),D) | member(k(D,B,C),C). [resolve(7,c,8,a)].
% 0.47/1.01 9 -difference(A,B,C) | -member(D,C) | member(D,A) # label(member_of_difference) # label(axiom). [assumption].
% 0.47/1.01 Derived: -member(A,B) | member(A,C) | member(k(C,D,B),C) | member(k(C,D,B),B). [resolve(9,a,8,a)].
% 0.47/1.01 10 -member(A,B) | -difference(B,C,D) | member(A,D) | member(A,C) # label(member_of_difference_or_set2) # label(axiom). [assumption].
% 0.47/1.01 Derived: -member(A,B) | member(A,C) | member(A,D) | member(k(B,D,C),B) | member(k(B,D,C),C). [resolve(10,b,8,a)].
% 0.47/1.01 11 -member(k(A,B,C),B) | member(k(A,B,C),C) | difference(A,B,C) # label(difference_axiom1) # label(axiom). [assumption].
% 0.47/1.01 Derived: -member(k(A,B,C),B) | member(k(A,B,C),C) | -member(D,B) | -member(D,C). [resolve(11,c,7,c)].
% 0.47/1.01 Derived: -member(k(A,B,C),B) | member(k(A,B,C),C) | -member(D,C) | member(D,A). [resolve(11,c,9,a)].
% 0.47/1.01 Derived: -member(k(A,B,C),B) | member(k(A,B,C),C) | -member(D,A) | member(D,C) | member(D,B). [resolve(11,c,10,b)].
% 0.47/1.01 12 -member(k(A,B,C),C) | -member(k(A,B,C),A) | member(k(A,B,C),B) | difference(A,B,C) # label(difference_axiom3) # label(axiom). [assumption].
% 0.47/1.01 Derived: -member(k(A,B,C),C) | -member(k(A,B,C),A) | member(k(A,B,C),B) | -member(D,B) | -member(D,C). [resolve(12,d,7,c)].
% 0.47/1.01 Derived: -member(k(A,B,C),C) | -member(k(A,B,C),A) | member(k(A,B,C),B) | -member(D,C) | member(D,A). [resolve(12,d,9,a)].
% 0.47/1.01 Derived: -member(k(A,B,C),C) | -member(k(A,B,C),A) | member(k(A,B,C),B) | -member(D,A) | member(D,C) | member(D,B). [resolve(12,d,10,b)].
% 0.47/1.01 13 -union(A,B,C) | -member(D,A) | member(D,C) # label(member_of_set1_is_member_of_union) # label(axiom). [assumption].
% 0.47/1.01 14 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.47/1.01 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(13,a,14,a)].
% 0.47/1.01 15 -union(A,B,C) | -member(D,B) | member(D,C) # label(member_of_set2_is_member_of_union) # label(axiom). [assumption].
% 0.47/1.01 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(15,a,14,a)].
% 0.47/1.01 16 -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.47/1.01 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(16,a,14,a)].
% 0.47/1.01 17 -member(g(A,B,C),A) | -member(g(A,B,C),C) | union(A,B,C) # label(union_axiom2) # label(axiom). [assumption].
% 0.47/1.01 Derived: -member(g(A,B,C),A) | -member(g(A,B,C),C) | -member(D,A) | member(D,C). [resolve(17,c,13,a)].
% 0.47/1.01 Derived: -member(g(A,B,C),A) | -member(g(A,B,C),C) | -member(D,B) | member(D,C). [resolve(17,c,15,a)].
% 0.47/1.01 Derived: -member(g(A,B,C),A) | -member(g(A,B,C),C) | -member(D,C) | member(D,A) | member(D,B). [resolve(17,c,16,a)].
% 0.47/1.01 18 -member(g(A,B,C),B) | -member(g(A,B,C),C) | union(A,B,C) # label(union_axiom3) # label(axiom). [assumption].
% 0.47/1.01 Derived: -member(g(A,B,C),B) | -member(g(A,B,C),C) | -member(D,A) | member(D,C). [resolve(18,c,13,a)].
% 0.47/1.01 Derived: -member(g(A,B,C),B) | -member(g(A,B,C),C) | -member(D,B) | member(D,C). [resolve(18,c,15,a)].
% 0.47/1.01 Derived: -member(g(A,B,C),B) | -member(g(A,B,C),C) | -member(D,C) | member(D,A) | member(D,B). [resolve(18,c,16,a)].
% 0.47/1.01 19 -subset(A,B) | -subset(B,A) | equal_sets(B,A) # label(subsets_are_set_equal_sets) # label(axiom). [assumption].
% 0.47/1.01 20 -equal_sets(A,B) | subset(A,B) # label(set_equal_sets_are_subsets1) # label(axiom). [assumption].
% 0.47/1.01 21 -equal_sets(A,B) | subset(B,A) # label(set_equal_sets_are_subsets2) # label(axiom). [assumption].
% 0.47/1.01 22 -member(A,B) | -subset(B,C) | member(A,C) # label(membership_in_subsets) # label(axiom). [assumption].
% 0.47/1.01 23 subset(A,B) | member(member_of_1_not_of_2(A,B),A) # label(subsets_axiom1) # label(axiom). [assumption].
% 0.47/1.02 24 -member(member_of_1_not_of_2(A,B),B) | subset(A,B) # label(subsets_axiom2) # label(axiom). [assumption].
% 0.47/1.02 Derived: -member(A,B) | member(A,C) | member(member_of_1_not_of_2(B,C),B). [resolve(22,b,23,a)].
% 0.47/1.02 Derived: -member(A,B) | member(A,C) | -member(member_of_1_not_of_2(B,C),C). [resolve(22,b,24,b)].
% 0.47/1.02
% 0.47/1.02 ============================== end predicate elimination =============
% 0.47/1.02
% 0.47/1.02 Auto_denials: (non-Horn, no changes).
% 0.47/1.02
% 0.47/1.02 Term ordering decisions:
% 0.47/1.02 Function symbol KB weights: member_of_1_not_of_2=1. g=1. h=1. k=1.
% 0.47/1.02
% 0.47/1.02 ============================== end of process initial clauses ========
% 0.47/1.02
% 0.47/1.02 ============================== CLAUSES FOR SEARCH ====================
% 0.47/1.02
% 0.47/1.02 ============================== end of clauses for search =============
% 0.47/1.02
% 0.47/1.02 ============================== SEARCH ================================
% 0.47/1.02
% 0.47/1.02 % Starting search at 0.01 seconds.
% 0.47/1.02
% 0.47/1.02 ============================== STATISTICS ============================
% 0.47/1.02
% 0.47/1.02 Given=48. Generated=193. Kept=48. proofs=0.
% 0.47/1.02 Usable=48. Sos=0. Demods=0. Limbo=0, Disabled=53. Hints=0.
% 0.47/1.02 Megabytes=0.08.
% 0.47/1.02 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.47/1.02
% 0.47/1.02 ============================== end of statistics =====================
% 0.47/1.02
% 0.47/1.02 ============================== end of search =========================
% 0.47/1.02
% 0.47/1.02 SEARCH FAILED
% 0.47/1.02
% 0.47/1.02 Exiting with failure.
% 0.47/1.02
% 0.47/1.02 Process 12382 exit (sos_empty) Tue Jun 28 09:33:53 2022
% 0.47/1.02 Prover9 interrupted
%------------------------------------------------------------------------------