0.07/0.12 % Problem : theBenchmark.p : TPTP v0.0.0. Released v0.0.0. 0.07/0.13 % Command : tptp2X_and_run_prover9 %d %s 0.13/0.34 % Computer : n020.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 : 180 0.13/0.34 % DateTime : Thu Aug 29 10:09:55 EDT 2019 0.13/0.34 % CPUTime : 1.71/2.03 ============================== Prover9 =============================== 1.71/2.03 Prover9 (32) version 2009-11A, November 2009. 1.71/2.03 Process 14835 was started by sandbox on n020.cluster.edu, 1.71/2.03 Thu Aug 29 10:09:56 2019 1.71/2.03 The command was "/export/starexec/sandbox/solver/bin/prover9 -t 180 -f /tmp/Prover9_14601_n020.cluster.edu". 1.71/2.03 ============================== end of head =========================== 1.71/2.03 1.71/2.03 ============================== INPUT ================================= 1.71/2.03 1.71/2.03 % Reading from file /tmp/Prover9_14601_n020.cluster.edu 1.71/2.03 1.71/2.03 set(prolog_style_variables). 1.71/2.03 set(auto2). 1.71/2.03 % set(auto2) -> set(auto). 1.71/2.03 % set(auto) -> set(auto_inference). 1.71/2.03 % set(auto) -> set(auto_setup). 1.71/2.03 % set(auto_setup) -> set(predicate_elim). 1.71/2.03 % set(auto_setup) -> assign(eq_defs, unfold). 1.71/2.03 % set(auto) -> set(auto_limits). 1.71/2.03 % set(auto_limits) -> assign(max_weight, "100.000"). 1.71/2.03 % set(auto_limits) -> assign(sos_limit, 20000). 1.71/2.03 % set(auto) -> set(auto_denials). 1.71/2.03 % set(auto) -> set(auto_process). 1.71/2.03 % set(auto2) -> assign(new_constants, 1). 1.71/2.03 % set(auto2) -> assign(fold_denial_max, 3). 1.71/2.03 % set(auto2) -> assign(max_weight, "200.000"). 1.71/2.03 % set(auto2) -> assign(max_hours, 1). 1.71/2.03 % assign(max_hours, 1) -> assign(max_seconds, 3600). 1.71/2.03 % set(auto2) -> assign(max_seconds, 0). 1.71/2.03 % set(auto2) -> assign(max_minutes, 5). 1.71/2.03 % assign(max_minutes, 5) -> assign(max_seconds, 300). 1.71/2.03 % set(auto2) -> set(sort_initial_sos). 1.71/2.03 % set(auto2) -> assign(sos_limit, -1). 1.71/2.03 % set(auto2) -> assign(lrs_ticks, 3000). 1.71/2.03 % set(auto2) -> assign(max_megs, 400). 1.71/2.03 % set(auto2) -> assign(stats, some). 1.71/2.03 % set(auto2) -> clear(echo_input). 1.71/2.03 % set(auto2) -> set(quiet). 1.71/2.03 % set(auto2) -> clear(print_initial_clauses). 1.71/2.03 % set(auto2) -> clear(print_given). 1.71/2.03 assign(lrs_ticks,-1). 1.71/2.03 assign(sos_limit,10000). 1.71/2.03 assign(order,kbo). 1.71/2.03 set(lex_order_vars). 1.71/2.03 clear(print_given). 1.71/2.03 1.71/2.03 % formulas(sos). % not echoed (1 formulas) 1.71/2.03 1.71/2.03 ============================== end of input ========================== 1.71/2.03 1.71/2.03 % From the command line: assign(max_seconds, 180). 1.71/2.03 1.71/2.03 ============================== PROCESS NON-CLAUSAL FORMULAS ========== 1.71/2.03 1.71/2.03 % Formulas that are not ordinary clauses: 1.71/2.03 1 -(all X exists Y1 exists Y2 exists Y3 all Z ((big_f(Y1,Y2,Y3) -> (big_f(X,X,Z) -> big_f(Y2,Y3,Y1) | big_f(Y3,Y1,Y2))) -> ((big_f(Y2,Y1,Z) <-> (big_f(Y3,Y1,Y2) -> big_f(Y2,Y3,Y1) & big_f(Y1,Y2,Y3))) -> (((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.71/2.03 1.71/2.03 ============================== end of process non-clausal formulas === 1.71/2.03 1.71/2.03 ============================== PROCESS INITIAL CLAUSES =============== 1.71/2.03 1.71/2.03 ============================== PREDICATE ELIMINATION ================= 1.71/2.03 1.71/2.03 ============================== end predicate elimination ============= 1.71/2.03 1.71/2.03 Auto_denials: (non-Horn, no changes). 1.71/2.03 1.71/2.03 Term ordering decisions: 1.71/2.03 Function symbol KB weights: c1=1. f1=1. 1.71/2.03 1.71/2.03 ============================== end of process initial clauses ======== 1.71/2.03 1.71/2.03 ============================== CLAUSES FOR SEARCH ==================== 1.71/2.03 1.71/2.03 ============================== end of clauses for search ============= 1.71/2.03 1.71/2.03 ============================== SEARCH ================================ 1.71/2.03 1.71/2.03 % Starting search at 0.01 seconds. 1.71/2.03 1.71/2.03 ============================== PROOF ================================= 1.71/2.03 % SZS status Theorem 1.71/2.03 % SZS output start Refutation 1.71/2.03 1.71/2.03 % Proof 1 at 1.02 (+ 0.01) seconds. 1.71/2.03 % Length of proof is 53. 1.71/2.03 % Level of proof is 26. 1.71/2.03 % Maximum clause weight is 40.000. 1.71/2.03 % Given clauses 401. 1.71/2.03 1.71/2.03 1 -(all X exists Y1 exists Y2 exists Y3 all Z ((big_f(Y1,Y2,Y3) -> (big_f(X,X,Z) -> big_f(Y2,Y3,Y1) | big_f(Y3,Y1,Y2))) -> ((big_f(Y2,Y1,Z) <-> (big_f(Y3,Y1,Y2) -> big_f(Y2,Y3,Y1) & big_f(Y1,Y2,Y3))) -> (((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.71/2.03 2 big_f(A,B,f1(B,A,C)) | big_f(C,B,A) # label(church_46_18_5) # label(negated_conjecture). [clausify(1)]. 1.71/2.03 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.71/2.03 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.71/2.03 9 -big_f(A,B,f1(B,A,C)) | -big_f(C,B,A) | big_f(A,C,B) # label(church_46_18_5) # label(negated_conjecture). [clausify(1)]. 1.71/2.03 10 -big_f(A,B,f1(B,A,C)) | -big_f(C,B,A) | big_f(B,A,C) # label(church_46_18_5) # label(negated_conjecture). [clausify(1)]. 1.71/2.03 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.71/2.03 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.71/2.03 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.71/2.03 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.71/2.03 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.71/2.03 18 -big_f(A,B,C) | -big_f(c1,c1,f1(A,B,C)) | big_f(B,C,A) | big_f(C,A,B) # label(church_46_18_5) # label(negated_conjecture). [clausify(1)]. 1.71/2.03 22 -big_f(f1(A,A,A),A,A) | big_f(A,A,A). [factor(15,b,c)]. 1.71/2.03 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.71/2.03 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.71/2.03 40 -big_f(c1,c1,A) | big_f(c1,A,c1) | big_f(A,c1,c1). [resolve(18,b,2,a),merge(d)]. 1.71/2.03 54 big_f(c1,f1(c1,c1,A),c1) | big_f(f1(c1,c1,A),c1,c1) | big_f(A,c1,c1). [resolve(40,a,2,a)]. 1.71/2.03 70 big_f(c1,f1(c1,c1,A),c1) | big_f(A,c1,c1) | big_f(c1,c1,A). [resolve(54,b,15,a),merge(c)]. 1.71/2.03 80 big_f(A,c1,c1) | big_f(c1,c1,A) | -big_f(c1,A,c1). [resolve(70,a,14,c),merge(d)]. 1.71/2.03 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.71/2.03 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.71/2.03 91 big_f(c1,A,c1) | big_f(c1,c1,A) | -big_f(A,c1,c1). [resolve(86,a,10,a),merge(d)]. 1.71/2.03 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.71/2.03 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,91,c)]. 1.71/2.03 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.71/2.03 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.71/2.03 718 big_f(c1,A,c1) | big_f(c1,c1,f1(c1,c1,A)) | -big_f(f1(c1,c1,A),c1,c1). [resolve(708,c,10,a),merge(d)]. 1.71/2.03 724 big_f(c1,A,c1) | big_f(c1,c1,f1(c1,c1,A)). [resolve(718,c,84,a),merge(c),merge(d)]. 1.71/2.03 732 big_f(c1,A,c1) | -big_f(A,c1,c1). [resolve(724,b,9,a),merge(c)]. 1.71/2.03 737 big_f(c1,f1(c1,c1,A),c1) | big_f(A,c1,c1). [resolve(732,b,54,b),merge(b)]. 1.71/2.03 749 big_f(A,c1,c1) | -big_f(c1,A,c1). [resolve(737,a,14,c),merge(c)]. 1.71/2.03 753 big_f(f1(c1,c1,A),c1,c1) | big_f(A,c1,c1). [resolve(749,b,737,a)]. 1.71/2.03 760 big_f(A,c1,c1) | big_f(c1,c1,A). [resolve(753,a,15,a),merge(b)]. 1.71/2.03 785 big_f(A,c1,c1) | big_f(c1,A,c1). [resolve(760,b,40,a),merge(c)]. 1.71/2.03 796 big_f(c1,A,c1). [resolve(785,a,732,b),merge(b)]. 1.71/2.03 797 big_f(A,c1,c1). [resolve(785,b,749,b),merge(b)]. 1.71/2.03 800 big_f(c1,c1,A). [resolve(796,a,13,c),unit_del(a,796)]. 1.71/2.03 806 -big_f(A,B,C) | big_f(B,C,A) | big_f(C,A,B). [back_unit_del(18),unit_del(b,800)]. 1.71/2.03 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.71/2.03 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.71/2.03 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.71/2.03 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.71/2.03 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.71/2.03 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.71/2.03 893 big_f(f1(A,B,C),B,A) | big_f(B,A,f1(A,B,C)) | big_f(B,C,A). [resolve(806,a,3,b)]. 1.71/2.03 894 big_f(A,f1(A,B,C),B) | big_f(f1(A,B,C),B,A) | big_f(C,A,B). [resolve(806,a,2,a)]. 1.71/2.03 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,a,832,a),unit_del(b,811)]. 1.71/2.03 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,a,831,a),unit_del(b,810)]. 1.71/2.03 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,b,833,a),unit_del(b,812)]. 1.71/2.03 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.71/2.03 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.71/2.03 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(10,b,1055,a,c,833,a)]. 1.71/2.03 1521 $F. [ur(806,b,1483,a,c,1473,a),unit_del(a,1457)]. 1.71/2.03 1.71/2.03 % SZS output end Refutation 1.71/2.03 ============================== end of proof ========================== 1.71/2.03 1.71/2.03 ============================== STATISTICS ============================ 1.71/2.03 1.71/2.03 Given=401. Generated=7106. Kept=1519. proofs=1. 1.71/2.03 Usable=318. Sos=703. Demods=0. Limbo=0, Disabled=515. Hints=0. 1.71/2.03 Megabytes=2.47. 1.71/2.03 User_CPU=1.02, System_CPU=0.01, Wall_clock=1. 1.71/2.03 1.71/2.03 ============================== end of statistics ===================== 1.71/2.03 1.71/2.03 ============================== end of search ========================= 1.71/2.03 1.71/2.03 THEOREM PROVED 1.71/2.03 % SZS status Theorem 1.71/2.03 1.71/2.03 Exiting with 1 proof. 1.71/2.03 1.71/2.03 Process 14835 exit (max_proofs) Thu Aug 29 10:09:57 2019 1.71/2.03 Prover9 interrupted 1.71/2.03 EOF