0.00/0.04 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.00/0.04 % Command : tptp2X_and_run_prover9 %d %s 0.02/0.23 % Computer : n008.star.cs.uiowa.edu 0.02/0.23 % Model : x86_64 x86_64 0.02/0.23 % CPU : Intel(R) Xeon(R) CPU E5-2609 0 @ 2.40GHz 0.02/0.23 % Memory : 32218.625MB 0.02/0.23 % OS : Linux 3.10.0-693.2.2.el7.x86_64 0.02/0.23 % CPULimit : 300 0.02/0.23 % DateTime : Sat Jul 14 04:40:25 CDT 2018 0.02/0.23 % CPUTime : 1.56/1.75 ============================== Prover9 =============================== 1.56/1.75 Prover9 (32) version 2009-11A, November 2009. 1.56/1.75 Process 15909 was started by sandbox2 on n008.star.cs.uiowa.edu, 1.56/1.75 Sat Jul 14 04:40:25 2018 1.56/1.75 The command was "/export/starexec/sandbox2/solver/bin/prover9 -t 300 -f /tmp/Prover9_15877_n008.star.cs.uiowa.edu". 1.56/1.75 ============================== end of head =========================== 1.56/1.75 1.56/1.75 ============================== INPUT ================================= 1.56/1.75 1.56/1.75 % Reading from file /tmp/Prover9_15877_n008.star.cs.uiowa.edu 1.56/1.75 1.56/1.75 set(prolog_style_variables). 1.56/1.75 set(auto2). 1.56/1.75 % set(auto2) -> set(auto). 1.56/1.75 % set(auto) -> set(auto_inference). 1.56/1.75 % set(auto) -> set(auto_setup). 1.56/1.75 % set(auto_setup) -> set(predicate_elim). 1.56/1.75 % set(auto_setup) -> assign(eq_defs, unfold). 1.56/1.75 % set(auto) -> set(auto_limits). 1.56/1.75 % set(auto_limits) -> assign(max_weight, "100.000"). 1.56/1.75 % set(auto_limits) -> assign(sos_limit, 20000). 1.56/1.75 % set(auto) -> set(auto_denials). 1.56/1.75 % set(auto) -> set(auto_process). 1.56/1.75 % set(auto2) -> assign(new_constants, 1). 1.56/1.75 % set(auto2) -> assign(fold_denial_max, 3). 1.56/1.75 % set(auto2) -> assign(max_weight, "200.000"). 1.56/1.75 % set(auto2) -> assign(max_hours, 1). 1.56/1.75 % assign(max_hours, 1) -> assign(max_seconds, 3600). 1.56/1.75 % set(auto2) -> assign(max_seconds, 0). 1.56/1.75 % set(auto2) -> assign(max_minutes, 5). 1.56/1.75 % assign(max_minutes, 5) -> assign(max_seconds, 300). 1.56/1.75 % set(auto2) -> set(sort_initial_sos). 1.56/1.75 % set(auto2) -> assign(sos_limit, -1). 1.56/1.75 % set(auto2) -> assign(lrs_ticks, 3000). 1.56/1.75 % set(auto2) -> assign(max_megs, 400). 1.56/1.75 % set(auto2) -> assign(stats, some). 1.56/1.75 % set(auto2) -> clear(echo_input). 1.56/1.75 % set(auto2) -> set(quiet). 1.56/1.75 % set(auto2) -> clear(print_initial_clauses). 1.56/1.75 % set(auto2) -> clear(print_given). 1.56/1.75 assign(lrs_ticks,-1). 1.56/1.75 assign(sos_limit,10000). 1.56/1.75 assign(order,kbo). 1.56/1.75 set(lex_order_vars). 1.56/1.75 clear(print_given). 1.56/1.75 1.56/1.75 % formulas(sos). % not echoed (1 formulas) 1.56/1.75 1.56/1.75 ============================== end of input ========================== 1.56/1.75 1.56/1.75 % From the command line: assign(max_seconds, 300). 1.56/1.75 1.56/1.75 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 1.56/1.75 1.56/1.75 % Formulas that are not ordinary clauses: 1.56/1.75 1 -(all X exists Y1 exists Y2 exists Y3 all Z ((big_f(Y1,Y2,Y3) -> (big_f(X,X,Z) -> big_f(Y3,Y1,Y2) | big_f(Y2,Y3,Y1))) -> (((big_f(Y3,Y1,Y2) -> big_f(Y2,Y3,Y1) & big_f(Y1,Y2,Y3)) <-> big_f(Y2,Y1,Z)) -> (((big_f(Y2,Y3,Y1) -> big_f(Y1,Y2,Y3) & big_f(Y3,Y1,Y2)) <-> big_f(Y1,Z,Y2)) -> ((big_f(Z,Y2,Y1) <-> ((big_f(Y3,Y1,Y2) -> -big_f(Y2,Y3,Y1)) -> big_f(Y1,Y2,Y3))) -> (big_f(Z,Z,Z) <-> big_f(Y1,Y2,Y3) & big_f(Y2,Y3,Y1) & big_f(Y3,Y1,Y2))))))) # label(church_46_18_5) # label(negated_conjecture) # label(non_clause). [assumption]. 1.56/1.75 1.56/1.75 ============================== end of process non-clausal formulas === 1.56/1.75 1.56/1.75 ============================== PROCESS INITIAL CLAUSES =============== 1.56/1.75 1.56/1.75 ============================== PREDICATE ELIMINATION ================= 1.56/1.75 1.56/1.75 ============================== end predicate elimination ============= 1.56/1.75 1.56/1.75 Auto_denials: (non-Horn, no changes). 1.56/1.75 1.56/1.75 Term ordering decisions: 1.56/1.75 Function symbol KB weights: c1=1. f1=1. 1.56/1.75 1.56/1.75 ============================== end of process initial clauses ======== 1.56/1.75 1.56/1.75 ============================== CLAUSES FOR SEARCH ==================== 1.56/1.75 1.56/1.75 ============================== end of clauses for search ============= 1.56/1.75 1.56/1.75 ============================== SEARCH ================================ 1.56/1.75 1.56/1.75 % Starting search at 0.01 seconds. 1.56/1.75 1.56/1.75 ============================== PROOF ================================= 1.56/1.75 % SZS status Theorem 1.56/1.75 % SZS output start Refutation 1.56/1.75 1.56/1.75 % Proof 1 at 1.32 (+ 0.01) seconds. 1.56/1.75 % Length of proof is 53. 1.56/1.75 % Level of proof is 26. 1.56/1.75 % Maximum clause weight is 40.000. 1.56/1.75 % Given clauses 401. 1.56/1.75 1.56/1.75 1 -(all X exists Y1 exists Y2 exists Y3 all Z ((big_f(Y1,Y2,Y3) -> (big_f(X,X,Z) -> big_f(Y3,Y1,Y2) | big_f(Y2,Y3,Y1))) -> (((big_f(Y3,Y1,Y2) -> big_f(Y2,Y3,Y1) & big_f(Y1,Y2,Y3)) <-> big_f(Y2,Y1,Z)) -> (((big_f(Y2,Y3,Y1) -> big_f(Y1,Y2,Y3) & big_f(Y3,Y1,Y2)) <-> big_f(Y1,Z,Y2)) -> ((big_f(Z,Y2,Y1) <-> ((big_f(Y3,Y1,Y2) -> -big_f(Y2,Y3,Y1)) -> big_f(Y1,Y2,Y3))) -> (big_f(Z,Z,Z) <-> big_f(Y1,Y2,Y3) & big_f(Y2,Y3,Y1) & big_f(Y3,Y1,Y2))))))) # label(church_46_18_5) # label(negated_conjecture) # label(non_clause). [assumption]. 1.56/1.75 2 big_f(A,B,C) | big_f(C,B,f1(B,C,A)) # label(church_46_18_5) # label(negated_conjecture). [clausify(1)]. 1.56/1.75 3 big_f(A,B,C) | big_f(C,f1(C,A,B),A) # label(church_46_18_5) # label(negated_conjecture). [clausify(1)]. 1.56/1.75 7 -big_f(f1(A,B,C),f1(A,B,C),f1(A,B,C)) | -big_f(A,B,C) | -big_f(B,C,A) | -big_f(C,A,B) # label(church_46_18_5) # label(negated_conjecture). [clausify(1)]. 1.56/1.75 10 -big_f(A,B,C) | big_f(C,A,B) | -big_f(C,B,f1(B,C,A)) # label(church_46_18_5) # label(negated_conjecture). [clausify(1)]. 1.56/1.75 11 -big_f(A,B,C) | big_f(B,C,A) | -big_f(C,B,f1(B,C,A)) # label(church_46_18_5) # label(negated_conjecture). [clausify(1)]. 1.56/1.75 13 -big_f(A,B,C) | big_f(C,A,B) | -big_f(C,f1(C,A,B),A) # label(church_46_18_5) # label(negated_conjecture). [clausify(1)]. 1.56/1.75 14 -big_f(A,B,C) | big_f(B,C,A) | -big_f(C,f1(C,A,B),A) # label(church_46_18_5) # label(negated_conjecture). [clausify(1)]. 1.56/1.75 15 -big_f(f1(A,B,C),B,A) | big_f(C,A,B) | big_f(A,B,C) # label(church_46_18_5) # label(negated_conjecture). [clausify(1)]. 1.56/1.75 16 -big_f(f1(A,B,C),B,A) | big_f(B,C,A) | big_f(A,B,C) # label(church_46_18_5) # label(negated_conjecture). [clausify(1)]. 1.56/1.75 17 big_f(f1(A,B,C),B,A) | -big_f(C,A,B) | -big_f(B,C,A) # label(church_46_18_5) # label(negated_conjecture). [clausify(1)]. 1.56/1.75 18 -big_f(A,B,C) | -big_f(c1,c1,f1(A,B,C)) | big_f(C,A,B) | big_f(B,C,A) # label(church_46_18_5) # label(negated_conjecture). [clausify(1)]. 1.56/1.75 22 -big_f(f1(A,A,A),A,A) | big_f(A,A,A). [factor(15,b,c)]. 1.56/1.75 36 big_f(f1(f1(A,B,C),B,A),B,f1(A,B,C)) | -big_f(B,A,f1(A,B,C)) | big_f(B,C,A). [resolve(17,b,3,b)]. 1.56/1.75 38 big_f(f1(A,B,f1(B,A,C)),B,A) | -big_f(f1(B,A,C),A,B) | big_f(A,C,B). [resolve(17,c,3,b)]. 1.56/1.75 40 -big_f(c1,c1,A) | big_f(A,c1,c1) | big_f(c1,A,c1). [resolve(18,b,2,b),merge(d)]. 1.56/1.75 54 big_f(f1(c1,c1,A),c1,c1) | big_f(c1,f1(c1,c1,A),c1) | big_f(A,c1,c1). [resolve(40,a,2,b)]. 1.56/1.75 70 big_f(c1,f1(c1,c1,A),c1) | big_f(A,c1,c1) | big_f(c1,c1,A). [resolve(54,a,15,a),merge(c)]. 1.56/1.75 80 big_f(A,c1,c1) | big_f(c1,c1,A) | -big_f(c1,A,c1). [resolve(70,a,14,c),merge(d)]. 1.56/1.75 84 big_f(f1(c1,c1,A),c1,c1) | big_f(c1,c1,f1(c1,c1,A)) | big_f(c1,A,c1). [resolve(80,c,3,b)]. 1.56/1.75 86 big_f(c1,c1,f1(c1,c1,A)) | big_f(c1,A,c1) | big_f(c1,c1,A). [resolve(84,a,16,a),merge(c)]. 1.56/1.75 90 big_f(c1,A,c1) | big_f(c1,c1,A) | -big_f(A,c1,c1). [resolve(86,a,11,c),merge(d)]. 1.56/1.75 156 big_f(f1(c1,c1,f1(c1,c1,A)),c1,c1) | big_f(c1,A,c1) | big_f(c1,c1,f1(c1,c1,A)). [resolve(38,b,84,a),merge(d)]. 1.56/1.75 215 big_f(c1,A,c1) | big_f(c1,c1,f1(c1,c1,A)) | big_f(c1,f1(c1,c1,f1(c1,c1,A)),c1) | big_f(c1,c1,f1(c1,c1,f1(c1,c1,A))). [resolve(156,a,90,c)]. 1.56/1.75 700 big_f(c1,A,c1) | big_f(c1,c1,f1(c1,c1,A)) | big_f(c1,c1,f1(c1,c1,f1(c1,c1,A))) | -big_f(c1,f1(c1,c1,A),c1). [resolve(215,c,13,c),merge(e)]. 1.56/1.75 708 big_f(c1,A,c1) | big_f(c1,c1,f1(c1,c1,A)) | big_f(c1,c1,f1(c1,c1,f1(c1,c1,A))). [resolve(700,d,3,b),merge(d)]. 1.56/1.75 716 big_f(c1,A,c1) | big_f(c1,c1,f1(c1,c1,A)) | -big_f(f1(c1,c1,A),c1,c1). [resolve(708,c,11,c),merge(d)]. 1.56/1.75 724 big_f(c1,A,c1) | big_f(c1,c1,f1(c1,c1,A)). [resolve(716,c,84,a),merge(c),merge(d)]. 1.56/1.75 731 big_f(c1,A,c1) | -big_f(A,c1,c1). [resolve(724,b,10,c),merge(c)]. 1.56/1.75 737 big_f(c1,f1(c1,c1,A),c1) | big_f(A,c1,c1). [resolve(731,b,54,a),merge(b)]. 1.56/1.75 749 big_f(A,c1,c1) | -big_f(c1,A,c1). [resolve(737,a,14,c),merge(c)]. 1.56/1.75 753 big_f(f1(c1,c1,A),c1,c1) | big_f(A,c1,c1). [resolve(749,b,737,a)]. 1.56/1.75 760 big_f(A,c1,c1) | big_f(c1,c1,A). [resolve(753,a,15,a),merge(b)]. 1.56/1.75 785 big_f(A,c1,c1) | big_f(c1,A,c1). [resolve(760,b,40,a),merge(b)]. 1.56/1.75 796 big_f(c1,A,c1). [resolve(785,a,731,b),merge(b)]. 1.56/1.75 797 big_f(A,c1,c1). [resolve(785,b,749,b),merge(b)]. 1.56/1.75 800 big_f(c1,c1,A). [resolve(796,a,13,c),unit_del(a,796)]. 1.56/1.75 806 -big_f(A,B,C) | big_f(C,A,B) | big_f(B,C,A). [back_unit_del(18),unit_del(b,800)]. 1.56/1.75 810 -big_f(f1(c1,A,c1),f1(c1,A,c1),f1(c1,A,c1)). [ur(7,b,796,a,c,797,a,d,800,a)]. 1.56/1.75 811 -big_f(f1(A,c1,c1),f1(A,c1,c1),f1(A,c1,c1)). [ur(7,b,797,a,c,800,a,d,796,a)]. 1.56/1.75 812 -big_f(f1(c1,c1,A),f1(c1,c1,A),f1(c1,c1,A)). [ur(7,b,800,a,c,796,a,d,797,a)]. 1.56/1.75 831 -big_f(f1(f1(c1,A,c1),f1(c1,A,c1),f1(c1,A,c1)),f1(c1,A,c1),f1(c1,A,c1)). [ur(22,b,810,a)]. 1.56/1.75 832 -big_f(f1(f1(A,c1,c1),f1(A,c1,c1),f1(A,c1,c1)),f1(A,c1,c1),f1(A,c1,c1)). [ur(22,b,811,a)]. 1.56/1.75 833 -big_f(f1(f1(c1,c1,A),f1(c1,c1,A),f1(c1,c1,A)),f1(c1,c1,A),f1(c1,c1,A)). [ur(22,b,812,a)]. 1.56/1.75 893 big_f(A,B,f1(B,A,C)) | big_f(f1(B,A,C),A,B) | big_f(A,C,B). [resolve(806,a,3,b)]. 1.56/1.75 894 big_f(f1(A,B,C),B,A) | big_f(A,f1(A,B,C),B) | big_f(C,A,B). [resolve(806,a,2,b)]. 1.56/1.75 1029 big_f(f1(A,c1,c1),f1(A,c1,c1),f1(f1(A,c1,c1),f1(A,c1,c1),f1(A,c1,c1))). [resolve(893,b,832,a),unit_del(b,811)]. 1.56/1.75 1030 big_f(f1(c1,A,c1),f1(c1,A,c1),f1(f1(c1,A,c1),f1(c1,A,c1),f1(c1,A,c1))). [resolve(893,b,831,a),unit_del(b,810)]. 1.56/1.75 1055 big_f(f1(c1,c1,A),f1(f1(c1,c1,A),f1(c1,c1,A),f1(c1,c1,A)),f1(c1,c1,A)). [resolve(894,a,833,a),unit_del(b,812)]. 1.56/1.75 1457 big_f(f1(f1(f1(A,c1,c1),f1(A,c1,c1),f1(A,c1,c1)),f1(A,c1,c1),f1(A,c1,c1)),f1(A,c1,c1),f1(f1(A,c1,c1),f1(A,c1,c1),f1(A,c1,c1))). [resolve(1029,a,36,b),unit_del(b,811)]. 1.56/1.75 1473 -big_f(f1(f1(c1,A,c1),f1(c1,A,c1),f1(c1,A,c1)),f1(f1(f1(c1,A,c1),f1(c1,A,c1),f1(c1,A,c1)),f1(c1,A,c1),f1(c1,A,c1)),f1(c1,A,c1)). [ur(13,a,1030,a,b,831,a)]. 1.56/1.75 1483 -big_f(f1(c1,c1,A),f1(f1(c1,c1,A),f1(c1,c1,A),f1(c1,c1,A)),f1(f1(f1(c1,c1,A),f1(c1,c1,A),f1(c1,c1,A)),f1(c1,c1,A),f1(c1,c1,A))). [ur(11,a,1055,a,b,833,a)]. 1.56/1.75 1521 $F. [ur(806,b,1473,a,c,1483,a),unit_del(a,1457)]. 1.56/1.75 1.56/1.75 % SZS output end Refutation 1.56/1.75 ============================== end of proof ========================== 1.56/1.75 1.56/1.75 ============================== STATISTICS ============================ 1.56/1.75 1.56/1.75 Given=401. Generated=7106. Kept=1519. proofs=1. 1.56/1.75 Usable=318. Sos=703. Demods=0. Limbo=0, Disabled=515. Hints=0. 1.56/1.75 Megabytes=2.47. 1.56/1.75 User_CPU=1.32, System_CPU=0.01, Wall_clock=1. 1.56/1.75 1.56/1.75 ============================== end of statistics ===================== 1.56/1.75 1.56/1.75 ============================== end of search ========================= 1.56/1.75 1.56/1.75 THEOREM PROVED 1.56/1.75 % SZS status Theorem 1.56/1.75 1.56/1.75 Exiting with 1 proof. 1.56/1.75 1.56/1.75 Process 15909 exit (max_proofs) Sat Jul 14 04:40:26 2018 1.56/1.75 Prover9 interrupted 1.56/1.76 EOF