0.10/0.11 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.10/0.12 % Command : tptp2X_and_run_prover9 %d %s 0.11/0.33 % Computer : n015.cluster.edu 0.11/0.33 % Model : x86_64 x86_64 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.11/0.33 % Memory : 8042.1875MB 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64 0.11/0.33 % CPULimit : 180 0.11/0.33 % DateTime : Thu Aug 29 10:11:52 EDT 2019 0.11/0.33 % CPUTime : 1.05/1.37 ============================== Prover9 =============================== 1.05/1.37 Prover9 (32) version 2009-11A, November 2009. 1.05/1.37 Process 27798 was started by sandbox2 on n015.cluster.edu, 1.05/1.37 Thu Aug 29 10:11:52 2019 1.05/1.37 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 180 -f /tmp/Prover9_27529_n015.cluster.edu". 1.05/1.37 ============================== end of head =========================== 1.05/1.37 1.05/1.37 ============================== INPUT ================================= 1.05/1.37 1.05/1.37 % Reading from file /tmp/Prover9_27529_n015.cluster.edu 1.05/1.37 1.05/1.37 set(prolog_style_variables). 1.05/1.37 set(auto2). 1.05/1.37 % set(auto2) -> set(auto). 1.05/1.37 % set(auto) -> set(auto_inference). 1.05/1.37 % set(auto) -> set(auto_setup). 1.05/1.37 % set(auto_setup) -> set(predicate_elim). 1.05/1.37 % set(auto_setup) -> assign(eq_defs, unfold). 1.05/1.37 % set(auto) -> set(auto_limits). 1.05/1.37 % set(auto_limits) -> assign(max_weight, "100.000"). 1.05/1.37 % set(auto_limits) -> assign(sos_limit, 20000). 1.05/1.37 % set(auto) -> set(auto_denials). 1.05/1.37 % set(auto) -> set(auto_process). 1.05/1.37 % set(auto2) -> assign(new_constants, 1). 1.05/1.37 % set(auto2) -> assign(fold_denial_max, 3). 1.05/1.37 % set(auto2) -> assign(max_weight, "200.000"). 1.05/1.37 % set(auto2) -> assign(max_hours, 1). 1.05/1.37 % assign(max_hours, 1) -> assign(max_seconds, 3600). 1.05/1.37 % set(auto2) -> assign(max_seconds, 0). 1.05/1.37 % set(auto2) -> assign(max_minutes, 5). 1.05/1.37 % assign(max_minutes, 5) -> assign(max_seconds, 300). 1.05/1.37 % set(auto2) -> set(sort_initial_sos). 1.05/1.37 % set(auto2) -> assign(sos_limit, -1). 1.05/1.37 % set(auto2) -> assign(lrs_ticks, 3000). 1.05/1.37 % set(auto2) -> assign(max_megs, 400). 1.05/1.37 % set(auto2) -> assign(stats, some). 1.05/1.37 % set(auto2) -> clear(echo_input). 1.05/1.37 % set(auto2) -> set(quiet). 1.05/1.37 % set(auto2) -> clear(print_initial_clauses). 1.05/1.37 % set(auto2) -> clear(print_given). 1.05/1.37 assign(lrs_ticks,-1). 1.05/1.37 assign(sos_limit,10000). 1.05/1.37 assign(order,kbo). 1.05/1.37 set(lex_order_vars). 1.05/1.37 clear(print_given). 1.05/1.37 1.05/1.37 % formulas(sos). % not echoed (8 formulas) 1.05/1.37 1.05/1.37 ============================== end of input ========================== 1.05/1.37 1.05/1.37 % From the command line: assign(max_seconds, 180). 1.05/1.37 1.05/1.37 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 1.05/1.37 1.05/1.37 % Formulas that are not ordinary clauses: 1.05/1.37 1 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause). [assumption]. 1.05/1.37 2 $T # label(dt_k4_xboole_0) # label(axiom) # label(non_clause). [assumption]. 1.05/1.37 3 (all A all B subset(A,A)) # label(reflexivity_r1_tarski) # label(axiom) # label(non_clause). [assumption]. 1.05/1.37 4 $T # label(dt_k1_tarski) # label(axiom) # label(non_clause). [assumption]. 1.05/1.37 5 (all A all B ((all C (in(C,A) -> in(C,B))) <-> subset(A,B))) # label(d3_tarski) # label(axiom) # label(non_clause). [assumption]. 1.05/1.37 6 (all A all B (singleton(A) = B <-> (all C (C = A <-> in(C,B))))) # label(d1_tarski) # label(axiom) # label(non_clause). [assumption]. 1.05/1.37 7 (all A all B all C (C = set_difference(A,B) <-> (all D (in(D,A) & -in(D,B) <-> in(D,C))))) # label(d4_xboole_0) # label(axiom) # label(non_clause). [assumption]. 1.05/1.37 8 -(all A all B all C (subset(A,B) -> in(C,A) | subset(A,set_difference(B,singleton(C))))) # label(l3_zfmisc_1) # label(negated_conjecture) # label(non_clause). [assumption]. 1.05/1.37 1.05/1.37 ============================== end of process non-clausal formulas === 1.05/1.37 1.05/1.37 ============================== PROCESS INITIAL CLAUSES =============== 1.05/1.37 1.05/1.37 ============================== PREDICATE ELIMINATION ================= 1.05/1.37 1.05/1.37 ============================== end predicate elimination ============= 1.05/1.37 1.05/1.37 Auto_denials: (non-Horn, no changes). 1.05/1.37 1.05/1.37 Term ordering decisions: 1.05/1.37 1.05/1.37 % Assigning unary symbol singleton kb_weight 0 and highest precedence (11). 1.05/1.37 Function symbol KB weights: c1=1. c2=1. c3=1. set_difference=1. f1=1. f2=1. f3=1. singleton=0. 1.05/1.37 1.05/1.37 ============================== end of process initial clauses ======== 1.05/1.37 1.05/1.37 ============================== CLAUSES FOR SEARCH ==================== 1.05/1.37 1.05/1.37 ============================== end of clauses for search ============= 1.05/1.37 1.05/1.37 ============================== SEARCH ================================ 1.05/1.37 1.05/1.37 % Starting search at 0.01 seconds. 1.05/1.37 1.05/1.37 Low Water (keep): wt=25.000, iters=3732 1.05/1.37 1.05/1.37 Low Water (keep): wt=23.000, iters=3468 1.05/1.37 1.05/1.37 Low Water (keep): wt=22.000, iters=3335 42.53/42.85 42.53/42.85 Low Water (keep): wt=21.000, iters=3499 42.53/42.85 42.53/42.85 Low Water (keep): wt=20.000, iters=3366 42.53/42.85 42.53/42.85 Low Water (keep): wt=19.000, iters=3381 42.53/42.85 42.53/42.85 Low Water (keep): wt=18.000, iters=3335 42.53/42.85 42.53/42.85 Low Water (keep): wt=17.000, iters=3342 42.53/42.85 42.53/42.85 Low Water (keep): wt=16.000, iters=3334 42.53/42.85 42.53/42.85 Low Water (keep): wt=15.000, iters=3336 42.53/42.85 42.53/42.85 Low Water (keep): wt=14.000, iters=3375 42.53/42.85 42.53/42.85 Low Water (keep): wt=13.000, iters=3367 42.53/42.85 42.53/42.85 NOTE: Back_subsumption disabled, ratio of kept to back_subsumed is 31 (0.00 of 0.78 sec). 42.53/42.85 42.53/42.85 Low Water (keep): wt=12.000, iters=3336 42.53/42.85 42.53/42.85 Low Water (displace): id=4019, wt=27.000 42.53/42.85 42.53/42.85 Low Water (displace): id=4020, wt=26.000 42.53/42.85 42.53/42.85 Low Water (displace): id=4049, wt=25.000 42.53/42.85 42.53/42.85 Low Water (displace): id=4067, wt=24.000 42.53/42.85 42.53/42.85 Low Water (displace): id=4151, wt=23.000 42.53/42.85 42.53/42.85 Low Water (keep): wt=11.000, iters=3349 42.53/42.85 42.53/42.85 Low Water (displace): id=4308, wt=22.000 42.53/42.85 42.53/42.85 Low Water (displace): id=15525, wt=10.000 42.53/42.85 42.53/42.85 Low Water (displace): id=17404, wt=9.000 42.53/42.85 42.53/42.85 Low Water (keep): wt=10.000, iters=3334 42.53/42.85 42.53/42.85 Low Water (displace): id=23944, wt=8.000 42.53/42.85 42.53/42.85 ============================== PROOF ================================= 42.53/42.85 % SZS status Theorem 42.53/42.85 % SZS output start Refutation 42.53/42.85 42.53/42.85 % Proof 1 at 40.73 (+ 1.13) seconds. 42.53/42.85 % Length of proof is 90. 42.53/42.85 % Level of proof is 24. 42.53/42.85 % Maximum clause weight is 23.000. 42.53/42.85 % Given clauses 4711. 42.53/42.85 42.53/42.85 1 (all A all B (in(A,B) -> -in(B,A))) # label(antisymmetry_r2_hidden) # label(axiom) # label(non_clause). [assumption]. 42.53/42.85 5 (all A all B ((all C (in(C,A) -> in(C,B))) <-> subset(A,B))) # label(d3_tarski) # label(axiom) # label(non_clause). [assumption]. 42.53/42.85 6 (all A all B (singleton(A) = B <-> (all C (C = A <-> in(C,B))))) # label(d1_tarski) # label(axiom) # label(non_clause). [assumption]. 42.53/42.85 7 (all A all B all C (C = set_difference(A,B) <-> (all D (in(D,A) & -in(D,B) <-> in(D,C))))) # label(d4_xboole_0) # label(axiom) # label(non_clause). [assumption]. 42.53/42.85 8 -(all A all B all C (subset(A,B) -> in(C,A) | subset(A,set_difference(B,singleton(C))))) # label(l3_zfmisc_1) # label(negated_conjecture) # label(non_clause). [assumption]. 42.53/42.85 10 subset(c1,c2) # label(l3_zfmisc_1) # label(negated_conjecture). [clausify(8)]. 42.53/42.85 11 in(f1(A,B),A) | subset(A,B) # label(d3_tarski) # label(axiom). [clausify(5)]. 42.53/42.85 13 set_difference(A,B) = C | in(f3(A,B,C),A) | in(f3(A,B,C),C) # label(d4_xboole_0) # label(axiom). [clausify(7)]. 42.53/42.85 14 -in(c3,c1) # label(l3_zfmisc_1) # label(negated_conjecture). [clausify(8)]. 42.53/42.85 15 -in(A,B) | -in(B,A) # label(antisymmetry_r2_hidden) # label(axiom). [clausify(1)]. 42.53/42.85 16 -subset(c1,set_difference(c2,singleton(c3))) # label(l3_zfmisc_1) # label(negated_conjecture). [clausify(8)]. 42.53/42.85 17 set_difference(A,B) != C | -in(D,B) | -in(D,C) # label(d4_xboole_0) # label(axiom). [clausify(7)]. 42.53/42.85 18 -in(f1(A,B),B) | subset(A,B) # label(d3_tarski) # label(axiom). [clausify(5)]. 42.53/42.85 19 -in(A,B) | in(A,C) | -subset(B,C) # label(d3_tarski) # label(axiom). [clausify(5)]. 42.53/42.85 20 singleton(A) != B | C != A | in(C,B) # label(d1_tarski) # label(axiom). [clausify(6)]. 42.53/42.85 21 singleton(A) != B | C = A | -in(C,B) # label(d1_tarski) # label(axiom). [clausify(6)]. 42.53/42.85 22 set_difference(A,B) != C | in(D,A) | -in(D,C) # label(d4_xboole_0) # label(axiom). [clausify(7)]. 42.53/42.85 24 set_difference(A,B) != C | -in(D,A) | in(D,B) | in(D,C) # label(d4_xboole_0) # label(axiom). [clausify(7)]. 42.53/42.85 26 set_difference(A,B) = C | -in(f3(A,B,C),A) | in(f3(A,B,C),B) | -in(f3(A,B,C),C) # label(d4_xboole_0) # label(axiom). [clausify(7)]. 42.53/42.85 27 set_difference(A,B) = A | in(f3(A,B,A),A). [factor(13,b,c)]. 42.53/42.85 28 -in(A,A). [factor(15,a,b)]. 42.53/42.85 32 set_difference(A,B) = A | -in(f3(A,B,A),A) | in(f3(A,B,A),B). [factor(26,b,d)]. 42.53/42.85 36 in(f1(c1,set_difference(c2,singleton(c3))),c1). [resolve(16,a,11,b)]. 42.53/42.85 43 -in(f1(c1,set_difference(c2,singleton(c3))),set_difference(c2,singleton(c3))). [ur(18,b,16,a)]. 42.53/42.85 44 -in(A,B) | in(A,C) | in(f1(B,C),B). [resolve(19,c,11,b)]. 42.53/42.85 45 -in(A,c1) | in(A,c2). [resolve(19,c,10,a)]. 42.53/42.85 46 A != B | in(A,singleton(B)). [xx_res(20,a)]. 42.53/42.85 47 singleton(A) != B | in(A,B). [xx_res(20,b)]. 42.53/42.85 55 -in(c3,set_difference(c1,A)). [ur(22,a,xx,b,14,a)]. 42.53/42.85 74 set_difference(A,B) = A | set_difference(C,D) != A | -in(f3(A,B,A),D). [resolve(27,b,17,c)]. 42.53/42.85 75 set_difference(A,B) = A | set_difference(C,A) != D | -in(f3(A,B,A),D). [resolve(27,b,17,b)]. 42.53/42.85 78 -in(A,set_difference(A,B)). [ur(22,a,xx,b,28,a)]. 42.53/42.85 79 singleton(A) != A. [ur(20,b,xx,c,28,a)]. 42.53/42.85 85 set_difference(A,B) = A | in(f3(A,B,A),B). [resolve(32,b,27,b),merge(c)]. 42.53/42.85 90 -in(A,singleton(singleton(A))). [ur(21,a,xx,b,79,a(flip))]. 42.53/42.85 99 in(A,singleton(A)). [xx_res(46,a)]. 42.53/42.85 102 set_difference(singleton(A),B) != C | in(A,B) | in(A,C). [resolve(99,a,24,b)]. 42.53/42.85 121 -subset(singleton(A),A). [ur(19,a,99,a,b,28,a)]. 42.53/42.85 134 in(f1(singleton(A),A),singleton(A)). [resolve(121,a,11,b)]. 42.53/42.85 155 singleton(A) != singleton(B) | f1(singleton(B),B) = A. [resolve(134,a,21,c)]. 42.53/42.85 180 in(f1(c1,set_difference(c2,singleton(c3))),c2). [resolve(36,a,45,a)]. 42.53/42.85 183 set_difference(c1,A) != B | in(f1(c1,set_difference(c2,singleton(c3))),A) | in(f1(c1,set_difference(c2,singleton(c3))),B). [resolve(36,a,24,b)]. 42.53/42.85 267 set_difference(c2,A) != B | in(f1(c1,set_difference(c2,singleton(c3))),A) | in(f1(c1,set_difference(c2,singleton(c3))),B). [resolve(180,a,24,b)]. 42.53/42.85 287 -in(f1(c1,set_difference(c2,singleton(c3))),set_difference(A,c2)). [ur(17,a,xx,b,180,a)]. 42.53/42.85 328 set_difference(singleton(A),singleton(singleton(A))) != A. [ur(24,b,99,a,c,90,a,d,28,a)]. 42.53/42.85 359 in(A,B) | in(f1(singleton(A),B),singleton(A)). [resolve(44,a,99,a)]. 42.53/42.85 371 in(A,B) | singleton(C) != singleton(A) | f1(singleton(A),B) = C. [resolve(359,b,21,c)]. 42.53/42.85 487 set_difference(A,B) = A | singleton(C) != B | f3(A,B,A) = C. [resolve(85,b,21,c)]. 42.53/42.85 1526 f1(singleton(A),A) = A. [xx_res(155,a)]. 42.53/42.85 5923 in(A,B) | in(A,set_difference(singleton(A),B)). [resolve(102,a,1526,a(flip)),rewrite([1526(7)])]. 42.53/42.85 5938 in(A,B) | -in(set_difference(singleton(A),B),A). [resolve(5923,b,15,b)]. 42.53/42.85 5953 set_difference(A,B) = A | set_difference(C,B) != A. [resolve(74,c,85,b),merge(c)]. 42.53/42.85 6048 -in(set_difference(singleton(A),A),A). [ur(5938,a,28,a)]. 42.53/42.85 6056 set_difference(A,B) = A | set_difference(C,A) != B. [resolve(75,c,85,b),merge(c)]. 42.53/42.85 6107 singleton(set_difference(singleton(A),A)) != A. [ur(47,b,6048,a)]. 42.53/42.85 6174 set_difference(set_difference(A,B),B) = set_difference(A,B). [resolve(5953,b,1526,a(flip)),rewrite([1526(4),1526(6)])]. 42.53/42.85 6504 set_difference(A,set_difference(B,A)) = A. [resolve(6056,b,6174,a)]. 42.53/42.85 7045 -in(A,singleton(singleton(set_difference(singleton(A),A)))). [ur(21,a,6504,a(flip),b,6107,a(flip)),rewrite([6504(10)])]. 42.53/42.85 9530 -in(A,singleton(set_difference(singleton(A),singleton(singleton(A))))). [ur(21,a,6504,a(flip),b,328,a(flip)),rewrite([6504(12)])]. 42.53/42.85 9853 c2 != A | in(f1(c1,set_difference(c2,singleton(c3))),A). [para(6504(a,1),267(a,1)),unit_del(b,287)]. 42.53/42.85 9863 set_difference(c2,singleton(c3)) != c2. [ur(9853,b,43,a),flip(a)]. 42.53/42.85 9864 f1(c1,set_difference(c2,singleton(c3))) != c2. [ur(9853,b,28,a),flip(a)]. 42.53/42.85 9867 set_difference(A,singleton(c3)) != c2. [ur(5953,a,9863,a)]. 42.53/42.85 9872 -in(f3(c2,singleton(c3),c2),set_difference(A,c2)). [ur(75,a,9863,a,b,6174,a)]. 42.53/42.85 9893 -in(set_difference(A,singleton(c3)),singleton(c2)). [ur(21,a,6504,a(flip),b,9867,a),rewrite([6504(9)])]. 42.53/42.85 12609 in(A,B) | f1(singleton(A),B) = A. [xx_res(371,b)]. 42.53/42.85 12641 f1(singleton(set_difference(A,singleton(c3))),singleton(c2)) = set_difference(A,singleton(c3)). [resolve(12609,a,9893,a)]. 42.53/42.85 12740 f1(singleton(set_difference(singleton(A),A)),A) = set_difference(singleton(A),A). [resolve(12609,a,6048,a)]. 42.53/42.85 12908 f1(singleton(A),set_difference(A,B)) = A. [resolve(12609,a,78,a)]. 42.53/42.85 13169 f1(singleton(A),singleton(singleton(set_difference(singleton(A),A)))) = A. [resolve(7045,a,12609,a)]. 42.53/42.85 13719 set_difference(A,singleton(B)) = A | f3(A,singleton(B),A) = B. [resolve(487,b,12908,a(flip)),rewrite([12908(5),12908(8)])]. 42.53/42.85 14381 -in(f1(c1,set_difference(c2,singleton(c3))),singleton(c2)). [ur(21,a,13169,a(flip),b,9864,a),rewrite([13169(18)])]. 42.53/42.85 16128 in(A,set_difference(singleton(A),A)). [resolve(12740,a,102,a(flip)),rewrite([12740(5)]),unit_del(a,28)]. 42.53/42.85 16200 -in(A,set_difference(B,set_difference(singleton(A),A))). [ur(17,a,6504,a,c,16128,a)]. 42.53/42.85 18445 in(f1(c1,set_difference(c2,singleton(c3))),singleton(c3)). [resolve(12641,a,267,a(flip)),rewrite([12641(23)]),unit_del(b,43)]. 42.53/42.85 19021 f1(singleton(A),singleton(set_difference(singleton(A),singleton(singleton(A))))) = A. [resolve(9530,a,12609,a)]. 42.53/42.85 19066 in(f3(c2,singleton(c3),c2),c2). [resolve(9872,a,5923,b)]. 42.53/42.85 19075 in(f3(c2,singleton(c3),c2),singleton(c3)). [resolve(19066,a,26,d),unit_del(a,9867),unit_del(b,19066)]. 42.53/42.85 19084 singleton(c3) != singleton(A) | f3(c2,singleton(c3),c2) = A. [resolve(19075,a,21,c),flip(a)]. 42.53/42.85 19186 f3(c2,singleton(c3),c2) = c3. [xx_res(19084,a)]. 42.53/42.85 19228 in(c3,c2). [back_rewrite(19066),rewrite([19186(5)])]. 42.53/42.85 19314 set_difference(c1,A) != c2. [ur(22,b,14,a,c,19228,a)]. 42.53/42.85 19811 -in(set_difference(c1,A),singleton(c2)). [ur(21,a,19021,a(flip),b,19314,a),rewrite([19021(15)])]. 42.53/42.85 20266 -in(set_difference(c1,singleton(c2)),c1). [ur(24,a,6504,a(flip),c,19811,a,d,16200,a)]. 42.53/42.85 20372 f1(singleton(set_difference(c1,singleton(c2))),c1) = set_difference(c1,singleton(c2)). [resolve(20266,a,12609,a)]. 42.53/42.85 21747 in(f1(c1,set_difference(c2,singleton(c3))),set_difference(c1,singleton(c2))). [resolve(20372,a,183,a(flip)),rewrite([20372(22)]),unit_del(a,14381)]. 42.53/42.85 21804 set_difference(c1,singleton(c2)) != set_difference(A,singleton(c3)). [ur(17,b,18445,a,c,21747,a),flip(a)]. 42.53/42.85 23866 set_difference(A,singleton(B)) = A | in(B,A). [para(13719(b,1),27(b,1)),merge(b)]. 42.53/42.85 24875 set_difference(set_difference(c1,A),singleton(c3)) = set_difference(c1,A). [resolve(23866,b,55,a)]. 42.53/42.85 24876 $F. [resolve(24875,a,21804,a(flip))]. 42.53/42.85 42.53/42.85 % SZS output end Refutation 42.53/42.85 ============================== end of proof ========================== 42.53/42.85 42.53/42.85 ============================== STATISTICS ============================ 42.53/42.85 42.53/42.85 Given=4711. Generated=2253884. Kept=24867. proofs=1. 42.53/42.85 Usable=4569. Sos=9997. Demods=1911. Limbo=924, Disabled=9394. Hints=0. 42.53/42.85 Megabytes=16.01. 42.53/42.85 User_CPU=40.73, System_CPU=1.13, Wall_clock=42. 42.53/42.85 42.53/42.85 ============================== end of statistics ===================== 42.53/42.85 42.53/42.85 ============================== end of search ========================= 42.53/42.85 42.53/42.85 THEOREM PROVED 42.53/42.85 % SZS status Theorem 42.53/42.85 42.53/42.85 Exiting with 1 proof. 42.53/42.85 42.53/42.85 Process 27798 exit (max_proofs) Thu Aug 29 10:12:34 2019 42.53/42.85 Prover9 interrupted 42.53/42.85 EOF