TSTP Solution File: LAT019-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : LAT019-1 : TPTP v8.1.0. Released v2.2.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n011.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 04:34:17 EDT 2022
% Result : Unsatisfiable 0.93s 1.30s
% Output : Refutation 0.93s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 8
% Syntax : Number of clauses : 44 ( 44 unt; 0 nHn; 5 RR)
% Number of literals : 44 ( 0 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 101 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(meet(A,A),A),
file('LAT019-1.p',unknown),
[] ).
cnf(2,plain,
equal(join(A,A),A),
file('LAT019-1.p',unknown),
[] ).
cnf(3,plain,
equal(meet(A,B),meet(B,A)),
file('LAT019-1.p',unknown),
[] ).
cnf(4,plain,
equal(join(A,B),join(B,A)),
file('LAT019-1.p',unknown),
[] ).
cnf(5,plain,
equal(meet(meet(A,B),C),meet(A,meet(B,C))),
file('LAT019-1.p',unknown),
[] ).
cnf(6,plain,
equal(join(join(A,B),C),join(A,join(B,C))),
file('LAT019-1.p',unknown),
[] ).
cnf(8,plain,
equal(meet(join(A,meet(B,C)),join(A,B)),join(A,meet(B,C))),
file('LAT019-1.p',unknown),
[] ).
cnf(9,plain,
equal(meet(A,join(B,C)),join(meet(A,B),meet(A,C))),
file('LAT019-1.p',unknown),
[] ).
cnf(10,plain,
equal(join(meet(join(A,meet(B,C)),A),meet(join(A,meet(B,C)),B)),join(A,meet(B,C))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[8]),9]),
[iquote('back_demod(8),demod([9])')] ).
cnf(12,plain,
~ equal(join(meet(join(a,b),a),meet(join(a,b),c)),join(a,meet(b,c))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[9]),1]),
[iquote('demod([9]),flip(1)')] ).
cnf(13,plain,
equal(meet(A,meet(A,B)),meet(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,5]),1]),
[iquote('para(1,5),flip(1)')] ).
cnf(15,plain,
equal(meet(A,meet(B,A)),meet(A,B)),
inference(para,[status(thm),theory(equality)],[3,13]),
[iquote('para(3,13)')] ).
cnf(20,plain,
equal(join(A,join(A,B)),join(A,B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[2,6]),1]),
[iquote('para(2,6),flip(1)')] ).
cnf(22,plain,
equal(join(A,join(B,C)),join(C,join(A,B))),
inference(para,[status(thm),theory(equality)],[6,4]),
[iquote('para(6,4)')] ).
cnf(25,plain,
equal(join(meet(join(A,B),A),meet(join(A,B),B)),join(A,B)),
inference(para,[status(thm),theory(equality)],[9,1]),
[iquote('para(9,1)')] ).
cnf(26,plain,
equal(join(meet(A,B),meet(A,C)),meet(join(B,C),A)),
inference(para,[status(thm),theory(equality)],[9,3]),
[iquote('para(9,3)')] ).
cnf(29,plain,
equal(meet(join(A,B),A),join(A,meet(A,B))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,26]),1]),
[iquote('para(1,26),flip(1)')] ).
cnf(30,plain,
equal(join(A,join(meet(A,B),meet(join(A,B),B))),join(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[25]),29,6]),
[iquote('back_demod(25),demod([29,6])')] ).
cnf(31,plain,
~ equal(join(a,join(meet(a,b),meet(join(a,b),c))),join(a,meet(b,c))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[12]),29,6]),
[iquote('back_demod(12),demod([29,6])')] ).
cnf(32,plain,
equal(join(A,join(meet(A,meet(B,C)),meet(join(A,meet(B,C)),B))),join(A,meet(B,C))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[10]),29,6]),
[iquote('back_demod(10),demod([29,6])')] ).
cnf(33,plain,
equal(meet(join(A,B),B),join(meet(B,A),B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,26]),1]),
[iquote('para(1,26),flip(1)')] ).
cnf(34,plain,
equal(join(A,join(meet(A,B),join(meet(B,A),B))),join(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[30]),33]),
[iquote('back_demod(30),demod([33])')] ).
cnf(64,plain,
equal(join(meet(join(A,B),meet(B,A)),join(meet(B,A),B)),join(meet(B,A),B)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[33,13]),9,33,33]),
[iquote('para(33,13),demod([9,33,33])')] ).
cnf(68,plain,
equal(join(meet(A,B),meet(B,C)),meet(join(A,C),B)),
inference(para,[status(thm),theory(equality)],[3,26]),
[iquote('para(3,26)')] ).
cnf(79,plain,
equal(meet(join(A,B),C),join(meet(A,C),meet(B,C))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3,68]),1]),
[iquote('para(3,68),flip(1)')] ).
cnf(82,plain,
equal(join(meet(A,B),join(meet(B,A),B)),join(meet(B,A),B)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[64]),79,15,13,6,20]),
[iquote('back_demod(64),demod([79,15,13,6,20])')] ).
cnf(83,plain,
equal(join(A,join(meet(B,A),B)),join(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[34]),82]),
[iquote('back_demod(34),demod([82])')] ).
cnf(88,plain,
equal(join(A,join(meet(A,meet(B,C)),join(meet(A,B),meet(B,C)))),join(A,meet(B,C))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[32]),79,5,15]),
[iquote('back_demod(32),demod([79,5,15])')] ).
cnf(89,plain,
~ equal(join(a,join(meet(a,b),join(meet(a,c),meet(b,c)))),join(a,meet(b,c))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[31]),79]),
[iquote('back_demod(31),demod([79])')] ).
cnf(92,plain,
equal(join(A,join(meet(A,B),B)),join(A,B)),
inference(para,[status(thm),theory(equality)],[3,83]),
[iquote('para(3,83)')] ).
cnf(97,plain,
equal(join(A,join(B,join(C,D))),join(D,join(B,join(A,C)))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[22,22]),6]),
[iquote('para(22,22),demod([6])')] ).
cnf(98,plain,
equal(join(A,join(B,join(C,D))),join(C,join(B,join(D,A)))),
inference(flip,[status(thm),theory(equality)],[97]),
[iquote('flip(97)')] ).
cnf(141,plain,
equal(join(A,join(meet(A,B),join(B,C))),join(A,join(B,C))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[92,6]),6,6]),1]),
[iquote('para(92,6),demod([6,6]),flip(1)')] ).
cnf(379,plain,
equal(join(A,join(meet(A,B),join(C,B))),join(A,join(B,C))),
inference(para,[status(thm),theory(equality)],[4,141]),
[iquote('para(4,141)')] ).
cnf(380,plain,
equal(join(A,join(meet(B,C),meet(A,B))),join(A,meet(B,C))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[88]),379]),
[iquote('back_demod(88),demod([379])')] ).
cnf(438,plain,
equal(join(A,join(meet(B,C),meet(A,C))),join(A,meet(C,B))),
inference(para,[status(thm),theory(equality)],[3,380]),
[iquote('para(3,380)')] ).
cnf(443,plain,
equal(join(A,join(meet(A,B),meet(B,C))),join(A,meet(B,C))),
inference(para,[status(thm),theory(equality)],[4,380]),
[iquote('para(4,380)')] ).
cnf(446,plain,
equal(join(A,meet(B,C)),join(meet(C,B),join(meet(A,B),A))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[438,4]),6]),
[iquote('para(438,4),demod([6])')] ).
cnf(447,plain,
equal(join(meet(A,B),join(meet(C,B),C)),join(C,meet(B,A))),
inference(flip,[status(thm),theory(equality)],[446]),
[iquote('flip(446)')] ).
cnf(457,plain,
equal(join(meet(A,B),join(meet(B,C),A)),join(A,meet(B,C))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[443,4]),6]),1]),
[iquote('para(443,4),demod([6]),flip(1)')] ).
cnf(467,plain,
equal(join(A,meet(B,C)),join(meet(A,B),join(A,meet(C,B)))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[447,4]),6]),
[iquote('para(447,4),demod([6])')] ).
cnf(524,plain,
equal(join(meet(A,B),join(A,meet(C,B))),join(A,meet(C,B))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3,467]),1]),
[iquote('para(3,467),flip(1)')] ).
cnf(1669,plain,
~ equal(join(a,meet(b,c)),join(a,meet(b,c))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[98,89]),457,524]),
[iquote('para(98,89),demod([457,524])')] ).
cnf(1670,plain,
$false,
inference(conflict,[status(thm)],[1669]),
[iquote('xx_conflict(1669)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : LAT019-1 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n011.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 : Thu Jun 30 10:22:48 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.93/1.30 ----- EQP 0.9e, May 2009 -----
% 0.93/1.30 The job began on n011.cluster.edu, Thu Jun 30 10:22:48 2022
% 0.93/1.30 The command was "./eqp09e".
% 0.93/1.30
% 0.93/1.30 set(prolog_style_variables).
% 0.93/1.30 set(lrpo).
% 0.93/1.30 set(basic_paramod).
% 0.93/1.30 set(functional_subsume).
% 0.93/1.30 set(ordered_paramod).
% 0.93/1.30 set(prime_paramod).
% 0.93/1.30 set(para_pairs).
% 0.93/1.30 assign(pick_given_ratio,4).
% 0.93/1.30 clear(print_kept).
% 0.93/1.30 clear(print_new_demod).
% 0.93/1.30 clear(print_back_demod).
% 0.93/1.30 clear(print_given).
% 0.93/1.30 assign(max_mem,64000).
% 0.93/1.30 end_of_commands.
% 0.93/1.30
% 0.93/1.30 Usable:
% 0.93/1.30 end_of_list.
% 0.93/1.30
% 0.93/1.30 Sos:
% 0.93/1.30 0 (wt=-1) [] meet(A,A) = A.
% 0.93/1.30 0 (wt=-1) [] join(A,A) = A.
% 0.93/1.30 0 (wt=-1) [] meet(A,B) = meet(B,A).
% 0.93/1.30 0 (wt=-1) [] join(A,B) = join(B,A).
% 0.93/1.30 0 (wt=-1) [] meet(meet(A,B),C) = meet(A,meet(B,C)).
% 0.93/1.30 0 (wt=-1) [] join(join(A,B),C) = join(A,join(B,C)).
% 0.93/1.30 0 (wt=-1) [] join(meet(A,join(B,C)),meet(A,B)) = meet(A,join(B,C)).
% 0.93/1.30 0 (wt=-1) [] meet(join(A,meet(B,C)),join(A,B)) = join(A,meet(B,C)).
% 0.93/1.30 0 (wt=-1) [] meet(A,join(B,C)) = join(meet(A,B),meet(A,C)).
% 0.93/1.30 0 (wt=-1) [] -(join(a,meet(b,c)) = meet(join(a,b),join(a,c))).
% 0.93/1.30 end_of_list.
% 0.93/1.30
% 0.93/1.30 Demodulators:
% 0.93/1.30 end_of_list.
% 0.93/1.30
% 0.93/1.30 Passive:
% 0.93/1.30 end_of_list.
% 0.93/1.30
% 0.93/1.30 Starting to process input.
% 0.93/1.30
% 0.93/1.30 ** KEPT: 1 (wt=5) [] meet(A,A) = A.
% 0.93/1.30 1 is a new demodulator.
% 0.93/1.30
% 0.93/1.30 ** KEPT: 2 (wt=5) [] join(A,A) = A.
% 0.93/1.30 2 is a new demodulator.
% 0.93/1.30
% 0.93/1.30 ** KEPT: 3 (wt=7) [] meet(A,B) = meet(B,A).
% 0.93/1.30 clause forward subsumed: 0 (wt=7) [flip(3)] meet(B,A) = meet(A,B).
% 0.93/1.30
% 0.93/1.30 ** KEPT: 4 (wt=7) [] join(A,B) = join(B,A).
% 0.93/1.30 clause forward subsumed: 0 (wt=7) [flip(4)] join(B,A) = join(A,B).
% 0.93/1.30
% 0.93/1.30 ** KEPT: 5 (wt=11) [] meet(meet(A,B),C) = meet(A,meet(B,C)).
% 0.93/1.30 5 is a new demodulator.
% 0.93/1.30
% 0.93/1.30 ** KEPT: 6 (wt=11) [] join(join(A,B),C) = join(A,join(B,C)).
% 0.93/1.30 6 is a new demodulator.
% 0.93/1.30
% 0.93/1.30 ** KEPT: 7 (wt=15) [] join(meet(A,join(B,C)),meet(A,B)) = meet(A,join(B,C)).
% 0.93/1.30 7 is a new demodulator.
% 0.93/1.30
% 0.93/1.30 ** KEPT: 8 (wt=15) [] meet(join(A,meet(B,C)),join(A,B)) = join(A,meet(B,C)).
% 0.93/1.30 8 is a new demodulator.
% 0.93/1.30
% 0.93/1.30 ** KEPT: 9 (wt=13) [] meet(A,join(B,C)) = join(meet(A,B),meet(A,C)).
% 0.93/1.30 9 is a new demodulator.
% 0.93/1.30 -> 9 back demodulating 8.
% 0.93/1.30
% 0.93/1.30 ** KEPT: 10 (wt=21) [back_demod(8),demod([9])] join(meet(join(A,meet(B,C)),A),meet(join(A,meet(B,C)),B)) = join(A,meet(B,C)).
% 0.93/1.30 10 is a new demodulator.
% 0.93/1.30 -> 9 back demodulating 7.
% 0.93/1.30
% 0.93/1.30 ** KEPT: 11 (wt=19) [back_demod(7),demod([9,6,9])] join(meet(A,B),join(meet(A,C),meet(A,B))) = join(meet(A,B),meet(A,C)).
% 0.93/1.30 11 is a new demodulator.
% 0.93/1.30
% 0.93/1.30 ** KEPT: 12 (wt=17) [demod([9]),flip(1)] -(join(meet(join(a,b),a),meet(join(a,b),c)) = join(a,meet(b,c))).
% 0.93/1.30 ---------------- PROOF FOUND ----------------
% 0.93/1.30 % SZS status Unsatisfiable
% 0.93/1.30
% 0.93/1.30
% 0.93/1.30 After processing input:
% 0.93/1.30
% 0.93/1.30 Usable:
% 0.93/1.30 end_of_list.
% 0.93/1.30
% 0.93/1.30 Sos:
% 0.93/1.30 1 (wt=5) [] meet(A,A) = A.
% 0.93/1.30 2 (wt=5) [] join(A,A) = A.
% 0.93/1.30 3 (wt=7) [] meet(A,B) = meet(B,A).
% 0.93/1.30 4 (wt=7) [] join(A,B) = join(B,A).
% 0.93/1.30 5 (wt=11) [] meet(meet(A,B),C) = meet(A,meet(B,C)).
% 0.93/1.30 6 (wt=11) [] join(join(A,B),C) = join(A,join(B,C)).
% 0.93/1.30 9 (wt=13) [] meet(A,join(B,C)) = join(meet(A,B),meet(A,C)).
% 0.93/1.30 12 (wt=17) [demod([9]),flip(1)] -(join(meet(join(a,b),a),meet(join(a,b),c)) = join(a,meet(b,c))).
% 0.93/1.30 11 (wt=19) [back_demod(7),demod([9,6,9])] join(meet(A,B),join(meet(A,C),meet(A,B))) = join(meet(A,B),meet(A,C)).
% 0.93/1.30 10 (wt=21) [back_demod(8),demod([9])] join(meet(join(A,meet(B,C)),A),meet(join(A,meet(B,C)),B)) = join(A,meet(B,C)).
% 0.93/1.30 end_of_list.
% 0.93/1.30
% 0.93/1.30 Demodulators:
% 0.93/1.30 1 (wt=5) [] meet(A,A) = A.
% 0.93/1.30 2 (wt=5) [] join(A,A) = A.
% 0.93/1.30 5 (wt=11) [] meet(meet(A,B),C) = meet(A,meet(B,C)).
% 0.93/1.30 6 (wt=11) [] join(join(A,B),C) = join(A,join(B,C)).
% 0.93/1.30 9 (wt=13) [] meet(A,join(B,C)) = join(meet(A,B),meet(A,C)).
% 0.93/1.30 10 (wt=21) [back_demod(8),demod([9])] join(meet(join(A,meet(B,C)),A),meet(join(A,meet(B,C)),B)) = join(A,meet(B,C)).
% 0.93/1.30 11 (wt=19) [back_demod(7),demod([9,6,9])] join(meet(A,B),join(meet(A,C),meet(A,B))) = join(meet(A,B),meet(A,C)).
% 0.93/1.30 end_of_list.
% 0.93/1.30
% 0.93/1.30 Passive:
% 0.93/1.30 end_of_list.
% 0.93/1.30
% 0.93/1.30 UNIT CONFLICT from 1669 and x=x at 0.11 seconds.
% 0.93/1.30
% 0.93/1.30 ---------------- PROOF ----------------
% 0.93/1.30 % SZS output start Refutation
% See solution above
% 0.93/1.30 ------------ end of proof -------------
% 0.93/1.30
% 0.93/1.30
% 0.93/1.30 ------------- memory usage ------------
% 0.93/1.30 Memory dynamically allocated (tp_alloc): 2441.
% 0.93/1.30 type (bytes each) gets frees in use avail bytes
% 0.93/1.30 sym_ent ( 96) 56 0 56 0 5.2 K
% 0.93/1.30 term ( 16) 262188 224783 37405 24 724.5 K
% 0.93/1.30 gen_ptr ( 8) 184875 38700 146175 43 1142.3 K
% 0.93/1.30 context ( 808) 137354 137352 2 5 5.5 K
% 0.93/1.30 trail ( 12) 26145 26145 0 5 0.1 K
% 0.93/1.30 bt_node ( 68) 33087 33080 7 5 0.8 K
% 0.93/1.30 ac_position (285432) 0 0 0 0 0.0 K
% 0.93/1.30 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.93/1.30 ac_match_free_vars_pos (4020)
% 0.93/1.30 0 0 0 0 0.0 K
% 0.93/1.30 discrim ( 12) 14329 1223 13106 0 153.6 K
% 0.93/1.30 flat ( 40) 559951 559951 0 47 1.8 K
% 0.93/1.30 discrim_pos ( 12) 16691 16691 0 1 0.0 K
% 0.93/1.30 fpa_head ( 12) 464 0 464 0 5.4 K
% 0.93/1.30 fpa_tree ( 28) 2439 2439 0 33 0.9 K
% 0.93/1.30 fpa_pos ( 36) 1949 1949 0 1 0.0 K
% 0.93/1.30 literal ( 12) 14284 12615 1669 1 19.6 K
% 0.93/1.30 clause ( 24) 14284 12615 1669 1 39.1 K
% 0.93/1.30 list ( 12) 340 284 56 4 0.7 K
% 0.93/1.30 list_pos ( 20) 5607 682 4925 0 96.2 K
% 0.93/1.30 pair_index ( 40) 2 0 2 0 0.1 K
% 0.93/1.30
% 0.93/1.30 -------------- statistics -------------
% 0.93/1.30 Clauses input 10
% 0.93/1.30 Usable input 0
% 0.93/1.30 Sos input 10
% 0.93/1.30 Demodulators input 0
% 0.93/1.30 Passive input 0
% 0.93/1.30
% 0.93/1.30 Processed BS (before search) 14
% 0.93/1.30 Forward subsumed BS 2
% 0.93/1.30 Kept BS 12
% 0.93/1.30 New demodulators BS 9
% 0.93/1.30 Back demodulated BS 2
% 0.93/1.30
% 0.93/1.30 Clauses or pairs given 4240
% 0.93/1.30 Clauses generated 7187
% 0.93/1.30 Forward subsumed 5530
% 0.93/1.30 Deleted by weight 0
% 0.93/1.30 Deleted by variable count 0
% 0.93/1.30 Kept 1657
% 0.93/1.30 New demodulators 272
% 0.93/1.30 Back demodulated 154
% 0.93/1.30 Ordered paramod prunes 0
% 0.93/1.30 Basic paramod prunes 2604
% 0.93/1.30 Prime paramod prunes 204
% 0.93/1.30 Semantic prunes 0
% 0.93/1.30
% 0.93/1.30 Rewrite attmepts 86641
% 0.93/1.30 Rewrites 12112
% 0.93/1.30
% 0.93/1.30 FPA overloads 0
% 0.93/1.30 FPA underloads 0
% 0.93/1.30
% 0.93/1.30 Usable size 0
% 0.93/1.30 Sos size 1512
% 0.93/1.30 Demodulators size 233
% 0.93/1.30 Passive size 0
% 0.93/1.30 Disabled size 156
% 0.93/1.30
% 0.93/1.30 Proofs found 1
% 0.93/1.30
% 0.93/1.30 ----------- times (seconds) ----------- Thu Jun 30 10:22:49 2022
% 0.93/1.30
% 0.93/1.30 user CPU time 0.11 (0 hr, 0 min, 0 sec)
% 0.93/1.30 system CPU time 0.13 (0 hr, 0 min, 0 sec)
% 0.93/1.30 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 0.93/1.30 input time 0.00
% 0.93/1.30 paramodulation time 0.03
% 0.93/1.30 demodulation time 0.01
% 0.93/1.30 orient time 0.02
% 0.93/1.30 weigh time 0.00
% 0.93/1.30 forward subsume time 0.01
% 0.93/1.30 back demod find time 0.00
% 0.93/1.30 conflict time 0.00
% 0.93/1.30 LRPO time 0.01
% 0.93/1.30 store clause time 0.01
% 0.93/1.30 disable clause time 0.00
% 0.93/1.30 prime paramod time 0.01
% 0.93/1.30 semantics time 0.00
% 0.93/1.30
% 0.93/1.30 EQP interrupted
%------------------------------------------------------------------------------