TSTP Solution File: LCL110-2 by EQP---0.9e

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : EQP---0.9e
% Problem  : LCL110-2 : TPTP v8.1.0. Released v1.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : tptp2X_and_run_eqp %s

% Computer : n026.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:41:04 EDT 2022

% Result   : Unsatisfiable 0.70s 1.13s
% Output   : Refutation 0.70s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   26 (  26 unt;   0 nHn;   4 RR)
%            Number of literals    :   26 (   0 equ;   1 neg)
%            Maximal clause size   :    1 (   1 avg)
%            Maximal term depth    :    5 (   2 avg)
%            Number of predicates  :    2 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   2 con; 0-2 aty)
%            Number of variables   :   32 (   5 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,plain,
    equal(implies(truth,A),A),
    file('LCL110-2.p',unknown),
    [] ).

cnf(2,plain,
    equal(implies(implies(A,B),implies(implies(B,C),implies(A,C))),truth),
    file('LCL110-2.p',unknown),
    [] ).

cnf(3,plain,
    equal(implies(implies(A,B),B),implies(implies(B,A),A)),
    file('LCL110-2.p',unknown),
    [] ).

cnf(4,plain,
    equal(implies(implies(not(A),not(B)),implies(B,A)),truth),
    file('LCL110-2.p',unknown),
    [] ).

cnf(5,plain,
    ~ equal(implies(not(not(x)),x),truth),
    file('LCL110-2.p',unknown),
    [] ).

cnf(6,plain,
    equal(implies(implies(A,truth),truth),implies(A,A)),
    inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,3]),1]),
    [iquote('para(1,3),flip(1)')] ).

cnf(7,plain,
    equal(implies(A,implies(implies(A,B),B)),truth),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,2]),1]),
    [iquote('para(1,2),demod([1])')] ).

cnf(8,plain,
    equal(implies(implies(A,truth),implies(B,implies(A,B))),truth),
    inference(para,[status(thm),theory(equality)],[1,2]),
    [iquote('para(1,2)')] ).

cnf(9,plain,
    equal(implies(A,A),truth),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,7]),1]),
    [iquote('para(1,7),demod([1])')] ).

cnf(10,plain,
    equal(implies(implies(A,truth),truth),truth),
    inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[6]),9]),
    [iquote('back_demod(6),demod([9])')] ).

cnf(19,plain,
    equal(implies(A,truth),truth),
    inference(para,[status(thm),theory(equality)],[10,7]),
    [iquote('para(10,7)')] ).

cnf(20,plain,
    equal(implies(A,implies(B,A)),truth),
    inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[8]),19,1]),
    [iquote('back_demod(8),demod([19,1])')] ).

cnf(21,plain,
    equal(implies(implies(implies(A,B),B),A),implies(B,A)),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3,3]),20,1]),
    [iquote('para(3,3),demod([20,1])')] ).

cnf(22,plain,
    equal(implies(implies(not(A),not(truth)),A),truth),
    inference(para,[status(thm),theory(equality)],[1,4]),
    [iquote('para(1,4)')] ).

cnf(41,plain,
    equal(implies(implies(A,implies(not(A),not(truth))),implies(not(A),not(truth))),A),
    inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[22,3]),1]),1]),
    [iquote('para(22,3),demod([1]),flip(1)')] ).

cnf(44,plain,
    equal(implies(not(truth),not(not(truth))),not(not(truth))),
    inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[22,21]),1]),1]),
    [iquote('para(22,21),demod([1]),flip(1)')] ).

cnf(57,plain,
    equal(implies(implies(implies(A,B),C),implies(B,C)),truth),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[20,2]),1]),
    [iquote('para(20,2),demod([1])')] ).

cnf(72,plain,
    equal(implies(not(truth),A),truth),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[22,57]),1]),
    [iquote('para(22,57),demod([1])')] ).

