%------------------------------------------------------------------------------ % File : EQP---0.9e % Problem : MSC013-10 : TPTP v8.1.0. Released v7.3.0. % Transfm : none % Format : tptp:raw % Command : tptp2X_and_run_eqp %s % Computer : n013.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 : Sun Jul 17 22:40:21 EDT 2022 % Result : Unknown 2.66s 3.10s % Output : None % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----No solution output by system %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.03/0.11 % Problem : MSC013-10 : TPTP v8.1.0. Released v7.3.0. % 0.03/0.12 % Command : tptp2X_and_run_eqp %s % 0.11/0.32 % Computer : n013.cluster.edu % 0.11/0.32 % Model : x86_64 x86_64 % 0.11/0.32 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.11/0.32 % Memory : 8042.1875MB % 0.11/0.32 % OS : Linux 3.10.0-693.el7.x86_64 % 0.11/0.32 % CPULimit : 300 % 0.11/0.33 % WCLimit : 600 % 0.11/0.33 % DateTime : Fri Jul 1 15:06:44 EDT 2022 % 0.11/0.33 % CPUTime : % 2.66/3.10 ----- EQP 0.9e, May 2009 ----- % 2.66/3.10 The job began on n013.cluster.edu, Fri Jul 1 15:06:45 2022 % 2.66/3.10 The command was "./eqp09e". % 2.66/3.10 % 2.66/3.10 set(prolog_style_variables). % 2.66/3.10 set(lrpo). % 2.66/3.10 set(basic_paramod). % 2.66/3.10 set(functional_subsume). % 2.66/3.10 set(ordered_paramod). % 2.66/3.10 set(prime_paramod). % 2.66/3.10 set(para_pairs). % 2.66/3.10 assign(pick_given_ratio,4). % 2.66/3.10 clear(print_kept). % 2.66/3.10 clear(print_new_demod). % 2.66/3.10 clear(print_back_demod). % 2.66/3.10 clear(print_given). % 2.66/3.10 assign(max_mem,64000). % 2.66/3.10 end_of_commands. % 2.66/3.10 % 2.66/3.10 Usable: % 2.66/3.10 end_of_list. % 2.66/3.10 % 2.66/3.10 Sos: % 2.66/3.10 0 (wt=-1) [] ifeq(A,A,B,C) = B. % 2.66/3.10 0 (wt=-1) [] equalish(n0,n0) = true. % 2.66/3.10 0 (wt=-1) [] equalish(n1,n1) = true. % 2.66/3.10 0 (wt=-1) [] ifeq(equalish(n0,n1),true,goal,true) = true. % 2.66/3.10 0 (wt=-1) [] ifeq(equalish(n1,n0),true,goal,true) = true. % 2.66/3.10 0 (wt=-1) [] ifeq(equalish(A,A),true,ifeq(equalish(B,B),true,ifeq(equalish(C,C),true,ifeq(equalish(D,D),true,ifeq(equalish(E,E),true,f(E,D,C,B,A,sK1_relation_exists_F(E,D,C,B,A)),true),true),true),true),true) = true. % 2.66/3.10 0 (wt=-1) [] ifeq(f(A,B,C,D,E,F),true,ifeq(f(G,H,I,J,K,F),true,equalish(K,E),true),true) = true. % 2.66/3.10 0 (wt=-1) [] ifeq(f(A,B,C,D,E,F),true,ifeq(f(G,H,I,J,K,F),true,equalish(J,D),true),true) = true. % 2.66/3.10 0 (wt=-1) [] ifeq(f(A,B,C,D,E,F),true,ifeq(f(G,H,I,J,K,F),true,equalish(I,C),true),true) = true. % 2.66/3.10 0 (wt=-1) [] ifeq(f(A,B,C,D,E,F),true,ifeq(f(G,H,I,J,K,F),true,equalish(H,B),true),true) = true. % 2.66/3.10 0 (wt=-1) [] ifeq(f(A,B,C,D,E,F),true,ifeq(f(G,H,I,J,K,F),true,equalish(G,A),true),true) = true. % 2.66/3.10 0 (wt=-1) [] -(goal = true). % 2.66/3.10 end_of_list. % 2.66/3.10 % 2.66/3.10 Demodulators: % 2.66/3.10 end_of_list. % 2.66/3.10 % 2.66/3.10 Passive: % 2.66/3.10 end_of_list. % 2.66/3.10 % 2.66/3.10 Starting to process input. % 2.66/3.10 % 2.66/3.10 ** KEPT: 1 (wt=7) [] ifeq(A,A,B,C) = B. % 2.66/3.10 1 is a new demodulator. % 2.66/3.10 % 2.66/3.10 ** KEPT: 2 (wt=5) [] equalish(n0,n0) = true. % 2.66/3.10 2 is a new demodulator. % 2.66/3.10 % 2.66/3.10 ** KEPT: 3 (wt=5) [] equalish(n1,n1) = true. % 2.66/3.10 3 is a new demodulator. % 2.66/3.10 % 2.66/3.10 ** KEPT: 4 (wt=9) [] ifeq(equalish(n0,n1),true,goal,true) = true. % 2.66/3.10 4 is a new demodulator. % 2.66/3.10 % 2.66/3.10 ** KEPT: 5 (wt=9) [] ifeq(equalish(n1,n0),true,goal,true) = true. % 2.66/3.10 5 is a new demodulator. % 2.66/3.10 % 2.66/3.10 ** KEPT: 6 (wt=44) [] ifeq(equalish(A,A),true,ifeq(equalish(B,B),true,ifeq(equalish(C,C),true,ifeq(equalish(D,D),true,ifeq(equalish(E,E),true,f(E,D,C,B,A,sK1_relation_exists_F(E,D,C,B,A)),true),true),true),true),true) = true. % 2.66/3.10 6 is a new demodulator. % 2.66/3.10 % 2.66/3.10 ** KEPT: 7 (wt=25) [] ifeq(f(A,B,C,D,E,F),true,ifeq(f(G,H,I,J,K,F),true,equalish(K,E),true),true) = true. % 2.66/3.10 7 is a new demodulator. % 2.66/3.10 % 2.66/3.10 ** KEPT: 8 (wt=25) [] ifeq(f(A,B,C,D,E,F),true,ifeq(f(G,H,I,J,K,F),true,equalish(J,D),true),true) = true. % 2.66/3.10 8 is a new demodulator. % 2.66/3.10 % 2.66/3.10 ** KEPT: 9 (wt=25) [] ifeq(f(A,B,C,D,E,F),true,ifeq(f(G,H,I,J,K,F),true,equalish(I,C),true),true) = true. % 2.66/3.10 9 is a new demodulator. % 2.66/3.10 % 2.66/3.10 ** KEPT: 10 (wt=25) [] ifeq(f(A,B,C,D,E,F),true,ifeq(f(G,H,I,J,K,F),true,equalish(H,B),true),true) = true. % 2.66/3.10 10 is a new demodulator. % 2.66/3.10 % 2.66/3.10 ** KEPT: 11 (wt=25) [] ifeq(f(A,B,C,D,E,F),true,ifeq(f(G,H,I,J,K,F),true,equalish(G,A),true),true) = true. % 2.66/3.10 11 is a new demodulator. % 2.66/3.10 % 2.66/3.10 ** KEPT: 12 (wt=3) [flip(1)] -(true = goal). % 2.66/3.10 % 2.66/3.10 no more inferences to make. % 2.66/3.10 % 2.66/3.10 After processing input: % 2.66/3.10 % 2.66/3.10 Usable: % 2.66/3.10 end_of_list. % 2.66/3.10 % 2.66/3.10 Sos: % 2.66/3.10 12 (wt=3) [flip(1)] -(true = goal). % 2.66/3.10 2 (wt=5) [] equalish(n0,n0) = true. % 2.66/3.10 3 (wt=5) [] equalish(n1,n1) = true. % 2.66/3.10 1 (wt=7) [] ifeq(A,A,B,C) = B. % 2.66/3.10 4 (wt=9) [] ifeq(equalish(n0,n1),true,goal,true) = true. % 2.66/3.10 5 (wt=9) [] ifeq(equalish(n1,n0),true,goal,true) = true. % 2.66/3.10 7 (wt=25) [] ifeq(f(A,B,C,D,E,F),true,ifeq(f(G,H,I,J,K,F),true,equalish(K,E),true),true) = true. % 2.66/3.10 8 (wt=25) [] ifeq(f(A,B,C,D,E,F),true,ifeq(f(G,H,I,J,K,F),true,equalish(J,D),true),true) = true. % 2.66/3.10 9 (wt=25) [] ifeq(f(A,B,C,D,E,F),true,ifeq(f(G,H,I,J,K,F),true,equalish(I,C),true),true) = true. % 2.66/3.10 10 (wt=25) [] ifeq(f(A,B,C,D,E,F),true,ifeq(f(G,H,I,J,K,F),true,equalish(H,B),true),true) = true. % 2.66/3.10 11 (wt=25) [] ifeq(f(A,B,C,D,E,F),true,ifeq(f(G,H,I,J,K,F),true,equalish(G,A),true),true) = true. % 2.66/3.10 6 (wt=44) [] ifeq(equalish(A,A),true,ifeq(equalish(B,B),true,ifeq(equalish(C,C),true,ifeq(equalish(D,D),true,ifeq(equalish(E,E),true,f(E,D,C,B,A,sK1_relation_exists_F(E,D,C,B,A)),true),true),true),true),true) = true. % 2.66/3.10 end_of_list. % 2.66/3.10 % 2.66/3.10 Demodulators: % 2.66/3.10 1 (wt=7) [] ifeq(A,A,B,C) = B. % 2.66/3.10 2 (wt=5) [] equalish(n0,n0) = true. % 2.66/3.10 3 (wt=5) [] equalish(n1,n1) = true. % 2.66/3.10 4 (wt=9) [] ifeq(equalish(n0,n1),true,goal,true) = true. % 2.66/3.10 5 (wt=9) [] ifeq(equalish(n1,n0),true,goal,true) = true. % 2.66/3.10 6 (wt=44) [] ifeq(equalish(A,A),true,ifeq(equalish(B,B),true,ifeq(equalish(C,C),true,ifeq(equalish(D,D),true,ifeq(equalish(E,E),true,f(E,D,C,B,A,sK1_relation_exists_F(E,D,C,B,A)),true),true),true),true),true) = true. % 2.66/3.10 7 (wt=25) [] ifeq(f(A,B,C,D,E,F),true,ifeq(f(G,H,I,J,K,F),true,equalish(K,E),true),true) = true. % 2.66/3.10 8 (wt=25) [] ifeq(f(A,B,C,D,E,F),true,ifeq(f(G,H,I,J,K,F),true,equalish(J,D),true),true) = true. % 2.66/3.10 9 (wt=25) [] ifeq(f(A,B,C,D,E,F),true,ifeq(f(G,H,I,J,K,F),true,equalish(I,C),true),true) = true. % 2.66/3.10 10 (wt=25) [] ifeq(f(A,B,C,D,E,F),true,ifeq(f(G,H,I,J,K,F),true,equalish(H,B),true),true) = true. % 2.66/3.10 11 (wt=25) [] ifeq(f(A,B,C,D,E,F),true,ifeq(f(G,H,I,J,K,F),true,equalish(G,A),true),true) = true. % 2.66/3.10 end_of_list. % 2.66/3.10 % 2.66/3.10 Passive: % 2.66/3.10 end_of_list. % 2.66/3.10 % 2.66/3.10 no more inferences to make. % 2.66/3.10 % 2.66/3.10 ------------- memory usage ------------ % 2.66/3.10 Memory dynamically allocated (tp_alloc): 1464. % 2.66/3.10 type (bytes each) gets frees in use avail bytes % 2.66/3.10 sym_ent ( 96) 67 0 67 0 6.3 K % 2.66/3.10 term ( 16) 379238 360273 18965 20 367.1 K % 2.66/3.10 gen_ptr ( 8) 176428 101491 74937 40 585.8 K % 2.66/3.10 context ( 808) 15940937 15940937 0 4 3.2 K % 2.66/3.10 trail ( 12) 6903 6903 0 11 0.1 K % 2.66/3.10 bt_node ( 68) 12881594 12881594 0 42 2.8 K % 2.66/3.10 ac_position (285432) 0 0 0 0 0.0 K % 2.66/3.10 ac_match_pos (14044) 0 0 0 0 0.0 K % 2.66/3.10 ac_match_free_vars_pos (4020) % 2.66/3.10 0 0 0 0 0.0 K % 2.66/3.10 discrim ( 12) 11650 3606 8044 2647 125.3 K % 2.66/3.10 flat ( 40) 487433 487433 0 33 1.3 K % 2.66/3.10 discrim_pos ( 12) 25073 25073 0 1 0.0 K % 2.66/3.10 fpa_head ( 12) 565 0 565 0 6.6 K % 2.66/3.10 fpa_tree ( 28) 16369 16369 0 31 0.8 K % 2.66/3.10 fpa_pos ( 36) 1871 1871 0 1 0.0 K % 2.66/3.10 literal ( 12) 16661 15725 936 1 11.0 K % 2.66/3.10 clause ( 24) 16661 15725 936 1 22.0 K % 2.66/3.10 list ( 12) 994 938 56 3 0.7 K % 2.66/3.10 list_pos ( 20) 4395 1612 2783 630 66.7 K % 2.66/3.10 pair_index ( 40) 2 0 2 0 0.1 K % 2.66/3.10 % 2.66/3.10 -------------- statistics ------------- % 2.66/3.10 Clauses input 12 % 2.66/3.10 Usable input 0 % 2.66/3.10 Sos input 12 % 2.66/3.10 Demodulators input 0 % 2.66/3.10 Passive input 0 % 2.66/3.10 % 2.66/3.10 Processed BS (before search) 12 % 2.66/3.10 Forward subsumed BS 0 % 2.66/3.10 Kept BS 12 % 2.66/3.10 New demodulators BS 11 % 2.66/3.10 Back demodulated BS 0 % 2.66/3.10 % 2.66/3.10 Clauses or pairs given 394754 % 2.66/3.10 Clauses generated 15714 % 2.66/3.10 Forward subsumed 14790 % 2.66/3.10 Deleted by weight 0 % 2.66/3.10 Deleted by variable count 0 % 2.66/3.10 Kept 924 % 2.66/3.10 New demodulators 924 % 2.66/3.10 Back demodulated 320 % 2.66/3.10 Ordered paramod prunes 0 % 2.66/3.10 Basic paramod prunes 1819196 % 2.66/3.10 Prime paramod prunes 0 % 2.66/3.10 Semantic prunes 0 % 2.66/3.10 % 2.66/3.10 Rewrite attmepts 194856 % 2.66/3.10 Rewrites 25073 % 2.66/3.10 % 2.66/3.10 FPA overloads 0 % 2.66/3.10 FPA underloads 0 % 2.66/3.10 % 2.66/3.10 Usable size 0 % 2.66/3.10 Sos size 616 % 2.66/3.10 Demodulators size 615 % 2.66/3.10 Passive size 0 % 2.66/3.10 Disabled size 320 % 2.66/3.10 % 2.66/3.10 Proofs found 0 % 2.66/3.10 % 2.66/3.10 ----------- times (seconds) ----------- Fri Jul 1 15:06:47 2022 % 2.66/3.10 % 2.66/3.10 user CPU time 0.88 (0 hr, 0 min, 0 sec) % 2.66/3.10 system CPU time 1.15 (0 hr, 0 min, 1 sec) % 2.66/3.10 wall-clock time 2 (0 hr, 0 min, 2 sec) % 2.66/3.10 input time 0.00 % 2.66/3.10 paramodulation time 0.49 % 2.66/3.10 demodulation time 0.01 % 2.66/3.10 orient time 0.03 % 2.66/3.10 weigh time 0.01 % 2.66/3.10 forward subsume time 0.00 % 2.66/3.10 back demod find time 0.00 % 2.66/3.10 conflict time 0.00 % 2.66/3.10 LRPO time 0.01 % 2.66/3.10 store clause time 0.00 % 2.66/3.10 disable clause time 0.00 % 2.66/3.10 prime paramod time 0.01 % 2.66/3.10 semantics time 0.00 % 2.66/3.10 % 2.66/3.10 EQP interrupted %------------------------------------------------------------------------------