TSTP Solution File: PUZ015-10 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : PUZ015-10 : TPTP v8.1.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n025.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 : Mon Jul 18 18:09:01 EDT 2022
% Result : Unknown 36.12s 36.50s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : PUZ015-10 : TPTP v8.1.0. Released v7.5.0.
% 0.10/0.13 % Command : tptp2X_and_run_eqp %s
% 0.13/0.35 % Computer : n025.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Sun May 29 03:35:56 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.46/1.11 ----- EQP 0.9e, May 2009 -----
% 0.46/1.11 The job began on n025.cluster.edu, Sun May 29 03:35:57 2022
% 0.46/1.11 The command was "./eqp09e".
% 0.46/1.11
% 0.46/1.11 set(prolog_style_variables).
% 0.46/1.11 set(lrpo).
% 0.46/1.11 set(basic_paramod).
% 0.46/1.11 set(functional_subsume).
% 0.46/1.11 set(ordered_paramod).
% 0.46/1.11 set(prime_paramod).
% 0.46/1.11 set(para_pairs).
% 0.46/1.11 assign(pick_given_ratio,4).
% 0.46/1.11 clear(print_kept).
% 0.46/1.11 clear(print_new_demod).
% 0.46/1.11 clear(print_back_demod).
% 0.46/1.11 clear(print_given).
% 0.46/1.11 assign(max_mem,64000).
% 0.46/1.11 end_of_commands.
% 0.46/1.11
% 0.46/1.11 Usable:
% 0.46/1.11 end_of_list.
% 0.46/1.11
% 0.46/1.11 Sos:
% 0.46/1.11 0 (wt=-1) [] ifeq(A,A,B,C) = B.
% 0.46/1.11 0 (wt=-1) [] ifeq(achievable(row(A),squares(not_covered,not_covered,B,C,D,E,F,G)),true,achievable(row(A),squares(covered,covered,B,C,D,E,F,G)),true) = true.
% 0.46/1.11 0 (wt=-1) [] ifeq(achievable(row(A),squares(B,not_covered,not_covered,C,D,E,F,G)),true,achievable(row(A),squares(B,covered,covered,C,D,E,F,G)),true) = true.
% 0.46/1.11 0 (wt=-1) [] ifeq(achievable(row(A),squares(B,C,not_covered,not_covered,D,E,F,G)),true,achievable(row(A),squares(B,C,covered,covered,D,E,F,G)),true) = true.
% 0.46/1.11 0 (wt=-1) [] ifeq(achievable(row(A),squares(B,C,D,not_covered,not_covered,E,F,G)),true,achievable(row(A),squares(B,C,D,covered,covered,E,F,G)),true) = true.
% 0.46/1.11 0 (wt=-1) [] ifeq(achievable(row(A),squares(B,C,D,E,not_covered,not_covered,F,G)),true,achievable(row(A),squares(B,C,D,E,covered,covered,F,G)),true) = true.
% 0.46/1.11 0 (wt=-1) [] ifeq(achievable(row(A),squares(B,C,D,E,F,not_covered,not_covered,G)),true,achievable(row(A),squares(B,C,D,E,F,covered,covered,G)),true) = true.
% 0.46/1.11 0 (wt=-1) [] ifeq(achievable(row(A),squares(B,C,D,E,F,G,not_covered,not_covered)),true,achievable(row(A),squares(B,C,D,E,F,G,covered,covered)),true) = true.
% 0.46/1.11 0 (wt=-1) [] ifeq(achievable(row(A),squares(B,C,D,E,F,G,H,I)),true,achievable(row(successor(A)),squares(complement(B),complement(C),complement(D),complement(E),complement(F),complement(G),complement(H),complement(I))),true) = true.
% 0.46/1.11 0 (wt=-1) [] successor(n1) = n2.
% 0.46/1.11 0 (wt=-1) [] successor(n2) = n3.
% 0.46/1.11 0 (wt=-1) [] successor(n3) = n4.
% 0.46/1.11 0 (wt=-1) [] successor(n4) = n5.
% 0.46/1.11 0 (wt=-1) [] successor(n5) = n6.
% 0.46/1.11 0 (wt=-1) [] successor(n6) = n7.
% 0.46/1.11 0 (wt=-1) [] successor(n7) = n8.
% 0.46/1.11 0 (wt=-1) [] successor(n8) = n9.
% 0.46/1.11 0 (wt=-1) [] complement(covered) = not_covered.
% 0.46/1.11 0 (wt=-1) [] complement(not_covered) = covered.
% 0.46/1.11 0 (wt=-1) [] complement(removed) = not_covered.
% 0.46/1.11 0 (wt=-1) [] achievable(row(n1),squares(removed,not_covered,not_covered,not_covered,not_covered,not_covered,not_covered,not_covered)) = true.
% 0.46/1.11 0 (wt=-1) [] -(achievable(row(n8),squares(covered,covered,covered,covered,covered,covered,covered,not_covered)) = true).
% 0.46/1.11 end_of_list.
% 0.46/1.11
% 0.46/1.11 Demodulators:
% 0.46/1.11 end_of_list.
% 0.46/1.11
% 0.46/1.11 Passive:
% 0.46/1.11 end_of_list.
% 0.46/1.11
% 0.46/1.11 Starting to process input.
% 0.46/1.11
% 0.46/1.11 ** KEPT: 1 (wt=7) [] ifeq(A,A,B,C) = B.
% 0.46/1.11 1 is a new demodulator.
% 0.46/1.11
% 0.46/1.11 ** KEPT: 2 (wt=29) [] ifeq(achievable(row(A),squares(not_covered,not_covered,B,C,D,E,F,G)),true,achievable(row(A),squares(covered,covered,B,C,D,E,F,G)),true) = true.
% 0.46/1.11 2 is a new demodulator.
% 0.46/1.11
% 0.46/1.11 ** KEPT: 3 (wt=29) [] ifeq(achievable(row(A),squares(B,not_covered,not_covered,C,D,E,F,G)),true,achievable(row(A),squares(B,covered,covered,C,D,E,F,G)),true) = true.
% 0.46/1.11 3 is a new demodulator.
% 0.46/1.11
% 0.46/1.11 ** KEPT: 4 (wt=29) [] ifeq(achievable(row(A),squares(B,C,not_covered,not_covered,D,E,F,G)),true,achievable(row(A),squares(B,C,covered,covered,D,E,F,G)),true) = true.
% 0.46/1.11 4 is a new demodulator.
% 0.46/1.11
% 0.46/1.11 ** KEPT: 5 (wt=29) [] ifeq(achievable(row(A),squares(B,C,D,not_covered,not_covered,E,F,G)),true,achievable(row(A),squares(B,C,D,covered,covered,E,F,G)),true) = true.
% 0.46/1.11 5 is a new demodulator.
% 0.46/1.11
% 0.46/1.11 ** KEPT: 6 (wt=29) [] ifeq(achievable(row(A),squares(B,C,D,E,not_covered,not_covered,F,G)),true,achievable(row(A),squares(B,C,D,E,covered,covered,F,G)),true) = true.
% 0.46/1.11 6 is a new demodulator.
% 0.46/1.11
% 0.46/1.11 ** KEPT: 7 (wt=29) [] ifeq(achievable(row(A),squares(B,C,D,E,F,not_covered,not_covered,G)),true,achievable(row(A),squares(B,C,D,E,F,covered,covered,G)),true) = true.
% 0.46/1.11 7 is a new demodulator.
% 0.46/1.11
% 0.46/1.11 ** KEPT: 8 (wt=29) [] ifeq(achievable(row(A),squares(B,C,D,E,F,G,not_covered,not_covered)),true,achievable(row(A),squares(B,C,D,E,F,G,covered,covered)),true) = true.
% 0.46/1.11 8 is a new demodulator.
% 0.46/1.11
% 0.46/1.11 ** KEPT: 9 (wt=38) [] ifeq(achievable(row(A),squares(B,C,D,E,F,G,H,I)),true,achievable(row(successor(A)),squares(complement(B),complement(C),complement(D),complement(E),complement(F),complement(G),complement(H),complement(I))),true) = true.
% 36.12/36.50 9 is a new demodulator.
% 36.12/36.50
% 36.12/36.50 ** KEPT: 10 (wt=4) [] successor(n1) = n2.
% 36.12/36.50 10 is a new demodulator.
% 36.12/36.50
% 36.12/36.50 ** KEPT: 11 (wt=4) [] successor(n2) = n3.
% 36.12/36.50 11 is a new demodulator.
% 36.12/36.50
% 36.12/36.50 ** KEPT: 12 (wt=4) [] successor(n3) = n4.
% 36.12/36.50 12 is a new demodulator.
% 36.12/36.50
% 36.12/36.50 ** KEPT: 13 (wt=4) [] successor(n4) = n5.
% 36.12/36.50 13 is a new demodulator.
% 36.12/36.50
% 36.12/36.50 ** KEPT: 14 (wt=4) [] successor(n5) = n6.
% 36.12/36.50 14 is a new demodulator.
% 36.12/36.50
% 36.12/36.50 ** KEPT: 15 (wt=4) [] successor(n6) = n7.
% 36.12/36.50 15 is a new demodulator.
% 36.12/36.50
% 36.12/36.50 ** KEPT: 16 (wt=4) [] successor(n7) = n8.
% 36.12/36.50 16 is a new demodulator.
% 36.12/36.50
% 36.12/36.50 ** KEPT: 17 (wt=4) [] successor(n8) = n9.
% 36.12/36.50 17 is a new demodulator.
% 36.12/36.50
% 36.12/36.50 ** KEPT: 18 (wt=4) [] complement(covered) = not_covered.
% 36.12/36.50 18 is a new demodulator.
% 36.12/36.50
% 36.12/36.50 ** KEPT: 19 (wt=4) [] complement(not_covered) = covered.
% 36.12/36.50 19 is a new demodulator.
% 36.12/36.50
% 36.12/36.50 ** KEPT: 20 (wt=4) [] complement(removed) = not_covered.
% 36.12/36.50 20 is a new demodulator.
% 36.12/36.50
% 36.12/36.50 ** KEPT: 21 (wt=14) [] achievable(row(n1),squares(removed,not_covered,not_covered,not_covered,not_covered,not_covered,not_covered,not_covered)) = true.
% 36.12/36.50 21 is a new demodulator.
% 36.12/36.50
% 36.12/36.50 ** KEPT: 22 (wt=14) [] -(achievable(row(n8),squares(covered,covered,covered,covered,covered,covered,covered,not_covered)) = true).
% 36.12/36.50
% 36.12/36.50 After processing input:
% 36.12/36.50
% 36.12/36.50 Usable:
% 36.12/36.50 end_of_list.
% 36.12/36.50
% 36.12/36.50 Sos:
% 36.12/36.50 10 (wt=4) [] successor(n1) = n2.
% 36.12/36.50 11 (wt=4) [] successor(n2) = n3.
% 36.12/36.50 12 (wt=4) [] successor(n3) = n4.
% 36.12/36.50 13 (wt=4) [] successor(n4) = n5.
% 36.12/36.50 14 (wt=4) [] successor(n5) = n6.
% 36.12/36.50 15 (wt=4) [] successor(n6) = n7.
% 36.12/36.50 16 (wt=4) [] successor(n7) = n8.
% 36.12/36.50 17 (wt=4) [] successor(n8) = n9.
% 36.12/36.50 18 (wt=4) [] complement(covered) = not_covered.
% 36.12/36.50 19 (wt=4) [] complement(not_covered) = covered.
% 36.12/36.50 20 (wt=4) [] complement(removed) = not_covered.
% 36.12/36.50 1 (wt=7) [] ifeq(A,A,B,C) = B.
% 36.12/36.50 21 (wt=14) [] achievable(row(n1),squares(removed,not_covered,not_covered,not_covered,not_covered,not_covered,not_covered,not_covered)) = true.
% 36.12/36.50 22 (wt=14) [] -(achievable(row(n8),squares(covered,covered,covered,covered,covered,covered,covered,not_covered)) = true).
% 36.12/36.50 2 (wt=29) [] ifeq(achievable(row(A),squares(not_covered,not_covered,B,C,D,E,F,G)),true,achievable(row(A),squares(covered,covered,B,C,D,E,F,G)),true) = true.
% 36.12/36.50 3 (wt=29) [] ifeq(achievable(row(A),squares(B,not_covered,not_covered,C,D,E,F,G)),true,achievable(row(A),squares(B,covered,covered,C,D,E,F,G)),true) = true.
% 36.12/36.50 4 (wt=29) [] ifeq(achievable(row(A),squares(B,C,not_covered,not_covered,D,E,F,G)),true,achievable(row(A),squares(B,C,covered,covered,D,E,F,G)),true) = true.
% 36.12/36.50 5 (wt=29) [] ifeq(achievable(row(A),squares(B,C,D,not_covered,not_covered,E,F,G)),true,achievable(row(A),squares(B,C,D,covered,covered,E,F,G)),true) = true.
% 36.12/36.50 6 (wt=29) [] ifeq(achievable(row(A),squares(B,C,D,E,not_covered,not_covered,F,G)),true,achievable(row(A),squares(B,C,D,E,covered,covered,F,G)),true) = true.
% 36.12/36.50 7 (wt=29) [] ifeq(achievable(row(A),squares(B,C,D,E,F,not_covered,not_covered,G)),true,achievable(row(A),squares(B,C,D,E,F,covered,covered,G)),true) = true.
% 36.12/36.50 8 (wt=29) [] ifeq(achievable(row(A),squares(B,C,D,E,F,G,not_covered,not_covered)),true,achievable(row(A),squares(B,C,D,E,F,G,covered,covered)),true) = true.
% 36.12/36.50 9 (wt=38) [] ifeq(achievable(row(A),squares(B,C,D,E,F,G,H,I)),true,achievable(row(successor(A)),squares(complement(B),complement(C),complement(D),complement(E),complement(F),complement(G),complement(H),complement(I))),true) = true.
% 36.12/36.50 end_of_list.
% 36.12/36.50
% 36.12/36.50 Demodulators:
% 36.12/36.50 1 (wt=7) [] ifeq(A,A,B,C) = B.
% 36.12/36.50 2 (wt=29) [] ifeq(achievable(row(A),squares(not_covered,not_covered,B,C,D,E,F,G)),true,achievable(row(A),squares(covered,covered,B,C,D,E,F,G)),true) = true.
% 36.12/36.50 3 (wt=29) [] ifeq(achievable(row(A),squares(B,not_covered,not_covered,C,D,E,F,G)),true,achievable(row(A),squares(B,covered,covered,C,D,E,F,G)),true) = true.
% 36.12/36.50 4 (wt=29) [] ifeq(achievable(row(A),squares(B,C,not_covered,not_covered,D,E,F,G)),true,achievable(row(A),squares(B,C,covered,covered,D,E,F,G)),true) = true.
% 36.12/36.50 5 (wt=29) [] ifeq(achievable(row(A),squares(B,C,D,not_covered,not_covered,E,F,G)),true,achievable(row(A),squares(B,C,D,covered,covered,E,F,G)),true) = true.
% 36.12/36.50 6 (wt=29) [] ifeq(achievable(row(A),squares(B,C,D,E,not_covered,not_covered,F,G)),true,achievable(row(A),squares(B,C,D,E,covered,covered,F,G)),true) = true.
% 36.12/36.50 7 (wt=29) [] ifeq(achievable(row(A),squares(B,C,D,E,F,not_covered,not_covered,G)),true,achievable(row(A),squares(B,C,D,E,F,covered,covered,G)),true) = true.
% 36.12/36.50 8 (wt=29) [] ifeq(achievable(row(A),squares(B,C,D,E,F,G,not_covered,not_covered)),true,achievable(row(A),squares(B,C,D,E,F,G,covered,covered)),true) = true.
% 36.12/36.50 9 (wt=38) [] ifeq(achievable(row(A),squares(B,C,D,E,F,G,H,I)),true,achievable(row(successor(A)),squares(complement(B),complement(C),complement(D),complement(E),complement(F),complement(G),complement(H),complement(I))),true) = true.
% 36.12/36.50 10 (wt=4) [] successor(n1) = n2.
% 36.12/36.50 11 (wt=4) [] successor(n2) = n3.
% 36.12/36.50 12 (wt=4) [] successor(n3) = n4.
% 36.12/36.50 13 (wt=4) [] successor(n4) = n5.
% 36.12/36.50 14 (wt=4) [] successor(n5) = n6.
% 36.12/36.50 15 (wt=4) [] successor(n6) = n7.
% 36.12/36.50 16 (wt=4) [] successor(n7) = n8.
% 36.12/36.50 17 (wt=4) [] successor(n8) = n9.
% 36.12/36.50 18 (wt=4) [] complement(covered) = not_covered.
% 36.12/36.50 19 (wt=4) [] complement(not_covered) = covered.
% 36.12/36.50 20 (wt=4) [] complement(removed) = not_covered.
% 36.12/36.50 21 (wt=14) [] achievable(row(n1),squares(removed,not_covered,not_covered,not_covered,not_covered,not_covered,not_covered,not_covered)) = true.
% 36.12/36.50 end_of_list.
% 36.12/36.50
% 36.12/36.50 Passive:
% 36.12/36.50 end_of_list.
% 36.12/36.50
% 36.12/36.50 ------------- memory usage ---
% 36.12/36.50
% 36.12/36.50 ********** ABNORMAL END **********
% 36.12/36.50 ********** in tp_alloc, max_mem parameter exceeded.
% 36.12/36.50 ---------
% 36.12/36.50 Memory dynamically allocated (tp_alloc): 63964.
% 36.12/36.50 type (bytes each) gets frees in use avail bytes
% 36.12/36.50 sym_ent ( 96) 79 0 79 0 7.4 K
% 36.12/36.50 term ( 16) 4533459 3710424 823035 0 15971.1 K
% 36.12/36.50 gen_ptr ( 8) 4268935 632693 3636242 0 28408.1 K
% 36.12/36.50 context ( 808) 20144051 20144049 2 2 3.2 K
% 36.12/36.50 trail ( 12) 53918 53918 0 9 0.1 K
% 36.12/36.50 bt_node ( 68) 9613230 9613228 2 34 2.4 K
% 36.12/36.50 ac_position (285432) 0 0 0 0 0.0 K
% 36.12/36.50 ac_match_pos (14044) 0 0 0 0 0.0 K
% 36.12/36.50 ac_match_free_vars_pos (4020)
% 36.12/36.50 0 0 0 0 0.0 K
% 36.12/36.50 discrim ( 12) 952520 2015 950505 0 11138.7 K
% 36.12/36.50 flat ( 40) 11275107 11275107 0 37 1.4 K
% 36.12/36.50 discrim_pos ( 12) 106428 106428 0 1 0.0 K
% 36.12/36.50 fpa_head ( 12) 428 0 428 0 5.0 K
% 36.12/36.50 fpa_tree ( 28) 926798 926798 0 39 1.1 K
% 36.12/36.50 fpa_pos ( 36) 53177 53177 0 1 0.0 K
% 36.12/36.50 literal ( 12) 157867 131277 26590 0 311.6 K
% 36.12/36.50 clause ( 24) 157867 131277 26590 0 623.2 K
% 36.12/36.50 list ( 12) 26647 26591 56 3 0.7 K
% 36.12/36.50 list_pos ( 20) 106507 347 106160 0 2073.4 K
% 36.12/36.50 pair_index ( 40) 2 0 2 0 0.1 K
% 36.12/36.50
% 36.12/36.50 -------------- statistics -------------
% 36.12/36.50 Clauses input 22
% 36.12/36.50 Usable input 0
% 36.12/36.50 Sos input 22
% 36.12/36.50 Demodulators input 0
% 36.12/36.50 Passive input 0
% 36.12/36.50
% 36.12/36.50 Processed BS (before search) 22
% 36.12/36.50 Forward subsumed BS 0
% 36.12/36.50 Kept BS 22
% 36.12/36.50 New demodulators BS 21
% 36.12/36.50 Back demodulated BS 0
% 36.12/36.50
% 36.12/36.50 Clauses or pairs given 372517
% 36.12/36.50 Clauses generated 131256
% 36.12/36.50 Forward subsumed 104689
% 36.12/36.50 Deleted by weight 0
% 36.12/36.50 Deleted by variable count 0
% 36.12/36.50 Kept 26567
% 36.12/36.50 New demodulators 26567
% 36.12/36.50 Back demodulated 65
% 36.12/36.50 Ordered paramod prunes 0
% 36.12/36.50 Basic paramod prunes 2819922
% 36.12/36.50 Prime paramod prunes 0
% 36.12/36.50 Semantic prunes 0
% 36.12/36.50
% 36.12/36.50 Rewrite attmepts 3688670
% 36.12/36.50 Rewrites 106428
% 36.12/36.50
% 36.12/36.50 FPA overloads 0
% 36.12/36.50 FPA underloads 0
% 36.12/36.50
% 36.12/36.50 Usable size 0
% 36.12/36.50 Sos size 26524
% 36.12/36.50 Demodulators size 26523
% 36.12/36.50 Passive size 0
% 36.12/36.50 Disabled size 65
% 36.12/36.50
% 36.12/36.50 Proofs found 0
% 36.12/36.50
% 36.12/36.50 ----------- times (seconds) ----------- Sun May 29 03:36:32 2022
% 36.12/36.50
% 36.12/36.50 user CPU time 33.02 (0 hr, 0 min, 33 sec)
% 36.12/36.50 system CPU time 2.36 (0 hr, 0 min, 2 sec)
% 36.12/36.50 wall-clock time 35 (0 hr, 0 min, 35 sec)
% 36.12/36.50 input time 0.00
% 36.12/36.50 paramodulation time 1.41
% 36.12/36.50 demodulation time 1.54
% 36.12/36.50 orient time 0.30
% 36.12/36.50 weigh time 0.08
% 36.12/36.50 forward subsume time 0.29
% 36.12/36.50 back demod find time 22.52
% 36.12/36.50 conflict time 0.02
% 36.12/36.50 LRPO time 0.12
% 36.12/36.50 store clause time 5.75
% 36.12/36.50 disable clause time 0.02
% 36.12/36.50 prime paramod time 0.16
% 36.12/36.50 semantics time 0.00
% 36.12/36.50
% 36.12/36.50 EQP interrupted
%------------------------------------------------------------------------------