TSTP Solution File: SET014-4 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SET014-4 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n011.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:41 EDT 2022
% Result : Unsatisfiable 6.71s 7.03s
% Output : Refutation 6.71s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11 % Problem : SET014-4 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.10/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n011.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Sun Jul 10 06:57:11 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.12/1.41 ============================== Prover9 ===============================
% 1.12/1.41 Prover9 (32) version 2009-11A, November 2009.
% 1.12/1.41 Process 26061 was started by sandbox on n011.cluster.edu,
% 1.12/1.41 Sun Jul 10 06:57:12 2022
% 1.12/1.41 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_25908_n011.cluster.edu".
% 1.12/1.41 ============================== end of head ===========================
% 1.12/1.41
% 1.12/1.41 ============================== INPUT =================================
% 1.12/1.41
% 1.12/1.41 % Reading from file /tmp/Prover9_25908_n011.cluster.edu
% 1.12/1.41
% 1.12/1.41 set(prolog_style_variables).
% 1.12/1.41 set(auto2).
% 1.12/1.41 % set(auto2) -> set(auto).
% 1.12/1.41 % set(auto) -> set(auto_inference).
% 1.12/1.41 % set(auto) -> set(auto_setup).
% 1.12/1.41 % set(auto_setup) -> set(predicate_elim).
% 1.12/1.41 % set(auto_setup) -> assign(eq_defs, unfold).
% 1.12/1.41 % set(auto) -> set(auto_limits).
% 1.12/1.41 % set(auto_limits) -> assign(max_weight, "100.000").
% 1.12/1.41 % set(auto_limits) -> assign(sos_limit, 20000).
% 1.12/1.41 % set(auto) -> set(auto_denials).
% 1.12/1.41 % set(auto) -> set(auto_process).
% 1.12/1.41 % set(auto2) -> assign(new_constants, 1).
% 1.12/1.41 % set(auto2) -> assign(fold_denial_max, 3).
% 1.12/1.41 % set(auto2) -> assign(max_weight, "200.000").
% 1.12/1.41 % set(auto2) -> assign(max_hours, 1).
% 1.12/1.41 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 1.12/1.41 % set(auto2) -> assign(max_seconds, 0).
% 1.12/1.41 % set(auto2) -> assign(max_minutes, 5).
% 1.12/1.41 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 1.12/1.41 % set(auto2) -> set(sort_initial_sos).
% 1.12/1.41 % set(auto2) -> assign(sos_limit, -1).
% 1.12/1.41 % set(auto2) -> assign(lrs_ticks, 3000).
% 1.12/1.41 % set(auto2) -> assign(max_megs, 400).
% 1.12/1.41 % set(auto2) -> assign(stats, some).
% 1.12/1.41 % set(auto2) -> clear(echo_input).
% 1.12/1.41 % set(auto2) -> set(quiet).
% 1.12/1.41 % set(auto2) -> clear(print_initial_clauses).
% 1.12/1.41 % set(auto2) -> clear(print_given).
% 1.12/1.41 assign(lrs_ticks,-1).
% 1.12/1.41 assign(sos_limit,10000).
% 1.12/1.41 assign(order,kbo).
% 1.12/1.41 set(lex_order_vars).
% 1.12/1.41 clear(print_given).
% 1.12/1.41
% 1.12/1.41 % formulas(sos). % not echoed (18 formulas)
% 1.12/1.41
% 1.12/1.41 ============================== end of input ==========================
% 1.12/1.41
% 1.12/1.41 % From the command line: assign(max_seconds, 300).
% 1.12/1.41
% 1.12/1.41 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 1.12/1.41
% 1.12/1.41 % Formulas that are not ordinary clauses:
% 1.12/1.41
% 1.12/1.41 ============================== end of process non-clausal formulas ===
% 1.12/1.41
% 1.12/1.41 ============================== PROCESS INITIAL CLAUSES ===============
% 1.12/1.41
% 1.12/1.41 ============================== PREDICATE ELIMINATION =================
% 1.12/1.41 1 member(A,universal_set) | -little_set(A) # label(universal_set) # label(axiom). [assumption].
% 1.12/1.41 2 little_set(f1(A,B)) | A = B # label(extensionality1) # label(axiom). [assumption].
% 1.12/1.41 3 -member(A,B) | little_set(A) # label(a2) # label(axiom). [assumption].
% 1.12/1.41 Derived: member(f1(A,B),universal_set) | A = B. [resolve(1,b,2,a)].
% 1.12/1.41 Derived: member(A,universal_set) | -member(A,B). [resolve(1,b,3,b)].
% 1.12/1.41 4 member(A,complement(B)) | -little_set(A) | member(A,B) # label(complement2) # label(axiom). [assumption].
% 1.12/1.41 Derived: member(f1(A,B),complement(C)) | member(f1(A,B),C) | A = B. [resolve(4,b,2,a)].
% 1.12/1.41 Derived: member(A,complement(B)) | member(A,B) | -member(A,C). [resolve(4,b,3,b)].
% 1.12/1.41
% 1.12/1.41 ============================== end predicate elimination =============
% 1.12/1.41
% 1.12/1.41 Auto_denials: (non-Horn, no changes).
% 1.12/1.41
% 1.12/1.41 Term ordering decisions:
% 1.12/1.41
% 1.12/1.41 % Assigning unary symbol complement kb_weight 0 and highest precedence (13).
% 1.12/1.41 Function symbol KB weights: cs=1. universal_set=1. as=1. bs=1. empty_set=1. f1=1. intersection=1. f17=1. union=1. complement=0.
% 1.12/1.41
% 1.12/1.41 ============================== end of process initial clauses ========
% 1.12/1.41
% 1.12/1.41 ============================== CLAUSES FOR SEARCH ====================
% 1.12/1.41
% 1.12/1.41 ============================== end of clauses for search =============
% 1.12/1.41
% 1.12/1.41 ============================== SEARCH ================================
% 1.12/1.41
% 1.12/1.41 % Starting search at 0.01 seconds.
% 1.12/1.41
% 1.12/1.41 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 44 (0.00 of 0.22 sec).
% 1.12/1.41
% 1.12/1.41 Low Water (keep): wt=31.000, iters=3333
% 1.12/1.41
% 1.12/1.41 Low Water (keep): wt=29.000, iters=3334
% 1.12/1.41
% 1.12/1.41 Low Water (keep): wt=27.000, iters=3336
% 1.12/1.41
% 1.12/1.41 Low Water (keep): wt=25.000, iters=3337
% 1.12/1.41
% 1.12/1.41 Low Water (keep): wt=24.000, iters=3342
% 1.12/1.41
% 1.12/1.41 Low Water (keep): wt=23.000, iters=3425
% 1.12/1.41
% 1.12/1.41 Low Water (keep): wt=22.000, iters=3344
% 1.12/1.41
% 1.12/1.41 Low Water (keep): wt=21.000, iters=3336
% 6.71/7.03
% 6.71/7.03 Low Water (keep): wt=20.000, iters=3339
% 6.71/7.03
% 6.71/7.03 Low Water (keep): wt=19.000, iters=3337
% 6.71/7.03
% 6.71/7.03 Low Water (keep): wt=18.000, iters=3339
% 6.71/7.03
% 6.71/7.03 Low Water (keep): wt=17.000, iters=3407
% 6.71/7.03
% 6.71/7.03 Low Water (keep): wt=16.000, iters=3334
% 6.71/7.03
% 6.71/7.03 ============================== PROOF =================================
% 6.71/7.03 % SZS status Unsatisfiable
% 6.71/7.03 % SZS output start Refutation
% 6.71/7.03
% 6.71/7.03 % Proof 1 at 5.83 (+ 0.23) seconds.
% 6.71/7.03 % Length of proof is 22.
% 6.71/7.03 % Level of proof is 6.
% 6.71/7.03 % Maximum clause weight is 33.000.
% 6.71/7.03 % Given clauses 6692.
% 6.71/7.03
% 6.71/7.03 3 -member(A,B) | little_set(A) # label(a2) # label(axiom). [assumption].
% 6.71/7.03 4 member(A,complement(B)) | -little_set(A) | member(A,B) # label(complement2) # label(axiom). [assumption].
% 6.71/7.03 5 subset(as,cs) # label(a_subset_of_c) # label(hypothesis). [assumption].
% 6.71/7.03 6 subset(bs,cs) # label(b_subset_of_c) # label(hypothesis). [assumption].
% 6.71/7.03 7 subset(A,B) | member(f17(A,B),A) # label(subset2) # label(axiom). [assumption].
% 6.71/7.03 8 union(A,B) = complement(intersection(complement(A),complement(B))) # label(union) # label(axiom). [assumption].
% 6.71/7.03 11 -subset(union(as,bs),cs) # label(prove_a_union_b_subset_of_c) # label(negated_conjecture). [assumption].
% 6.71/7.03 12 -subset(complement(intersection(complement(as),complement(bs))),cs). [copy(11),rewrite([8(3)])].
% 6.71/7.03 13 -member(A,complement(B)) | -member(A,B) # label(complement1) # label(axiom). [assumption].
% 6.71/7.03 16 subset(A,B) | -member(f17(A,B),B) # label(subset3) # label(axiom). [assumption].
% 6.71/7.03 17 -subset(A,B) | -member(C,A) | member(C,B) # label(subset1) # label(axiom). [assumption].
% 6.71/7.03 18 member(A,intersection(B,C)) | -member(A,B) | -member(A,C) # label(intersection3) # label(axiom). [assumption].
% 6.71/7.03 23 member(A,complement(B)) | member(A,B) | -member(A,C). [resolve(4,b,3,b)].
% 6.71/7.03 27 member(f17(complement(intersection(complement(as),complement(bs))),cs),complement(intersection(complement(as),complement(bs)))). [resolve(12,a,7,a)].
% 6.71/7.03 40 -member(f17(complement(intersection(complement(as),complement(bs))),cs),cs). [ur(16,a,12,a)].
% 6.71/7.03 76 -member(f17(complement(intersection(complement(as),complement(bs))),cs),bs). [ur(17,a,6,a,c,40,a)].
% 6.71/7.03 77 -member(f17(complement(intersection(complement(as),complement(bs))),cs),as). [ur(17,a,5,a,c,40,a)].
% 6.71/7.03 118 member(f17(complement(intersection(complement(as),complement(bs))),cs),complement(A)) | member(f17(complement(intersection(complement(as),complement(bs))),cs),A). [resolve(27,a,23,c)].
% 6.71/7.03 122 -member(f17(complement(intersection(complement(as),complement(bs))),cs),intersection(complement(as),complement(bs))). [resolve(27,a,13,a)].
% 6.71/7.03 2521 member(f17(complement(intersection(complement(as),complement(bs))),cs),A) | member(f17(complement(intersection(complement(as),complement(bs))),cs),intersection(B,complement(A))) | -member(f17(complement(intersection(complement(as),complement(bs))),cs),B). [resolve(118,a,18,c)].
% 6.71/7.03 24018 -member(f17(complement(intersection(complement(as),complement(bs))),cs),complement(as)). [ur(2521,a,76,a,b,122,a)].
% 6.71/7.03 24026 $F. [resolve(24018,a,118,a),unit_del(a,77)].
% 6.71/7.03
% 6.71/7.03 % SZS output end Refutation
% 6.71/7.03 ============================== end of proof ==========================
% 6.71/7.03
% 6.71/7.03 ============================== STATISTICS ============================
% 6.71/7.03
% 6.71/7.03 Given=6692. Generated=401715. Kept=24020. proofs=1.
% 6.71/7.03 Usable=4652. Sos=8236. Demods=47. Limbo=2, Disabled=11152. Hints=0.
% 6.71/7.03 Megabytes=14.47.
% 6.71/7.03 User_CPU=5.83, System_CPU=0.23, Wall_clock=6.
% 6.71/7.03
% 6.71/7.03 ============================== end of statistics =====================
% 6.71/7.03
% 6.71/7.03 ============================== end of search =========================
% 6.71/7.03
% 6.71/7.03 THEOREM PROVED
% 6.71/7.03 % SZS status Unsatisfiable
% 6.71/7.03
% 6.71/7.03 Exiting with 1 proof.
% 6.71/7.03
% 6.71/7.03 Process 26061 exit (max_proofs) Sun Jul 10 06:57:18 2022
% 6.71/7.03 Prover9 interrupted
%------------------------------------------------------------------------------