TSTP Solution File: ANA005-10 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : ANA005-10 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n005.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:32 EDT 2022
% Result : Unknown 25.16s 25.59s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : ANA005-10 : TPTP v8.1.0. Released v7.3.0.
% 0.04/0.13 % Command : tptp2X_and_run_eqp %s
% 0.12/0.34 % Computer : n005.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Fri Jul 8 04:23:52 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.69/1.09 ----- EQP 0.9e, May 2009 -----
% 0.69/1.09 The job began on n005.cluster.edu, Fri Jul 8 04:23:53 2022
% 0.69/1.09 The command was "./eqp09e".
% 0.69/1.09
% 0.69/1.09 set(prolog_style_variables).
% 0.69/1.09 set(lrpo).
% 0.69/1.09 set(basic_paramod).
% 0.69/1.09 set(functional_subsume).
% 0.69/1.09 set(ordered_paramod).
% 0.69/1.09 set(prime_paramod).
% 0.69/1.09 set(para_pairs).
% 0.69/1.09 assign(pick_given_ratio,4).
% 0.69/1.09 clear(print_kept).
% 0.69/1.09 clear(print_new_demod).
% 0.69/1.09 clear(print_back_demod).
% 0.69/1.09 clear(print_given).
% 0.69/1.09 assign(max_mem,64000).
% 0.69/1.09 end_of_commands.
% 0.69/1.09
% 0.69/1.09 Usable:
% 0.69/1.09 end_of_list.
% 0.69/1.09
% 0.69/1.09 Sos:
% 0.69/1.09 0 (wt=-1) [] ifeq3(A,A,B,C) = B.
% 0.69/1.09 0 (wt=-1) [] ifeq2(A,A,B,C) = B.
% 0.69/1.09 0 (wt=-1) [] ifeq(A,A,B,C) = B.
% 0.69/1.09 0 (wt=-1) [] add(A,n0) = A.
% 0.69/1.09 0 (wt=-1) [] add(n0,A) = A.
% 0.69/1.09 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.09 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.09 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.09 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.09 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.09 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.09 0 (wt=-1) [] add(add(A,B),C) = add(A,add(B,C)).
% 0.69/1.09 0 (wt=-1) [] add(A,B) = add(B,A).
% 0.69/1.09 0 (wt=-1) [] ifeq3(less_than(n0,A),true,less_than(n0,half(A)),true) = true.
% 0.69/1.09 0 (wt=-1) [] ifeq3(less_than(n0,A),true,less_than(n0,half(A)),true) = true.
% 0.69/1.09 0 (wt=-1) [] minus(add(A,B)) = add(minus(A),minus(B)).
% 0.69/1.09 0 (wt=-1) [] ifeq3(less_than(n0,A),true,less_than(n0,fp31(A)),true) = true.
% 0.69/1.09 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.09 0 (wt=-1) [] ifeq3(less_than(n0,A),true,less_than(n0,fp32(A)),true) = true.
% 0.69/1.09 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.09 0 (wt=-1) [] less_than(n0,b) = true.
% 0.69/1.09 0 (wt=-1) [] ifeq3(less_than(n0,A),true,less_than(absolute(add(fp33(A),minus(a))),A),true) = true.
% 0.69/1.09 0 (wt=-1) [] ifeq2(less_than(A,A),true,a2,b2) = b2.
% 0.69/1.09 0 (wt=-1) [] ifeq(tuple(less_than(n0,A),less_than(absolute(add(add(f(fp33(A)),g(fp33(A))),minus(add(l1,l2)))),b)),tuple(true,true),a2,b2) = b2.
% 0.69/1.09 0 (wt=-1) [] -(a2 = b2).
% 0.69/1.09 end_of_list.
% 0.69/1.09
% 0.69/1.09 Demodulators:
% 0.69/1.09 end_of_list.
% 0.69/1.09
% 0.69/1.09 Passive:
% 0.69/1.09 end_of_list.
% 0.69/1.09
% 0.69/1.09 Starting to process input.
% 0.69/1.09
% 0.69/1.09 ** KEPT: 1 (wt=7) [] ifeq3(A,A,B,C) = B.
% 0.69/1.09 1 is a new demodulator.
% 0.69/1.09
% 0.69/1.09 ** KEPT: 2 (wt=7) [] ifeq2(A,A,B,C) = B.
% 0.69/1.09 2 is a new demodulator.
% 0.69/1.09
% 0.69/1.09 ** KEPT: 3 (wt=7) [] ifeq(A,A,B,C) = B.
% 0.69/1.09 3 is a new demodulator.
% 0.69/1.09
% 0.69/1.09 ** KEPT: 4 (wt=5) [] add(A,n0) = A.
% 0.69/1.09 4 is a new demodulator.
% 0.69/1.09
% 0.69/1.09 ** KEPT: 5 (wt=5) [] add(n0,A) = A.
% 0.69/1.09 5 is a new demodulator.
% 0.69/1.09
% 0.69/1.09 ** 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.09 6 is a new demodulator.
% 0.69/1.09
% 0.69/1.09 ** 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.09 7 is a new demodulator.
% 0.69/1.09
% 0.69/1.09 ** 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.09 8 is a new demodulator.
% 0.69/1.09
% 0.69/1.09 ** 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.09 9 is a new demodulator.
% 0.69/1.09
% 0.69/1.09 ** 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.09 10 is a new demodulator.
% 0.69/1.09
% 0.69/1.09 ** 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.09 11 is a new demodulator.
% 0.69/1.09
% 0.69/1.09 ** KEPT: 12 (wt=11) [] add(add(A,B),C) = add(A,add(B,C)).
% 0.69/1.09 12 is a new demodulator.
% 0.69/1.09
% 0.69/1.09 ** KEPT: 13 (wt=7) [] add(A,B) = add(B,A).
% 0.69/1.09 clause forward subsumed: 0 (wt=7) [flip(13)] add(B,A) = add(A,B).
% 0.69/1.09
% 0.69/1.09 ** KEPT: 14 (wt=12) [] ifeq3(less_than(n0,A),true,less_than(n0,half(A)),true) = true.
% 0.69/1.09 14 is a new demodulator.
% 0.69/1.09 clause forward subsumed: 0 (wt=3) [demod([14])] true = true.
% 0.69/1.09
% 0.69/1.09 ** KEPT: 15 (wt=10) [] minus(add(A,B)) = add(minus(A),minus(B)).
% 25.16/25.59 15 is a new demodulator.
% 25.16/25.59
% 25.16/25.59 ** KEPT: 16 (wt=12) [] ifeq3(less_than(n0,A),true,less_than(n0,fp31(A)),true) = true.
% 25.16/25.59 16 is a new demodulator.
% 25.16/25.59
% 25.16/25.59 ** 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.16/25.59 17 is a new demodulator.
% 25.16/25.59
% 25.16/25.59 ** KEPT: 18 (wt=12) [] ifeq3(less_than(n0,A),true,less_than(n0,fp32(A)),true) = true.
% 25.16/25.59 18 is a new demodulator.
% 25.16/25.59
% 25.16/25.59 ** 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.16/25.59 19 is a new demodulator.
% 25.16/25.59
% 25.16/25.59 ** KEPT: 20 (wt=5) [] less_than(n0,b) = true.
% 25.16/25.59 20 is a new demodulator.
% 25.16/25.59
% 25.16/25.59 ** KEPT: 21 (wt=16) [] ifeq3(less_than(n0,A),true,less_than(absolute(add(fp33(A),minus(a))),A),true) = true.
% 25.16/25.59 21 is a new demodulator.
% 25.16/25.59
% 25.16/25.59 ** KEPT: 22 (wt=9) [] ifeq2(less_than(A,A),true,a2,b2) = b2.
% 25.16/25.59 22 is a new demodulator.
% 25.16/25.59
% 25.16/25.59 ** KEPT: 23 (wt=28) [demod([15,12])] ifeq(tuple(less_than(n0,A),less_than(absolute(add(f(fp33(A)),add(g(fp33(A)),add(minus(l1),minus(l2))))),b)),tuple(true,true),a2,b2) = b2.
% 25.16/25.59 23 is a new demodulator.
% 25.16/25.59
% 25.16/25.59 ** KEPT: 24 (wt=3) [flip(1)] -(b2 = a2).
% 25.16/25.59
% 25.16/25.59 After processing input:
% 25.16/25.59
% 25.16/25.59 Usable:
% 25.16/25.59 end_of_list.
% 25.16/25.59
% 25.16/25.59 Sos:
% 25.16/25.59 24 (wt=3) [flip(1)] -(b2 = a2).
% 25.16/25.59 4 (wt=5) [] add(A,n0) = A.
% 25.16/25.59 5 (wt=5) [] add(n0,A) = A.
% 25.16/25.59 20 (wt=5) [] less_than(n0,b) = true.
% 25.16/25.59 1 (wt=7) [] ifeq3(A,A,B,C) = B.
% 25.16/25.59 2 (wt=7) [] ifeq2(A,A,B,C) = B.
% 25.16/25.59 3 (wt=7) [] ifeq(A,A,B,C) = B.
% 25.16/25.59 13 (wt=7) [] add(A,B) = add(B,A).
% 25.16/25.59 22 (wt=9) [] ifeq2(less_than(A,A),true,a2,b2) = b2.
% 25.16/25.59 15 (wt=10) [] minus(add(A,B)) = add(minus(A),minus(B)).
% 25.16/25.59 12 (wt=11) [] add(add(A,B),C) = add(A,add(B,C)).
% 25.16/25.59 14 (wt=12) [] ifeq3(less_than(n0,A),true,less_than(n0,half(A)),true) = true.
% 25.16/25.59 16 (wt=12) [] ifeq3(less_than(n0,A),true,less_than(n0,fp31(A)),true) = true.
% 25.16/25.59 18 (wt=12) [] ifeq3(less_than(n0,A),true,less_than(n0,fp32(A)),true) = true.
% 25.16/25.59 21 (wt=16) [] ifeq3(less_than(n0,A),true,less_than(absolute(add(fp33(A),minus(a))),A),true) = true.
% 25.16/25.59 6 (wt=17) [] ifeq3(less_than(A,B),true,ifeq3(less_than(C,A),true,less_than(C,B),true),true) = true.
% 25.16/25.59 11 (wt=18) [] ifeq3(less_than(add(absolute(A),absolute(B)),C),true,less_than(absolute(add(A,B)),C),true) = true.
% 25.16/25.59 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.16/25.59 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.16/25.59 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.16/25.59 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.16/25.59 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.16/25.59 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.16/25.59 23 (wt=28) [demod([15,12])] ifeq(tuple(less_than(n0,A),less_than(absolute(add(f(fp33(A)),add(g(fp33(A)),add(minus(l1),minus(l2))))),b)),tuple(true,true),a2,b2) = b2.
% 25.16/25.59 end_of_list.
% 25.16/25.59
% 25.16/25.59 Demodulators:
% 25.16/25.59 1 (wt=7) [] ifeq3(A,A,B,C) = B.
% 25.16/25.59 2 (wt=7) [] ifeq2(A,A,B,C) = B.
% 25.16/25.59 3 (wt=7) [] ifeq(A,A,B,C) = B.
% 25.16/25.59 4 (wt=5) [] add(A,n0) = A.
% 25.16/25.59 5 (wt=5) [] add(n0,A) = A.
% 25.16/25.59 6 (wt=17) [] ifeq3(less_than(A,B),true,ifeq3(less_than(C,A),true,less_than(C,B),true),true) = true.
% 25.16/25.59 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.16/25.59 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.16/25.59 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.16/25.59 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.16/25.59 11 (wt=18) [] ifeq3(less_than(add(absolute(A),absolute(B)),C),true,less_than(absolute(add(A,B)),C),true) = true.
% 25.16/25.59 12 (wt=11) [] add(add(A,B),C) = add(A,add(B,C)).
% 25.16/25.59 14 (wt=12) [] ifeq3(less_than(n0,A),true,less_than(n0,half(A)),true) = true.
% 25.16/25.59 15 (wt=10) [] minus(add(A,B)) = add(minus(A),minus(B)).
% 25.16/25.59 16 (wt=12) [] ifeq3(less_than(n0,A),true,less_than(n0,fp31(A)),true) = true.
% 25.16/25.59 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.16/25.59 18 (wt=12) [] ifeq3(less_than(n0,A),true,less_than(n0,fp32(A)),true) = true.
% 25.16/25.59 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.16/25.59 20 (wt=5) [] less_than(n0,b) = true.
% 25.16/25.59 21 (wt=16) [] ifeq3(less_than(n0,A),true,less_than(absolute(add(fp33(A),minus(a))),A),true) = true.
% 25.16/25.59 22 (wt=9) [] ifeq2(less_than(A,A),true,a2,b2) = b2.
% 25.16/25.59 23 (wt=28) [demod([15,12])] ifeq(tuple(less_than(n0,A),less_than(absolute(add(f(fp33(A)),add(g(fp33(A)),add(minus(l1),minus(l2))))),b)),tuple(true,true),a2,b2) = b2.
% 25.16/25.59 end_of_list.
% 25.16/25.59
% 25.16/25.59 Passive:
% 25.16/25.59 end_of_list.
% 25.16/25.59
% 25.16/25.59 ------------- memory usage ------------
% 25.16/25.59 Memory dynamically allocated (tp_alloc): 63964.
% 25.16/25.59 type (bytes each) gets frees in use avail bytes
% 25.16/25.59 sym_ent ( 96) 78 0 78 0 7.3 K
% 25.16/25.59 term (
% 25.16/25.59
% 25.16/25.59 ********** ABNORMAL END **********
% 25.16/25.59 ********** in tp_alloc, max_mem parameter exceeded.
% 25.16/25.59 16) 2070712 1265616 805096 18 15569.0 K
% 25.16/25.59 gen_ptr ( 8) 4295744 100304 4195440 0 32776.9 K
% 25.16/25.59 context ( 808) 104225073 104225071 2 4 4.7 K
% 25.16/25.59 trail ( 12) 60087 60087 0 7 0.1 K
% 25.16/25.59 bt_node ( 68) 60247684 60247681 3 30 2.2 K
% 25.16/25.59 ac_position (285432) 0 0 0 0 0.0 K
% 25.16/25.59 ac_match_pos (14044) 0 0 0 0 0.0 K
% 25.16/25.59 ac_match_free_vars_pos (4020)
% 25.16/25.59 0 0 0 0 0.0 K
% 25.16/25.59 discrim ( 12) 609116 1874 607242 0 7116.1 K
% 25.16/25.59 flat ( 40) 3528055 3528055 0 38 1.5 K
% 25.16/25.59 discrim_pos ( 12) 54068 54068 0 1 0.0 K
% 25.16/25.59 fpa_head ( 12) 24611 0 24611 0 288.4 K
% 25.16/25.59 fpa_tree ( 28) 429848 429848 0 21 0.6 K
% 25.16/25.59 fpa_pos ( 36) 79602 79602 0 1 0.0 K
% 25.16/25.59 literal ( 12) 96616 56702 39914 1 467.8 K
% 25.16/25.59 clause ( 24) 96616 56702 39914 1 935.5 K
% 25.16/25.59 list ( 12) 39747 39691 56 3 0.7 K
% 25.16/25.59 list_pos ( 20) 159765 756 159009 0 3105.6 K
% 25.16/25.59 pair_index ( 40) 2 0 2 0 0.1 K
% 25.16/25.59
% 25.16/25.59 -------------- statistics -------------
% 25.16/25.59 Clauses input 25
% 25.16/25.59 Usable input 0
% 25.16/25.59 Sos input 25
% 25.16/25.59 Demodulators input 0
% 25.16/25.59 Passive input 0
% 25.16/25.59
% 25.16/25.59 Processed BS (before search) 26
% 25.16/25.59 Forward subsumed BS 2
% 25.16/25.59 Kept BS 24
% 25.16/25.59 New demodulators BS 22
% 25.16/25.59 Back demodulated BS 0
% 25.16/25.59
% 25.16/25.59 Clauses or pairs given 3144785
% 25.16/25.59 Clauses generated 55738
% 25.16/25.59 Forward subsumed 15848
% 25.16/25.59 Deleted by weight 0
% 25.16/25.59 Deleted by variable count 0
% 25.16/25.59 Kept 39890
% 25.16/25.59 New demodulators 39666
% 25.16/25.59 Back demodulated 155
% 25.16/25.59 Ordered paramod prunes 0
% 25.16/25.59 Basic paramod prunes 4676304
% 25.16/25.59 Prime paramod prunes 7
% 25.16/25.59 Semantic prunes 0
% 25.16/25.59
% 25.16/25.59 Rewrite attmepts 1170799
% 25.16/25.59 Rewrites 53257
% 25.16/25.59
% 25.16/25.59 FPA overloads 0
% 25.16/25.59 FPA underloads 0
% 25.16/25.59
% 25.16/25.59 Usable size 0
% 25.16/25.59 Sos size 39759
% 25.16/25.59 Demodulators size 39577
% 25.16/25.59 Passive size 0
% 25.16/25.59 Disabled size 155
% 25.16/25.59
% 25.16/25.59 Proofs found 0
% 25.16/25.59
% 25.16/25.59 ----------- times (seconds) ----------- Fri Jul 8 04:24:17 2022
% 25.16/25.59
% 25.16/25.59 user CPU time 16.42 (0 hr, 0 min, 16 sec)
% 25.16/25.59 system CPU time 8.07 (0 hr, 0 min, 8 sec)
% 25.16/25.59 wall-clock time 24 (0 hr, 0 min, 24 sec)
% 25.16/25.59 input time 0.00
% 25.16/25.59 paramodulation time 3.37
% 25.16/25.59 demodulation time 0.15
% 25.16/25.59 orient time 0.08
% 25.16/25.59 weigh time 0.01
% 25.16/25.59 forward subsume time 0.06
% 25.16/25.59 back demod find time 0.53
% 25.16/25.59 conflict time 0.02
% 25.16/25.59 LRPO time 0.02
% 25.16/25.59 store clause time 9.55
% 25.16/25.59 disable clause time 0.02
% 25.16/25.59 prime paramod time 0.07
% 25.16/25.59 semantics time 0.00
% 25.16/25.59
% 25.16/25.59 EQP interrupted
%------------------------------------------------------------------------------