cnf(73,plain,
    equal(not(not(truth)),truth),
    inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[44]),72]),1]),
    [iquote('back_demod(44),demod([72]),flip(1)')] ).

cnf(78,plain,
    equal(implies(not(A),implies(A,not(truth))),truth),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[73,4]),1]),
    [iquote('para(73,4),demod([1])')] ).

cnf(85,plain,
    equal(implies(implies(A,not(truth)),not(truth)),A),
    inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[72,3]),1]),1]),
    [iquote('para(72,3),demod([1]),flip(1)')] ).

cnf(91,plain,
    equal(implies(not(implies(A,not(truth))),A),truth),
    inference(para,[status(thm),theory(equality)],[85,78]),
    [iquote('para(85,78)')] ).

cnf(157,plain,
    equal(implies(A,implies(not(A),not(truth))),truth),
    inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[91,4]),1]),
    [iquote('para(91,4),demod([1])')] ).

cnf(158,plain,
    equal(implies(not(A),not(truth)),A),
    inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[41]),157,1]),
    [iquote('back_demod(41),demod([157,1])')] ).

cnf(159,plain,
    equal(implies(not(not(A)),A),truth),
    inference(para,[status(thm),theory(equality)],[158,78]),
    [iquote('para(158,78)')] ).

cnf(160,plain,
    $false,
    inference(conflict,[status(thm)],[159,5]),
    [iquote('conflict(159,5)')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : LCL110-2 : TPTP v8.1.0. Released v1.0.0.
% 0.04/0.13  % Command  : tptp2X_and_run_eqp %s
% 0.12/0.34  % Computer : n026.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 19:56:37 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.70/1.13  ----- EQP 0.9e, May 2009 -----
% 0.70/1.13  The job began on n026.cluster.edu, Mon Jul  4 19:56:38 2022
% 0.70/1.13  The command was "./eqp09e".
% 0.70/1.13  
% 0.70/1.13  set(prolog_style_variables).
% 0.70/1.13  set(lrpo).
% 0.70/1.13  set(basic_paramod).
% 0.70/1.13  set(functional_subsume).
% 0.70/1.13  set(ordered_paramod).
% 0.70/1.13  set(prime_paramod).
% 0.70/1.13  set(para_pairs).
% 0.70/1.13  assign(pick_given_ratio,4).
% 0.70/1.13  clear(print_kept).
% 0.70/1.13  clear(print_new_demod).
% 0.70/1.13  clear(print_back_demod).
% 0.70/1.13  clear(print_given).
% 0.70/1.13  assign(max_mem,64000).
% 0.70/1.13  end_of_commands.
% 0.70/1.13  
% 0.70/1.13  Usable:
% 0.70/1.13  end_of_list.
% 0.70/1.13  
% 0.70/1.13  Sos:
% 0.70/1.13  0 (wt=-1) [] implies(truth,A) = A.
% 0.70/1.13  0 (wt=-1) [] implies(implies(A,B),implies(implies(B,C),implies(A,C))) = truth.
% 0.70/1.13  0 (wt=-1) [] implies(implies(A,B),B) = implies(implies(B,A),A).
% 0.70/1.13  0 (wt=-1) [] implies(implies(not(A),not(B)),implies(B,A)) = truth.
% 0.70/1.13  0 (wt=-1) [] -(implies(not(not(x)),x) = truth).
% 0.70/1.13  end_of_list.
% 0.70/1.13  
% 0.70/1.13  Demodulators:
% 0.70/1.13  end_of_list.
% 0.70/1.13  
% 0.70/1.13  Passive:
% 0.70/1.13  end_of_list.
% 0.70/1.13  
% 0.70/1.13  Starting to process input.
% 0.70/1.13  
% 0.70/1.13  ** KEPT: 1 (wt=5) [] implies(truth,A) = A.
% 0.70/1.13  1 is a new demodulator.
% 0.70/1.13  
% 0.70/1.13  ** KEPT: 2 (wt=13) [] implies(implies(A,B),implies(implies(B,C),implies(A,C))) = truth.
% 0.70/1.13  2 is a new demodulator.
% 0.70/1.13  
% 0.70/1.13  ** KEPT: 3 (wt=11) [] implies(implies(A,B),B) = implies(implies(B,A),A).
% 0.70/1.13  clause forward subsumed: 0 (wt=11) [flip(3)] implies(implies(B,A),A) = implies(implies(A,B),B).
% 0.70/1.13  
% 0.70/1.13  ** KEPT: 4 (wt=11) [] implies(implies(not(A),not(B)),implies(B,A)) = truth.
% 0.70/1.13  4 is a new demodulator.
% 0.70/1.13  
% 0.70/1.13  ** KEPT: 5 (wt=7) [] -(implies(not(not(x)),x) = truth).
% 0.70/1.13  ---------------- PROOF FOUND ----------------
% 0.70/1.13  % SZS status Unsatisfiable
% 0.70/1.13  
% 0.70/1.13  
% 0.70/1.13  After processing input:
% 0.70/1.13  
% 0.70/1.13  Usable:
% 0.70/1.13  end_of_list.
% 0.70/1.13  
% 0.70/1.13  Sos:
% 0.70/1.13  1 (wt=5) [] implies(truth,A) = A.
% 0.70/1.13  5 (wt=7) [] -(implies(not(not(x)),x) = truth).
% 0.70/1.13  3 (wt=11) [] implies(implies(A,B),B) = implies(implies(B,A),A).
% 0.70/1.13  4 (wt=11) [] implies(implies(not(A),not(B)),implies(B,A)) = truth.
% 0.70/1.13  2 (wt=13) [] implies(implies(A,B),implies(implies(B,C),implies(A,C))) = truth.
% 0.70/1.13  end_of_list.
% 0.70/1.13  
% 0.70/1.13  Demodulators:
% 0.70/1.13  1 (wt=5) [] implies(truth,A) = A.
% 0.70/1.13  2 (wt=13) [] implies(implies(A,B),implies(implies(B,C),implies(A,C))) = truth.
% 0.70/1.13  4 (wt=11) [] implies(implies(not(A),not(B)),implies(B,A)) = truth.
% 0.70/1.13  end_of_list.
% 0.70/1.13  
% 0.70/1.13  Passive:
% 0.70/1.13  end_of_list.
% 0.70/1.13  
% 0.70/1.13  UNIT CONFLICT from 159 and 5 at   0.01 seconds.
% 0.70/1.13  
% 0.70/1.13  ---------------- PROOF ----------------
% 0.70/1.13  % SZS output start Refutation
% See solution above
% 0.70/1.13  ------------ end of proof -------------
% 0.70/1.13  
% 0.70/1.13  
% 0.70/1.13  ------------- memory usage ------------
% 0.70/1.13  Memory dynamically allocated (tp_alloc): 488.
% 0.70/1.13    type (bytes each)        gets      frees     in use      avail      bytes
% 0.70/1.13  sym_ent (  96)               55          0         55          0      5.2 K
% 0.70/1.13  term (  16)               22559      19263       3296         23     64.2 K
% 0.70/1.13  gen_ptr (   8)            19709       4416      15293         25    119.7 K
% 0.70/1.13  context ( 808)            15522      15520          2          2      3.2 K
% 0.70/1.13  trail (  12)               1527       1527          0          6      0.1 K
% 0.70/1.13  bt_node (  68)             6136       6132          4         13      1.1 K
% 0.70/1.13  ac_position (285432)          0          0          0          0      0.0 K
% 0.70/1.13  ac_match_pos (14044)          0          0          0          0      0.0 K
% 0.70/1.13  ac_match_free_vars_pos (4020)
% 0.70/1.13                                0          0          0          0      0.0 K
% 0.70/1.13  discrim (  12)             3765        134       3631         33     42.9 K
% 0.70/1.13  flat (  40)               40912      40912          0         37      1.4 K
% 0.70/1.13  discrim_pos (  12)         1323       1323          0          1      0.0 K
% 0.70/1.13  fpa_head (  12)             643          0        643          0      7.5 K
% 0.70/1.13  fpa_tree (  28)             957        957          0         17      0.5 K
% 0.70/1.13  fpa_pos (  36)              315        315          0          1      0.0 K
% 0.70/1.13  literal (  12)              929        770        159          1      1.9 K
% 0.70/1.13  clause (  24)               929        770        159          1      3.8 K
% 0.70/1.13  list (  12)                 215        159         56          3      0.7 K
% 0.70/1.13  list_pos (  20)             661         70        591         12     11.8 K
% 0.70/1.13  pair_index (   40)              2          0          2          0      0.1 K
% 0.70/1.13  
% 0.70/1.13  -------------- statistics -------------
% 0.70/1.13  Clauses input                  5
% 0.70/1.13    Usable input                   0
% 0.70/1.13    Sos input                      5
% 0.70/1.13    Demodulators input             0
% 0.70/1.13    Passive input                  0
% 0.70/1.13  
% 0.70/1.13  Processed BS (before search)   6
% 0.70/1.13  Forward subsumed BS            1
% 0.70/1.13  Kept BS                        5
% 0.70/1.13  New demodulators BS            3
% 0.70/1.13  Back demodulated BS            0
% 0.70/1.13  
% 0.70/1.13  Clauses or pairs given       392
% 0.70/1.13  Clauses generated            761
% 0.70/1.13  Forward subsumed             607
% 0.70/1.13  Deleted by weight              0
% 0.70/1.13  Deleted by variable count      0
% 0.70/1.13  Kept                         154
% 0.70/1.13  New demodulators             153
% 0.70/1.13  Back demodulated              13
% 0.70/1.13  Ordered paramod prunes         0
% 0.70/1.13  Basic paramod prunes         635
% 0.70/1.13  Prime paramod prunes          72
% 0.70/1.13  Semantic prunes                0
% 0.70/1.13  
% 0.70/1.13  Rewrite attmepts            8132
% 0.70/1.13  Rewrites                    1249
% 0.70/1.13  
% 0.70/1.13  FPA overloads                  0
% 0.70/1.13  FPA underloads                 0
% 0.70/1.13  
% 0.70/1.13  Usable size                    0
% 0.70/1.13  Sos size                     145
% 0.70/1.13  Demodulators size            143
% 0.70/1.13  Passive size                   0
% 0.70/1.13  Disabled size                 13
% 0.70/1.13  
% 0.70/1.13  Proofs found                   1
% 0.70/1.13  
% 0.70/1.13  ----------- times (seconds) ----------- Mon Jul  4 19:56:38 2022
% 0.70/1.13  
% 0.70/1.13  user CPU time             0.01   (0 hr, 0 min, 0 sec)
% 0.70/1.13  system CPU time           0.02   (0 hr, 0 min, 0 sec)
% 0.70/1.13  wall-clock time           0      (0 hr, 0 min, 0 sec)
% 0.70/1.13  input time                0.00
% 0.70/1.13  paramodulation time       0.00
% 0.70/1.13  demodulation time         0.00
% 0.70/1.13  orient time               0.00
% 0.70/1.13  weigh time                0.00
% 0.70/1.13  forward subsume time      0.00
% 0.70/1.13  back demod find time      0.00
% 0.70/1.13  conflict time             0.00
% 0.70/1.13  LRPO time                 0.00
% 0.70/1.13  store clause time         0.00
% 0.70/1.13  disable clause time       0.00
% 0.70/1.13  prime paramod time        0.00
% 0.70/1.13  semantics time            0.00
% 0.70/1.13  
% 0.70/1.13  EQP interrupted
%------------------------------------------------------------------------------