TSTP Solution File: SEU120+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SEU120+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n021.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 13:29:06 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 : SEU120+1 : TPTP v8.1.0. Released v3.3.0.
% 0.13/0.13 % Command : tptp2X_and_run_prover9 %d %s
% 0.13/0.35 % Computer : n021.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % 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 Jun 19 23:33:48 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.46/1.01 ============================== Prover9 ===============================
% 0.46/1.01 Prover9 (32) version 2009-11A, November 2009.
% 0.46/1.01 Process 22328 was started by sandbox on n021.cluster.edu,
% 0.46/1.01 Sun Jun 19 23:33:48 2022
% 0.46/1.01 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_22175_n021.cluster.edu".
% 0.46/1.01 ============================== end of head ===========================
% 0.46/1.01
% 0.46/1.01 ============================== INPUT =================================
% 0.46/1.01
% 0.46/1.01 % Reading from file /tmp/Prover9_22175_n021.cluster.edu
% 0.46/1.01
% 0.46/1.01 set(prolog_style_variables).
% 0.46/1.01 set(auto2).
% 0.46/1.01 % set(auto2) -> set(auto).
% 0.46/1.01 % set(auto) -> set(auto_inference).
% 0.46/1.01 % set(auto) -> set(auto_setup).
% 0.46/1.01 % set(auto_setup) -> set(predicate_elim).
% 0.46/1.01 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.46/1.01 % set(auto) -> set(auto_limits).
% 0.46/1.01 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.46/1.01 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.46/1.01 % set(auto) -> set(auto_denials).
% 0.46/1.01 % set(auto) -> set(auto_process).
% 0.46/1.01 % set(auto2) -> assign(new_constants, 1).
% 0.46/1.01 % set(auto2) -> assign(fold_denial_max, 3).
% 0.46/1.01 % set(auto2) -> assign(max_weight, "200.000").
% 0.46/1.01 % set(auto2) -> assign(max_hours, 1).
% 0.46/1.01 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.46/1.01 % set(auto2) -> assign(max_seconds, 0).
% 0.46/1.01 % set(auto2) -> assign(max_minutes, 5).
% 0.46/1.01 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.46/1.01 % set(auto2) -> set(sort_initial_sos).
% 0.46/1.01 % set(auto2) -> assign(sos_limit, -1).
% 0.46/1.01 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.46/1.01 % set(auto2) -> assign(max_megs, 400).
% 0.46/1.01 % set(auto2) -> assign(stats, some).
% 0.46/1.01 % set(auto2) -> clear(echo_input).
% 0.46/1.01 % set(auto2) -> set(quiet).
% 0.46/1.01 % set(auto2) -> clear(print_initial_clauses).
% 0.46/1.01 % set(auto2) -> clear(print_given).
% 0.46/1.01 assign(lrs_ticks,-1).
% 0.46/1.01 assign(sos_limit,10000).
% 0.46/1.01 assign(order,kbo).
% 0.46/1.01 set(lex_order_vars).
% 0.46/1.01 clear(print_given).
% 0.46/1.01
% 0.46/1.01 % formulas(sos). % not echoed (12 formulas)
% 0.46/1.01
% 0.46/1.01 ============================== end of input ==========================
% 0.46/1.01
% 0.46/1.01 % From the command line: assign(max_seconds, 300).
% 0.46/1.01
% 0.46/1.01 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.46/1.01
% 0.46/1.01 % Formulas that are not ordinary clauses:
% 0.46/1.01 1 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.01 2 (all A all B set_intersection2(A,B) = set_intersection2(B,A)) # label(commutativity_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.01 3 (all A (A = empty_set <-> (all B -in(B,A)))) # label(d1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.01 4 (all A all B (disjoint(A,B) <-> set_intersection2(A,B) = empty_set)) # label(d7_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.01 5 $T # label(dt_k1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.01 6 $T # label(dt_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.01 7 (all A all B set_intersection2(A,A) = A) # label(idempotence_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.01 8 (exists A empty(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.01 9 (exists A -empty(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.01 10 (all A all B (disjoint(A,B) -> disjoint(B,A))) # label(symmetry_r1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.01 11 -(all A all B (-(-disjoint(A,B) & (all C -in(C,set_intersection2(A,B)))) & -((exists C in(C,set_intersection2(A,B))) & disjoint(A,B)))) # label(t4_xboole_0) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.46/1.01
% 0.46/1.01 ============================== end of process non-clausal formulas ===
% 0.46/1.01
% 0.46/1.01 ============================== PROCESS INITIAL CLAUSES ===============
% 0.46/1.01
% 0.46/1.01 ============================== PREDICATE ELIMINATION =================
% 0.46/1.01
% 0.46/1.01 ============================== end predicate elimination =============
% 0.46/1.01
% 0.46/1.01 Auto_denials: (non-Horn, no changes).
% 0.46/1.01
% 0.46/1.01 Term ordering decisions:
% 0.46/1.01
% 0.46/1.01 % Assigning unary symbol f1 kb_weight 0 and highest precedence (12).
% 0.46/1.01 Function symbol KB weights: empty_set=1. c1=1. c2=1. c3=1. c4=1. c5=1. set_intersection2=1. f1=0.
% 0.46/1.01
% 0.46/1.01 ============================== end of process initial clauses ========
% 0.46/1.01
% 0.46/1.01 ============================== CLAUSES FOR SEARCH ====================
% 0.46/1.01
% 0.46/1.01 ============================== 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 16.
% 0.46/1.01 % Level of proof is 5.
% 0.46/1.01 % Maximum clause weight is 8.000.
% 0.46/1.01 % Given clauses 21.
% 0.46/1.01
% 0.46/1.01 3 (all A (A = empty_set <-> (all B -in(B,A)))) # label(d1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.01 4 (all A all B (disjoint(A,B) <-> set_intersection2(A,B) = empty_set)) # label(d7_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.01 7 (all A all B set_intersection2(A,A) = A) # label(idempotence_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.46/1.01 11 -(all A all B (-(-disjoint(A,B) & (all C -in(C,set_intersection2(A,B)))) & -((exists C in(C,set_intersection2(A,B))) & disjoint(A,B)))) # label(t4_xboole_0) # label(negated_conjecture) # label(non_clause). [assumption].
% 0.46/1.01 14 set_intersection2(A,A) = A # label(idempotence_k3_xboole_0) # label(axiom). [clausify(7)].
% 0.46/1.01 16 empty_set = A | in(f1(A),A) # label(d1_xboole_0) # label(axiom). [clausify(3)].
% 0.46/1.01 19 empty_set != A | -in(B,A) # label(d1_xboole_0) # label(axiom). [clausify(3)].
% 0.46/1.01 21 -disjoint(A,B) | set_intersection2(A,B) = empty_set # label(d7_xboole_0) # label(axiom). [clausify(4)].
% 0.46/1.01 22 disjoint(A,B) | set_intersection2(A,B) != empty_set # label(d7_xboole_0) # label(axiom). [clausify(4)].
% 0.46/1.01 23 -disjoint(c3,c4) | in(c5,set_intersection2(c3,c4)) # label(t4_xboole_0) # label(negated_conjecture). [clausify(11)].
% 0.46/1.01 24 -in(A,set_intersection2(c3,c4)) | disjoint(c3,c4) # label(t4_xboole_0) # label(negated_conjecture). [clausify(11)].
% 0.46/1.01 28 -in(A,empty_set). [ur(19,a,14,a(flip)),rewrite([14(3)])].
% 0.46/1.01 31 disjoint(c3,c4) | set_intersection2(c3,c4) = empty_set. [resolve(24,a,16,b),flip(b)].
% 0.46/1.01 33 set_intersection2(c3,c4) = empty_set. [resolve(31,a,21,a),merge(b)].
% 0.46/1.01 34 -disjoint(c3,c4). [back_rewrite(23),rewrite([33(7)]),unit_del(b,28)].
% 0.46/1.01 35 $F. [resolve(33,a,22,b),unit_del(a,34)].
% 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=21. Generated=45. Kept=23. proofs=1.
% 0.46/1.01 Usable=17. Sos=1. Demods=3. Limbo=0, Disabled=19. Hints=0.
% 0.46/1.01 Megabytes=0.05.
% 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 22328 exit (max_proofs) Sun Jun 19 23:33:48 2022
% 0.46/1.01 Prover9 interrupted
%------------------------------------------------------------------------------