TSTP Solution File: SEU141+1 by Prover9---1109a
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Prover9---1109a
% Problem : SEU141+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_prover9 %d %s
% Computer : n010.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:17 EDT 2022
% Result : Theorem 58.53s 58.80s
% Output : Refutation 58.53s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : SEU141+1 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.12 % Command : tptp2X_and_run_prover9 %d %s
% 0.12/0.33 % Computer : n010.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 Jun 19 03:56:37 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.67/0.97 ============================== Prover9 ===============================
% 0.67/0.97 Prover9 (32) version 2009-11A, November 2009.
% 0.67/0.97 Process 25266 was started by sandbox on n010.cluster.edu,
% 0.67/0.97 Sun Jun 19 03:56:38 2022
% 0.67/0.97 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 300 -f /tmp/Prover9_25113_n010.cluster.edu".
% 0.67/0.97 ============================== end of head ===========================
% 0.67/0.97
% 0.67/0.97 ============================== INPUT =================================
% 0.67/0.97
% 0.67/0.97 % Reading from file /tmp/Prover9_25113_n010.cluster.edu
% 0.67/0.97
% 0.67/0.97 set(prolog_style_variables).
% 0.67/0.97 set(auto2).
% 0.67/0.97 % set(auto2) -> set(auto).
% 0.67/0.97 % set(auto) -> set(auto_inference).
% 0.67/0.97 % set(auto) -> set(auto_setup).
% 0.67/0.97 % set(auto_setup) -> set(predicate_elim).
% 0.67/0.97 % set(auto_setup) -> assign(eq_defs, unfold).
% 0.67/0.97 % set(auto) -> set(auto_limits).
% 0.67/0.97 % set(auto_limits) -> assign(max_weight, "100.000").
% 0.67/0.97 % set(auto_limits) -> assign(sos_limit, 20000).
% 0.67/0.97 % set(auto) -> set(auto_denials).
% 0.67/0.97 % set(auto) -> set(auto_process).
% 0.67/0.97 % set(auto2) -> assign(new_constants, 1).
% 0.67/0.97 % set(auto2) -> assign(fold_denial_max, 3).
% 0.67/0.97 % set(auto2) -> assign(max_weight, "200.000").
% 0.67/0.97 % set(auto2) -> assign(max_hours, 1).
% 0.67/0.97 % assign(max_hours, 1) -> assign(max_seconds, 3600).
% 0.67/0.97 % set(auto2) -> assign(max_seconds, 0).
% 0.67/0.97 % set(auto2) -> assign(max_minutes, 5).
% 0.67/0.97 % assign(max_minutes, 5) -> assign(max_seconds, 300).
% 0.67/0.97 % set(auto2) -> set(sort_initial_sos).
% 0.67/0.97 % set(auto2) -> assign(sos_limit, -1).
% 0.67/0.97 % set(auto2) -> assign(lrs_ticks, 3000).
% 0.67/0.97 % set(auto2) -> assign(max_megs, 400).
% 0.67/0.97 % set(auto2) -> assign(stats, some).
% 0.67/0.97 % set(auto2) -> clear(echo_input).
% 0.67/0.97 % set(auto2) -> set(quiet).
% 0.67/0.97 % set(auto2) -> clear(print_initial_clauses).
% 0.67/0.97 % set(auto2) -> clear(print_given).
% 0.67/0.97 assign(lrs_ticks,-1).
% 0.67/0.97 assign(sos_limit,10000).
% 0.67/0.97 assign(order,kbo).
% 0.67/0.97 set(lex_order_vars).
% 0.67/0.97 clear(print_given).
% 0.67/0.97
% 0.67/0.97 % formulas(sos). % not echoed (24 formulas)
% 0.67/0.97
% 0.67/0.97 ============================== end of input ==========================
% 0.67/0.97
% 0.67/0.97 % From the command line: assign(max_seconds, 300).
% 0.67/0.97
% 0.67/0.97 ============================== PROCESS NON-CLAUSAL FORMULAS ==========
% 0.67/0.97
% 0.67/0.97 % Formulas that are not ordinary clauses:
% 0.67/0.97 1 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause). [assumption].
% 0.67/0.97 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.67/0.97 3 (all A all B (A = B <-> subset(A,B) & subset(B,A))) # label(d10_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.67/0.97 4 (all A all B (subset(A,B) <-> (all C (in(C,A) -> in(C,B))))) # label(d3_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.67/0.97 5 (all A all B all C (C = set_intersection2(A,B) <-> (all D (in(D,C) <-> in(D,A) & in(D,B))))) # label(d3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.67/0.97 6 (all A all B all C (C = set_difference(A,B) <-> (all D (in(D,C) <-> in(D,A) & -in(D,B))))) # label(d4_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.67/0.97 7 (all A all B (disjoint(A,B) <-> set_intersection2(A,B) = empty_set)) # label(d7_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.67/0.97 8 $T # label(dt_k1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.67/0.97 9 $T # label(dt_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.67/0.97 10 $T # label(dt_k4_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.67/0.97 11 (all A all B set_intersection2(A,A) = A) # label(idempotence_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.67/0.97 12 (exists A empty(A)) # label(rc1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.67/0.97 13 (exists A -empty(A)) # label(rc2_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.67/0.97 14 (all A all B subset(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause). [assumption].
% 0.67/0.97 15 (all A all B (disjoint(A,B) -> disjoint(B,A))) # label(symmetry_r1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 0.67/0.97 16 (all A set_intersection2(A,empty_set) = empty_set) # label(t2_boole) # label(axiom) # label(non_clause). [assumption].
% 0.67/0.97 17 (all A set_difference(A,empty_set) = A) # label(t3_boole) # label(axiom) # label(non_clause). [assumption].
% 58.53/58.80 18 (all A set_difference(empty_set,A) = empty_set) # label(t4_boole) # label(axiom) # label(non_clause). [assumption].
% 58.53/58.80 19 (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(axiom) # label(non_clause). [assumption].
% 58.53/58.80 20 (all A (empty(A) -> A = empty_set)) # label(t6_boole) # label(axiom) # label(non_clause). [assumption].
% 58.53/58.80 21 (all A all B -(in(A,B) & empty(B))) # label(t7_boole) # label(axiom) # label(non_clause). [assumption].
% 58.53/58.80 22 (all A all B -(empty(A) & A != B & empty(B))) # label(t8_boole) # label(axiom) # label(non_clause). [assumption].
% 58.53/58.80 23 -(all A all B (disjoint(A,B) <-> set_difference(A,B) = A)) # label(t83_xboole_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 58.53/58.80
% 58.53/58.80 ============================== end of process non-clausal formulas ===
% 58.53/58.80
% 58.53/58.80 ============================== PROCESS INITIAL CLAUSES ===============
% 58.53/58.80
% 58.53/58.80 ============================== PREDICATE ELIMINATION =================
% 58.53/58.80
% 58.53/58.80 ============================== end predicate elimination =============
% 58.53/58.80
% 58.53/58.80 Auto_denials: (non-Horn, no changes).
% 58.53/58.80
% 58.53/58.80 Term ordering decisions:
% 58.53/58.80 Function symbol KB weights: empty_set=1. c1=1. c2=1. c3=1. c4=1. set_intersection2=1. set_difference=1. f1=1. f4=1. f2=1. f3=1.
% 58.53/58.80
% 58.53/58.80 ============================== end of process initial clauses ========
% 58.53/58.80
% 58.53/58.80 ============================== CLAUSES FOR SEARCH ====================
% 58.53/58.80
% 58.53/58.80 ============================== end of clauses for search =============
% 58.53/58.80
% 58.53/58.80 ============================== SEARCH ================================
% 58.53/58.80
% 58.53/58.80 % Starting search at 0.02 seconds.
% 58.53/58.80
% 58.53/58.80 Low Water (keep): wt=33.000, iters=5681
% 58.53/58.80
% 58.53/58.80 Low Water (keep): wt=29.000, iters=5289
% 58.53/58.80
% 58.53/58.80 Low Water (keep): wt=27.000, iters=3939
% 58.53/58.80
% 58.53/58.80 Low Water (keep): wt=25.000, iters=5298
% 58.53/58.80
% 58.53/58.80 Low Water (keep): wt=23.000, iters=3462
% 58.53/58.80
% 58.53/58.80 Low Water (keep): wt=21.000, iters=3334
% 58.53/58.80
% 58.53/58.80 Low Water (displace): id=1133, wt=33.000
% 58.53/58.80
% 58.53/58.80 Low Water (displace): id=10388, wt=19.000
% 58.53/58.80
% 58.53/58.80 Low Water (displace): id=10393, wt=17.000
% 58.53/58.80
% 58.53/58.80 Low Water (keep): wt=19.000, iters=3672
% 58.53/58.80
% 58.53/58.80 Low Water (keep): wt=17.000, iters=3413
% 58.53/58.80
% 58.53/58.80 Low Water (displace): id=12142, wt=15.000
% 58.53/58.80
% 58.53/58.80 Low Water (keep): wt=16.000, iters=3350
% 58.53/58.80
% 58.53/58.80 Low Water (keep): wt=15.000, iters=3341
% 58.53/58.80
% 58.53/58.80 Low Water (displace): id=15169, wt=14.000
% 58.53/58.80
% 58.53/58.80 Low Water (displace): id=15265, wt=13.000
% 58.53/58.80
% 58.53/58.80 Low Water (keep): wt=14.000, iters=3385
% 58.53/58.80
% 58.53/58.80 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 58 (0.00 of 5.51 sec).
% 58.53/58.80
% 58.53/58.80 Low Water (keep): wt=13.000, iters=3335
% 58.53/58.80
% 58.53/58.80 Low Water (displace): id=18901, wt=12.000
% 58.53/58.80
% 58.53/58.80 Low Water (displace): id=19031, wt=11.000
% 58.53/58.80
% 58.53/58.80 Low Water (keep): wt=12.000, iters=3466
% 58.53/58.80
% 58.53/58.80 ============================== PROOF =================================
% 58.53/58.80 % SZS status Theorem
% 58.53/58.80 % SZS output start Refutation
% 58.53/58.80
% 58.53/58.80 % Proof 1 at 56.93 (+ 0.91) seconds.
% 58.53/58.80 % Length of proof is 37.
% 58.53/58.80 % Level of proof is 8.
% 58.53/58.80 % Maximum clause weight is 23.000.
% 58.53/58.80 % Given clauses 1258.
% 58.53/58.80
% 58.53/58.80 2 (all A all B set_intersection2(A,B) = set_intersection2(B,A)) # label(commutativity_k3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 58.53/58.80 5 (all A all B all C (C = set_intersection2(A,B) <-> (all D (in(D,C) <-> in(D,A) & in(D,B))))) # label(d3_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 58.53/58.80 6 (all A all B all C (C = set_difference(A,B) <-> (all D (in(D,C) <-> in(D,A) & -in(D,B))))) # label(d4_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 58.53/58.80 7 (all A all B (disjoint(A,B) <-> set_intersection2(A,B) = empty_set)) # label(d7_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 58.53/58.80 15 (all A all B (disjoint(A,B) -> disjoint(B,A))) # label(symmetry_r1_xboole_0) # label(axiom) # label(non_clause). [assumption].
% 58.53/58.80 19 (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(axiom) # label(non_clause). [assumption].
% 58.53/58.80 21 (all A all B -(in(A,B) & empty(B))) # label(t7_boole) # label(axiom) # label(non_clause). [assumption].
% 58.53/58.80 23 -(all A all B (disjoint(A,B) <-> set_difference(A,B) = A)) # label(t83_xboole_1) # label(negated_conjecture) # label(non_clause). [assumption].
% 58.53/58.80 24 empty(empty_set) # label(fc1_xboole_0) # label(axiom). [assumption].
% 58.53/58.80 31 set_intersection2(A,B) = set_intersection2(B,A) # label(commutativity_k3_xboole_0) # label(axiom). [clausify(2)].
% 58.53/58.80 33 disjoint(c3,c4) | set_difference(c3,c4) = c3 # label(t83_xboole_1) # label(negated_conjecture). [clausify(23)].
% 58.53/58.80 34 disjoint(A,B) | in(f4(A,B),set_intersection2(A,B)) # label(t4_xboole_0) # label(axiom). [clausify(19)].
% 58.53/58.80 35 set_intersection2(A,B) = C | in(f2(A,B,C),C) | in(f2(A,B,C),A) # label(d3_xboole_0) # label(axiom). [clausify(5)].
% 58.53/58.80 36 set_intersection2(A,B) = C | in(f2(A,B,C),C) | in(f2(A,B,C),B) # label(d3_xboole_0) # label(axiom). [clausify(5)].
% 58.53/58.80 37 set_difference(A,B) = C | in(f3(A,B,C),C) | in(f3(A,B,C),A) # label(d4_xboole_0) # label(axiom). [clausify(6)].
% 58.53/58.80 39 -in(A,B) | -empty(B) # label(t7_boole) # label(axiom). [clausify(21)].
% 58.53/58.80 42 -disjoint(c3,c4) | set_difference(c3,c4) != c3 # label(t83_xboole_1) # label(negated_conjecture). [clausify(23)].
% 58.53/58.80 43 set_difference(A,B) != C | -in(D,C) | -in(D,B) # label(d4_xboole_0) # label(axiom). [clausify(6)].
% 58.53/58.80 47 -disjoint(A,B) | disjoint(B,A) # label(symmetry_r1_xboole_0) # label(axiom). [clausify(15)].
% 58.53/58.80 50 -disjoint(A,B) | set_intersection2(A,B) = empty_set # label(d7_xboole_0) # label(axiom). [clausify(7)].
% 58.53/58.80 57 set_intersection2(A,B) != C | in(D,C) | -in(D,A) | -in(D,B) # label(d3_xboole_0) # label(axiom). [clausify(5)].
% 58.53/58.80 61 set_difference(A,B) = C | -in(f3(A,B,C),C) | -in(f3(A,B,C),A) | in(f3(A,B,C),B) # label(d4_xboole_0) # label(axiom). [clausify(6)].
% 58.53/58.80 64 set_difference(A,B) = A | in(f3(A,B,A),A). [factor(37,b,c)].
% 58.53/58.80 72 set_difference(A,B) = A | -in(f3(A,B,A),A) | in(f3(A,B,A),B). [factor(61,b,c)].
% 58.53/58.80 80 -in(A,empty_set). [ur(39,b,24,a)].
% 58.53/58.80 92 set_difference(A,B) != C | -in(f2(D,C,E),B) | set_intersection2(C,D) = E | in(f2(D,C,E),E). [resolve(43,b,36,c),rewrite([31(5)])].
% 58.53/58.80 103 disjoint(A,B) | in(f4(B,A),set_intersection2(A,B)). [resolve(47,a,34,a),rewrite([31(3)])].
% 58.53/58.80 106 set_intersection2(c3,c4) = empty_set | set_difference(c3,c4) = c3. [resolve(50,a,33,a)].
% 58.53/58.80 224 set_difference(A,B) = A | set_intersection2(A,C) != D | in(f3(A,B,A),D) | -in(f3(A,B,A),C). [resolve(64,b,57,d),rewrite([31(3)])].
% 58.53/58.80 261 set_difference(A,B) = A | in(f3(A,B,A),B). [resolve(72,b,64,b),merge(c)].
% 58.53/58.80 267 set_intersection2(A,B) = empty_set | in(f2(A,B,empty_set),A). [resolve(80,a,35,b)].
% 58.53/58.80 346 in(f4(c4,c3),set_intersection2(c3,c4)) | set_difference(c3,c4) != c3. [resolve(103,a,42,a)].
% 58.53/58.80 649 set_intersection2(A,B) = empty_set | set_difference(C,A) != B. [resolve(267,b,92,b),rewrite([31(6)]),merge(c),unit_del(c,80)].
% 58.53/58.80 660 set_intersection2(c3,c4) = empty_set. [resolve(649,b,106,b),rewrite([31(3)]),merge(b)].
% 58.53/58.80 662 set_difference(c3,c4) != c3. [back_rewrite(346),rewrite([660(6)]),unit_del(a,80)].
% 58.53/58.80 21460 -in(f3(c3,c4,c3),c4). [ur(224,a,662,a,b,660,a,c,80,a)].
% 58.53/58.80 21468 $F. [resolve(21460,a,261,b),unit_del(a,662)].
% 58.53/58.80
% 58.53/58.80 % SZS output end Refutation
% 58.53/58.80 ============================== end of proof ==========================
% 58.53/58.80
% 58.53/58.80 ============================== STATISTICS ============================
% 58.53/58.80
% 58.53/58.80 Given=1258. Generated=1696445. Kept=21444. proofs=1.
% 58.53/58.80 Usable=1243. Sos=9999. Demods=9. Limbo=0, Disabled=10240. Hints=0.
% 58.53/58.80 Megabytes=17.46.
% 58.53/58.80 User_CPU=56.93, System_CPU=0.91, Wall_clock=58.
% 58.53/58.80
% 58.53/58.80 ============================== end of statistics =====================
% 58.53/58.80
% 58.53/58.80 ============================== end of search =========================
% 58.53/58.80
% 58.53/58.80 THEOREM PROVED
% 58.53/58.80 % SZS status Theorem
% 58.53/58.80
% 58.53/58.80 Exiting with 1 proof.
% 58.53/58.80
% 58.53/58.80 Process 25266 exit (max_proofs) Sun Jun 19 03:57:36 2022
% 58.53/58.80 Prover9 interrupted
%------------------------------------------------------------------------------