TSTP Solution File: ANA004-10 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : ANA004-10 : TPTP v8.1.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n006.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 : Thu Jul 14 18:50:30 EDT 2022
% Result : Unknown 25.36s 25.75s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : ANA004-10 : TPTP v8.1.0. Released v7.5.0.
% 0.06/0.12 % Command : tptp2X_and_run_eqp %s
% 0.13/0.33 % Computer : n006.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Fri Jul 8 03:53:06 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.69/1.10 ----- EQP 0.9e, May 2009 -----
% 0.69/1.10 The job began on n006.cluster.edu, Fri Jul 8 03:53:07 2022
% 0.69/1.10 The command was "./eqp09e".
% 0.69/1.10
% 0.69/1.10 set(prolog_style_variables).
% 0.69/1.10 set(lrpo).
% 0.69/1.10 set(basic_paramod).
% 0.69/1.10 set(functional_subsume).
% 0.69/1.10 set(ordered_paramod).
% 0.69/1.10 set(prime_paramod).
% 0.69/1.10 set(para_pairs).
% 0.69/1.10 assign(pick_given_ratio,4).
% 0.69/1.10 clear(print_kept).
% 0.69/1.10 clear(print_new_demod).
% 0.69/1.10 clear(print_back_demod).
% 0.69/1.10 clear(print_given).
% 0.69/1.10 assign(max_mem,64000).
% 0.69/1.10 end_of_commands.
% 0.69/1.10
% 0.69/1.10 Usable:
% 0.69/1.10 end_of_list.
% 0.69/1.10
% 0.69/1.10 Sos:
% 0.69/1.10 0 (wt=-1) [] ifeq3(A,A,B,C) = B.
% 0.69/1.10 0 (wt=-1) [] ifeq2(A,A,B,C) = B.
% 0.69/1.10 0 (wt=-1) [] ifeq(A,A,B,C) = B.
% 0.69/1.10 0 (wt=-1) [] add(A,n0) = A.
% 0.69/1.10 0 (wt=-1) [] add(n0,A) = A.
% 0.69/1.10 0 (wt=-1) [] ifeq3(less_than(A,B),true,ifeq3(less_than(C,A),true,less_than(C,B),true),true) = true.
% 0.69/1.10 0 (wt=-1) [] ifeq3(less_than(n0,A),true,ifeq3(less_than(n0,B),true,less_than(n0,minimum(B,A)),true),true) = true.
% 0.69/1.10 0 (wt=-1) [] ifeq3(less_than(n0,A),true,ifeq3(less_than(n0,B),true,less_than(minimum(B,A),B),true),true) = true.
% 0.69/1.10 0 (wt=-1) [] ifeq3(less_than(n0,A),true,ifeq3(less_than(n0,B),true,less_than(minimum(B,A),A),true),true) = true.
% 0.69/1.10 0 (wt=-1) [] ifeq3(less_than(A,half(B)),true,ifeq3(less_than(C,half(B)),true,less_than(add(C,A),B),true),true) = true.
% 0.69/1.10 0 (wt=-1) [] ifeq3(less_than(add(absolute(A),absolute(B)),C),true,less_than(absolute(add(A,B)),C),true) = true.
% 0.69/1.10 0 (wt=-1) [] add(add(A,B),C) = add(A,add(B,C)).
% 0.69/1.10 0 (wt=-1) [] add(A,B) = add(B,A).
% 0.69/1.10 0 (wt=-1) [] ifeq3(less_than(n0,A),true,less_than(n0,half(A)),true) = true.
% 0.69/1.10 0 (wt=-1) [] ifeq3(less_than(n0,A),true,less_than(n0,half(A)),true) = true.
% 0.69/1.10 0 (wt=-1) [] minus(add(A,B)) = add(minus(A),minus(B)).
% 0.69/1.10 0 (wt=-1) [] ifeq3(less_than(n0,A),true,less_than(n0,fp31(A)),true) = true.
% 0.69/1.10 0 (wt=-1) [] ifeq3(less_than(absolute(add(A,minus(a))),fp31(B)),true,ifeq3(less_than(n0,B),true,less_than(absolute(add(f(A),minus(l1))),B),true),true) = true.
% 0.69/1.10 0 (wt=-1) [] ifeq3(less_than(n0,A),true,less_than(n0,fp32(A)),true) = true.
% 0.69/1.10 0 (wt=-1) [] ifeq3(less_than(absolute(add(A,minus(a))),fp32(B)),true,ifeq3(less_than(n0,B),true,less_than(absolute(add(g(A),minus(l2))),B),true),true) = true.
% 0.69/1.10 0 (wt=-1) [] less_than(n0,b) = true.
% 0.69/1.10 0 (wt=-1) [] ifeq3(less_than(n0,A),true,less_than(absolute(add(fp33(A),minus(a))),A),true) = true.
% 0.69/1.10 0 (wt=-1) [] ifeq2(less_than(A,A),true,a2,b2) = b2.
% 0.69/1.10 0 (wt=-1) [] ifeq(tuple(less_than(n0,A),less_than(absolute(add(add(f(fp33(A)),minus(l1)),add(g(fp33(A)),minus(l2)))),b)),tuple(true,true),a2,b2) = b2.
% 0.69/1.10 0 (wt=-1) [] -(a2 = b2).
% 0.69/1.10 end_of_list.
% 0.69/1.10
% 0.69/1.10 Demodulators:
% 0.69/1.10 end_of_list.
% 0.69/1.10
% 0.69/1.10 Passive:
% 0.69/1.10 end_of_list.
% 0.69/1.10
% 0.69/1.10 Starting to process input.
% 0.69/1.10
% 0.69/1.10 ** KEPT: 1 (wt=7) [] ifeq3(A,A,B,C) = B.
% 0.69/1.10 1 is a new demodulator.
% 0.69/1.10
% 0.69/1.10 ** KEPT: 2 (wt=7) [] ifeq2(A,A,B,C) = B.
% 0.69/1.10 2 is a new demodulator.
% 0.69/1.10
% 0.69/1.10 ** KEPT: 3 (wt=7) [] ifeq(A,A,B,C) = B.
% 0.69/1.10 3 is a new demodulator.
% 0.69/1.10
% 0.69/1.10 ** KEPT: 4 (wt=5) [] add(A,n0) = A.
% 0.69/1.10 4 is a new demodulator.
% 0.69/1.10
% 0.69/1.10 ** KEPT: 5 (wt=5) [] add(n0,A) = A.
% 0.69/1.10 5 is a new demodulator.
% 0.69/1.10
% 0.69/1.10 ** KEPT: 6 (wt=17) [] ifeq3(less_than(A,B),true,ifeq3(less_than(C,A),true,less_than(C,B),true),true) = true.
% 0.69/1.10 6 is a new demodulator.
% 0.69/1.10
% 0.69/1.10 ** KEPT: 7 (wt=19) [] ifeq3(less_than(n0,A),true,ifeq3(less_than(n0,B),true,less_than(n0,minimum(B,A)),true),true) = true.
% 0.69/1.10 7 is a new demodulator.
% 0.69/1.10
% 0.69/1.10 ** KEPT: 8 (wt=19) [] ifeq3(less_than(n0,A),true,ifeq3(less_than(n0,B),true,less_than(minimum(B,A),B),true),true) = true.
% 0.69/1.10 8 is a new demodulator.
% 0.69/1.10
% 0.69/1.10 ** KEPT: 9 (wt=19) [] ifeq3(less_than(n0,A),true,ifeq3(less_than(n0,B),true,less_than(minimum(B,A),A),true),true) = true.
% 0.69/1.10 9 is a new demodulator.
% 0.69/1.10
% 0.69/1.10 ** KEPT: 10 (wt=21) [] ifeq3(less_than(A,half(B)),true,ifeq3(less_than(C,half(B)),true,less_than(add(C,A),B),true),true) = true.
% 0.69/1.10 10 is a new demodulator.
% 0.69/1.10
% 0.69/1.10 ** KEPT: 11 (wt=18) [] ifeq3(less_than(add(absolute(A),absolute(B)),C),true,less_than(absolute(add(A,B)),C),true) = true.
% 0.69/1.10 11 is a new demodulator.
% 0.69/1.10
% 0.69/1.10 ** KEPT: 12 (wt=11) [] add(add(A,B),C) = add(A,add(B,C)).
% 0.69/1.10 12 is a new demodulator.
% 0.69/1.10
% 0.69/1.10 ** KEPT: 13 (wt=7) [] add(A,B) = add(B,A).
% 0.69/1.10 clause forward subsumed: 0 (wt=7) [flip(13)] add(B,A) = add(A,B).
% 0.69/1.10
% 0.69/1.10 ** KEPT: 14 (wt=12) [] ifeq3(less_than(n0,A),true,less_than(n0,half(A)),true) = true.
% 0.69/1.10 14 is a new demodulator.
% 0.69/1.10 clause forward subsumed: 0 (wt=3) [demod([14])] true = true.
% 0.69/1.10
% 0.69/1.10 ** KEPT: 15 (wt=10) [] minus(add(A,B)) = add(minus(A),minus(B)).
% 25.36/25.74 15 is a new demodulator.
% 25.36/25.74
% 25.36/25.74 ** KEPT: 16 (wt=12) [] ifeq3(less_than(n0,A),true,less_than(n0,fp31(A)),true) = true.
% 25.36/25.74 16 is a new demodulator.
% 25.36/25.74
% 25.36/25.74 ** KEPT: 17 (wt=27) [] ifeq3(less_than(absolute(add(A,minus(a))),fp31(B)),true,ifeq3(less_than(n0,B),true,less_than(absolute(add(f(A),minus(l1))),B),true),true) = true.
% 25.36/25.74 17 is a new demodulator.
% 25.36/25.74
% 25.36/25.74 ** KEPT: 18 (wt=12) [] ifeq3(less_than(n0,A),true,less_than(n0,fp32(A)),true) = true.
% 25.36/25.74 18 is a new demodulator.
% 25.36/25.74
% 25.36/25.74 ** KEPT: 19 (wt=27) [] ifeq3(less_than(absolute(add(A,minus(a))),fp32(B)),true,ifeq3(less_than(n0,B),true,less_than(absolute(add(g(A),minus(l2))),B),true),true) = true.
% 25.36/25.74 19 is a new demodulator.
% 25.36/25.74
% 25.36/25.74 ** KEPT: 20 (wt=5) [] less_than(n0,b) = true.
% 25.36/25.74 20 is a new demodulator.
% 25.36/25.74
% 25.36/25.74 ** KEPT: 21 (wt=16) [] ifeq3(less_than(n0,A),true,less_than(absolute(add(fp33(A),minus(a))),A),true) = true.
% 25.36/25.74 21 is a new demodulator.
% 25.36/25.74
% 25.36/25.74 ** KEPT: 22 (wt=9) [] ifeq2(less_than(A,A),true,a2,b2) = b2.
% 25.36/25.74 22 is a new demodulator.
% 25.36/25.74
% 25.36/25.74 ** KEPT: 23 (wt=28) [demod([12])] ifeq(tuple(less_than(n0,A),less_than(absolute(add(f(fp33(A)),add(minus(l1),add(g(fp33(A)),minus(l2))))),b)),tuple(true,true),a2,b2) = b2.
% 25.36/25.74 23 is a new demodulator.
% 25.36/25.74
% 25.36/25.74 ** KEPT: 24 (wt=3) [flip(1)] -(b2 = a2).
% 25.36/25.74
% 25.36/25.74 After processing input:
% 25.36/25.74
% 25.36/25.74 Usable:
% 25.36/25.74 end_of_list.
% 25.36/25.74
% 25.36/25.74 Sos:
% 25.36/25.74 24 (wt=3) [flip(1)] -(b2 = a2).
% 25.36/25.74 4 (wt=5) [] add(A,n0) = A.
% 25.36/25.74 5 (wt=5) [] add(n0,A) = A.
% 25.36/25.74 20 (wt=5) [] less_than(n0,b) = true.
% 25.36/25.74 1 (wt=7) [] ifeq3(A,A,B,C) = B.
% 25.36/25.74 2 (wt=7) [] ifeq2(A,A,B,C) = B.
% 25.36/25.74 3 (wt=7) [] ifeq(A,A,B,C) = B.
% 25.36/25.74 13 (wt=7) [] add(A,B) = add(B,A).
% 25.36/25.74 22 (wt=9) [] ifeq2(less_than(A,A),true,a2,b2) = b2.
% 25.36/25.74 15 (wt=10) [] minus(add(A,B)) = add(minus(A),minus(B)).
% 25.36/25.74 12 (wt=11) [] add(add(A,B),C) = add(A,add(B,C)).
% 25.36/25.74 14 (wt=12) [] ifeq3(less_than(n0,A),true,less_than(n0,half(A)),true) = true.
% 25.36/25.74 16 (wt=12) [] ifeq3(less_than(n0,A),true,less_than(n0,fp31(A)),true) = true.
% 25.36/25.74 18 (wt=12) [] ifeq3(less_than(n0,A),true,less_than(n0,fp32(A)),true) = true.
% 25.36/25.74 21 (wt=16) [] ifeq3(less_than(n0,A),true,less_than(absolute(add(fp33(A),minus(a))),A),true) = true.
% 25.36/25.74 6 (wt=17) [] ifeq3(less_than(A,B),true,ifeq3(less_than(C,A),true,less_than(C,B),true),true) = true.
% 25.36/25.74 11 (wt=18) [] ifeq3(less_than(add(absolute(A),absolute(B)),C),true,less_than(absolute(add(A,B)),C),true) = true.
% 25.36/25.74 7 (wt=19) [] ifeq3(less_than(n0,A),true,ifeq3(less_than(n0,B),true,less_than(n0,minimum(B,A)),true),true) = true.
% 25.36/25.74 8 (wt=19) [] ifeq3(less_than(n0,A),true,ifeq3(less_than(n0,B),true,less_than(minimum(B,A),B),true),true) = true.
% 25.36/25.74 9 (wt=19) [] ifeq3(less_than(n0,A),true,ifeq3(less_than(n0,B),true,less_than(minimum(B,A),A),true),true) = true.
% 25.36/25.74 10 (wt=21) [] ifeq3(less_than(A,half(B)),true,ifeq3(less_than(C,half(B)),true,less_than(add(C,A),B),true),true) = true.
% 25.36/25.74 17 (wt=27) [] ifeq3(less_than(absolute(add(A,minus(a))),fp31(B)),true,ifeq3(less_than(n0,B),true,less_than(absolute(add(f(A),minus(l1))),B),true),true) = true.
% 25.36/25.74 19 (wt=27) [] ifeq3(less_than(absolute(add(A,minus(a))),fp32(B)),true,ifeq3(less_than(n0,B),true,less_than(absolute(add(g(A),minus(l2))),B),true),true) = true.
% 25.36/25.74 23 (wt=28) [demod([12])] ifeq(tuple(less_than(n0,A),less_than(absolute(add(f(fp33(A)),add(minus(l1),add(g(fp33(A)),minus(l2))))),b)),tuple(true,true),a2,b2) = b2.
% 25.36/25.74 end_of_list.
% 25.36/25.74
% 25.36/25.74 Demodulators:
% 25.36/25.74 1 (wt=7) [] ifeq3(A,A,B,C) = B.
% 25.36/25.74 2 (wt=7) [] ifeq2(A,A,B,C) = B.
% 25.36/25.74 3 (wt=7) [] ifeq(A,A,B,C) = B.
% 25.36/25.74 4 (wt=5) [] add(A,n0) = A.
% 25.36/25.74 5 (wt=5) [] add(n0,A) = A.
% 25.36/25.74 6 (wt=17) [] ifeq3(less_than(A,B),true,ifeq3(less_than(C,A),true,less_than(C,B),true),true) = true.
% 25.36/25.74 7 (wt=19) [] ifeq3(less_than(n0,A),true,ifeq3(less_than(n0,B),true,less_than(n0,minimum(B,A)),true),true) = true.
% 25.36/25.74 8 (wt=19) [] ifeq3(less_than(n0,A),true,ifeq3(less_than(n0,B),true,less_than(minimum(B,A),B),true),true) = true.
% 25.36/25.74 9 (wt=19) [] ifeq3(less_than(n0,A),true,ifeq3(less_than(n0,B),true,less_than(minimum(B,A),A),true),true) = true.
% 25.36/25.74 10 (wt=21) [] ifeq3(less_than(A,half(B)),true,ifeq3(less_than(C,half(B)),true,less_than(add(C,A),B),true),true) = true.
% 25.36/25.74 11 (wt=18) [] ifeq3(less_than(add(absolute(A),absolute(B)),C),true,less_than(absolute(add(A,B)),C),true) = true.
% 25.36/25.74 12 (wt=11) [] add(add(A,B),C) = add(A,add(B,C)).
% 25.36/25.74 14 (wt=12) [] ifeq3(less_than(n0,A),true,less_than(n0,half(A)),true) = true.
% 25.36/25.74 15 (wt=10) [] minus(add(A,B)) = add(minus(A),minus(B)).
% 25.36/25.74 16 (wt=12) [] ifeq3(less_than(n0,A),true,less_than(n0,fp31(A)),true) = true.
% 25.36/25.74 17 (wt=27) [] ifeq3(less_than(absolute(add(A,minus(a))),fp31(B)),true,ifeq3(less_than(n0,B),true,less_than(absolute(add(f(A),minus(l1))),B),true),true) = true.
% 25.36/25.74 18 (wt=12) [] ifeq3(less_than(n0,A),true,less_than(n0,fp32(A)),true) = true.
% 25.36/25.74 19 (wt=27) [] ifeq3(less_than(absolute(add(A,minus(a))),fp32(B)),true,ifeq3(less_than(n0,B),true,less_than(absolute(add(g(A),minus(l2))),B),true),true) = true.
% 25.36/25.74 20 (wt=5) [] less_than(n0,b) = true.
% 25.36/25.74 21 (wt=16) [] ifeq3(less_than(n0,A),true,less_than(absolute(add(fp33(A),minus(a))),A),true) = true.
% 25.36/25.74 22 (wt=9) [] ifeq2(less_than(A,A),true,a2,b2) = b2.
% 25.36/25.74 23 (wt=28) [demod([12])] ifeq(tuple(less_than(n0,A),less_than(absolute(add(f(fp33(A)),add(minus(l1),add(g(fp33(A)),minus(l2))))),b)),tuple(true,true),a2,b2) = b2.
% 25.36/25.74 end_of_list.
% 25.36/25.74
% 25.36/25.74 Passive:
% 25.36/25.74 end_of_list.
% 25.36/25.74
% 25.36/25.74 ------------- memory usage ------------
% 25.36/25.74 Memory dynamically allocated (tp_alloc): 63964.
% 25.36/25.74 type (bytes each) gets frees in use avail bytes
% 25.36/25.74 sym_ent ( 96) 78 0 78 0 7.3 K
% 25.36/25.74 term ( 16)
% 25.36/25.74
% 25.36/25.74 ********** ABNORMAL END **********
% 25.36/25.74 ********** in tp_alloc, max_mem parameter exceeded.
% 25.36/25.74 2070501 1265631 804870 23 15564.7 K
% 25.36/25.74 gen_ptr ( 8) 4294605 100305 4194300 0 32768.0 K
% 25.36/25.74 context ( 808) 104221477 104221475 2 4 4.7 K
% 25.36/25.74 trail ( 12) 60087 60087 0 7 0.1 K
% 25.36/25.74 bt_node ( 68) 60246660 60246657 3 30 2.2 K
% 25.36/25.74 ac_position (285432) 0 0 0 0 0.0 K
% 25.36/25.74 ac_match_pos (14044) 0 0 0 0 0.0 K
% 25.36/25.74 ac_match_free_vars_pos (4020)
% 25.36/25.74 0 0 0 0 0.0 K
% 25.36/25.74 discrim ( 12) 610938 1874 609064 0 7137.5 K
% 25.36/25.74 flat ( 40) 3525888 3525888 0 38 1.5 K
% 25.36/25.74 discrim_pos ( 12) 54056 54056 0 1 0.0 K
% 25.36/25.74 fpa_head ( 12) 24611 0 24611 0 288.4 K
% 25.36/25.74 fpa_tree ( 28) 429282 429282 0 21 0.6 K
% 25.36/25.74 fpa_pos ( 36) 79578 79578 0 1 0.0 K
% 25.36/25.74 literal ( 12) 96592 56690 39902 1 467.6 K
% 25.36/25.74 clause ( 24) 96592 56690 39902 1 935.2 K
% 25.36/25.74 list ( 12) 39735 39679 56 3 0.7 K
% 25.36/25.74 list_pos ( 20) 159717 756 158961 0 3104.7 K
% 25.36/25.74 pair_index ( 40) 2 0 2 0 0.1 K
% 25.36/25.74
% 25.36/25.74 -------------- statistics -------------
% 25.36/25.74 Clauses input 25
% 25.36/25.74 Usable input 0
% 25.36/25.74 Sos input 25
% 25.36/25.74 Demodulators input 0
% 25.36/25.74 Passive input 0
% 25.36/25.74
% 25.36/25.74 Processed BS (before search) 26
% 25.36/25.74 Forward subsumed BS 2
% 25.36/25.74 Kept BS 24
% 25.36/25.74 New demodulators BS 22
% 25.36/25.74 Back demodulated BS 0
% 25.36/25.74
% 25.36/25.74 Clauses or pairs given 3144675
% 25.36/25.74 Clauses generated 55726
% 25.36/25.74 Forward subsumed 15848
% 25.36/25.74 Deleted by weight 0
% 25.36/25.74 Deleted by variable count 0
% 25.36/25.74 Kept 39878
% 25.36/25.74 New demodulators 39654
% 25.36/25.74 Back demodulated 155
% 25.36/25.74 Ordered paramod prunes 0
% 25.36/25.74 Basic paramod prunes 4676267
% 25.36/25.74 Prime paramod prunes 7
% 25.36/25.74 Semantic prunes 0
% 25.36/25.74
% 25.36/25.74 Rewrite attmepts 1170527
% 25.36/25.74 Rewrites 53245
% 25.36/25.74
% 25.36/25.74 FPA overloads 0
% 25.36/25.74 FPA underloads 0
% 25.36/25.74
% 25.36/25.74 Usable size 0
% 25.36/25.74 Sos size 39747
% 25.36/25.74 Demodulators size 39565
% 25.36/25.74 Passive size 0
% 25.36/25.74 Disabled size 155
% 25.36/25.74
% 25.36/25.74 Proofs found 0
% 25.36/25.74
% 25.36/25.74 ----------- times (seconds) ----------- Fri Jul 8 03:53:31 2022
% 25.36/25.74
% 25.36/25.74 user CPU time 16.71 (0 hr, 0 min, 16 sec)
% 25.36/25.74 system CPU time 7.93 (0 hr, 0 min, 7 sec)
% 25.36/25.74 wall-clock time 24 (0 hr, 0 min, 24 sec)
% 25.36/25.74 input time 0.00
% 25.36/25.75 paramodulation time 3.27
% 25.36/25.75 demodulation time 0.14
% 25.36/25.75 orient time 0.05
% 25.36/25.75 weigh time 0.02
% 25.36/25.75 forward subsume time 0.04
% 25.36/25.75 back demod find time 0.53
% 25.36/25.75 conflict time 0.02
% 25.36/25.75 LRPO time 0.02
% 25.36/25.75 store clause time 10.02
% 25.36/25.75 disable clause time 0.02
% 25.36/25.75 prime paramod time 0.06
% 25.36/25.75 semantics time 0.00
% 25.36/25.75
% 25.36/25.75 EQP interrupted
%------------------------------------------------------------------------------