TSTP Solution File: LCL306-10 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : LCL306-10 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n008.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:42:35 EDT 2022
% Result : Unknown 29.64s 30.08s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : LCL306-10 : TPTP v8.1.0. Released v7.3.0.
% 0.07/0.14 % Command : tptp2X_and_run_eqp %s
% 0.13/0.35 % Computer : n008.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 Jul 3 02:16:53 EDT 2022
% 0.13/0.35 % CPUTime :
% 29.64/30.07 ----- EQP 0.9e, May 2009 -----
% 29.64/30.07 The job began on n008.cluster.edu, Sun Jul 3 02:16:54 2022
% 29.64/30.07 The command was "./eqp09e".
% 29.64/30.07
% 29.64/30.07 set(prolog_style_variables).
% 29.64/30.07 set(lrpo).
% 29.64/30.07 set(basic_paramod).
% 29.64/30.07 set(functional_subsume).
% 29.64/30.07 set(ordered_paramod).
% 29.64/30.07 set(prime_paramod).
% 29.64/30.07 set(para_pairs).
% 29.64/30.07 assign(pick_given_ratio,4).
% 29.64/30.07 clear(print_kept).
% 29.64/30.07 clear(print_new_demod).
% 29.64/30.07 clear(print_back_demod).
% 29.64/30.07 clear(print_given).
% 29.64/30.07 assign(max_mem,64000).
% 29.64/30.07 end_of_commands.
% 29.64/30.07
% 29.64/30.07 Usable:
% 29.64/30.07 end_of_list.
% 29.64/30.07
% 29.64/30.07 Sos:
% 29.64/30.07 0 (wt=-1) [] ifeq(A,A,B,C) = B.
% 29.64/30.07 0 (wt=-1) [] axiom(implies(or(A,A),A)) = true.
% 29.64/30.07 0 (wt=-1) [] axiom(implies(A,or(B,A))) = true.
% 29.64/30.07 0 (wt=-1) [] axiom(implies(or(A,B),or(B,A))) = true.
% 29.64/30.07 0 (wt=-1) [] axiom(implies(or(A,or(B,C)),or(B,or(A,C)))) = true.
% 29.64/30.07 0 (wt=-1) [] axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))) = true.
% 29.64/30.07 0 (wt=-1) [] implies(A,B) = or(not(A),B).
% 29.64/30.07 0 (wt=-1) [] ifeq(axiom(A),true,theorem(A),true) = true.
% 29.64/30.07 0 (wt=-1) [] ifeq(theorem(implies(A,B)),true,ifeq(theorem(A),true,theorem(B),true),true) = true.
% 29.64/30.07 0 (wt=-1) [] and(A,B) = not(or(not(A),not(B))).
% 29.64/30.07 0 (wt=-1) [] equivalent(A,B) = and(implies(A,B),implies(B,A)).
% 29.64/30.07 0 (wt=-1) [] -(theorem(implies(not(p),equivalent(q,or(p,q)))) = true).
% 29.64/30.07 end_of_list.
% 29.64/30.07
% 29.64/30.07 Demodulators:
% 29.64/30.07 end_of_list.
% 29.64/30.07
% 29.64/30.07 Passive:
% 29.64/30.07 end_of_list.
% 29.64/30.07
% 29.64/30.07 Starting to process input.
% 29.64/30.07
% 29.64/30.07 ** KEPT: 1 (wt=7) [] ifeq(A,A,B,C) = B.
% 29.64/30.07 1 is a new demodulator.
% 29.64/30.07
% 29.64/30.07 ** KEPT: 2 (wt=8) [] axiom(implies(or(A,A),A)) = true.
% 29.64/30.07 2 is a new demodulator.
% 29.64/30.07
% 29.64/30.07 ** KEPT: 3 (wt=8) [] axiom(implies(A,or(B,A))) = true.
% 29.64/30.07 3 is a new demodulator.
% 29.64/30.07
% 29.64/30.07 ** KEPT: 4 (wt=10) [] axiom(implies(or(A,B),or(B,A))) = true.
% 29.64/30.07 4 is a new demodulator.
% 29.64/30.07
% 29.64/30.07 ** KEPT: 5 (wt=14) [] axiom(implies(or(A,or(B,C)),or(B,or(A,C)))) = true.
% 29.64/30.07 5 is a new demodulator.
% 29.64/30.07
% 29.64/30.07 ** KEPT: 6 (wt=14) [] axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))) = true.
% 29.64/30.07 6 is a new demodulator.
% 29.64/30.07
% 29.64/30.07 ** KEPT: 7 (wt=8) [flip(1)] or(not(A),B) = implies(A,B).
% 29.64/30.07 7 is a new demodulator.
% 29.64/30.07
% 29.64/30.07 ** KEPT: 8 (wt=9) [] ifeq(axiom(A),true,theorem(A),true) = true.
% 29.64/30.07 8 is a new demodulator.
% 29.64/30.07
% 29.64/30.07 ** KEPT: 9 (wt=16) [] ifeq(theorem(implies(A,B)),true,ifeq(theorem(A),true,theorem(B),true),true) = true.
% 29.64/30.07 9 is a new demodulator.
% 29.64/30.07
% 29.64/30.07 ** KEPT: 10 (wt=9) [demod([7]),flip(1)] not(implies(A,not(B))) = and(A,B).
% 29.64/30.07 10 is a new demodulator.
% 29.64/30.07
% 29.64/30.07 ** KEPT: 11 (wt=11) [flip(1)] and(implies(A,B),implies(B,A)) = equivalent(A,B).
% 29.64/30.07 11 is a new demodulator.
% 29.64/30.07
% 29.64/30.07 ** KEPT: 12 (wt=11) [] -(theorem(implies(not(p),equivalent(q,or(p,q)))) = true).
% 29.64/30.07
% 29.64/30.07 After processing input:
% 29.64/30.07
% 29.64/30.07 Usable:
% 29.64/30.07 end_of_list.
% 29.64/30.07
% 29.64/30.07 Sos:
% 29.64/30.07 1 (wt=7) [] ifeq(A,A,B,C) = B.
% 29.64/30.07 2 (wt=8) [] axiom(implies(or(A,A),A)) = true.
% 29.64/30.07 3 (wt=8) [] axiom(implies(A,or(B,A))) = true.
% 29.64/30.07 7 (wt=8) [flip(1)] or(not(A),B) = implies(A,B).
% 29.64/30.07 8 (wt=9) [] ifeq(axiom(A),true,theorem(A),true) = true.
% 29.64/30.07 10 (wt=9) [demod([7]),flip(1)] not(implies(A,not(B))) = and(A,B).
% 29.64/30.07 4 (wt=10) [] axiom(implies(or(A,B),or(B,A))) = true.
% 29.64/30.07 11 (wt=11) [flip(1)] and(implies(A,B),implies(B,A)) = equivalent(A,B).
% 29.64/30.07 12 (wt=11) [] -(theorem(implies(not(p),equivalent(q,or(p,q)))) = true).
% 29.64/30.07 5 (wt=14) [] axiom(implies(or(A,or(B,C)),or(B,or(A,C)))) = true.
% 29.64/30.07 6 (wt=14) [] axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))) = true.
% 29.64/30.07 9 (wt=16) [] ifeq(theorem(implies(A,B)),true,ifeq(theorem(A),true,theorem(B),true),true) = true.
% 29.64/30.07 end_of_list.
% 29.64/30.07
% 29.64/30.07 Demodulators:
% 29.64/30.07 1 (wt=7) [] ifeq(A,A,B,C) = B.
% 29.64/30.07 2 (wt=8) [] axiom(implies(or(A,A),A)) = true.
% 29.64/30.07 3 (wt=8) [] axiom(implies(A,or(B,A))) = true.
% 29.64/30.07 4 (wt=10) [] axiom(implies(or(A,B),or(B,A))) = true.
% 29.64/30.07 5 (wt=14) [] axiom(implies(or(A,or(B,C)),or(B,or(A,C)))) = true.
% 29.64/30.07 6 (wt=14) [] axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))) = true.
% 29.64/30.07 7 (wt=8) [flip(1)] or(not(A),B) = implies(A,B).
% 29.64/30.07 8 (wt=9) [] ifeq(axiom(A),true,theorem(A),true) = true.
% 29.64/30.07 9 (wt=16) [] ifeq(theorem(implies(A,B)),true,ifeq(theorem(A),true,theorem(B),true),true) = true.
% 29.64/30.07 10 (wt=9) [demod([7]),flip(1)] not(implies(A,not(B))) = and(A,B).
% 29.64/30.07 11 (wt=11) [flip(1)] and(implies(A,B),implies(B,A)) = equivalent(A,B).
% 29.64/30.07 end_of_list.
% 29.64/30.07
% 29.64/30.07 Passive:
% 29.64/30.07 end_of_list.
% 29.64/30.07
% 29.64/30.07 ------------- memory usage ------------
% 29.64/30.07 Memory dynamically allocated (tp_alloc): 63964.
% 29.64/30.07 type (bytes each) gets frees in use avail bytes
% 29.64/30.07 sym_ent ( 96) 66 0 66 0 6.2 K
% 29.64/30.07 term ( 16) 8485560 7814134 671426 5 12998.0 K
% 29.64/30.08 gen_ptr ( 8) 5126301 1146648 3979653 0 31091.0 K
% 29.64/30.08 context ( 808) 44482702 44482700 2 4 4.7 K
% 29.64/30.08 trail ( 12) 175567 175567 0 8 0.1 K
% 29.64/30.08 bt_node ( 68) 23952888 23952886 2 32 2.3 K
% 29.64/30.08 ac_position (285432) 0 0 0 0 0.0 K
% 29.64/30.08 ac_match_pos (14044) 0 0 0 0 0.0 K
% 29.64/30.08 ac_match_free_vars_pos (4020)
% 29.64/30.08 0 0 0 0 0.0 K
% 29.64/30.08 discrim ( 12) 668327 3725 664602 0 7788.3 K
% 29.64/30.08 flat ( 40) 10797667 10797667 0 93 3.6 K
% 29.64/30.08 discrim_pos ( 12) 169365 169365 0 1 0.0 K
% 29.64/30.08 fpa_head ( 12) 236516 0 236516 0 2771.7 K
% 29.64/30.08 fpa_tree ( 28) 161457 161457 0 39 1.1 K
% 29.64/30.08 fpa_pos ( 36) 59095 59095 0 1 0.0 K
% 29.64/30.08 literal ( 12) 332492 302817 29675 0 347.8 K
% 29.64/30.08 clause ( 24) 332492 302817 29675 0 695.5 K
% 29.64/30.08 list ( 12) 29480 29424 56 3 0.7 K
% 29.64/30.08 list_pos ( 20) 118901 1127 117774 0 2300.3 K
% 29.64/30.08 pair_index ( 40) 2 0 2 0 0.1 K
% 29.64/30.08
% 29.64/30.08 -------------- statistics -------------
% 29.64/30.08 Clauses input 12
% 29.64/30.08 Usable input 0
% 29.64/30.08 Sos input 12
% 29.64/30.08 Demodulators input 0
% 29.64/30.08 Passive input 0
% 29.64/30.08
% 29.64/30.08 Processed BS (before search) 12
% 29.64/30.08 Forward subsumed BS 0
% 29.64/30.08 Kept BS 12
% 29.64/30.08 New demodulators BS 11
% 29.64/30.08 Back demodulated BS 0
% 29.64/30.08
% 29.64/30.08 Clauses or pairs given 2488515
% 29.64/30.08 Clauses generated 302402
% 29.64/30.08 Forward subsumed 272740
% 29.64/30.08 Deleted by weight 0
% 29.64/30.08 Deleted by variable count 0
% 29.64/30.08 Kept 29662
% 29.64/30.08 New demodulators 29410
% 29.64/30.08 Back demodulated 223
% 29.64/30.08 Ordered paramod prunes 0
% 29.64/30.08 Basic paramod prunes 9190641
% 29.64/30.08 Prime paramod prunes 7378
% 29.64/30.08 Semantic prunes 0
% 29.64/30.08
% 29.64/30.08 Rewrite attmepts 2298792
% 29.64/30.08 Rewrites 161739
% 29.64/30.08
% 29.64/30.08 FPA overloads 0
% 29.64/30.08 FPA
% 29.64/30.08
% 29.64/30.08 ********** ABNORMAL END **********
% 29.64/30.08 ********** in tp_alloc, max_mem parameter exceeded.
% 29.64/30.08 underloads 0
% 29.64/30.08
% 29.64/30.08 Usable size 0
% 29.64/30.08 Sos size 29451
% 29.64/30.08 Demodulators size 29198
% 29.64/30.08 Passive size 0
% 29.64/30.08 Disabled size 223
% 29.64/30.08
% 29.64/30.08 Proofs found 0
% 29.64/30.08
% 29.64/30.08 ----------- times (seconds) ----------- Sun Jul 3 02:17:23 2022
% 29.64/30.08
% 29.64/30.08 user CPU time 19.65 (0 hr, 0 min, 19 sec)
% 29.64/30.08 system CPU time 9.33 (0 hr, 0 min, 9 sec)
% 29.64/30.08 wall-clock time 29 (0 hr, 0 min, 29 sec)
% 29.64/30.08 input time 0.00
% 29.64/30.08 paramodulation time 2.74
% 29.64/30.08 demodulation time 0.25
% 29.64/30.08 orient time 0.37
% 29.64/30.08 weigh time 0.06
% 29.64/30.08 forward subsume time 0.09
% 29.64/30.08 back demod find time 0.36
% 29.64/30.08 conflict time 0.02
% 29.64/30.08 LRPO time 0.14
% 29.64/30.08 store clause time 13.40
% 29.64/30.08 disable clause time 0.05
% 29.64/30.08 prime paramod time 0.33
% 29.64/30.08 semantics time 0.00
% 29.64/30.08
% 29.64/30.08 EQP interrupted
%------------------------------------------------------------------------------