TSTP Solution File: LCL245-10 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : LCL245-10 : TPTP v8.1.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n010.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:12 EDT 2022
% Result : Unknown 32.98s 33.35s
% Output : None
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : LCL245-10 : TPTP v8.1.0. Released v7.5.0.
% 0.04/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n010.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jul 4 11:27:17 EDT 2022
% 0.12/0.34 % CPUTime :
% 32.98/33.34 ----- EQP 0.9e, May 2009 -----
% 32.98/33.34 The job began on n010.cluster.edu, Mon Jul 4 11:27:18 2022
% 32.98/33.34 The command was "./eqp09e".
% 32.98/33.34
% 32.98/33.34 set(prolog_style_variables).
% 32.98/33.34 set(lrpo).
% 32.98/33.34 set(basic_paramod).
% 32.98/33.34 set(functional_subsume).
% 32.98/33.34 set(ordered_paramod).
% 32.98/33.34 set(prime_paramod).
% 32.98/33.34 set(para_pairs).
% 32.98/33.34 assign(pick_given_ratio,4).
% 32.98/33.34 clear(print_kept).
% 32.98/33.34 clear(print_new_demod).
% 32.98/33.34 clear(print_back_demod).
% 32.98/33.34 clear(print_given).
% 32.98/33.34 assign(max_mem,64000).
% 32.98/33.34 end_of_commands.
% 32.98/33.34
% 32.98/33.34 Usable:
% 32.98/33.34 end_of_list.
% 32.98/33.34
% 32.98/33.34 Sos:
% 32.98/33.34 0 (wt=-1) [] ifeq(A,A,B,C) = B.
% 32.98/33.34 0 (wt=-1) [] axiom(implies(or(A,A),A)) = true.
% 32.98/33.34 0 (wt=-1) [] axiom(implies(A,or(B,A))) = true.
% 32.98/33.34 0 (wt=-1) [] axiom(implies(or(A,B),or(B,A))) = true.
% 32.98/33.34 0 (wt=-1) [] axiom(implies(or(A,or(B,C)),or(B,or(A,C)))) = true.
% 32.98/33.34 0 (wt=-1) [] axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))) = true.
% 32.98/33.34 0 (wt=-1) [] implies(A,B) = or(not(A),B).
% 32.98/33.34 0 (wt=-1) [] ifeq(axiom(A),true,theorem(A),true) = true.
% 32.98/33.34 0 (wt=-1) [] ifeq(theorem(implies(A,B)),true,ifeq(theorem(A),true,theorem(B),true),true) = true.
% 32.98/33.34 0 (wt=-1) [] and(A,B) = not(or(not(A),not(B))).
% 32.98/33.34 0 (wt=-1) [] -(theorem(implies(and(implies(q,r),implies(p,q)),implies(p,r))) = true).
% 32.98/33.34 end_of_list.
% 32.98/33.34
% 32.98/33.34 Demodulators:
% 32.98/33.34 end_of_list.
% 32.98/33.34
% 32.98/33.34 Passive:
% 32.98/33.34 end_of_list.
% 32.98/33.34
% 32.98/33.34 Starting to process input.
% 32.98/33.34
% 32.98/33.34 ** KEPT: 1 (wt=7) [] ifeq(A,A,B,C) = B.
% 32.98/33.34 1 is a new demodulator.
% 32.98/33.34
% 32.98/33.34 ** KEPT: 2 (wt=8) [] axiom(implies(or(A,A),A)) = true.
% 32.98/33.34 2 is a new demodulator.
% 32.98/33.34
% 32.98/33.34 ** KEPT: 3 (wt=8) [] axiom(implies(A,or(B,A))) = true.
% 32.98/33.34 3 is a new demodulator.
% 32.98/33.34
% 32.98/33.34 ** KEPT: 4 (wt=10) [] axiom(implies(or(A,B),or(B,A))) = true.
% 32.98/33.34 4 is a new demodulator.
% 32.98/33.34
% 32.98/33.34 ** KEPT: 5 (wt=14) [] axiom(implies(or(A,or(B,C)),or(B,or(A,C)))) = true.
% 32.98/33.34 5 is a new demodulator.
% 32.98/33.34
% 32.98/33.34 ** KEPT: 6 (wt=14) [] axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))) = true.
% 32.98/33.34 6 is a new demodulator.
% 32.98/33.34
% 32.98/33.34 ** KEPT: 7 (wt=8) [flip(1)] or(not(A),B) = implies(A,B).
% 32.98/33.34 7 is a new demodulator.
% 32.98/33.34
% 32.98/33.34 ** KEPT: 8 (wt=9) [] ifeq(axiom(A),true,theorem(A),true) = true.
% 32.98/33.34 8 is a new demodulator.
% 32.98/33.34
% 32.98/33.34 ** KEPT: 9 (wt=16) [] ifeq(theorem(implies(A,B)),true,ifeq(theorem(A),true,theorem(B),true),true) = true.
% 32.98/33.34 9 is a new demodulator.
% 32.98/33.34
% 32.98/33.34 ** KEPT: 10 (wt=9) [demod([7]),flip(1)] not(implies(A,not(B))) = and(A,B).
% 32.98/33.34 10 is a new demodulator.
% 32.98/33.34
% 32.98/33.34 ** KEPT: 11 (wt=14) [] -(theorem(implies(and(implies(q,r),implies(p,q)),implies(p,r))) = true).
% 32.98/33.34
% 32.98/33.34 After processing input:
% 32.98/33.34
% 32.98/33.34 Usable:
% 32.98/33.34 end_of_list.
% 32.98/33.34
% 32.98/33.34 Sos:
% 32.98/33.34 1 (wt=7) [] ifeq(A,A,B,C) = B.
% 32.98/33.34 2 (wt=8) [] axiom(implies(or(A,A),A)) = true.
% 32.98/33.34 3 (wt=8) [] axiom(implies(A,or(B,A))) = true.
% 32.98/33.34 7 (wt=8) [flip(1)] or(not(A),B) = implies(A,B).
% 32.98/33.34 8 (wt=9) [] ifeq(axiom(A),true,theorem(A),true) = true.
% 32.98/33.34 10 (wt=9) [demod([7]),flip(1)] not(implies(A,not(B))) = and(A,B).
% 32.98/33.34 4 (wt=10) [] axiom(implies(or(A,B),or(B,A))) = true.
% 32.98/33.34 5 (wt=14) [] axiom(implies(or(A,or(B,C)),or(B,or(A,C)))) = true.
% 32.98/33.34 6 (wt=14) [] axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))) = true.
% 32.98/33.34 11 (wt=14) [] -(theorem(implies(and(implies(q,r),implies(p,q)),implies(p,r))) = true).
% 32.98/33.34 9 (wt=16) [] ifeq(theorem(implies(A,B)),true,ifeq(theorem(A),true,theorem(B),true),true) = true.
% 32.98/33.34 end_of_list.
% 32.98/33.34
% 32.98/33.34 Demodulators:
% 32.98/33.34 1 (wt=7) [] ifeq(A,A,B,C) = B.
% 32.98/33.34 2 (wt=8) [] axiom(implies(or(A,A),A)) = true.
% 32.98/33.34 3 (wt=8) [] axiom(implies(A,or(B,A))) = true.
% 32.98/33.35 4 (wt=10) [] axiom(implies(or(A,B),or(B,A))) = true.
% 32.98/33.35 5 (wt=14) [] axiom(implies(or(A,or(B,C)),or(B,or(A,C)))) = true.
% 32.98/33.35 6 (wt=14) [] axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))) = true.
% 32.98/33.35 7 (wt=8) [flip(1)] or(not(A),B) = implies(A,B).
% 32.98/33.35 8 (wt=9) [] ifeq(axiom(A),true,theorem(A),true) = true.
% 32.98/33.35 9 (wt=16) [] ifeq(theorem(implies(A,B)),true,ifeq(theorem(A),true,theorem(B),true),true) = true.
% 32.98/33.35 10 (wt=9) [demod([7]),flip(1)] not(implies(A,not(B))) = and(A,B).
% 32.98/33.35 end_of_list.
% 32.98/33.35
% 32.98/33.35 Passive:
% 32.98/33.35 end_of_list.
% 32.98/33.35
% 32.98/33.35 ------------- memory usage ------------
% 32.98/33.35 Memory dynamically allocated (tp_alloc): 63964.
% 32.98/33.35 type (bytes each) gets frees in use avail bytes
% 32.98/33.35 sym_ent ( 96) 66 0 66 0 6.2 K
% 32.98/33.35 term ( 16) 13204354 12501552 702802 2 13581.2 K
% 32.98/33.35 gen_ptr ( 8) 5808071 1853351 3954720 0 30896.2 K
% 32.98/33.35 context ( 808) 66823585 66823583 2 3 3.9 K
% 32.98/33.35 trail ( 12) 255951 255951 0 8 0.1 K
% 32.98/33.35 bt_node ( 68) 35913211 35913209 2 32 2.3 K
% 32.98/33.35 ac_position (285432) 0 0 0 0 0.0 K
% 32.98/33.35 ac_match_pos (14044) 0 0 0 0 0.0 K
% 32.98/33.35 ac_match_free_vars_pos (4020)
% 32.98/33.35 0 0 0 0 0.0 K
% 32.98/33.35 discrim ( 12) 593200 1612 591588 0 6932.7 K
% 32.98/33.35 flat ( 40) 15343679 15343679 0 60 2.3 K
% 32.98/33.35 discrim_pos ( 12) 261537 261537 0 1 0.0 K
% 32.98/33.35 fpa_head ( 12) 221262 0 221262 0 2592.9 K
% 32.98/33.35 fpa_tree ( 28) 182432 182432 0 23 0.6 K
% 32.98/33.35 fpa_pos ( 36) 74478 74478 0 1 0.0 K
% 32.98/33.35 literal ( 12) 522078 484836 37242 1 436.4 K
% 32.98/33.35 clause ( 24) 522078 484836 37242 1 872.9 K
% 32.98/33.35 list ( 12) 37295 37239 56 3 0.7 K
% 32.98/33.35 list_pos ( 20) 149189 551 148638 0 2903.1 K
% 32.98/33.35 pair_index ( 40) 2 0 2 0 0.1 K
% 32.98/33.35
% 32.98/33.35 -------------- statistics -------------
% 32.98/33.35 Clauses input 11
% 32.98/33.35 Usable input 0
% 32.98/33.35 Sos input 11
% 32.98/33.35 Demodulators input 0
% 32.98/33.35 Passive input 0
% 32.98/33.35
% 32.98/33.35 Processed BS (before search) 11
% 32.98/33.35 Forward subsumed BS 0
% 32.98/33.35 Kept BS 11
% 32.98/33.35 New demodulators BS 10
% 32.98/33.35 Back demodulated BS 0
% 32.98/33.35
% 32.98/33.35 Clauses or pairs given 3590854
% 32.98/33.35 Clauses generated 484806
% 32.98/33.35 Forward subsumed 447575
% 32.98/33.35 Deleted by weight 0
% 32.98/33.35 Deleted by variable count 0
% 32.98/33.35 Kept 37231
% 32.98/33.35 New demodulators 37226
% 32.98/33.35 Back demodulated 108
% 32.98/33.35 Ordered paramod prunes 0
% 32.98/33.35 Basic paramod prunes 13024122
% 32.98/33.35 Prime paramod prunes 11714
% 32.98/33.35 Semantic prunes 0
% 32.98/33.35
% 32.98/33.35 Rewrite attmepts 3410024
% 32.98/33.35 Rewrites 249812
% 32.98/33.35
% 32.98/33.35 FPA overloads 0
% 32.98/33.35 FPA underloads 0
% 32.98/33.35
% 32.98/33.35 Usable size 0
% 32.98/33.35 Sos size 37134
% 32.98/33.35 Demodulators size 371
% 32.98/33.35
% 32.98/33.35 ********** ABNORMAL END **********
% 32.98/33.35 ********** in tp_alloc, max_mem parameter exceeded.
% 32.98/33.35 28
% 32.98/33.35 Passive size 0
% 32.98/33.35 Disabled size 108
% 32.98/33.35
% 32.98/33.35 Proofs found 0
% 32.98/33.35
% 32.98/33.35 ----------- times (seconds) ----------- Mon Jul 4 11:27:50 2022
% 32.98/33.35
% 32.98/33.35 user CPU time 19.59 (0 hr, 0 min, 19 sec)
% 32.98/33.35 system CPU time 12.68 (0 hr, 0 min, 12 sec)
% 32.98/33.35 wall-clock time 32 (0 hr, 0 min, 32 sec)
% 32.98/33.35 input time 0.00
% 32.98/33.35 paramodulation time 4.08
% 32.98/33.35 demodulation time 0.33
% 32.98/33.35 orient time 0.58
% 32.98/33.35 weigh time 0.12
% 32.98/33.35 forward subsume time 0.18
% 32.98/33.35 back demod find time 0.76
% 32.98/33.35 conflict time 0.03
% 32.98/33.35 LRPO time 0.23
% 32.98/33.35 store clause time 9.97
% 32.98/33.35 disable clause time 0.02
% 32.98/33.35 prime paramod time 0.50
% 32.98/33.35 semantics time 0.00
% 32.98/33.35
% 32.98/33.35 EQP interrupted
%------------------------------------------------------------------------------