TSTP Solution File: SET625+3 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SET625+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n017.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:30:55 EDT 2022
% Result : Theorem 0.46s 1.01s
% Output : Refutation 0.46s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SET625+3 : TPTP v8.1.0. Released v2.2.0.
% 0.04/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n017.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sun Jul 10 10:38:32 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.46/1.00 ============================== Prover9 ===============================
% 0.46/1.00 Prover9 (32) version 2009-11A, November 2009.
% 0.46/1.00 Process 3851 was started by sandbox2 on n017.cluster.edu,
% 0.46/1.00 Sun Jul 10 10:38:33 2022
% 0.46/1.00 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_3696_n017.cluster.edu".
% 0.46/1.00 ============================== end of head ===========================
% 0.46/1.00
% 0.46/1.00 ============================== INPUT =================================
% 0.46/1.00
% 0.46/1.00 % Reading from file /tmp/Prover9_3696_n017.cluster.edu
% 0.46/1.00
% 0.46/1.00 set(prolog_style_variables).
% 0.46/1.00 set(auto2).
% 0.46/1.00 % set(auto2) -> set(auto).
% 0.46/1.00 % set(auto) -> set(auto_inference).
% 0.46/1.00 % set(auto) -> set(auto_setup).
% 0.46/1.00 % set(auto_setup) -> set(predicate_elim).
% 0.46/1.00 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.46/1.00 % set(auto) -> set(auto_limits).
% 0.46/1.00 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.46/1.00 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.46/1.00 % set(auto) -> set(auto_denials).
% 0.46/1.00 % set(auto) -> set(auto_process).
% 0.46/1.00 % set(auto2) -> assign(new_constants, 1).
% 0.46/1.00 % set(auto2) -> assign(fold_denial_max, 3).
% 0.46/1.00 % set(auto2) -> assign(max_weight, "200.000").
% 0.46/1.00 % set(auto2) -> assign(max_hours, 1).
% 0.46/1.00 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.46/1.00 % set(auto2) -> assign(max_seconds, 0).
% 0.46/1.00 % set(auto2) -> assign(max_minutes, 5).
% 0.46/1.00 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.46/1.00 % set(auto2) -> set(sort_initial_sos).
% 0.46/1.00 % set(auto2) -> assign(sos_limit, -1).
% 0.46/1.00 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.46/1.00 % set(auto2) -> assign(max_megs, 400).
% 0.46/1.00 % set(auto2) -> assign(stats, some).
% 0.46/1.00 % set(auto2) -> clear(echo_input).
% 0.46/1.00 % set(auto2) -> set(quiet).
% 0.46/1.00 % set(auto2) -> clear(print_initial_clauses).
% 0.46/1.00 % set(auto2) -> clear(print_given).
% 0.46/1.00 assign(lrs_ticks,-1).
% 0.46/1.00 assign(sos_limit,10000).
% 0.46/1.00 assign(order,kbo).
% 0.46/1.00 set(lex_order_vars).
% 0.46/1.00 clear(print_given).
% 0.46/1.00
% 0.46/1.00 % formulas(sos). % not echoed (5 formulas)
% 0.46/1.00
% 0.46/1.00 ============================== end of input ==========================
% 0.46/1.00
% 0.46/1.00 % From the command line: assign(max_seconds, 300).
% 0.46/1.00
% 0.46/1.00 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.46/1.00
% 0.46/1.00 % Formulas that are not ordinary clauses:
% 0.46/1.00 1 (all B all C (intersect(B,C) <-> (exists D (member(D,B) & member(D,C))))) # label(intersect_defn) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.00 2 (all B all C (subset(B,C) <-> (all D (member(D,B) -> member(D,C))))) # label(subset_defn) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.00 3 (all B all C (intersect(B,C) -> intersect(C,B))) # label(symmetry_of_intersect) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.00 4 (all B subset(B,B)) # label(reflexivity_of_subset) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.00 5 -(all B all C all D (intersect(B,C) & subset(C,D) -> intersect(B,D))) # label(prove_th101) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.46/1.00
% 0.46/1.00 ============================== end of process non-clausal formulas ===
% 0.46/1.00
% 0.46/1.00 ============================== PROCESS INITIAL CLAUSES ===============
% 0.46/1.00
% 0.46/1.00 ============================== PREDICATE ELIMINATION =================
% 0.46/1.00 6 -subset(A,B) | -member(C,A) | member(C,B) # label(subset_defn) # label(axiom). [clausify(2)].
% 0.46/1.00 7 subset(A,A) # label(reflexivity_of_subset) # label(axiom). [clausify(4)].
% 0.46/1.00 8 subset(c2,c3) # label(prove_th101) # label(negated_conjecture). [clausify(5)].
% 0.46/1.00 9 subset(A,B) | member(f2(A,B),A) # label(subset_defn) # label(axiom). [clausify(2)].
% 0.46/1.00 10 subset(A,B) | -member(f2(A,B),B) # label(subset_defn) # label(axiom). [clausify(2)].
% 0.46/1.00 Derived: -member(A,c2) | member(A,c3). [resolve(6,a,8,a)].
% 0.46/1.00 Derived: -member(A,B) | member(A,C) | member(f2(B,C),B). [resolve(6,a,9,a)].
% 0.46/1.00 Derived: -member(A,B) | member(A,C) | -member(f2(B,C),C). [resolve(6,a,10,a)].
% 0.46/1.00
% 0.46/1.00 ============================== end predicate elimination =============
% 0.46/1.00
% 0.46/1.00 Auto_denials: (non-Horn, no changes).
% 0.46/1.00
% 0.46/1.00 Term ordering decisions:
% 0.46/1.00 Function symbol KB weights: c1=1. c2=1. c3=1. f1=1. f2=1.
% 0.46/1.00
% 0.46/1.00 ============================== end of process initial clauses ========
% 0.46/1.00
% 0.46/1.00 ============================== CLAUSES FOR SEARCH ====================
% 0.46/1.00
% 0.46/1.00 ============================== end of clauses for search =============
% 0.46/1.01
% 0.46/1.01 ============================== SEARCH ================================
% 0.46/1.01
% 0.46/1.01 % Starting search at 0.01 seconds.
% 0.46/1.01
% 0.46/1.01 ============================== PROOF =================================
% 0.46/1.01 % SZS status Theorem
% 0.46/1.01 % SZS output start Refutation
% 0.46/1.01
% 0.46/1.01 % Proof 1 at 0.01 (+ 0.00) seconds.
% 0.46/1.01 % Length of proof is 18.
% 0.46/1.01 % Level of proof is 4.
% 0.46/1.01 % Maximum clause weight is 9.000.
% 0.46/1.01 % Given clauses 15.
% 0.46/1.01
% 0.46/1.01 1 (all B all C (intersect(B,C) <-> (exists D (member(D,B) & member(D,C))))) # label(intersect_defn) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.01 2 (all B all C (subset(B,C) <-> (all D (member(D,B) -> member(D,C))))) # label(subset_defn) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.01 3 (all B all C (intersect(B,C) -> intersect(C,B))) # label(symmetry_of_intersect) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.01 5 -(all B all C all D (intersect(B,C) & subset(C,D) -> intersect(B,D))) # label(prove_th101) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.46/1.01 6 -subset(A,B) | -member(C,A) | member(C,B) # label(subset_defn) # label(axiom). [clausify(2)].
% 0.46/1.01 8 subset(c2,c3) # label(prove_th101) # label(negated_conjecture). [clausify(5)].
% 0.46/1.01 11 intersect(c1,c2) # label(prove_th101) # label(negated_conjecture). [clausify(5)].
% 0.46/1.01 12 -intersect(c1,c3) # label(prove_th101) # label(negated_conjecture). [clausify(5)].
% 0.46/1.01 13 -intersect(A,B) | intersect(B,A) # label(symmetry_of_intersect) # label(axiom). [clausify(3)].
% 0.46/1.01 14 -intersect(A,B) | member(f1(A,B),A) # label(intersect_defn) # label(axiom). [clausify(1)].
% 0.46/1.01 15 -intersect(A,B) | member(f1(A,B),B) # label(intersect_defn) # label(axiom). [clausify(1)].
% 0.46/1.01 16 intersect(A,B) | -member(C,A) | -member(C,B) # label(intersect_defn) # label(axiom). [clausify(1)].
% 0.46/1.01 17 -member(A,c2) | member(A,c3). [resolve(6,a,8,a)].
% 0.46/1.01 22 -intersect(c3,c1). [ur(13,b,12,a)].
% 0.46/1.01 23 member(f1(c1,c2),c1). [resolve(14,a,11,a)].
% 0.46/1.01 24 member(f1(c1,c2),c2). [resolve(15,a,11,a)].
% 0.46/1.01 32 -member(f1(c1,c2),c3). [ur(16,a,22,a,c,23,a)].
% 0.46/1.01 37 $F. [resolve(24,a,17,a),unit_del(a,32)].
% 0.46/1.01
% 0.46/1.01 % SZS output end Refutation
% 0.46/1.01 ============================== end of proof ==========================
% 0.46/1.01
% 0.46/1.01 ============================== STATISTICS ============================
% 0.46/1.01
% 0.46/1.01 Given=15. Generated=34. Kept=26. proofs=1.
% 0.46/1.01 Usable=15. Sos=8. Demods=0. Limbo=3, Disabled=14. Hints=0.
% 0.46/1.01 Megabytes=0.04.
% 0.46/1.01 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.46/1.01
% 0.46/1.01 ============================== end of statistics =====================
% 0.46/1.01
% 0.46/1.01 ============================== end of search =========================
% 0.46/1.01
% 0.46/1.01 THEOREM PROVED
% 0.46/1.01 % SZS status Theorem
% 0.46/1.01
% 0.46/1.01 Exiting with 1 proof.
% 0.46/1.01
% 0.46/1.01 Process 3851 exit (max_proofs) Sun Jul 10 10:38:33 2022
% 0.46/1.01 Prover9 interrupted
%------------------------------------------------------------------------------