%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : SWX200-1 : TPTP v9.3.0. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n004.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 : 300s
% DateTime : Tue May 5 07:00:09 PM UTC 2026
% Result : Unsatisfiable 0.72s 1.26s
% Output : Refutation 0.72s
% Verified :
% SZS Type : ERROR: Analysing output (Cycle in a tree)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(cons(A,merge(B,cons(C,D))),aux(A,B,C,D,btrue)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(3,plain,
equal(aux2(A,B,C,btrue),ord(cons(B,C))),
file('SWX200-1.p',unknown),
[] ).
cnf(4,plain,
equal(ord(cons(A,B)),aux2(C,A,B,btrue)),
inference(flip,[status(thm),theory(equality)],[3]),
[iquote('flip(3)')] ).
cnf(5,plain,
equal(aux2(A,B,C,bfalse),bfalse),
file('SWX200-1.p',unknown),
[] ).
cnf(7,plain,
equal(leqNat(s(A),z),bfalse),
file('SWX200-1.p',unknown),
[] ).
cnf(9,plain,
equal(merge(nil,A),A),
file('SWX200-1.p',unknown),
[] ).
cnf(12,plain,
equal(ord(nil),btrue),
file('SWX200-1.p',unknown),
[] ).
cnf(14,plain,
equal(ord(cons(A,cons(B,C))),aux2(A,B,C,leqNat(A,B))),
file('SWX200-1.p',unknown),
[] ).
cnf(15,plain,
equal(impl(btrue,A),A),
file('SWX200-1.p',unknown),
[] ).
cnf(17,plain,
equal(impl(eq2(ord(A),btrue),impl(eq2(ord(B),bfalse),eq2(ord(merge(A,B)),btrue))),prop_merge_ord_not3(A,B)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(18,plain,
equal(eq2(bfalse,btrue),bfalse),
file('SWX200-1.p',unknown),
[] ).
cnf(24,plain,
equal(eq2(A,A),btrue),
file('SWX200-1.p',unknown),
[] ).
cnf(25,plain,
~ equal(eq2(prop_merge_ord_not3(A,B),bfalse),btrue),
file('SWX200-1.p',unknown),
[] ).
cnf(40,plain,
equal(cons(A,cons(B,C)),aux(A,nil,B,C,btrue)),
inference(para,[status(thm),theory(equality)],[9,1]),
[iquote('para(9,1)')] ).
cnf(41,plain,
equal(ord(aux(A,nil,B,C,btrue)),aux2(A,B,C,leqNat(A,B))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[14]),40]),
[iquote('back_demod(14),demod([40])')] ).
cnf(60,plain,
equal(impl(eq2(ord(A),bfalse),eq2(ord(A),btrue)),prop_merge_ord_not3(nil,A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[9,17]),12,24,15]),
[iquote('para(9,17),demod([12,24,15])')] ).
cnf(81,plain,
equal(aux2(A,B,C,leqNat(A,B)),aux2(D,A,cons(B,C),btrue)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[40,4]),41]),
[iquote('para(40,4),demod([41])')] ).
cnf(84,plain,
equal(aux2(A,s(B),cons(z,C),btrue),bfalse),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[7,81]),5]),1]),
[iquote('para(7,81),demod([5]),flip(1)')] ).
cnf(96,plain,
equal(impl(eq2(aux2(A,B,C,btrue),bfalse),eq2(ord(cons(B,C)),btrue)),prop_merge_ord_not3(nil,cons(B,C))),
inference(para,[status(thm),theory(equality)],[4,60]),
[iquote('para(4,60)')] ).
cnf(774,plain,
equal(impl(eq2(aux2(A,B,C,btrue),bfalse),eq2(aux2(D,B,C,btrue),btrue)),prop_merge_ord_not3(nil,cons(B,C))),
inference(para,[status(thm),theory(equality)],[4,96]),
[iquote('para(4,96)')] ).
cnf(775,plain,
equal(prop_merge_ord_not3(nil,cons(A,B)),impl(eq2(aux2(C,A,B,btrue),bfalse),eq2(aux2(D,A,B,btrue),btrue))),
inference(flip,[status(thm),theory(equality)],[774]),
[iquote('flip(774)')] ).
cnf(776,plain,
~ equal(eq2(impl(eq2(aux2(A,B,C,btrue),bfalse),eq2(aux2(D,B,C,btrue),btrue)),bfalse),btrue),
inference(para,[status(thm),theory(equality)],[775,25]),
[iquote('para(775,25)')] ).
cnf(777,plain,
~ equal(btrue,btrue),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[84,776]),24,84,18,15,24]),
[iquote('para(84,776),demod([24,84,18,15,24])')] ).
cnf(778,plain,
$false,
inference(conflict,[status(thm)],[777]),
[iquote('xx_conflict(777)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12 % Problem : SWX200-1 : TPTP v9.3.0. Released v9.3.0.
% 0.00/0.12 % Command : tptp2X_and_run_eqp %s
% 0.18/0.33 % Computer : n004.cluster.edu
% 0.18/0.33 % Model : x86_64 x86_64
% 0.18/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.33 % Memory : 8042.1875MB
% 0.18/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.18/0.33 % CPULimit : 300
% 0.18/0.33 % WCLimit : 300
% 0.18/0.33 % DateTime : Tue May 5 11:15:32 EDT 2026
% 0.18/0.34 % CPUTime :
% 0.72/1.26 ----- EQP 0.9e, May 2009 -----
% 0.72/1.26 The job began on n004.cluster.edu, Tue May 5 11:15:33 2026
% 0.72/1.26 The command was "./eqp09e".
% 0.72/1.26
% 0.72/1.26 set(prolog_style_variables).
% 0.72/1.26 set(lrpo).
% 0.72/1.26 set(basic_paramod).
% 0.72/1.26 set(functional_subsume).
% 0.72/1.26 set(ordered_paramod).
% 0.72/1.26 set(prime_paramod).
% 0.72/1.26 set(para_pairs).
% 0.72/1.26 assign(pick_given_ratio,4).
% 0.72/1.26 clear(print_kept).
% 0.72/1.26 clear(print_new_demod).
% 0.72/1.26 clear(print_back_demod).
% 0.72/1.26 clear(print_given).
% 0.72/1.26 assign(max_mem,64000).
% 0.72/1.26 end_of_commands.
% 0.72/1.26
% 0.72/1.26 Usable:
% 0.72/1.26 end_of_list.
% 0.72/1.26
% 0.72/1.26 Sos:
% 0.72/1.26 0 (wt=-1) [] aux(A,B,C,D,btrue) = cons(A,merge(B,cons(C,D))).
% 0.72/1.26 0 (wt=-1) [] aux(A,B,C,D,bfalse) = cons(C,merge(cons(A,B),D)).
% 0.72/1.26 0 (wt=-1) [] aux2(A,B,C,btrue) = ord(cons(B,C)).
% 0.72/1.26 0 (wt=-1) [] aux2(A,B,C,bfalse) = bfalse.
% 0.72/1.26 0 (wt=-1) [] leqNat(z,A) = btrue.
% 0.72/1.26 0 (wt=-1) [] leqNat(s(A),z) = bfalse.
% 0.72/1.26 0 (wt=-1) [] leqNat(s(A),s(B)) = leqNat(A,B).
% 0.72/1.26 0 (wt=-1) [] merge(nil,A) = A.
% 0.72/1.26 0 (wt=-1) [] merge(cons(A,B),nil) = cons(A,B).
% 0.72/1.26 0 (wt=-1) [] merge(cons(A,B),cons(C,D)) = aux(A,B,C,D,leqNat(A,C)).
% 0.72/1.26 0 (wt=-1) [] ord(nil) = btrue.
% 0.72/1.26 0 (wt=-1) [] ord(cons(A,nil)) = btrue.
% 0.72/1.26 0 (wt=-1) [] ord(cons(A,cons(B,C))) = aux2(A,B,C,leqNat(A,B)).
% 0.72/1.26 0 (wt=-1) [] impl(btrue,A) = A.
% 0.72/1.26 0 (wt=-1) [] impl(bfalse,A) = btrue.
% 0.72/1.26 0 (wt=-1) [] prop_merge_ord_not3(A,B) = impl(eq2(ord(A),btrue),impl(eq2(ord(B),bfalse),eq2(ord(merge(A,B)),btrue))).
% 0.72/1.26 0 (wt=-1) [] eq2(bfalse,btrue) = bfalse.
% 0.72/1.26 0 (wt=-1) [] eq2(btrue,bfalse) = bfalse.
% 0.72/1.26 0 (wt=-1) [] eq(s(A),s(B)) = eq(A,B).
% 0.72/1.26 0 (wt=-1) [] eq(z,s(A)) = bfalse.
% 0.72/1.26 0 (wt=-1) [] eq(s(A),z) = bfalse.
% 0.72/1.26 0 (wt=-1) [] eq(A,A) = btrue.
% 0.72/1.26 0 (wt=-1) [] eq2(A,A) = btrue.
% 0.72/1.26 0 (wt=-1) [] -(eq2(prop_merge_ord_not3(A,B),bfalse) = btrue).
% 0.72/1.26 end_of_list.
% 0.72/1.26
% 0.72/1.26 Demodulators:
% 0.72/1.26 end_of_list.
% 0.72/1.26
% 0.72/1.26 Passive:
% 0.72/1.26 end_of_list.
% 0.72/1.26
% 0.72/1.26 Starting to process input.
% 0.72/1.26
% 0.72/1.26 ** KEPT: 1 (wt=14) [flip(1)] cons(A,merge(B,cons(C,D))) = aux(A,B,C,D,btrue).
% 0.72/1.26 1 is a new demodulator.
% 0.72/1.26
% 0.72/1.26 ** KEPT: 2 (wt=14) [flip(1)] cons(A,merge(cons(B,C),D)) = aux(B,C,A,D,bfalse).
% 0.72/1.26 2 is a new demodulator.
% 0.72/1.26
% 0.72/1.26 ** KEPT: 3 (wt=10) [] aux2(A,B,C,btrue) = ord(cons(B,C)).
% 0.72/1.26
% 0.72/1.26 ** KEPT: 4 (wt=10) [flip(3)] ord(cons(A,B)) = aux2(C,A,B,btrue).
% 0.72/1.26 clause forward subsumed: 0 (wt=10) [flip(4)] aux2(C,A,B,btrue) = ord(cons(A,B)).
% 0.72/1.26
% 0.72/1.26 ** KEPT: 5 (wt=7) [] aux2(A,B,C,bfalse) = bfalse.
% 0.72/1.26 5 is a new demodulator.
% 0.72/1.26
% 0.72/1.26 ** KEPT: 6 (wt=5) [] leqNat(z,A) = btrue.
% 0.72/1.26 6 is a new demodulator.
% 0.72/1.26
% 0.72/1.26 ** KEPT: 7 (wt=6) [] leqNat(s(A),z) = bfalse.
% 0.72/1.26 7 is a new demodulator.
% 0.72/1.26
% 0.72/1.26 ** KEPT: 8 (wt=9) [] leqNat(s(A),s(B)) = leqNat(A,B).
% 0.72/1.26 8 is a new demodulator.
% 0.72/1.26
% 0.72/1.26 ** KEPT: 9 (wt=5) [] merge(nil,A) = A.
% 0.72/1.26 9 is a new demodulator.
% 0.72/1.26
% 0.72/1.26 ** KEPT: 10 (wt=9) [] merge(cons(A,B),nil) = cons(A,B).
% 0.72/1.26 10 is a new demodulator.
% 0.72/1.26
% 0.72/1.26 ** KEPT: 11 (wt=16) [] merge(cons(A,B),cons(C,D)) = aux(A,B,C,D,leqNat(A,C)).
% 0.72/1.26 11 is a new demodulator.
% 0.72/1.26
% 0.72/1.26 ** KEPT: 12 (wt=4) [] ord(nil) = btrue.
% 0.72/1.26 12 is a new demodulator.
% 0.72/1.26
% 0.72/1.26 ** KEPT: 13 (wt=6) [] ord(cons(A,nil)) = btrue.
% 0.72/1.26 13 is a new demodulator.
% 0.72/1.26
% 0.72/1.26 ** KEPT: 14 (wt=14) [] ord(cons(A,cons(B,C))) = aux2(A,B,C,leqNat(A,B)).
% 0.72/1.26 14 is a new demodulator.
% 0.72/1.26
% 0.72/1.26 ** KEPT: 15 (wt=5) [] impl(btrue,A) = A.
% 0.72/1.26 15 is a new demodulator.
% 0.72/1.26
% 0.72/1.26 ** KEPT: 16 (wt=5) [] impl(bfalse,A) = btrue.
% 0.72/1.26 16 is a new demodulator.
% 0.72/1.26
% 0.72/1.26 ** KEPT: 17 (wt=20) [flip(1)] impl(eq2(ord(A),btrue),impl(eq2(ord(B),bfalse),eq2(ord(merge(A,B)),btrue))) = prop_merge_ord_not3(A,B).
% 0.72/1.26 17 is a new demodulator.
% 0.72/1.26
% 0.72/1.26 ** KEPT: 18 (wt=5) [] eq2(bfalse,btrue) = bfalse.
% 0.72/1.26 18 is a new demodulator.
% 0.72/1.26
% 0.72/1.26 ** KEPT: 19 (wt=5) [] eq2(btrue,bfalse) = bfalse.
% 0.72/1.26 19 is a new demodulator.
% 0.72/1.26
% 0.72/1.26 ** KEPT: 20 (wt=9) [] eq(s(A),s(B)) = eq(A,B).
% 0.72/1.26 20 is a new demodulator.
% 0.72/1.26
% 0.72/1.26 ** KEPT: 21 (wt=6) [] eq(z,s(A)) = bfalse.
% 0.72/1.26 21 is a new demodulator.
% 0.72/1.26
% 0.72/1.26 ** KEPT: 22 (wt=6) [] eq(s(A),z) = bfalse.
% 0.72/1.26 22 is a new demodulator.
% 0.72/1.26
% 0.72/1.26 ** KEPT: 23 (wt=5) [] eq(A,A) = btrue.
% 0.72/1.26 23 is a new demodulator.
% 0.72/1.26
% 0.72/1.26 ** KEPT: 24 (wt=5) [] eq2(A,A) = btrue.
% 0.72/1.26 24 is a new demodulator.
% 0.72/1.26
% 0.72/1.26 ** KEPT: 25 (wt=7) [] -(eq2(prop_merge_ord_not3(A,B),bfalse) = btrue).
% 0.72/1.26 ---------------- PROOF FOUND ----------------
% 0.72/1.26 % SZS status Unsatisfiable
% 0.72/1.26
% 0.72/1.26
% 0.72/1.26 After processing input:
% 0.72/1.26
% 0.72/1.26 Usable:
% 0.72/1.26 end_of_list.
% 0.72/1.26
% 0.72/1.26 Sos:
% 0.72/1.26 12 (wt=4) [] ord(nil) = btrue.
% 0.72/1.26 6 (wt=5) [] leqNat(z,A) = btrue.
% 0.72/1.26 9 (wt=5) [] merge(nil,A) = A.
% 0.72/1.26 15 (wt=5) [] impl(btrue,A) = A.
% 0.72/1.26 16 (wt=5) [] impl(bfalse,A) = btrue.
% 0.72/1.26 18 (wt=5) [] eq2(bfalse,btrue) = bfalse.
% 0.72/1.26 19 (wt=5) [] eq2(btrue,bfalse) = bfalse.
% 0.72/1.26 23 (wt=5) [] eq(A,A) = btrue.
% 0.72/1.26 24 (wt=5) [] eq2(A,A) = btrue.
% 0.72/1.26 7 (wt=6) [] leqNat(s(A),z) = bfalse.
% 0.72/1.26 13 (wt=6) [] ord(cons(A,nil)) = btrue.
% 0.72/1.26 21 (wt=6) [] eq(z,s(A)) = bfalse.
% 0.72/1.26 22 (wt=6) [] eq(s(A),z) = bfalse.
% 0.72/1.26 5 (wt=7) [] aux2(A,B,C,bfalse) = bfalse.
% 0.72/1.26 25 (wt=7) [] -(eq2(prop_merge_ord_not3(A,B),bfalse) = btrue).
% 0.72/1.26 8 (wt=9) [] leqNat(s(A),s(B)) = leqNat(A,B).
% 0.72/1.26 10 (wt=9) [] merge(cons(A,B),nil) = cons(A,B).
% 0.72/1.26 20 (wt=9) [] eq(s(A),s(B)) = eq(A,B).
% 0.72/1.26 3 (wt=10) [] aux2(A,B,C,btrue) = ord(cons(B,C)).
% 0.72/1.26 4 (wt=10) [flip(3)] ord(cons(A,B)) = aux2(C,A,B,btrue).
% 0.72/1.26 1 (wt=14) [flip(1)] cons(A,merge(B,cons(C,D))) = aux(A,B,C,D,btrue).
% 0.72/1.26 2 (wt=14) [flip(1)] cons(A,merge(cons(B,C),D)) = aux(B,C,A,D,bfalse).
% 0.72/1.26 14 (wt=14) [] ord(cons(A,cons(B,C))) = aux2(A,B,C,leqNat(A,B)).
% 0.72/1.26 11 (wt=16) [] merge(cons(A,B),cons(C,D)) = aux(A,B,C,D,leqNat(A,C)).
% 0.72/1.26 17 (wt=20) [flip(1)] impl(eq2(ord(A),btrue),impl(eq2(ord(B),bfalse),eq2(ord(merge(A,B)),btrue))) = prop_merge_ord_not3(A,B).
% 0.72/1.26 end_of_list.
% 0.72/1.26
% 0.72/1.26 Demodulators:
% 0.72/1.26 1 (wt=14) [flip(1)] cons(A,merge(B,cons(C,D))) = aux(A,B,C,D,btrue).
% 0.72/1.26 2 (wt=14) [flip(1)] cons(A,merge(cons(B,C),D)) = aux(B,C,A,D,bfalse).
% 0.72/1.26 5 (wt=7) [] aux2(A,B,C,bfalse) = bfalse.
% 0.72/1.26 6 (wt=5) [] leqNat(z,A) = btrue.
% 0.72/1.26 7 (wt=6) [] leqNat(s(A),z) = bfalse.
% 0.72/1.26 8 (wt=9) [] leqNat(s(A),s(B)) = leqNat(A,B).
% 0.72/1.26 9 (wt=5) [] merge(nil,A) = A.
% 0.72/1.26 10 (wt=9) [] merge(cons(A,B),nil) = cons(A,B).
% 0.72/1.26 11 (wt=16) [] merge(cons(A,B),cons(C,D)) = aux(A,B,C,D,leqNat(A,C)).
% 0.72/1.26 12 (wt=4) [] ord(nil) = btrue.
% 0.72/1.26 13 (wt=6) [] ord(cons(A,nil)) = btrue.
% 0.72/1.26 14 (wt=14) [] ord(cons(A,cons(B,C))) = aux2(A,B,C,leqNat(A,B)).
% 0.72/1.26 15 (wt=5) [] impl(btrue,A) = A.
% 0.72/1.26 16 (wt=5) [] impl(bfalse,A) = btrue.
% 0.72/1.26 17 (wt=20) [flip(1)] impl(eq2(ord(A),btrue),impl(eq2(ord(B),bfalse),eq2(ord(merge(A,B)),btrue))) = prop_merge_ord_not3(A,B).
% 0.72/1.26 18 (wt=5) [] eq2(bfalse,btrue) = bfalse.
% 0.72/1.26 19 (wt=5) [] eq2(btrue,bfalse) = bfalse.
% 0.72/1.26 20 (wt=9) [] eq(s(A),s(B)) = eq(A,B).
% 0.72/1.26 21 (wt=6) [] eq(z,s(A)) = bfalse.
% 0.72/1.26 22 (wt=6) [] eq(s(A),z) = bfalse.
% 0.72/1.26 23 (wt=5) [] eq(A,A) = btrue.
% 0.72/1.26 24 (wt=5) [] eq2(A,A) = btrue.
% 0.72/1.26 end_of_list.
% 0.72/1.26
% 0.72/1.26 Passive:
% 0.72/1.26 end_of_list.
% 0.72/1.26
% 0.72/1.26 UNIT CONFLICT from 777 and x=x at 0.06 seconds.
% 0.72/1.26
% 0.72/1.26 ---------------- PROOF ----------------
% 0.72/1.26 % SZS output start Refutation
% See solution above
% 0.72/1.26 ------------ end of proof -------------
% 0.72/1.26
% 0.72/1.26
% 0.72/1.26 ------------- memory usage ------------
% 0.72/1.26 Memory dynamically allocated (tp_alloc): 1464.
% 0.72/1.26 type (bytes each) gets frees in use avail bytes
% 0.72/1.26 sym_ent ( 96) 71 0 71 0 6.7 K
% 0.72/1.26 term ( 16) 70044 49555 20489 39 397.9 K
% 0.72/1.26 gen_ptr ( 8) 84428 6936 77492 23 605.6 K
% 0.72/1.26 context ( 808) 163645 163643 2 5 5.5 K
% 0.72/1.26 trail ( 12) 1136 1136 0 10 0.1 K
% 0.72/1.26 bt_node ( 68) 81962 81957 5 20 1.7 K
% 0.72/1.26 ac_position (285432) 0 0 0 0 0.0 K
% 0.72/1.26 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.72/1.26 ac_match_free_vars_pos (4020)
% 0.72/1.26 0 0 0 0 0.0 K
% 0.72/1.26 discrim ( 12) 15534 222 15312 0 179.4 K
% 0.72/1.26 flat ( 40) 104358 104358 0 51 2.0 K
% 0.72/1.26 discrim_pos ( 12) 2260 2260 0 1 0.0 K
% 0.72/1.26 fpa_head ( 12) 3918 0 3918 0 45.9 K
% 0.72/1.26 fpa_tree ( 28) 2866 2866 0 21 0.6 K
% 0.72/1.26 fpa_pos ( 36) 1039 1039 0 1 0.0 K
% 0.72/1.26 literal ( 12) 3302 2525 777 0 9.1 K
% 0.72/1.26 clause ( 24) 3302 2525 777 0 18.2 K
% 0.72/1.26 list ( 12) 322 266 56 3 0.7 K
% 0.72/1.26 list_pos ( 20) 2649 107 2542 0 49.6 K
% 0.72/1.26 pair_index ( 40) 2 0 2 0 0.1 K
% 0.72/1.26
% 0.72/1.26 -------------- statistics -------------
% 0.72/1.26 Clauses input 24
% 0.72/1.26 Usable input 0
% 0.72/1.26 Sos input 24
% 0.72/1.26 Demodulators input 0
% 0.72/1.26 Passive input 0
% 0.72/1.26
% 0.72/1.26 Processed BS (before search) 26
% 0.72/1.26 Forward subsumed BS 1
% 0.72/1.26 Kept BS 25
% 0.72/1.26 New demodulators BS 22
% 0.72/1.26 Back demodulated BS 0
% 0.72/1.26
% 0.72/1.26 Clauses or pairs given 15458
% 0.72/1.26 Clauses generated 1938
% 0.72/1.26 Forward subsumed 1186
% 0.72/1.26 Deleted by weight 0
% 0.72/1.26 Deleted by variable count 0
% 0.72/1.26 Kept 752
% 0.72/1.26 New demodulators 241
% 0.72/1.26 Back demodulated 17
% 0.72/1.26 Ordered paramod prunes 0
% 0.72/1.26 Basic paramod prunes 79499
% 0.72/1.26 Prime paramod prunes 0
% 0.72/1.26 Semantic prunes 0
% 0.72/1.26
% 0.72/1.26 Rewrite attmepts 27119
% 0.72/1.26 Rewrites 1641
% 0.72/1.26
% 0.72/1.26 FPA overloads 0
% 0.72/1.26 FPA underloads 0
% 0.72/1.26
% 0.72/1.26 Usable size 0
% 0.72/1.26 Sos size 759
% 0.72/1.26 Demodulators size 248
% 0.72/1.26 Passive size 0
% 0.72/1.26 Disabled size 17
% 0.72/1.26
% 0.72/1.26 Proofs found 1
% 0.72/1.26
% 0.72/1.26 ----------- times (seconds) ----------- Tue May 5 11:15:33 2026
% 0.72/1.26
% 0.72/1.26 user CPU time 0.06 (0 hr, 0 min, 0 sec)
% 0.72/1.26 system CPU time 0.11 (0 hr, 0 min, 0 sec)
% 0.72/1.26 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.72/1.26 input time 0.00
% 0.72/1.26 paramodulation time 0.02
% 0.72/1.26 demodulation time 0.01
% 0.72/1.26 orient time 0.00
% 0.72/1.26 weigh time 0.00
% 0.72/1.26 forward subsume time 0.00
% 0.72/1.26 back demod find time 0.00
% 0.72/1.26 conflict time 0.00
% 0.72/1.26 LRPO time 0.00
% 0.72/1.26 store clause time 0.01
% 0.72/1.26 disable clause time 0.00
% 0.72/1.26 prime paramod time 0.00
% 0.72/1.26 semantics time 0.00
% 0.72/1.26
% 0.72/1.26 EQP interrupted
%------------------------------------------------------------------------------