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