TSTP Solution File: SET574+3 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SET574+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n025.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:20 EDT 2022
% Result : Theorem 0.83s 1.08s
% Output : Refutation 0.83s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : SET574+3 : TPTP v8.1.0. Released v2.2.0.
% 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.34 % Computer : n025.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.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Sat Jul 9 23:29:16 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.83/1.08 ============================== Prover9 ===============================
% 0.83/1.08 Prover9 (32) version 2009-11A, November 2009.
% 0.83/1.08 Process 6923 was started by sandbox2 on n025.cluster.edu,
% 0.83/1.08 Sat Jul 9 23:29:17 2022
% 0.83/1.08 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_6661_n025.cluster.edu".
% 0.83/1.08 ============================== end of head ===========================
% 0.83/1.08
% 0.83/1.08 ============================== INPUT =================================
% 0.83/1.08
% 0.83/1.08 % Reading from file /tmp/Prover9_6661_n025.cluster.edu
% 0.83/1.08
% 0.83/1.08 set(prolog_style_variables).
% 0.83/1.08 set(auto2).
% 0.83/1.08 % set(auto2) -> set(auto).
% 0.83/1.08 % set(auto) -> set(auto_inference).
% 0.83/1.08 % set(auto) -> set(auto_setup).
% 0.83/1.08 % set(auto_setup) -> set(predicate_elim).
% 0.83/1.08 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.83/1.08 % set(auto) -> set(auto_limits).
% 0.83/1.08 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.83/1.08 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.83/1.08 % set(auto) -> set(auto_denials).
% 0.83/1.08 % set(auto) -> set(auto_process).
% 0.83/1.08 % set(auto2) -> assign(new_constants, 1).
% 0.83/1.08 % set(auto2) -> assign(fold_denial_max, 3).
% 0.83/1.08 % set(auto2) -> assign(max_weight, "200.000").
% 0.83/1.08 % set(auto2) -> assign(max_hours, 1).
% 0.83/1.08 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.83/1.08 % set(auto2) -> assign(max_seconds, 0).
% 0.83/1.08 % set(auto2) -> assign(max_minutes, 5).
% 0.83/1.08 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.83/1.08 % set(auto2) -> set(sort_initial_sos).
% 0.83/1.08 % set(auto2) -> assign(sos_limit, -1).
% 0.83/1.08 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.83/1.08 % set(auto2) -> assign(max_megs, 400).
% 0.83/1.08 % set(auto2) -> assign(stats, some).
% 0.83/1.08 % set(auto2) -> clear(echo_input).
% 0.83/1.08 % set(auto2) -> set(quiet).
% 0.83/1.08 % set(auto2) -> clear(print_initial_clauses).
% 0.83/1.08 % set(auto2) -> clear(print_given).
% 0.83/1.08 assign(lrs_ticks,-1).
% 0.83/1.08 assign(sos_limit,10000).
% 0.83/1.08 assign(order,kbo).
% 0.83/1.08 set(lex_order_vars).
% 0.83/1.08 clear(print_given).
% 0.83/1.08
% 0.83/1.08 % formulas(sos). % not echoed (3 formulas)
% 0.83/1.08
% 0.83/1.08 ============================== end of input ==========================
% 0.83/1.08
% 0.83/1.08 % From the command line: assign(max_seconds, 300).
% 0.83/1.08
% 0.83/1.08 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.83/1.08
% 0.83/1.08 % Formulas that are not ordinary clauses:
% 0.83/1.08 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.83/1.08 2 (all B all C (intersect(B,C) -> intersect(C,B))) # label(symmetry_of_intersect) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.08 3 -(all B all C all D (member(B,C) & member(B,D) -> intersect(C,D))) # label(prove_th13) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.83/1.08
% 0.83/1.08 ============================== end of process non-clausal formulas ===
% 0.83/1.08
% 0.83/1.08 ============================== PROCESS INITIAL CLAUSES ===============
% 0.83/1.08
% 0.83/1.08 ============================== PREDICATE ELIMINATION =================
% 0.83/1.08
% 0.83/1.08 ============================== end predicate elimination =============
% 0.83/1.08
% 0.83/1.08 Auto_denials:
% 0.83/1.08 % copying label prove_th13 to answer in negative clause
% 0.83/1.08
% 0.83/1.08 Term ordering decisions:
% 0.83/1.08 Function symbol KB weights: c1=1. c2=1. c3=1. f1=1.
% 0.83/1.08
% 0.83/1.08 ============================== end of process initial clauses ========
% 0.83/1.08
% 0.83/1.08 ============================== CLAUSES FOR SEARCH ====================
% 0.83/1.08
% 0.83/1.08 ============================== end of clauses for search =============
% 0.83/1.08
% 0.83/1.08 ============================== SEARCH ================================
% 0.83/1.08
% 0.83/1.08 % Starting search at 0.01 seconds.
% 0.83/1.08
% 0.83/1.08 ============================== PROOF =================================
% 0.83/1.08 % SZS status Theorem
% 0.83/1.08 % SZS output start Refutation
% 0.83/1.08
% 0.83/1.08 % Proof 1 at 0.01 (+ 0.00) seconds: prove_th13.
% 0.83/1.08 % Length of proof is 11.
% 0.83/1.08 % Level of proof is 3.
% 0.83/1.08 % Maximum clause weight is 9.000.
% 0.83/1.08 % Given clauses 7.
% 0.83/1.08
% 0.83/1.08 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.83/1.08 2 (all B all C (intersect(B,C) -> intersect(C,B))) # label(symmetry_of_intersect) # label(axiom) # label(non_clause). [assumption].
% 0.83/1.08 3 -(all B all C all D (member(B,C) & member(B,D) -> intersect(C,D))) # label(prove_th13) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.83/1.08 4 member(c1,c2) # label(prove_th13) # label(negated_conjecture). [clausify(3)].
% 0.83/1.08 5 member(c1,c3) # label(prove_th13) # label(negated_conjecture). [clausify(3)].
% 0.83/1.08 6 -intersect(c2,c3) # label(prove_th13) # label(negated_conjecture) # answer(prove_th13). [clausify(3)].
% 0.83/1.08 7 -intersect(A,B) | intersect(B,A) # label(symmetry_of_intersect) # label(axiom). [clausify(2)].
% 0.83/1.08 10 intersect(A,B) | -member(C,A) | -member(C,B) # label(intersect_defn) # label(axiom). [clausify(1)].
% 0.83/1.08 11 -intersect(c3,c2) # answer(prove_th13). [resolve(7,b,6,a)].
% 0.83/1.08 14 intersect(c3,c2). [ur(10,b,5,a,c,4,a)].
% 0.83/1.08 15 $F # answer(prove_th13). [resolve(14,a,11,a)].
% 0.83/1.08
% 0.83/1.08 % SZS output end Refutation
% 0.83/1.08 ============================== end of proof ==========================
% 0.83/1.08
% 0.83/1.08 ============================== STATISTICS ============================
% 0.83/1.08
% 0.83/1.08 Given=7. Generated=12. Kept=11. proofs=1.
% 0.83/1.08 Usable=7. Sos=1. Demods=0. Limbo=2, Disabled=7. Hints=0.
% 0.83/1.08 Megabytes=0.03.
% 0.83/1.08 User_CPU=0.01, System_CPU=0.00, Wall_clock=0.
% 0.83/1.08
% 0.83/1.08 ============================== end of statistics =====================
% 0.83/1.08
% 0.83/1.08 ============================== end of search =========================
% 0.83/1.08
% 0.83/1.08 THEOREM PROVED
% 0.83/1.08 % SZS status Theorem
% 0.83/1.08
% 0.83/1.08 Exiting with 1 proof.
% 0.83/1.08
% 0.83/1.08 Process 6923 exit (max_proofs) Sat Jul 9 23:29:17 2022
% 0.83/1.08 Prover9 interrupted
%------------------------------------------------------------------------------