TSTP Solution File: LCL315-10 by EQP---0.9e

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : EQP---0.9e
% Problem  : LCL315-10 : TPTP v8.1.0. Released v7.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_eqp %s

% Computer : n016.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:38 EDT 2022

% Result   : Unknown 23.50s 23.94s
% Output   : None 
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : LCL315-10 : TPTP v8.1.0. Released v7.5.0.
% 0.10/0.13  % Command  : tptp2X_and_run_eqp %s
% 0.12/0.33  % Computer : n016.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 : Sun Jul  3 09:55:15 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 23.50/23.94  ----- EQP 0.9e, May 2009 -----
% 23.50/23.94  The job began on n016.cluster.edu, Sun Jul  3 09:55:16 2022
% 23.50/23.94  The command was "./eqp09e".
% 23.50/23.94  
% 23.50/23.94  set(prolog_style_variables).
% 23.50/23.94  set(lrpo).
% 23.50/23.94  set(basic_paramod).
% 23.50/23.94  set(functional_subsume).
% 23.50/23.94  set(ordered_paramod).
% 23.50/23.94  set(prime_paramod).
% 23.50/23.94  set(para_pairs).
% 23.50/23.94  assign(pick_given_ratio,4).
% 23.50/23.94  clear(print_kept).
% 23.50/23.94  clear(print_new_demod).
% 23.50/23.94  clear(print_back_demod).
% 23.50/23.94  clear(print_given).
% 23.50/23.94  assign(max_mem,64000).
% 23.50/23.94  end_of_commands.
% 23.50/23.94  
% 23.50/23.94  Usable:
% 23.50/23.94  end_of_list.
% 23.50/23.94  
% 23.50/23.94  Sos:
% 23.50/23.94  0 (wt=-1) [] ifeq(A,A,B,C) = B.
% 23.50/23.94  0 (wt=-1) [] axiom(implies(or(A,A),A)) = true.
% 23.50/23.94  0 (wt=-1) [] axiom(implies(A,or(B,A))) = true.
% 23.50/23.94  0 (wt=-1) [] axiom(implies(or(A,B),or(B,A))) = true.
% 23.50/23.94  0 (wt=-1) [] axiom(implies(or(A,or(B,C)),or(B,or(A,C)))) = true.
% 23.50/23.94  0 (wt=-1) [] axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))) = true.
% 23.50/23.94  0 (wt=-1) [] implies(A,B) = or(not(A),B).
% 23.50/23.94  0 (wt=-1) [] ifeq(axiom(A),true,theorem(A),true) = true.
% 23.50/23.94  0 (wt=-1) [] ifeq(theorem(implies(A,B)),true,ifeq(theorem(A),true,theorem(B),true),true) = true.
% 23.50/23.94  0 (wt=-1) [] and(A,B) = not(or(not(A),not(B))).
% 23.50/23.94  0 (wt=-1) [] equivalent(A,B) = and(implies(A,B),implies(B,A)).
% 23.50/23.94  0 (wt=-1) [] -(theorem(implies(equivalent(p,q),equivalent(implies(p,r),implies(q,r)))) = true).
% 23.50/23.94  end_of_list.
% 23.50/23.94  
% 23.50/23.94  Demodulators:
% 23.50/23.94  end_of_list.
% 23.50/23.94  
% 23.50/23.94  Passive:
% 23.50/23.94  end_of_list.
% 23.50/23.94  
% 23.50/23.94  Starting to process input.
% 23.50/23.94  
% 23.50/23.94  ** KEPT: 1 (wt=7) [] ifeq(A,A,B,C) = B.
% 23.50/23.94  1 is a new demodulator.
% 23.50/23.94  
% 23.50/23.94  ** KEPT: 2 (wt=8) [] axiom(implies(or(A,A),A)) = true.
% 23.50/23.94  2 is a new demodulator.
% 23.50/23.94  
% 23.50/23.94  ** KEPT: 3 (wt=8) [] axiom(implies(A,or(B,A))) = true.
% 23.50/23.94  3 is a new demodulator.
% 23.50/23.94  
% 23.50/23.94  ** KEPT: 4 (wt=10) [] axiom(implies(or(A,B),or(B,A))) = true.
% 23.50/23.94  4 is a new demodulator.
% 23.50/23.94  
% 23.50/23.94  ** KEPT: 5 (wt=14) [] axiom(implies(or(A,or(B,C)),or(B,or(A,C)))) = true.
% 23.50/23.94  5 is a new demodulator.
% 23.50/23.94  
% 23.50/23.94  ** KEPT: 6 (wt=14) [] axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))) = true.
% 23.50/23.94  6 is a new demodulator.
% 23.50/23.94  
% 23.50/23.94  ** KEPT: 7 (wt=8) [flip(1)] or(not(A),B) = implies(A,B).
% 23.50/23.94  7 is a new demodulator.
% 23.50/23.94  
% 23.50/23.94  ** KEPT: 8 (wt=9) [] ifeq(axiom(A),true,theorem(A),true) = true.
% 23.50/23.94  8 is a new demodulator.
% 23.50/23.94  
% 23.50/23.94  ** KEPT: 9 (wt=16) [] ifeq(theorem(implies(A,B)),true,ifeq(theorem(A),true,theorem(B),true),true) = true.
% 23.50/23.94  9 is a new demodulator.
% 23.50/23.94  
% 23.50/23.94  ** KEPT: 10 (wt=9) [demod([7]),flip(1)] not(implies(A,not(B))) = and(A,B).
% 23.50/23.94  10 is a new demodulator.
% 23.50/23.94  
% 23.50/23.94  ** KEPT: 11 (wt=11) [flip(1)] and(implies(A,B),implies(B,A)) = equivalent(A,B).
% 23.50/23.94  11 is a new demodulator.
% 23.50/23.94  
% 23.50/23.94  ** KEPT: 12 (wt=14) [] -(theorem(implies(equivalent(p,q),equivalent(implies(p,r),implies(q,r)))) = true).
% 23.50/23.94  
% 23.50/23.94  After processing input:
% 23.50/23.94  
% 23.50/23.94  Usable:
% 23.50/23.94  end_of_list.
% 23.50/23.94  
% 23.50/23.94  Sos:
% 23.50/23.94  1 (wt=7) [] ifeq(A,A,B,C) = B.
% 23.50/23.94  2 (wt=8) [] axiom(implies(or(A,A),A)) = true.
% 23.50/23.94  3 (wt=8) [] axiom(implies(A,or(B,A))) = true.
% 23.50/23.94  7 (wt=8) [flip(1)] or(not(A),B) = implies(A,B).
% 23.50/23.94  8 (wt=9) [] ifeq(axiom(A),true,theorem(A),true) = true.
% 23.50/23.94  10 (wt=9) [demod([7]),flip(1)] not(implies(A,not(B))) = and(A,B).
% 23.50/23.94  4 (wt=10) [] axiom(implies(or(A,B),or(B,A))) = true.
% 23.50/23.94  11 (wt=11) [flip(1)] and(implies(A,B),implies(B,A)) = equivalent(A,B).
% 23.50/23.94  5 (wt=14) [] axiom(implies(or(A,or(B,C)),or(B,or(A,C)))) = true.
% 23.50/23.94  6 (wt=14) [] axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))) = true.
% 23.50/23.94  12 (wt=14) [] -(theorem(implies(equivalent(p,q),equivalent(implies(p,r),implies(q,r)))) = true).
% 23.50/23.94  9 (wt=16) [] ifeq(theorem(implies(A,B)),true,ifeq(theorem(A),true,theorem(B),true),true) = true.
% 23.50/23.94  end_of_list.
% 23.50/23.94  
% 23.50/23.94  Demodulators:
% 23.50/23.94  1 (wt=7) [] ifeq(A,A,B,C) = B.
% 23.50/23.94  2 (wt=8) [] axiom(implies(or(A,A),A)) = true.
% 23.50/23.94  3 (wt=8) [] axiom(implies(A,or(B,A))) = true.
% 23.50/23.94  4 (wt=10) [] axiom(implies(or(A,B),or(B,A))) = true.
% 23.50/23.94  5 (wt=14) [] axiom(implies(or(A,or(B,C)),or(B,or(A,C)))) = true.
% 23.50/23.94  6 (wt=14) [] axiom(implies(implies(A,B),implies(or(C,A),or(C,B)))) = true.
% 23.50/23.94  7 (wt=8) [flip(1)] or(not(A),B) = implies(A,B).
% 23.50/23.94  8 (wt=9) [] ifeq(axiom(A),true,theorem(A),true) = true.
% 23.50/23.94  9 (wt=16) [] ifeq(theorem(implies(A,B)),true,ifeq(theorem(A),true,theorem(B),true),true) = true.
% 23.50/23.94  10 (wt=9) [demod([7]),flip(1)] not(implies(A,not(B))) = and(A,B).
% 23.50/23.94  11 (wt=11) [flip(1)] and(implies(A,B),implies(B,A)) = equivalent(A,B).
% 23.50/23.94  end_of_list.
% 23.50/23.94  
% 23.50/23.94  Passive:
% 23.50/23.94  end_of_list.
% 23.50/23.94  
% 23.50/23.94  ------------- memory usage ------------
% 23.50/23.94  Memory dynamically allocated (tp_alloc): 63964.
% 23.50/23.94    type (bytes each)        gets      frees     in use      avail      bytes
% 23.50/23.94  sym_ent (  96)               67          0         67          0      6.3 K
% 23.50/23.94  term (  16)             8453780    7782377     671403          6  12997.6 K
% 23.50/23.94  gen_ptr (   8)          5121411    1141798    3979613          3  31090.8 K
% 23.50/23.94  context ( 808)         44383065   44383063          2          4      4.7 K
% 23.50/23.94  trail (  12)             175640     175640          0          8      0.1 K
% 23.50/23.94  bt_node (  68)         23903480   23903478          2         32      2.3 K
% 23.50/23.94  ac_position (285432)          0          0          0          0      0.0 K
% 23.50/23.94  ac_match_pos (14044)          0          0          0          0      0.0 K
% 23.50/23.94  ac_match_free_vars_pos (4020)
% 23.50/23.94                                0          0          0          0      0.0 K
% 23.50/23.94  discrim (  12)           668368       3725     664643          0   7788.8 K
% 23.50/23.94  flat (  40)            10753496   10753496          0         93      3.6 K
% 23.50/23.94  discrim_pos (  12)       167998     167998          0          1      0.0 K
% 23.50/23.94  fpa_head (  12)          236545          0     236545          0   2772.0 K
% 23.50/23.94  fpa_tree (  28)          161443     161443          0         39      1.1 K
% 23.50/23.94  fpa_pos (  36)            59083      59083          0          1      0.0 K
% 23.50/23.94  literal (  12)           331777     302108      29669          0    347.7 K
% 23.50/23.94  clause (  24)            331777     302108      29669          0    695.4 K
% 23.50/23.94  list (  12)               29474      29418         56          3      0.7 K
% 23.50/23.94  list_pos (  20)          118877       1127     117750          0   2299.8 K
% 23.50/23.94  pair_index (   40)              2          0          2          0      0.1 K
% 23.50/23.94  
% 23.50/23.94  -------------- statistics -------------
% 23.50/23.94  Clauses input                 12
% 23.50/23.94    Usable input                   0
% 23.50/23.94    Sos input                     12
% 23.50/23.94    Demodulators input             0
% 23.50/23.94    Passive input                  0
% 23.50/23.94  
% 23.50/23.94  Processed BS (before search)  12
% 23.50/23.94  Forward subsumed BS            0
% 23.50/23.94  Kept BS                       12
% 23.50/23.94  New demodulators BS           11
% 23.50/23.94  Back demodulated BS            0
% 23.50/23.94  
% 23.50/23.94  Clauses or pairs given   2484115
% 23.50/23.94  Clauses generated         301693
% 23.50/23.94  Forward subsumed          272037
% 23.50/23.94  Deleted by weight              0
% 23.50/23.94  Deleted by variable count      0
% 23.50/23.94  Kept                       29656
% 23.50/23.94  New demodulators           29404
% 23.50/23.94  Back demodulated             223
% 23.50/23.94  Ordered paramod prunes         0
% 23.50/23.94  Basic paramod prunes     9187417
% 23.50/23.94  Prime paramod prunes        7378
% 23.50/23.94  Semantic prunes                0
% 23.50/23.94  
% 23.50/23.94  Rewrite attmepts         2286312
% 23.50/23.94  Rewrites                  160372
% 23.50/23.94  
% 23.50/23.94  FPA overload
% 23.50/23.94  
% 23.50/23.94  ********** ABNORMAL END **********
% 23.50/23.94  ********** in tp_alloc, max_mem parameter exceeded.
% 23.50/23.94  s                  0
% 23.50/23.94  FPA underloads                 0
% 23.50/23.94  
% 23.50/23.94  Usable size                    0
% 23.50/23.94  Sos size                   29445
% 23.50/23.94  Demodulators size          29192
% 23.50/23.94  Passive size                   0
% 23.50/23.94  Disabled size                223
% 23.50/23.94  
% 23.50/23.94  Proofs found                   0
% 23.50/23.94  
% 23.50/23.94  ----------- times (seconds) ----------- Sun Jul  3 09:55:39 2022
% 23.50/23.94  
% 23.50/23.94  user CPU time            14.39   (0 hr, 0 min, 14 sec)
% 23.50/23.94  system CPU time           8.44   (0 hr, 0 min, 8 sec)
% 23.50/23.94  wall-clock time          23      (0 hr, 0 min, 23 sec)
% 23.50/23.94  input time                0.00
% 23.50/23.94  paramodulation time       2.61
% 23.50/23.94  demodulation time         0.24
% 23.50/23.94  orient time               0.35
% 23.50/23.94  weigh time                0.07
% 23.50/23.94  forward subsume time      0.09
% 23.50/23.94  back demod find time      0.26
% 23.50/23.94  conflict time             0.03
% 23.50/23.94  LRPO time                 0.14
% 23.50/23.94  store clause time         8.38
% 23.50/23.94  disable clause time       0.03
% 23.50/23.94  prime paramod time        0.29
% 23.50/23.94  semantics time            0.00
% 23.50/23.94  
% 23.50/23.94  EQP interrupted
%------------------------------------------------------------------------------