TSTP Solution File: MSC014-10 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : MSC014-10 : TPTP v8.1.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n028.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 1.17s 1.55s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : MSC014-10 : TPTP v8.1.0. Released v7.5.0.
% 0.06/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n028.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 : Fri Jul 1 16:11:46 EDT 2022
% 0.12/0.33 % CPUTime :
% 1.17/1.55 ----- EQP 0.9e, May 2009 -----
% 1.17/1.55 The job began on n028.cluster.edu, Fri Jul 1 16:11:46 2022
% 1.17/1.55 The command was "./eqp09e".
% 1.17/1.55
% 1.17/1.55 set(prolog_style_variables).
% 1.17/1.55 set(lrpo).
% 1.17/1.55 set(basic_paramod).
% 1.17/1.55 set(functional_subsume).
% 1.17/1.55 set(ordered_paramod).
% 1.17/1.55 set(prime_paramod).
% 1.17/1.55 set(para_pairs).
% 1.17/1.55 assign(pick_given_ratio,4).
% 1.17/1.55 clear(print_kept).
% 1.17/1.55 clear(print_new_demod).
% 1.17/1.55 clear(print_back_demod).
% 1.17/1.55 clear(print_given).
% 1.17/1.55 assign(max_mem,64000).
% 1.17/1.55 end_of_commands.
% 1.17/1.55
% 1.17/1.55 Usable:
% 1.17/1.55 end_of_list.
% 1.17/1.55
% 1.17/1.55 Sos:
% 1.17/1.55 0 (wt=-1) [] ifeq2(A,A,B,C) = B.
% 1.17/1.55 0 (wt=-1) [] ifeq(A,A,B,C) = B.
% 1.17/1.55 0 (wt=-1) [] equalish(n0,n0) = true.
% 1.17/1.55 0 (wt=-1) [] equalish(n1,n1) = true.
% 1.17/1.55 0 (wt=-1) [] ifeq2(equalish(A,A),true,ifeq2(equalish(B,B),true,ifeq2(equalish(C,C),true,ifeq2(equalish(D,D),true,f(D,C,B,A,sK1_exists_f_Z(D,C,B,A)),true),true),true),true) = true.
% 1.17/1.55 0 (wt=-1) [] ifeq2(f(A,B,C,D,E),true,ifeq2(f(F,G,H,I,E),true,equalish(I,D),true),true) = true.
% 1.17/1.55 0 (wt=-1) [] ifeq2(f(A,B,C,D,E),true,ifeq2(f(F,G,H,I,E),true,equalish(H,C),true),true) = true.
% 1.17/1.55 0 (wt=-1) [] ifeq2(f(A,B,C,D,E),true,ifeq2(f(F,G,H,I,E),true,equalish(G,B),true),true) = true.
% 1.17/1.55 0 (wt=-1) [] ifeq2(f(A,B,C,D,E),true,ifeq2(f(F,G,H,I,E),true,equalish(F,A),true),true) = true.
% 1.17/1.55 0 (wt=-1) [] ifeq(equalish(n0,n1),true,a,b) = b.
% 1.17/1.55 0 (wt=-1) [] ifeq(equalish(n1,n0),true,a,b) = b.
% 1.17/1.55 0 (wt=-1) [] -(a = b).
% 1.17/1.55 end_of_list.
% 1.17/1.55
% 1.17/1.55 Demodulators:
% 1.17/1.55 end_of_list.
% 1.17/1.55
% 1.17/1.55 Passive:
% 1.17/1.55 end_of_list.
% 1.17/1.55
% 1.17/1.55 Starting to process input.
% 1.17/1.55
% 1.17/1.55 ** KEPT: 1 (wt=7) [] ifeq2(A,A,B,C) = B.
% 1.17/1.55 1 is a new demodulator.
% 1.17/1.55
% 1.17/1.55 ** KEPT: 2 (wt=7) [] ifeq(A,A,B,C) = B.
% 1.17/1.55 2 is a new demodulator.
% 1.17/1.55
% 1.17/1.55 ** KEPT: 3 (wt=5) [] equalish(n0,n0) = true.
% 1.17/1.55 3 is a new demodulator.
% 1.17/1.55
% 1.17/1.55 ** KEPT: 4 (wt=5) [] equalish(n1,n1) = true.
% 1.17/1.55 4 is a new demodulator.
% 1.17/1.55
% 1.17/1.55 ** KEPT: 5 (wt=36) [] ifeq2(equalish(A,A),true,ifeq2(equalish(B,B),true,ifeq2(equalish(C,C),true,ifeq2(equalish(D,D),true,f(D,C,B,A,sK1_exists_f_Z(D,C,B,A)),true),true),true),true) = true.
% 1.17/1.55 5 is a new demodulator.
% 1.17/1.55
% 1.17/1.55 ** KEPT: 6 (wt=23) [] ifeq2(f(A,B,C,D,E),true,ifeq2(f(F,G,H,I,E),true,equalish(I,D),true),true) = true.
% 1.17/1.55 6 is a new demodulator.
% 1.17/1.55
% 1.17/1.55 ** KEPT: 7 (wt=23) [] ifeq2(f(A,B,C,D,E),true,ifeq2(f(F,G,H,I,E),true,equalish(H,C),true),true) = true.
% 1.17/1.55 7 is a new demodulator.
% 1.17/1.55
% 1.17/1.55 ** KEPT: 8 (wt=23) [] ifeq2(f(A,B,C,D,E),true,ifeq2(f(F,G,H,I,E),true,equalish(G,B),true),true) = true.
% 1.17/1.55 8 is a new demodulator.
% 1.17/1.55
% 1.17/1.55 ** KEPT: 9 (wt=23) [] ifeq2(f(A,B,C,D,E),true,ifeq2(f(F,G,H,I,E),true,equalish(F,A),true),true) = true.
% 1.17/1.55 9 is a new demodulator.
% 1.17/1.55
% 1.17/1.55 ** KEPT: 10 (wt=9) [] ifeq(equalish(n0,n1),true,a,b) = b.
% 1.17/1.55 10 is a new demodulator.
% 1.17/1.55
% 1.17/1.55 ** KEPT: 11 (wt=9) [] ifeq(equalish(n1,n0),true,a,b) = b.
% 1.17/1.55 11 is a new demodulator.
% 1.17/1.55
% 1.17/1.55 ** KEPT: 12 (wt=3) [flip(1)] -(b = a).
% 1.17/1.55
% 1.17/1.55 no more inferences to make.
% 1.17/1.55
% 1.17/1.55 After processing input:
% 1.17/1.55
% 1.17/1.55 Usable:
% 1.17/1.55 end_of_list.
% 1.17/1.55
% 1.17/1.55 Sos:
% 1.17/1.55 12 (wt=3) [flip(1)] -(b = a).
% 1.17/1.55 3 (wt=5) [] equalish(n0,n0) = true.
% 1.17/1.55 4 (wt=5) [] equalish(n1,n1) = true.
% 1.17/1.55 1 (wt=7) [] ifeq2(A,A,B,C) = B.
% 1.17/1.55 2 (wt=7) [] ifeq(A,A,B,C) = B.
% 1.17/1.55 10 (wt=9) [] ifeq(equalish(n0,n1),true,a,b) = b.
% 1.17/1.55 11 (wt=9) [] ifeq(equalish(n1,n0),true,a,b) = b.
% 1.17/1.55 6 (wt=23) [] ifeq2(f(A,B,C,D,E),true,ifeq2(f(F,G,H,I,E),true,equalish(I,D),true),true) = true.
% 1.17/1.55 7 (wt=23) [] ifeq2(f(A,B,C,D,E),true,ifeq2(f(F,G,H,I,E),true,equalish(H,C),true),true) = true.
% 1.17/1.55 8 (wt=23) [] ifeq2(f(A,B,C,D,E),true,ifeq2(f(F,G,H,I,E),true,equalish(G,B),true),true) = true.
% 1.17/1.55 9 (wt=23) [] ifeq2(f(A,B,C,D,E),true,ifeq2(f(F,G,H,I,E),true,equalish(F,A),true),true) = true.
% 1.17/1.55 5 (wt=36) [] ifeq2(equalish(A,A),true,ifeq2(equalish(B,B),true,ifeq2(equalish(C,C),true,ifeq2(equalish(D,D),true,f(D,C,B,A,sK1_exists_f_Z(D,C,B,A)),true),true),true),true) = true.
% 1.17/1.55 end_of_list.
% 1.17/1.55
% 1.17/1.55 Demodulators:
% 1.17/1.55 1 (wt=7) [] ifeq2(A,A,B,C) = B.
% 1.17/1.55 2 (wt=7) [] ifeq(A,A,B,C) = B.
% 1.17/1.55 3 (wt=5) [] equalish(n0,n0) = true.
% 1.17/1.55 4 (wt=5) [] equalish(n1,n1) = true.
% 1.17/1.55 5 (wt=36) [] ifeq2(equalish(A,A),true,ifeq2(equalish(B,B),true,ifeq2(equalish(C,C),true,ifeq2(equalish(D,D),true,f(D,C,B,A,sK1_exists_f_Z(D,C,B,A)),true),true),true),true) = true.
% 1.17/1.55 6 (wt=23) [] ifeq2(f(A,B,C,D,E),true,ifeq2(f(F,G,H,I,E),true,equalish(I,D),true),true) = true.
% 1.17/1.55 7 (wt=23) [] ifeq2(f(A,B,C,D,E),true,ifeq2(f(F,G,H,I,E),true,equalish(H,C),true),true) = true.
% 1.17/1.55 8 (wt=23) [] ifeq2(f(A,B,C,D,E),true,ifeq2(f(F,G,H,I,E),true,equalish(G,B),true),true) = true.
% 1.17/1.55 9 (wt=23) [] ifeq2(f(A,B,C,D,E),true,ifeq2(f(F,G,H,I,E),true,equalish(F,A),true),true) = true.
% 1.17/1.55 10 (wt=9) [] ifeq(equalish(n0,n1),true,a,b) = b.
% 1.17/1.55 11 (wt=9) [] ifeq(equalish(n1,n0),true,a,b) = b.
% 1.17/1.55 end_of_list.
% 1.17/1.55
% 1.17/1.55 Passive:
% 1.17/1.55 end_of_list.
% 1.17/1.55
% 1.17/1.55 no more inferences to make.
% 1.17/1.55
% 1.17/1.55 ------------- memory usage ------------
% 1.17/1.55 Memory dynamically allocated (tp_alloc): 976.
% 1.17/1.55 type (bytes each) gets frees in use avail bytes
% 1.17/1.55 sym_ent ( 96) 70 0 70 0 6.6 K
% 1.17/1.55 term ( 16) 86609 80072 6537 18 126.6 K
% 1.17/1.55 gen_ptr ( 8) 49551 24449 25102 34 196.4 K
% 1.17/1.55 context ( 808) 2228641 2228641 0 4 3.2 K
% 1.17/1.55 trail ( 12) 2116 2116 0 9 0.1 K
% 1.17/1.55 bt_node ( 68) 1770184 1770184 0 34 2.3 K
% 1.17/1.55 ac_position (285432) 0 0 0 0 0.0 K
% 1.17/1.55 ac_match_pos (14044) 0 0 0 0 0.0 K
% 1.17/1.55 ac_match_free_vars_pos (4020)
% 1.17/1.55 0 0 0 0 0.0 K
% 1.17/1.55 discrim ( 12) 4400 1474 2926 861 44.4 K
% 1.17/1.55 flat ( 40) 109697 109697 0 26 1.0 K
% 1.17/1.55 discrim_pos ( 12) 4716 4716 0 1 0.0 K
% 1.17/1.55 fpa_head ( 12) 438 0 438 0 5.1 K
% 1.17/1.55 fpa_tree ( 28) 5407 5407 0 25 0.7 K
% 1.17/1.55 fpa_pos ( 36) 743 743 0 1 0.0 K
% 1.17/1.55 literal ( 12) 4420 4048 372 1 4.4 K
% 1.17/1.55 clause ( 24) 4420 4048 372 1 8.7 K
% 1.17/1.55 list ( 12) 430 374 56 3 0.7 K
% 1.17/1.55 list_pos ( 20) 1755 652 1103 180 25.1 K
% 1.17/1.55 pair_index ( 40) 2 0 2 0 0.1 K
% 1.17/1.55
% 1.17/1.55 -------------- statistics -------------
% 1.17/1.55 Clauses input 12
% 1.17/1.55 Usable input 0
% 1.17/1.55 Sos input 12
% 1.17/1.55 Demodulators input 0
% 1.17/1.55 Passive input 0
% 1.17/1.55
% 1.17/1.55 Processed BS (before search) 12
% 1.17/1.55 Forward subsumed BS 0
% 1.17/1.55 Kept BS 12
% 1.17/1.55 New demodulators BS 11
% 1.17/1.55 Back demodulated BS 0
% 1.17/1.55
% 1.17/1.55 Clauses or pairs given 62956
% 1.17/1.55 Clauses generated 4037
% 1.17/1.55 Forward subsumed 3677
% 1.17/1.55 Deleted by weight 0
% 1.17/1.55 Deleted by variable count 0
% 1.17/1.55 Kept 360
% 1.17/1.55 New demodulators 360
% 1.17/1.55 Back demodulated 128
% 1.17/1.55 Ordered paramod prunes 0
% 1.17/1.55 Basic paramod prunes 249402
% 1.17/1.55 Prime paramod prunes 0
% 1.17/1.55 Semantic prunes 0
% 1.17/1.55
% 1.17/1.55 Rewrite attmepts 43802
% 1.17/1.55 Rewrites 4716
% 1.17/1.55
% 1.17/1.55 FPA overloads 0
% 1.17/1.55 FPA underloads 0
% 1.17/1.55
% 1.17/1.55 Usable size 0
% 1.17/1.55 Sos size 244
% 1.17/1.55 Demodulators size 243
% 1.17/1.55 Passive size 0
% 1.17/1.55 Disabled size 128
% 1.17/1.55
% 1.17/1.55 Proofs found 0
% 1.17/1.55
% 1.17/1.55 ----------- times (seconds) ----------- Fri Jul 1 16:11:47 2022
% 1.17/1.55
% 1.17/1.55 user CPU time 0.21 (0 hr, 0 min, 0 sec)
% 1.17/1.55 system CPU time 0.27 (0 hr, 0 min, 0 sec)
% 1.17/1.55 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 1.17/1.55 input time 0.00
% 1.17/1.55 paramodulation time 0.11
% 1.17/1.55 demodulation time 0.01
% 1.17/1.55 orient time 0.01
% 1.17/1.55 weigh time 0.00
% 1.17/1.55 forward subsume time 0.00
% 1.17/1.55 back demod find time 0.00
% 1.17/1.55 conflict time 0.00
% 1.17/1.55 LRPO time 0.01
% 1.17/1.55 store clause time 0.00
% 1.17/1.55 disable clause time 0.00
% 1.17/1.55 prime paramod time 0.01
% 1.17/1.55 semantics time 0.00
% 1.17/1.55
% 1.17/1.55 EQP interrupted
%------------------------------------------------------------------------------