TSTP Solution File: SYN563-10 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : SYN563-10 : TPTP v8.1.0. Released v7.5.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 : Thu Jul 21 05:11:12 EDT 2022
% Result : Unsatisfiable 1.31s 1.69s
% Output : Refutation 1.31s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 12
% Syntax : Number of clauses : 24 ( 24 unt; 0 nHn; 11 RR)
% Number of literals : 24 ( 0 equ; 1 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 : 12 ( 12 usr; 5 con; 0-4 aty)
% Number of variables : 26 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(ifeq2(A,A,B,C),B),
file('SYN563-10.p',unknown),
[] ).
cnf(2,plain,
equal(ifeq(A,A,B,C),B),
file('SYN563-10.p',unknown),
[] ).
cnf(3,plain,
equal(p2(A,A),true),
file('SYN563-10.p',unknown),
[] ).
cnf(4,plain,
equal(p6(A,A),true),
file('SYN563-10.p',unknown),
[] ).
cnf(5,plain,
equal(p2(f4(c7),f4(c8)),true),
file('SYN563-10.p',unknown),
[] ).
cnf(7,plain,
equal(p5(f3(f3(A)),f3(f4(A))),true),
file('SYN563-10.p',unknown),
[] ).
cnf(9,plain,
equal(ifeq2(p6(c7,A),true,p6(c7,f3(A)),true),true),
file('SYN563-10.p',unknown),
[] ).
cnf(10,plain,
equal(ifeq2(p5(A,B),true,p6(f4(A),B),true),true),
file('SYN563-10.p',unknown),
[] ).
cnf(11,plain,
equal(ifeq2(p2(A,B),true,p2(f3(A),f3(B)),true),true),
file('SYN563-10.p',unknown),
[] ).
cnf(15,plain,
equal(ifeq2(p6(A,B),true,ifeq2(p5(B,C),true,p5(A,C),true),true),true),
file('SYN563-10.p',unknown),
[] ).
cnf(17,plain,
equal(ifeq2(p2(A,B),true,ifeq2(p2(C,D),true,ifeq2(p5(A,C),true,p5(B,D),true),true),true),true),
file('SYN563-10.p',unknown),
[] ).
cnf(19,plain,
equal(ifeq(p6(f4(c7),f3(f4(c8))),true,a,b),b),
file('SYN563-10.p',unknown),
[] ).
cnf(20,plain,
~ equal(b,a),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(26,plain,
equal(p6(c7,f3(c7)),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4,9]),1]),
[iquote('para(4,9),demod([1])')] ).
cnf(31,plain,
equal(p2(f3(f4(c7)),f3(f4(c8))),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[5,11]),1]),
[iquote('para(5,11),demod([1])')] ).
cnf(49,plain,
equal(ifeq2(p6(A,f3(f3(B))),true,p5(A,f3(f4(B))),true),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[7,15]),1]),
[iquote('para(7,15),demod([1])')] ).
cnf(51,plain,
equal(p6(c7,f3(f3(c7))),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[26,9]),1]),
[iquote('para(26,9),demod([1])')] ).
cnf(128,plain,
equal(ifeq2(p2(A,B),true,ifeq2(p5(A,f3(f4(c7))),true,p5(B,f3(f4(c8))),true),true),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[31,17]),1]),
[iquote('para(31,17),demod([1])')] ).
cnf(202,plain,
equal(p5(c7,f3(f4(c7))),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[51,49]),1]),
[iquote('para(51,49),demod([1])')] ).
cnf(2187,plain,
equal(ifeq2(p2(c7,A),true,p5(A,f3(f4(c8))),true),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[202,128]),1]),
[iquote('para(202,128),demod([1])')] ).
cnf(2188,plain,
equal(p5(c7,f3(f4(c8))),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3,2187]),1]),
[iquote('para(3,2187),demod([1])')] ).
cnf(2209,plain,
equal(p6(f4(c7),f3(f4(c8))),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[2188,10]),1]),
[iquote('para(2188,10),demod([1])')] ).
cnf(2211,plain,
equal(b,a),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[19]),2209,2]),1]),
[iquote('back_demod(19),demod([2209,2]),flip(1)')] ).
cnf(2212,plain,
$false,
inference(conflict,[status(thm)],[2211,20]),
[iquote('conflict(2211,20)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13 % Problem : SYN563-10 : TPTP v8.1.0. Released v7.5.0.
% 0.04/0.13 % Command : tptp2X_and_run_eqp %s
% 0.13/0.35 % Computer : n011.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Mon Jul 11 14:26:57 EDT 2022
% 0.13/0.35 % CPUTime :
% 1.31/1.69 ----- EQP 0.9e, May 2009 -----
% 1.31/1.69 The job began on n011.cluster.edu, Mon Jul 11 14:26:58 2022
% 1.31/1.69 The command was "./eqp09e".
% 1.31/1.69
% 1.31/1.69 set(prolog_style_variables).
% 1.31/1.69 set(lrpo).
% 1.31/1.69 set(basic_paramod).
% 1.31/1.69 set(functional_subsume).
% 1.31/1.69 set(ordered_paramod).
% 1.31/1.69 set(prime_paramod).
% 1.31/1.69 set(para_pairs).
% 1.31/1.69 assign(pick_given_ratio,4).
% 1.31/1.69 clear(print_kept).
% 1.31/1.69 clear(print_new_demod).
% 1.31/1.69 clear(print_back_demod).
% 1.31/1.69 clear(print_given).
% 1.31/1.69 assign(max_mem,64000).
% 1.31/1.69 end_of_commands.
% 1.31/1.69
% 1.31/1.69 Usable:
% 1.31/1.69 end_of_list.
% 1.31/1.69
% 1.31/1.69 Sos:
% 1.31/1.69 0 (wt=-1) [] ifeq2(A,A,B,C) = B.
% 1.31/1.69 0 (wt=-1) [] ifeq(A,A,B,C) = B.
% 1.31/1.69 0 (wt=-1) [] p2(A,A) = true.
% 1.31/1.69 0 (wt=-1) [] p6(A,A) = true.
% 1.31/1.69 0 (wt=-1) [] p2(f4(c7),f4(c8)) = true.
% 1.31/1.69 0 (wt=-1) [] ifeq2(p5(A,B),true,p6(A,B),true) = true.
% 1.31/1.69 0 (wt=-1) [] p5(f3(f3(A)),f3(f4(A))) = true.
% 1.31/1.69 0 (wt=-1) [] ifeq2(p6(f4(A),B),true,p5(A,B),true) = true.
% 1.31/1.69 0 (wt=-1) [] ifeq2(p6(c7,A),true,p6(c7,f3(A)),true) = true.
% 1.31/1.69 0 (wt=-1) [] ifeq2(p5(A,B),true,p6(f4(A),B),true) = true.
% 1.31/1.69 0 (wt=-1) [] ifeq2(p2(A,B),true,p2(f3(A),f3(B)),true) = true.
% 1.31/1.69 0 (wt=-1) [] ifeq2(p2(A,B),true,p2(f4(A),f4(B)),true) = true.
% 1.31/1.69 0 (wt=-1) [] ifeq2(p2(A,B),true,ifeq2(p2(A,C),true,p2(C,B),true),true) = true.
% 1.31/1.69 0 (wt=-1) [] ifeq2(p6(A,B),true,ifeq2(p6(C,A),true,p6(C,B),true),true) = true.
% 1.31/1.69 0 (wt=-1) [] ifeq2(p6(A,B),true,ifeq2(p5(B,C),true,p5(A,C),true),true) = true.
% 1.31/1.69 0 (wt=-1) [] ifeq2(p2(A,B),true,ifeq2(p2(C,D),true,ifeq2(p6(C,A),true,p6(D,B),true),true),true) = true.
% 1.31/1.69 0 (wt=-1) [] ifeq2(p2(A,B),true,ifeq2(p2(C,D),true,ifeq2(p5(A,C),true,p5(B,D),true),true),true) = true.
% 1.31/1.69 0 (wt=-1) [] ifeq(p6(f4(c7),c8),true,a,b) = b.
% 1.31/1.69 0 (wt=-1) [] ifeq(p6(f4(c7),f3(f4(c8))),true,a,b) = b.
% 1.31/1.69 0 (wt=-1) [] -(a = b).
% 1.31/1.69 end_of_list.
% 1.31/1.69
% 1.31/1.69 Demodulators:
% 1.31/1.69 end_of_list.
% 1.31/1.69
% 1.31/1.69 Passive:
% 1.31/1.69 end_of_list.
% 1.31/1.69
% 1.31/1.69 Starting to process input.
% 1.31/1.69
% 1.31/1.69 ** KEPT: 1 (wt=7) [] ifeq2(A,A,B,C) = B.
% 1.31/1.69 1 is a new demodulator.
% 1.31/1.69
% 1.31/1.69 ** KEPT: 2 (wt=7) [] ifeq(A,A,B,C) = B.
% 1.31/1.69 2 is a new demodulator.
% 1.31/1.69
% 1.31/1.69 ** KEPT: 3 (wt=5) [] p2(A,A) = true.
% 1.31/1.69 3 is a new demodulator.
% 1.31/1.69
% 1.31/1.69 ** KEPT: 4 (wt=5) [] p6(A,A) = true.
% 1.31/1.69 4 is a new demodulator.
% 1.31/1.69
% 1.31/1.69 ** KEPT: 5 (wt=7) [] p2(f4(c7),f4(c8)) = true.
% 1.31/1.69 5 is a new demodulator.
% 1.31/1.69
% 1.31/1.69 ** KEPT: 6 (wt=11) [] ifeq2(p5(A,B),true,p6(A,B),true) = true.
% 1.31/1.69 6 is a new demodulator.
% 1.31/1.69
% 1.31/1.69 ** KEPT: 7 (wt=9) [] p5(f3(f3(A)),f3(f4(A))) = true.
% 1.31/1.69 7 is a new demodulator.
% 1.31/1.69
% 1.31/1.69 ** KEPT: 8 (wt=12) [] ifeq2(p6(f4(A),B),true,p5(A,B),true) = true.
% 1.31/1.69 8 is a new demodulator.
% 1.31/1.69
% 1.31/1.69 ** KEPT: 9 (wt=12) [] ifeq2(p6(c7,A),true,p6(c7,f3(A)),true) = true.
% 1.31/1.69 9 is a new demodulator.
% 1.31/1.69
% 1.31/1.69 ** KEPT: 10 (wt=12) [] ifeq2(p5(A,B),true,p6(f4(A),B),true) = true.
% 1.31/1.69 10 is a new demodulator.
% 1.31/1.69
% 1.31/1.69 ** KEPT: 11 (wt=13) [] ifeq2(p2(A,B),true,p2(f3(A),f3(B)),true) = true.
% 1.31/1.69 11 is a new demodulator.
% 1.31/1.69
% 1.31/1.69 ** KEPT: 12 (wt=13) [] ifeq2(p2(A,B),true,p2(f4(A),f4(B)),true) = true.
% 1.31/1.69 12 is a new demodulator.
% 1.31/1.69
% 1.31/1.69 ** KEPT: 13 (wt=17) [] ifeq2(p2(A,B),true,ifeq2(p2(A,C),true,p2(C,B),true),true) = true.
% 1.31/1.69 13 is a new demodulator.
% 1.31/1.69
% 1.31/1.69 ** KEPT: 14 (wt=17) [] ifeq2(p6(A,B),true,ifeq2(p6(C,A),true,p6(C,B),true),true) = true.
% 1.31/1.69 14 is a new demodulator.
% 1.31/1.69
% 1.31/1.69 ** KEPT: 15 (wt=17) [] ifeq2(p6(A,B),true,ifeq2(p5(B,C),true,p5(A,C),true),true) = true.
% 1.31/1.69 15 is a new demodulator.
% 1.31/1.69
% 1.31/1.69 ** KEPT: 16 (wt=23) [] ifeq2(p2(A,B),true,ifeq2(p2(C,D),true,ifeq2(p6(C,A),true,p6(D,B),true),true),true) = true.
% 1.31/1.69 16 is a new demodulator.
% 1.31/1.69
% 1.31/1.69 ** KEPT: 17 (wt=23) [] ifeq2(p2(A,B),true,ifeq2(p2(C,D),true,ifeq2(p5(A,C),true,p5(B,D),true),true),true) = true.
% 1.31/1.69 17 is a new demodulator.
% 1.31/1.69
% 1.31/1.69 ** KEPT: 18 (wt=10) [] ifeq(p6(f4(c7),c8),true,a,b) = b.
% 1.31/1.69 18 is a new demodulator.
% 1.31/1.69
% 1.31/1.69 ** KEPT: 19 (wt=12) [] ifeq(p6(f4(c7),f3(f4(c8))),true,a,b) = b.
% 1.31/1.69 19 is a new demodulator.
% 1.31/1.69
% 1.31/1.69 ** KEPT: 20 (wt=3) [flip(1)] -(b = a).
% 1.31/1.69 ---------------- PROOF FOUND ----------------
% 1.31/1.69 % SZS status Unsatisfiable
% 1.31/1.69
% 1.31/1.69
% 1.31/1.69 After processing input:
% 1.31/1.69
% 1.31/1.69 Usable:
% 1.31/1.69 end_of_list.
% 1.31/1.69
% 1.31/1.69 Sos:
% 1.31/1.69 20 (wt=3) [flip(1)] -(b = a).
% 1.31/1.69 3 (wt=5) [] p2(A,A) = true.
% 1.31/1.69 4 (wt=5) [] p6(A,A) = true.
% 1.31/1.69 1 (wt=7) [] ifeq2(A,A,B,C) = B.
% 1.31/1.69 2 (wt=7) [] ifeq(A,A,B,C) = B.
% 1.31/1.69 5 (wt=7) [] p2(f4(c7),f4(c8)) = true.
% 1.31/1.69 7 (wt=9) [] p5(f3(f3(A)),f3(f4(A))) = true.
% 1.31/1.69 18 (wt=10) [] ifeq(p6(f4(c7),c8),true,a,b) = b.
% 1.31/1.69 6 (wt=11) [] ifeq2(p5(A,B),true,p6(A,B),true) = true.
% 1.31/1.69 8 (wt=12) [] ifeq2(p6(f4(A),B),true,p5(A,B),true) = true.
% 1.31/1.69 9 (wt=12) [] ifeq2(p6(c7,A),true,p6(c7,f3(A)),true) = true.
% 1.31/1.69 10 (wt=12) [] ifeq2(p5(A,B),true,p6(f4(A),B),true) = true.
% 1.31/1.69 19 (wt=12) [] ifeq(p6(f4(c7),f3(f4(c8))),true,a,b) = b.
% 1.31/1.69 11 (wt=13) [] ifeq2(p2(A,B),true,p2(f3(A),f3(B)),true) = true.
% 1.31/1.69 12 (wt=13) [] ifeq2(p2(A,B),true,p2(f4(A),f4(B)),true) = true.
% 1.31/1.69 13 (wt=17) [] ifeq2(p2(A,B),true,ifeq2(p2(A,C),true,p2(C,B),true),true) = true.
% 1.31/1.69 14 (wt=17) [] ifeq2(p6(A,B),true,ifeq2(p6(C,A),true,p6(C,B),true),true) = true.
% 1.31/1.69 15 (wt=17) [] ifeq2(p6(A,B),true,ifeq2(p5(B,C),true,p5(A,C),true),true) = true.
% 1.31/1.69 16 (wt=23) [] ifeq2(p2(A,B),true,ifeq2(p2(C,D),true,ifeq2(p6(C,A),true,p6(D,B),true),true),true) = true.
% 1.31/1.69 17 (wt=23) [] ifeq2(p2(A,B),true,ifeq2(p2(C,D),true,ifeq2(p5(A,C),true,p5(B,D),true),true),true) = true.
% 1.31/1.69 end_of_list.
% 1.31/1.69
% 1.31/1.69 Demodulators:
% 1.31/1.69 1 (wt=7) [] ifeq2(A,A,B,C) = B.
% 1.31/1.69 2 (wt=7) [] ifeq(A,A,B,C) = B.
% 1.31/1.69 3 (wt=5) [] p2(A,A) = true.
% 1.31/1.69 4 (wt=5) [] p6(A,A) = true.
% 1.31/1.69 5 (wt=7) [] p2(f4(c7),f4(c8)) = true.
% 1.31/1.69 6 (wt=11) [] ifeq2(p5(A,B),true,p6(A,B),true) = true.
% 1.31/1.69 7 (wt=9) [] p5(f3(f3(A)),f3(f4(A))) = true.
% 1.31/1.69 8 (wt=12) [] ifeq2(p6(f4(A),B),true,p5(A,B),true) = true.
% 1.31/1.69 9 (wt=12) [] ifeq2(p6(c7,A),true,p6(c7,f3(A)),true) = true.
% 1.31/1.69 10 (wt=12) [] ifeq2(p5(A,B),true,p6(f4(A),B),true) = true.
% 1.31/1.69 11 (wt=13) [] ifeq2(p2(A,B),true,p2(f3(A),f3(B)),true) = true.
% 1.31/1.69 12 (wt=13) [] ifeq2(p2(A,B),true,p2(f4(A),f4(B)),true) = true.
% 1.31/1.69 13 (wt=17) [] ifeq2(p2(A,B),true,ifeq2(p2(A,C),true,p2(C,B),true),true) = true.
% 1.31/1.69 14 (wt=17) [] ifeq2(p6(A,B),true,ifeq2(p6(C,A),true,p6(C,B),true),true) = true.
% 1.31/1.69 15 (wt=17) [] ifeq2(p6(A,B),true,ifeq2(p5(B,C),true,p5(A,C),true),true) = true.
% 1.31/1.69 16 (wt=23) [] ifeq2(p2(A,B),true,ifeq2(p2(C,D),true,ifeq2(p6(C,A),true,p6(D,B),true),true),true) = true.
% 1.31/1.69 17 (wt=23) [] ifeq2(p2(A,B),true,ifeq2(p2(C,D),true,ifeq2(p5(A,C),true,p5(B,D),true),true),true) = true.
% 1.31/1.69 18 (wt=10) [] ifeq(p6(f4(c7),c8),true,a,b) = b.
% 1.31/1.69 19 (wt=12) [] ifeq(p6(f4(c7),f3(f4(c8))),true,a,b) = b.
% 1.31/1.69 end_of_list.
% 1.31/1.69
% 1.31/1.69 Passive:
% 1.31/1.69 end_of_list.
% 1.31/1.69
% 1.31/1.69 UNIT CONFLICT from 2211 and 20 at 0.23 seconds.
% 1.31/1.69
% 1.31/1.69 ---------------- PROOF ----------------
% 1.31/1.69 % SZS output start Refutation
% See solution above
% 1.31/1.69 ------------ end of proof -------------
% 1.31/1.69
% 1.31/1.69
% 1.31/1.69 ------------- memory usage ------------
% 1.31/1.69 Memory dynamically allocated (tp_alloc): 2929.
% 1.31/1.69 type (bytes each) gets frees in use avail bytes
% 1.31/1.69 sym_ent ( 96) 91 0 91 0 8.5 K
% 1.31/1.69 term ( 16) 126346 91444 34902 29 673.6 K
% 1.31/1.69 gen_ptr ( 8) 170775 19371 151404 23 1183.0 K
% 1.31/1.69 context ( 808) 1912771 1912769 2 2 3.2 K
% 1.31/1.69 trail ( 12) 2407 2407 0 4 0.0 K
% 1.31/1.69 bt_node ( 68) 1085509 1085506 3 21 1.6 K
% 1.31/1.69 ac_position (285432) 0 0 0 0 0.0 K
% 1.31/1.69 ac_match_pos (14044) 0 0 0 0 0.0 K
% 1.31/1.69 ac_match_free_vars_pos (4020)
% 1.31/1.69 0 0 0 0 0.0 K
% 1.31/1.69 discrim ( 12) 31280 553 30727 53 360.7 K
% 1.31/1.69 flat ( 40) 208517 208517 0 25 1.0 K
% 1.31/1.69 discrim_pos ( 12) 5903 5903 0 1 0.0 K
% 1.31/1.69 fpa_head ( 12) 3564 0 3564 0 41.8 K
% 1.31/1.69 fpa_tree ( 28) 22342 22342 0 19 0.5 K
% 1.31/1.69 fpa_pos ( 36) 4420 4420 0 1 0.0 K
% 1.31/1.69 literal ( 12) 7248 5037 2211 1 25.9 K
% 1.31/1.69 clause ( 24) 7248 5037 2211 1 51.8 K
% 1.31/1.69 list ( 12) 2268 2211 57 2 0.7 K
% 1.31/1.69 list_pos ( 20) 8946 236 8710 13 170.4 K
% 1.31/1.69 pair_index ( 40) 2 0 2 0 0.1 K
% 1.31/1.69
% 1.31/1.69 -------------- statistics -------------
% 1.31/1.69 Clauses input 20
% 1.31/1.69 Usable input 0
% 1.31/1.69 Sos input 20
% 1.31/1.69 Demodulators input 0
% 1.31/1.69 Passive input 0
% 1.31/1.69
% 1.31/1.69 Processed BS (before search) 20
% 1.31/1.69 Forward subsumed BS 0
% 1.31/1.69 Kept BS 20
% 1.31/1.69 New demodulators BS 19
% 1.31/1.69 Back demodulated BS 0
% 1.31/1.69
% 1.31/1.69 Clauses or pairs given 77497
% 1.31/1.69 Clauses generated 5018
% 1.31/1.69 Forward subsumed 2827
% 1.31/1.69 Deleted by weight 0
% 1.31/1.69 Deleted by variable count 0
% 1.31/1.69 Kept 2191
% 1.31/1.69 New demodulators 2190
% 1.31/1.69 Back demodulated 43
% 1.31/1.69 Ordered paramod prunes 0
% 1.31/1.69 Basic paramod prunes 172380
% 1.31/1.69 Prime paramod prunes 0
% 1.31/1.69 Semantic prunes 0
% 1.31/1.69
% 1.31/1.69 Rewrite attmepts 72788
% 1.31/1.69 Rewrites 5903
% 1.31/1.69
% 1.31/1.69 FPA overloads 0
% 1.31/1.69 FPA underloads 0
% 1.31/1.69
% 1.31/1.69 Usable size 0
% 1.31/1.69 Sos size 2167
% 1.31/1.69 Demodulators size 2166
% 1.31/1.69 Passive size 0
% 1.31/1.69 Disabled size 43
% 1.31/1.69
% 1.31/1.69 Proofs found 1
% 1.31/1.69
% 1.31/1.69 ----------- times (seconds) ----------- Mon Jul 11 14:26:58 2022
% 1.31/1.69
% 1.31/1.69 user CPU time 0.23 (0 hr, 0 min, 0 sec)
% 1.31/1.69 system CPU time 0.34 (0 hr, 0 min, 0 sec)
% 1.31/1.69 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 1.31/1.69 input time 0.00
% 1.31/1.69 paramodulation time 0.09
% 1.31/1.69 demodulation time 0.01
% 1.31/1.69 orient time 0.01
% 1.31/1.69 weigh time 0.00
% 1.31/1.69 forward subsume time 0.01
% 1.31/1.69 back demod find time 0.01
% 1.31/1.69 conflict time 0.00
% 1.31/1.69 LRPO time 0.00
% 1.31/1.69 store clause time 0.02
% 1.31/1.69 disable clause time 0.00
% 1.31/1.69 prime paramod time 0.01
% 1.31/1.69 semantics time 0.00
% 1.31/1.69
% 1.31/1.69 EQP interrupted
%------------------------------------------------------------------------------