TSTP Solution File: LCL410-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : LCL410-1 : TPTP v8.1.0. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n029.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 09:43:08 EDT 2022
% Result : Unknown 16.06s 16.42s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : LCL410-1 : TPTP v8.1.0. Released v2.5.0.
% 0.11/0.13 % Command : tptp2X_and_run_eqp %s
% 0.13/0.34 % Computer : n029.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jul 4 12:28:56 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.73/1.08 ----- EQP 0.9e, May 2009 -----
% 0.73/1.08 The job began on n029.cluster.edu, Mon Jul 4 12:28:57 2022
% 0.73/1.08 The command was "./eqp09e".
% 0.73/1.08
% 0.73/1.08 set(prolog_style_variables).
% 0.73/1.08 set(lrpo).
% 0.73/1.08 set(basic_paramod).
% 0.73/1.08 set(functional_subsume).
% 0.73/1.08 set(ordered_paramod).
% 0.73/1.08 set(prime_paramod).
% 0.73/1.08 set(para_pairs).
% 0.73/1.08 assign(pick_given_ratio,4).
% 0.73/1.08 clear(print_kept).
% 0.73/1.08 clear(print_new_demod).
% 0.73/1.08 clear(print_back_demod).
% 0.73/1.08 clear(print_given).
% 0.73/1.08 assign(max_mem,64000).
% 0.73/1.08 end_of_commands.
% 0.73/1.08
% 0.73/1.08 Usable:
% 0.73/1.08 end_of_list.
% 0.73/1.08
% 0.73/1.08 Sos:
% 0.73/1.08 0 (wt=-1) [] not(A) = xor(A,truth).
% 0.73/1.08 0 (wt=-1) [] xor(A,falsehood) = A.
% 0.73/1.08 0 (wt=-1) [] xor(A,A) = falsehood.
% 0.73/1.08 0 (wt=-1) [] and_star(A,truth) = A.
% 0.73/1.08 0 (wt=-1) [] and_star(A,falsehood) = falsehood.
% 0.73/1.08 0 (wt=-1) [] and_star(xor(truth,A),A) = falsehood.
% 0.73/1.08 0 (wt=-1) [] xor(A,xor(truth,B)) = xor(xor(A,truth),B).
% 0.73/1.08 0 (wt=-1) [] and_star(xor(and_star(xor(truth,A),B),truth),B) = and_star(xor(and_star(xor(truth,B),A),truth),A).
% 0.73/1.08 0 (wt=-1) [] or(A,B) = implies(not(A),B).
% 0.73/1.08 0 (wt=-1) [] or(or(A,B),C) = or(A,or(B,C)).
% 0.73/1.08 0 (wt=-1) [] or(A,B) = or(B,A).
% 0.73/1.08 0 (wt=-1) [] and(A,B) = not(or(not(A),not(B))).
% 0.73/1.08 0 (wt=-1) [] and(and(A,B),C) = and(A,and(B,C)).
% 0.73/1.08 0 (wt=-1) [] and(A,B) = and(B,A).
% 0.73/1.08 0 (wt=-1) [] xor(A,B) = or(and(A,not(B)),and(not(A),B)).
% 0.73/1.08 0 (wt=-1) [] xor(A,B) = xor(B,A).
% 0.73/1.08 0 (wt=-1) [] and_star(A,B) = not(or(not(A),not(B))).
% 0.73/1.08 0 (wt=-1) [] and_star(and_star(A,B),C) = and_star(A,and_star(B,C)).
% 0.73/1.08 0 (wt=-1) [] and_star(A,B) = and_star(B,A).
% 0.73/1.08 0 (wt=-1) [] not(truth) = falsehood.
% 0.73/1.08 end_of_list.
% 0.73/1.08
% 0.73/1.08 Demodulators:
% 0.73/1.08 end_of_list.
% 0.73/1.08
% 0.73/1.08 Passive:
% 0.73/1.08 end_of_list.
% 0.73/1.08
% 0.73/1.08 Starting to process input.
% 0.73/1.08
% 0.73/1.08 ** KEPT: 1 (wt=6) [] not(A) = xor(A,truth).
% 0.73/1.08 1 is a new demodulator.
% 0.73/1.08
% 0.73/1.08 ** KEPT: 2 (wt=5) [] xor(A,falsehood) = A.
% 0.73/1.08 2 is a new demodulator.
% 0.73/1.08
% 0.73/1.08 ** KEPT: 3 (wt=5) [] xor(A,A) = falsehood.
% 0.73/1.08 3 is a new demodulator.
% 0.73/1.08
% 0.73/1.08 ** KEPT: 4 (wt=5) [] and_star(A,truth) = A.
% 0.73/1.08 4 is a new demodulator.
% 0.73/1.08
% 0.73/1.08 ** KEPT: 5 (wt=5) [] and_star(A,falsehood) = falsehood.
% 0.73/1.08 5 is a new demodulator.
% 0.73/1.08
% 0.73/1.08 ** KEPT: 6 (wt=7) [] and_star(xor(truth,A),A) = falsehood.
% 0.73/1.08 6 is a new demodulator.
% 0.73/1.08
% 0.73/1.08 ** KEPT: 7 (wt=11) [flip(1)] xor(xor(A,truth),B) = xor(A,xor(truth,B)).
% 0.73/1.08 7 is a new demodulator.
% 0.73/1.08
% 0.73/1.08 ** KEPT: 8 (wt=19) [] and_star(xor(and_star(xor(truth,A),B),truth),B) = and_star(xor(and_star(xor(truth,B),A),truth),A).
% 0.73/1.09 clause forward subsumed: 0 (wt=19) [flip(8)] and_star(xor(and_star(xor(truth,B),A),truth),A) = and_star(xor(and_star(xor(truth,A),B),truth),B).
% 0.73/1.09
% 0.73/1.09 ** KEPT: 9 (wt=9) [demod([1])] or(A,B) = implies(xor(A,truth),B).
% 0.73/1.09
% 0.73/1.09 ** KEPT: 10 (wt=9) [flip(9)] implies(xor(A,truth),B) = or(A,B).
% 0.73/1.09 clause forward subsumed: 0 (wt=9) [flip(10)] or(A,B) = implies(xor(A,truth),B).
% 0.73/1.09
% 0.73/1.09 ** KEPT: 11 (wt=11) [] or(or(A,B),C) = or(A,or(B,C)).
% 0.73/1.09 11 is a new demodulator.
% 0.73/1.09
% 0.73/1.09 ** KEPT: 12 (wt=7) [] or(A,B) = or(B,A).
% 0.73/1.09 clause forward subsumed: 0 (wt=7) [flip(12)] or(B,A) = or(A,B).
% 0.73/1.09
% 0.73/1.09 ** KEPT: 13 (wt=13) [demod([1,1,1]),flip(1)] xor(or(xor(A,truth),xor(B,truth)),truth) = and(A,B).
% 0.73/1.09 13 is a new demodulator.
% 0.73/1.09
% 0.73/1.09 ** KEPT: 14 (wt=11) [] and(and(A,B),C) = and(A,and(B,C)).
% 0.73/1.09 14 is a new demodulator.
% 0.73/1.09
% 0.73/1.09 ** KEPT: 15 (wt=7) [] and(A,B) = and(B,A).
% 0.73/1.09 clause forward subsumed: 0 (wt=7) [flip(15)] and(B,A) = and(A,B).
% 0.73/1.09
% 0.73/1.09 ** KEPT: 16 (wt=15) [demod([1,1])] xor(A,B) = or(and(A,xor(B,truth)),and(xor(A,truth),B)).
% 0.73/1.09
% 0.73/1.09 ** KEPT: 17 (wt=15) [flip(16)] or(and(A,xor(B,truth)),and(xor(A,truth),B)) = xor(A,B).
% 0.73/1.09 clause forward subsumed: 0 (wt=15) [flip(17)] xor(A,B) = or(and(A,xor(B,truth)),and(xor(A,truth),B)).
% 0.73/1.09
% 0.73/1.09 ** KEPT: 18 (wt=7) [] xor(A,B) = xor(B,A).
% 0.73/1.09 clause forward subsumed: 0 (wt=7) [flip(18)] xor(B,A) = xor(A,B).
% 0.73/1.09
% 0.73/1.09 ** KEPT: 19 (wt=7) [demod([1,1,1,13])] and_star(A,B) = and(A,B).
% 0.73/1.09 19 is a new demodulator.
% 0.73/1.09 -> 19 back demodulating 8.
% 0.73/1.09
% 0.73/1.09 ** KEPT: 20 (wt=19) [back_demod(8),demod([19,19,19,19])] and(xor(and(xor(truth,A),B),truth),B) = and(xor(and(xor(truth,B),A),truth),A).
% 0.73/1.09 clause forward subsumed: 0 (wt=19) [flip(20)] and(xor(and(xor(truth,B),A),truth),A) = and(xor(and(xor(truth,A),B),truth),B).
% 0.73/1.09 -> 19 back demodulating 6.
% 0.73/1.09
% 0.73/1.09 ** KEPT: 21 (wt=7) [back_demod(6),demod([19])] and(xor(truth,A),A) = falsehood.
% 0.73/1.09 21 is a new demodulator.
% 0.73/1.09 -> 19 back demodulating 5.
% 0.73/1.09
% 0.73/1.09 ** KEPT: 22 (wt=5) [back_demod(5),demod([19])] and(A,falsehood) = falsehood.
% 0.73/1.09 22 is a new demodulator.
% 0.73/1.09 -> 19 back demodulating 4.
% 0.73/1.09
% 0.73/1.09 ** KEPT: 23 (wt=5) [back_demod(4),demod([19])] and(A,truth) = A.
% 16.06/16.42 23 is a new demodulator.
% 16.06/16.42 clause forward subsumed: 0 (wt=11) [demod([19,19,14,19,19])] and(A,and(B,C)) = and(A,and(B,C)).
% 16.06/16.42 clause forward subsumed: 0 (wt=7) [demod([19,19])] and(A,B) = and(B,A).
% 16.06/16.42 clause forward subsumed: 0 (wt=3) [demod([1,3])] falsehood = falsehood.
% 16.06/16.42
% 16.06/16.42 After processing input:
% 16.06/16.42
% 16.06/16.42 Usable:
% 16.06/16.42 end_of_list.
% 16.06/16.42
% 16.06/16.42 Sos:
% 16.06/16.42 2 (wt=5) [] xor(A,falsehood) = A.
% 16.06/16.42 3 (wt=5) [] xor(A,A) = falsehood.
% 16.06/16.42 22 (wt=5) [back_demod(5),demod([19])] and(A,falsehood) = falsehood.
% 16.06/16.42 23 (wt=5) [back_demod(4),demod([19])] and(A,truth) = A.
% 16.06/16.42 1 (wt=6) [] not(A) = xor(A,truth).
% 16.06/16.42 12 (wt=7) [] or(A,B) = or(B,A).
% 16.06/16.42 15 (wt=7) [] and(A,B) = and(B,A).
% 16.06/16.42 18 (wt=7) [] xor(A,B) = xor(B,A).
% 16.06/16.42 19 (wt=7) [demod([1,1,1,13])] and_star(A,B) = and(A,B).
% 16.06/16.42 21 (wt=7) [back_demod(6),demod([19])] and(xor(truth,A),A) = falsehood.
% 16.06/16.42 9 (wt=9) [demod([1])] or(A,B) = implies(xor(A,truth),B).
% 16.06/16.42 10 (wt=9) [flip(9)] implies(xor(A,truth),B) = or(A,B).
% 16.06/16.42 7 (wt=11) [flip(1)] xor(xor(A,truth),B) = xor(A,xor(truth,B)).
% 16.06/16.42 11 (wt=11) [] or(or(A,B),C) = or(A,or(B,C)).
% 16.06/16.42 14 (wt=11) [] and(and(A,B),C) = and(A,and(B,C)).
% 16.06/16.42 13 (wt=13) [demod([1,1,1]),flip(1)] xor(or(xor(A,truth),xor(B,truth)),truth) = and(A,B).
% 16.06/16.42 16 (wt=15) [demod([1,1])] xor(A,B) = or(and(A,xor(B,truth)),and(xor(A,truth),B)).
% 16.06/16.42 17 (wt=15) [flip(16)] or(and(A,xor(B,truth)),and(xor(A,truth),B)) = xor(A,B).
% 16.06/16.42 20 (wt=19) [back_demod(8),demod([19,19,19,19])] and(xor(and(xor(truth,A),B),truth),B) = and(xor(and(xor(truth,B),A),truth),A).
% 16.06/16.42 end_of_list.
% 16.06/16.42
% 16.06/16.42 Demodulators:
% 16.06/16.42 1 (wt=6) [] not(A) = xor(A,truth).
% 16.06/16.42 2 (wt=5) [] xor(A,falsehood) = A.
% 16.06/16.42 3 (wt=5) [] xor(A,A) = falsehood.
% 16.06/16.42 7 (wt=11) [flip(1)] xor(xor(A,truth),B) = xor(A,xor(truth,B)).
% 16.06/16.42 11 (wt=11) [] or(or(A,B),C) = or(A,or(B,C)).
% 16.06/16.42 13 (wt=13) [demod([1,1,1]),flip(1)] xor(or(xor(A,truth),xor(B,truth)),truth) = and(A,B).
% 16.06/16.42 14 (wt=11) [] and(and(A,B),C) = and(A,and(B,C)).
% 16.06/16.42 19 (wt=7) [demod([1,1,1,13])] and_star(A,B) = and(A,B).
% 16.06/16.42 21 (wt=7) [back_demod(6),demod([19])] and(xor(truth,A),A) = falsehood.
% 16.06/16.42 22 (wt=5) [back_demod(5),demod([19])] and(A,falsehood) = falsehood.
% 16.06/16.42 23 (wt=5) [back_demod(4),demod([19])] and(A,truth) = A.
% 16.06/16.42 end_of_list.
% 16.06/16.42
% 16.06/16.42 Passive:
% 16.06/16.42 end_of_list.
% 16.06/16.42
% 16.06/16.42 ------------- memory usage ------------
% 16.06/16.42 Memory dynamically allocated (tp_alloc): 63964.
% 16.06/16.42 type (bytes each) gets frees in use avail bytes
% 16.06/16.42 sym_ent ( 96) 58 0 58 0 5.4 K
% 16.06/16.42 term ( 16) 6122685 5154812 967873 13 18772.1 K
% 16.06/16.42 gen_ptr ( 8) 5868470 870550 4997920 0 39046.2 K
% 16.06/16.42 context ( 808) 4031706 4031704 2 7 7.1 K
% 16.06/16.42 trail ( 12) 987960 987960 0 7 0.1 K
% 16.06/16.42 bt_node ( 68) 1363558 1363555 3 10 0.9 K
% 16.06/16.42 ac_position (285432) 0 0 0 0 0.0 K
% 16.06/16.42 ac_match_pos (14044) 0 0 0 0 0.0 K
% 16.06/16.42 ac_match_free_vars_pos (4020)
% 16.06/16.42 0 0 0 0 0.0 K
% 16.06/16.42 discrim ( 12) 214902 4376 210526 0 2467.1 K
% 16.06/16.42 flat ( 40) 16075593 16075593 0 55 2.1 K
% 16.06/16.42 discrim_pos ( 12) 351384 351384 0 1 0.0 K
% 16.06/16.42 fpa_head ( 12) 5482 0 5482 0 64.2 K
% 16.06/16.42 fpa_tree ( 28) 21990 21990 0 13 0.4 K
% 16.06/16.42 fpa_pos ( 36) 40497 40497 0 1 0.0 K
% 16.06/16.42 literal ( 12) 259218 225449 33769 1 395.7 K
% 16.06/16.42 clause ( 24) 259218 225449 33769 1 791.5 K
% 16.06/16.42 list ( 12) 6787 6731 56 4 0.7 K
% 16.06/16.42 list_pos ( 20) 108959 2096 106863 0 2087.2 K
% 16.06/16.42 pair_index ( 40) 2 0 2 0 0.1 K
% 16.06/16.42
% 16.06/16.42 -------------- statistics -------------
% 16.06/16.42 Clauses input 20
% 16.06/16.42 Usable input 0
% 16.06/16.42 Sos input 20
% 16.06/16.42 Demodulators input 0
% 16.06/16.42 Passive input 0
% 16.06/16.42
% 16.06/16.42 Processed BS (before search) 33
% 16.06/16.42 Forward subsumed BS 10
% 16.06/16.42 Kept BS 23
% 16.06/16.42 New demodulators BS 14
% 16.06/16.42 Back demodulated BS 4
% 16.06/16.42
% 16.06/16.42 Clauses or pairs given 115295
% 16.06/16.42 Clauses generated 171149
% 16.06/16.42 Forward subsumed 137403
% 16.06/16.42 Deleted by weight 0
% 16.06/16.42 Deleted by variable count 0
% 16.06/16.42 Kept
% 16.06/16.42
% 16.06/16.42 ********** ABNORMAL END **********
% 16.06/16.42 ********** in tp_alloc, max_mem parameter exceeded.
% 16.06/16.42 33746
% 16.06/16.42 New demodulators 6714
% 16.06/16.42 Back demodulated 428
% 16.06/16.42 Ordered paramod prunes 0
% 16.06/16.42 Basic paramod prunes 286603
% 16.06/16.42 Prime paramod prunes 19435
% 16.06/16.42 Semantic prunes 0
% 16.06/16.42
% 16.06/16.42 Rewrite attmepts 2246057
% 16.06/16.42 Rewrites 280551
% 16.06/16.42
% 16.06/16.42 FPA overloads 0
% 16.06/16.42 FPA underloads 0
% 16.06/16.42
% 16.06/16.42 Usable size 0
% 16.06/16.42 Sos size 33337
% 16.06/16.42 Demodulators size 6420
% 16.06/16.42 Passive size 0
% 16.06/16.42 Disabled size 432
% 16.06/16.42
% 16.06/16.42 Proofs found 0
% 16.06/16.42
% 16.06/16.42 ----------- times (seconds) ----------- Mon Jul 4 12:29:12 2022
% 16.06/16.42
% 16.06/16.42 user CPU time 13.44 (0 hr, 0 min, 13 sec)
% 16.06/16.42 system CPU time 1.89 (0 hr, 0 min, 1 sec)
% 16.06/16.42 wall-clock time 15 (0 hr, 0 min, 15 sec)
% 16.06/16.42 input time 0.00
% 16.06/16.42 paramodulation time 0.60
% 16.06/16.42 demodulation time 0.47
% 16.06/16.42 orient time 0.37
% 16.06/16.42 weigh time 0.08
% 16.06/16.42 forward subsume time 0.23
% 16.06/16.42 back demod find time 2.12
% 16.06/16.42 conflict time 0.03
% 16.06/16.42 LRPO time 0.17
% 16.06/16.42 store clause time 8.79
% 16.06/16.42 disable clause time 0.11
% 16.06/16.42 prime paramod time 0.21
% 16.06/16.42 semantics time 0.00
% 16.06/16.42
% 16.06/16.42 EQP interrupted
%------------------------------------------------------------------------------