TSTP Solution File: LCL341-10 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : LCL341-10 : TPTP v8.1.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n004.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:46 EDT 2022
% Result : Unknown 28.09s 28.49s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : LCL341-10 : TPTP v8.1.0. Released v7.5.0.
% 0.07/0.13 % Command : tptp2X_and_run_eqp %s
% 0.12/0.34 % Computer : n004.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 : Mon Jul 4 13:47:23 EDT 2022
% 0.12/0.34 % CPUTime :
% 28.09/28.49 ----- EQP 0.9e, May 2009 -----
% 28.09/28.49 The job began on n004.cluster.edu, Mon Jul 4 13:47:23 2022
% 28.09/28.49 The command was "./eqp09e".
% 28.09/28.49
% 28.09/28.49 set(prolog_style_variables).
% 28.09/28.49 set(lrpo).
% 28.09/28.49 set(basic_paramod).
% 28.09/28.49 set(functional_subsume).
% 28.09/28.49 set(ordered_paramod).
% 28.09/28.49 set(prime_paramod).
% 28.09/28.49 set(para_pairs).
% 28.09/28.49 assign(pick_given_ratio,4).
% 28.09/28.49 clear(print_kept).
% 28.09/28.49 clear(print_new_demod).
% 28.09/28.49 clear(print_back_demod).
% 28.09/28.49 clear(print_given).
% 28.09/28.49 assign(max_mem,64000).
% 28.09/28.49 end_of_commands.
% 28.09/28.49
% 28.09/28.49 Usable:
% 28.09/28.49 end_of_list.
% 28.09/28.49
% 28.09/28.49 Sos:
% 28.09/28.49 0 (wt=-1) [] ifeq(A,A,B,C) = B.
% 28.09/28.49 0 (wt=-1) [] axiom(implies(or(A,A),A)) = true.
% 28.09/28.49 0 (wt=-1) [] axiom(implies(A,or(B,A))) = true.
% 28.09/28.49 0 (wt=-1) [] axiom(implies(or(A,B),or(B,A))) = true.
% 28.09/28.49 0 (wt=-1) [] axiom(implies(or(A,or(B,C)),or(B,or(A,C)))) = true.
% 28.09/28.49 0 (wt=-1) [] axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))) = true.
% 28.09/28.49 0 (wt=-1) [] implies(A,B) = or(not(A),B).
% 28.09/28.49 0 (wt=-1) [] ifeq(axiom(A),true,theorem(A),true) = true.
% 28.09/28.49 0 (wt=-1) [] ifeq(theorem(implies(A,B)),true,ifeq(theorem(A),true,theorem(B),true),true) = true.
% 28.09/28.49 0 (wt=-1) [] and(A,B) = not(or(not(A),not(B))).
% 28.09/28.49 0 (wt=-1) [] equivalent(A,B) = and(implies(A,B),implies(B,A)).
% 28.09/28.49 0 (wt=-1) [] -(theorem(implies(p,equivalent(implies(p,q),q))) = true).
% 28.09/28.49 end_of_list.
% 28.09/28.49
% 28.09/28.49 Demodulators:
% 28.09/28.49 end_of_list.
% 28.09/28.49
% 28.09/28.49 Passive:
% 28.09/28.49 end_of_list.
% 28.09/28.49
% 28.09/28.49 Starting to process input.
% 28.09/28.49
% 28.09/28.49 ** KEPT: 1 (wt=7) [] ifeq(A,A,B,C) = B.
% 28.09/28.49 1 is a new demodulator.
% 28.09/28.49
% 28.09/28.49 ** KEPT: 2 (wt=8) [] axiom(implies(or(A,A),A)) = true.
% 28.09/28.49 2 is a new demodulator.
% 28.09/28.49
% 28.09/28.49 ** KEPT: 3 (wt=8) [] axiom(implies(A,or(B,A))) = true.
% 28.09/28.49 3 is a new demodulator.
% 28.09/28.49
% 28.09/28.49 ** KEPT: 4 (wt=10) [] axiom(implies(or(A,B),or(B,A))) = true.
% 28.09/28.49 4 is a new demodulator.
% 28.09/28.49
% 28.09/28.49 ** KEPT: 5 (wt=14) [] axiom(implies(or(A,or(B,C)),or(B,or(A,C)))) = true.
% 28.09/28.49 5 is a new demodulator.
% 28.09/28.49
% 28.09/28.49 ** KEPT: 6 (wt=14) [] axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))) = true.
% 28.09/28.49 6 is a new demodulator.
% 28.09/28.49
% 28.09/28.49 ** KEPT: 7 (wt=8) [flip(1)] or(not(A),B) = implies(A,B).
% 28.09/28.49 7 is a new demodulator.
% 28.09/28.49
% 28.09/28.49 ** KEPT: 8 (wt=9) [] ifeq(axiom(A),true,theorem(A),true) = true.
% 28.09/28.49 8 is a new demodulator.
% 28.09/28.49
% 28.09/28.49 ** KEPT: 9 (wt=16) [] ifeq(theorem(implies(A,B)),true,ifeq(theorem(A),true,theorem(B),true),true) = true.
% 28.09/28.49 9 is a new demodulator.
% 28.09/28.49
% 28.09/28.49 ** KEPT: 10 (wt=9) [demod([7]),flip(1)] not(implies(A,not(B))) = and(A,B).
% 28.09/28.49 10 is a new demodulator.
% 28.09/28.49
% 28.09/28.49 ** KEPT: 11 (wt=11) [flip(1)] and(implies(A,B),implies(B,A)) = equivalent(A,B).
% 28.09/28.49 11 is a new demodulator.
% 28.09/28.49
% 28.09/28.49 ** KEPT: 12 (wt=10) [] -(theorem(implies(p,equivalent(implies(p,q),q))) = true).
% 28.09/28.49
% 28.09/28.49 After processing input:
% 28.09/28.49
% 28.09/28.49 Usable:
% 28.09/28.49 end_of_list.
% 28.09/28.49
% 28.09/28.49 Sos:
% 28.09/28.49 1 (wt=7) [] ifeq(A,A,B,C) = B.
% 28.09/28.49 2 (wt=8) [] axiom(implies(or(A,A),A)) = true.
% 28.09/28.49 3 (wt=8) [] axiom(implies(A,or(B,A))) = true.
% 28.09/28.49 7 (wt=8) [flip(1)] or(not(A),B) = implies(A,B).
% 28.09/28.49 8 (wt=9) [] ifeq(axiom(A),true,theorem(A),true) = true.
% 28.09/28.49 10 (wt=9) [demod([7]),flip(1)] not(implies(A,not(B))) = and(A,B).
% 28.09/28.49 4 (wt=10) [] axiom(implies(or(A,B),or(B,A))) = true.
% 28.09/28.49 12 (wt=10) [] -(theorem(implies(p,equivalent(implies(p,q),q))) = true).
% 28.09/28.49 11 (wt=11) [flip(1)] and(implies(A,B),implies(B,A)) = equivalent(A,B).
% 28.09/28.49 5 (wt=14) [] axiom(implies(or(A,or(B,C)),or(B,or(A,C)))) = true.
% 28.09/28.49 6 (wt=14) [] axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))) = true.
% 28.09/28.49 9 (wt=16) [] ifeq(theorem(implies(A,B)),true,ifeq(theorem(A),true,theorem(B),true),true) = true.
% 28.09/28.49 end_of_list.
% 28.09/28.49
% 28.09/28.49 Demodulators:
% 28.09/28.49 1 (wt=7) [] ifeq(A,A,B,C) = B.
% 28.09/28.49 2 (wt=8) [] axiom(implies(or(A,A),A)) = true.
% 28.09/28.49 3 (wt=8) [] axiom(implies(A,or(B,A))) = true.
% 28.09/28.49 4 (wt=10) [] axiom(implies(or(A,B),or(B,A))) = true.
% 28.09/28.49 5 (wt=14) [] axiom(implies(or(A,or(B,C)),or(B,or(A,C)))) = true.
% 28.09/28.49 6 (wt=14) [] axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))) = true.
% 28.09/28.49 7 (wt=8) [flip(1)] or(not(A),B) = implies(A,B).
% 28.09/28.49 8 (wt=9) [] ifeq(axiom(A),true,theorem(A),true) = true.
% 28.09/28.49 9 (wt=16) [] ifeq(theorem(implies(A,B)),true,ifeq(theorem(A),true,theorem(B),true),true) = true.
% 28.09/28.49 10 (wt=9) [demod([7]),flip(1)] not(implies(A,not(B))) = and(A,B).
% 28.09/28.49 11 (wt=11) [flip(1)] and(implies(A,B),implies(B,A)) = equivalent(A,B).
% 28.09/28.49 end_of_list.
% 28.09/28.49
% 28.09/28.49 Passive:
% 28.09/28.49 end_of_list.
% 28.09/28.49
% 28.09/28.49 ------------- memory usage ------------
% 28.09/28.49 Memory dynamically allocated (tp_alloc): 63964.
% 28.09/28.49 type (bytes each) gets frees in use avail bytes
% 28.09/28.49 sym_ent ( 96) 66 0 66 0 6.2 K
% 28.09/28.49 term ( 16) 8496852 7825706 671146 48 12993.5 K
% 28.09/28.49 gen_ptr ( 8) 5128425 1147998 3980427 0 31097.1 K
% 28.09/28.49 context ( 808) 44447715 44447713 2 4 4.7 K
% 28.09/28.49 trail ( 12) 175166 175166 0 8 0.1 K
% 28.09/28.49 bt_node ( 68) 23927272 23927270 2 32 2.3 K
% 28.09/28.49 ac_position (285432) 0 0 0 0 0.0 K
% 28.09/28.49 ac_match_pos (14044) 0 0 0 0 0.0 K
% 28.09/28.49 ac_match_free_vars_pos (4020)
% 28.09/28.49 0 0 0 0 0.0 K
% 28.09/28.49 discrim ( 12) 668914 3746 665168 0 7794.9 K
% 28.09/28.49 flat ( 40) 10816001 10816001 0 93 3.6 K
% 28.09/28.49 discrim_pos ( 12) 169979 169979 0 1 0.0 K
% 28.09/28.49 fpa_head ( 12) 236421 0 236421 0 2770.6 K
% 28.09/28.49 fpa_tree ( 28) 161306 161306 0 39 1.1 K
% 28.09/28.49 fpa_pos ( 36) 58998 58998 0 1 0.0 K
% 28.09/28.49 literal ( 12) 332421 302795 29626 1 347.2 K
% 28.09/28.49 clause ( 24) 332421 302795 29626 1 694.4 K
% 28.09/28.49 list ( 12) 29431 29375 56 3 0.7 K
% 28.09/28.49 list_pos ( 20) 118710 1132 117578 0 2296.4 K
% 28.09/28.49 pair_index ( 40) 2 0 2 0 0.1 K
% 28.09/28.49
% 28.09/28.49 -------------- statistics -------------
% 28.09/28.49 Clauses input 12
% 28.09/28.49 Usable input 0
% 28.09/28.49 Sos input 12
% 28.09/28.49 Demodulators input 0
% 28.09/28.49 Passive input 0
% 28.09/28.49
% 28.09/28.49 Processed BS (before search) 12
% 28.09/28.49 Forward subsumed BS 0
% 28.09/28.49 Kept BS 12
% 28.09/28.49 New demodulators BS 11
% 28.09/28.49 Back demodulated BS 0
% 28.09/28.49
% 28.09/28.49 Clauses or pairs given 2487325
% 28.09/28.49 Clauses generated 302380
% 28.09/28.49 Forward subsumed 272766
% 28.09/28.49 Deleted by weight 0
% 28.09/28.49 Deleted by variable count 0
% 28.09/28.49 Kept 29614
% 28.09/28.49 New demodulators 29361
% 28.09/28.49 Back demodulated 224
% 28.09/28.49 Ordered paramod prunes 0
% 28.09/28.49 Basic paramod prunes 9188691
% 28.09/28.49 Prime paramod prunes 7367
% 28.09/28.49 Semantic prunes 0
% 28.09/28.49
% 28.09/28.49 Rewrite attmepts 2305554
% 28.09/28.49 Rewrites 162364
% 28.09/28.49
% 28.09/28.49 FPA overloads 0
% 28.09/28.49 FPA
% 28.09/28.49
% 28.09/28.49 ********** ABNORMAL END **********
% 28.09/28.49 ********** in tp_alloc, max_mem parameter exceeded.
% 28.09/28.49 underloads 0
% 28.09/28.49
% 28.09/28.49 Usable size 0
% 28.09/28.49 Sos size 29402
% 28.09/28.49 Demodulators size 29148
% 28.09/28.49 Passive size 0
% 28.09/28.49 Disabled size 224
% 28.09/28.49
% 28.09/28.49 Proofs found 0
% 28.09/28.49
% 28.09/28.49 ----------- times (seconds) ----------- Mon Jul 4 13:47:51 2022
% 28.09/28.49
% 28.09/28.49 user CPU time 18.52 (0 hr, 0 min, 18 sec)
% 28.09/28.49 system CPU time 8.91 (0 hr, 0 min, 8 sec)
% 28.09/28.49 wall-clock time 28 (0 hr, 0 min, 28 sec)
% 28.09/28.49 input time 0.00
% 28.09/28.49 paramodulation time 2.64
% 28.09/28.49 demodulation time 0.21
% 28.09/28.49 orient time 0.36
% 28.09/28.49 weigh time 0.06
% 28.09/28.49 forward subsume time 0.11
% 28.09/28.49 back demod find time 0.39
% 28.09/28.49 conflict time 0.02
% 28.09/28.49 LRPO time 0.14
% 28.09/28.49 store clause time 12.42
% 28.09/28.49 disable clause time 0.03
% 28.09/28.49 prime paramod time 0.31
% 28.09/28.49 semantics time 0.00
% 28.09/28.49
% 28.09/28.49 EQP interrupted
%------------------------------------------------------------------------------