%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : ALG069-10 : TPTP v8.1.0. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n021.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 14 15:38:22 EDT 2022
% Result : Unsatisfiable 0.71s 1.09s
% Output : Refutation 0.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 10
% Syntax : Number of clauses : 19 ( 19 unt; 0 nHn; 11 RR)
% Number of literals : 19 ( 0 equ; 3 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; 2 con; 0-4 aty)
% Number of variables : 14 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(ifeq2(A,A,B,C),B),
file('ALG069-10.p',unknown),
[] ).
cnf(2,plain,
equal(ifeq(A,A,B,C),B),
file('ALG069-10.p',unknown),
[] ).
cnf(5,plain,
equal(ifeq(sorti1(A),true,sorti1(sK2_ax3_V(A)),true),true),
file('ALG069-10.p',unknown),
[] ).
cnf(6,plain,
equal(ifeq2(sorti1(A),true,op1(sK2_ax3_V(A),sK2_ax3_V(A)),A),A),
file('ALG069-10.p',unknown),
[] ).
cnf(7,plain,
~ equal(tuple(op2(A,A),sorti2(A)),tuple(sK1_ax4_U,true)),
file('ALG069-10.p',unknown),
[] ).
cnf(8,plain,
equal(sorti2(sK1_ax4_U),true),
file('ALG069-10.p',unknown),
[] ).
cnf(9,plain,
equal(ifeq(sorti1(A),true,sorti2(h(A)),true),true),
file('ALG069-10.p',unknown),
[] ).
cnf(10,plain,
equal(ifeq2(sorti1(A),true,ifeq2(sorti1(B),true,op2(h(B),h(A)),h(op1(B,A))),h(op1(B,A))),h(op1(B,A))),
file('ALG069-10.p',unknown),
[] ).
cnf(12,plain,
equal(ifeq(sorti2(A),true,sorti1(j(A)),true),true),
file('ALG069-10.p',unknown),
[] ).
cnf(14,plain,
equal(ifeq2(sorti2(A),true,h(j(A)),A),A),
file('ALG069-10.p',unknown),
[] ).
cnf(16,plain,
equal(sorti1(j(sK1_ax4_U)),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[8,12]),2]),
[iquote('para(8,12),demod([2])')] ).
cnf(17,plain,
equal(h(j(sK1_ax4_U)),sK1_ax4_U),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[8,14]),1]),
[iquote('para(8,14),demod([1])')] ).
cnf(18,plain,
equal(sorti1(sK2_ax3_V(j(sK1_ax4_U))),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[16,5]),2]),
[iquote('para(16,5),demod([2])')] ).
cnf(20,plain,
equal(sorti2(h(sK2_ax3_V(j(sK1_ax4_U)))),true),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[18,9]),2]),
[iquote('para(18,9),demod([2])')] ).
cnf(31,plain,
~ equal(tuple(op2(h(sK2_ax3_V(j(sK1_ax4_U))),h(sK2_ax3_V(j(sK1_ax4_U)))),true),tuple(sK1_ax4_U,true)),
inference(para,[status(thm),theory(equality)],[20,7]),
[iquote('para(20,7)')] ).
cnf(35,plain,
equal(op1(sK2_ax3_V(j(sK1_ax4_U)),sK2_ax3_V(j(sK1_ax4_U))),j(sK1_ax4_U)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[16,6]),1]),
[iquote('para(16,6),demod([1])')] ).
cnf(140,plain,
equal(op2(h(sK2_ax3_V(j(sK1_ax4_U))),h(sK2_ax3_V(j(sK1_ax4_U)))),sK1_ax4_U),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[35,10]),18,18,17,1,35,17,1,35,17]),
[iquote('para(35,10),demod([18,18,17,1,35,17,1,35,17])')] ).
cnf(141,plain,
~ equal(tuple(sK1_ax4_U,true),tuple(sK1_ax4_U,true)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[31]),140]),
[iquote('back_demod(31),demod([140])')] ).
cnf(142,plain,
$false,
inference(conflict,[status(thm)],[141]),
[iquote('xx_conflict(141)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : ALG069-10 : TPTP v8.1.0. Released v7.3.0.
% 0.07/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n021.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 : Wed Jun 8 08:05:07 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.71/1.09 ----- EQP 0.9e, May 2009 -----
% 0.71/1.09 The job began on n021.cluster.edu, Wed Jun 8 08:05:08 2022
% 0.71/1.09 The command was "./eqp09e".
% 0.71/1.09
% 0.71/1.09 set(prolog_style_variables).
% 0.71/1.09 set(lrpo).
% 0.71/1.09 set(basic_paramod).
% 0.71/1.09 set(functional_subsume).
% 0.71/1.09 set(ordered_paramod).
% 0.71/1.09 set(prime_paramod).
% 0.71/1.09 set(para_pairs).
% 0.71/1.09 assign(pick_given_ratio,4).
% 0.71/1.09 clear(print_kept).
% 0.71/1.09 clear(print_new_demod).
% 0.71/1.09 clear(print_back_demod).
% 0.71/1.09 clear(print_given).
% 0.71/1.09 assign(max_mem,64000).
% 0.71/1.09 end_of_commands.
% 0.71/1.09
% 0.71/1.09 Usable:
% 0.71/1.09 end_of_list.
% 0.71/1.09
% 0.71/1.09 Sos:
% 0.71/1.09 0 (wt=-1) [] ifeq2(A,A,B,C) = B.
% 0.71/1.09 0 (wt=-1) [] ifeq(A,A,B,C) = B.
% 0.71/1.09 0 (wt=-1) [] ifeq(sorti1(A),true,ifeq(sorti1(B),true,sorti1(op1(B,A)),true),true) = true.
% 0.71/1.09 0 (wt=-1) [] ifeq(sorti2(A),true,ifeq(sorti2(B),true,sorti2(op2(B,A)),true),true) = true.
% 0.71/1.09 0 (wt=-1) [] ifeq(sorti1(A),true,sorti1(sK2_ax3_V(A)),true) = true.
% 0.71/1.09 0 (wt=-1) [] ifeq2(sorti1(A),true,op1(sK2_ax3_V(A),sK2_ax3_V(A)),A) = A.
% 0.71/1.09 0 (wt=-1) [] -(tuple(op2(A,A),sorti2(A)) = tuple(sK1_ax4_U,true)).
% 0.71/1.09 0 (wt=-1) [] sorti2(sK1_ax4_U) = true.
% 0.71/1.09 0 (wt=-1) [] ifeq(sorti1(A),true,sorti2(h(A)),true) = true.
% 0.71/1.09 0 (wt=-1) [] ifeq2(sorti1(A),true,ifeq2(sorti1(B),true,op2(h(B),h(A)),h(op1(B,A))),h(op1(B,A))) = h(op1(B,A)).
% 0.71/1.09 0 (wt=-1) [] ifeq2(sorti1(A),true,j(h(A)),A) = A.
% 0.71/1.09 0 (wt=-1) [] ifeq(sorti2(A),true,sorti1(j(A)),true) = true.
% 0.71/1.09 0 (wt=-1) [] ifeq2(sorti2(A),true,ifeq2(sorti2(B),true,op1(j(B),j(A)),j(op2(B,A))),j(op2(B,A))) = j(op2(B,A)).
% 0.71/1.09 0 (wt=-1) [] ifeq2(sorti2(A),true,h(j(A)),A) = A.
% 0.71/1.09 end_of_list.
% 0.71/1.09
% 0.71/1.09 Demodulators:
% 0.71/1.09 end_of_list.
% 0.71/1.09
% 0.71/1.09 Passive:
% 0.71/1.09 end_of_list.
% 0.71/1.09
% 0.71/1.09 Starting to process input.
% 0.71/1.09
% 0.71/1.09 ** KEPT: 1 (wt=7) [] ifeq2(A,A,B,C) = B.
% 0.71/1.09 1 is a new demodulator.
% 0.71/1.09
% 0.71/1.09 ** KEPT: 2 (wt=7) [] ifeq(A,A,B,C) = B.
% 0.71/1.09 2 is a new demodulator.
% 0.71/1.09
% 0.71/1.09 ** KEPT: 3 (wt=16) [] ifeq(sorti1(A),true,ifeq(sorti1(B),true,sorti1(op1(B,A)),true),true) = true.
% 0.71/1.09 3 is a new demodulator.
% 0.71/1.09
% 0.71/1.09 ** KEPT: 4 (wt=16) [] ifeq(sorti2(A),true,ifeq(sorti2(B),true,sorti2(op2(B,A)),true),true) = true.
% 0.71/1.09 4 is a new demodulator.
% 0.71/1.09
% 0.71/1.09 ** KEPT: 5 (wt=10) [] ifeq(sorti1(A),true,sorti1(sK2_ax3_V(A)),true) = true.
% 0.71/1.09 5 is a new demodulator.
% 0.71/1.09
% 0.71/1.09 ** KEPT: 6 (wt=12) [] ifeq2(sorti1(A),true,op1(sK2_ax3_V(A),sK2_ax3_V(A)),A) = A.
% 0.71/1.09 6 is a new demodulator.
% 0.71/1.09
% 0.71/1.09 ** KEPT: 7 (wt=10) [] -(tuple(op2(A,A),sorti2(A)) = tuple(sK1_ax4_U,true)).
% 0.71/1.09
% 0.71/1.09 ** KEPT: 8 (wt=4) [] sorti2(sK1_ax4_U) = true.
% 0.71/1.09 8 is a new demodulator.
% 0.71/1.09
% 0.71/1.09 ** KEPT: 9 (wt=10) [] ifeq(sorti1(A),true,sorti2(h(A)),true) = true.
% 0.71/1.09 9 is a new demodulator.
% 0.71/1.09
% 0.71/1.09 ** KEPT: 10 (wt=26) [] ifeq2(sorti1(A),true,ifeq2(sorti1(B),true,op2(h(B),h(A)),h(op1(B,A))),h(op1(B,A))) = h(op1(B,A)).
% 0.71/1.09 10 is a new demodulator.
% 0.71/1.09
% 0.71/1.09 ** KEPT: 11 (wt=10) [] ifeq2(sorti1(A),true,j(h(A)),A) = A.
% 0.71/1.09 11 is a new demodulator.
% 0.71/1.09
% 0.71/1.09 ** KEPT: 12 (wt=10) [] ifeq(sorti2(A),true,sorti1(j(A)),true) = true.
% 0.71/1.09 12 is a new demodulator.
% 0.71/1.09
% 0.71/1.09 ** KEPT: 13 (wt=26) [] ifeq2(sorti2(A),true,ifeq2(sorti2(B),true,op1(j(B),j(A)),j(op2(B,A))),j(op2(B,A))) = j(op2(B,A)).
% 0.71/1.09 13 is a new demodulator.
% 0.71/1.09
% 0.71/1.09 ** KEPT: 14 (wt=10) [] ifeq2(sorti2(A),true,h(j(A)),A) = A.
% 0.71/1.09 14 is a new demodulator.
% 0.71/1.09 ---------------- PROOF FOUND ----------------
% 0.71/1.09 % SZS status Unsatisfiable
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 After processing input:
% 0.71/1.09
% 0.71/1.09 Usable:
% 0.71/1.09 end_of_list.
% 0.71/1.09
% 0.71/1.09 Sos:
% 0.71/1.09 8 (wt=4) [] sorti2(sK1_ax4_U) = true.
% 0.71/1.09 1 (wt=7) [] ifeq2(A,A,B,C) = B.
% 0.71/1.09 2 (wt=7) [] ifeq(A,A,B,C) = B.
% 0.71/1.09 5 (wt=10) [] ifeq(sorti1(A),true,sorti1(sK2_ax3_V(A)),true) = true.
% 0.71/1.09 7 (wt=10) [] -(tuple(op2(A,A),sorti2(A)) = tuple(sK1_ax4_U,true)).
% 0.71/1.09 9 (wt=10) [] ifeq(sorti1(A),true,sorti2(h(A)),true) = true.
% 0.71/1.09 11 (wt=10) [] ifeq2(sorti1(A),true,j(h(A)),A) = A.
% 0.71/1.09 12 (wt=10) [] ifeq(sorti2(A),true,sorti1(j(A)),true) = true.
% 0.71/1.09 14 (wt=10) [] ifeq2(sorti2(A),true,h(j(A)),A) = A.
% 0.71/1.09 6 (wt=12) [] ifeq2(sorti1(A),true,op1(sK2_ax3_V(A),sK2_ax3_V(A)),A) = A.
% 0.71/1.09 3 (wt=16) [] ifeq(sorti1(A),true,ifeq(sorti1(B),true,sorti1(op1(B,A)),true),true) = true.
% 0.71/1.09 4 (wt=16) [] ifeq(sorti2(A),true,ifeq(sorti2(B),true,sorti2(op2(B,A)),true),true) = true.
% 0.71/1.09 10 (wt=26) [] ifeq2(sorti1(A),true,ifeq2(sorti1(B),true,op2(h(B),h(A)),h(op1(B,A))),h(op1(B,A))) = h(op1(B,A)).
% 0.71/1.09 13 (wt=26) [] ifeq2(sorti2(A),true,ifeq2(sorti2(B),true,op1(j(B),j(A)),j(op2(B,A))),j(op2(B,A))) = j(op2(B,A)).
% 0.71/1.09 end_of_list.
% 0.71/1.09
% 0.71/1.09 Demodulators:
% 0.71/1.09 1 (wt=7) [] ifeq2(A,A,B,C) = B.
% 0.71/1.09 2 (wt=7) [] ifeq(A,A,B,C) = B.
% 0.71/1.09 3 (wt=16) [] ifeq(sorti1(A),true,ifeq(sorti1(B),true,sorti1(op1(B,A)),true),true) = true.
% 0.71/1.09 4 (wt=16) [] ifeq(sorti2(A),true,ifeq(sorti2(B),true,sorti2(op2(B,A)),true),true) = true.
% 0.71/1.09 5 (wt=10) [] ifeq(sorti1(A),true,sorti1(sK2_ax3_V(A)),true) = true.
% 0.71/1.09 6 (wt=12) [] ifeq2(sorti1(A),true,op1(sK2_ax3_V(A),sK2_ax3_V(A)),A) = A.
% 0.71/1.09 8 (wt=4) [] sorti2(sK1_ax4_U) = true.
% 0.71/1.09 9 (wt=10) [] ifeq(sorti1(A),true,sorti2(h(A)),true) = true.
% 0.71/1.09 10 (wt=26) [] ifeq2(sorti1(A),true,ifeq2(sorti1(B),true,op2(h(B),h(A)),h(op1(B,A))),h(op1(B,A))) = h(op1(B,A)).
% 0.71/1.09 11 (wt=10) [] ifeq2(sorti1(A),true,j(h(A)),A) = A.
% 0.71/1.09 12 (wt=10) [] ifeq(sorti2(A),true,sorti1(j(A)),true) = true.
% 0.71/1.09 13 (wt=26) [] ifeq2(sorti2(A),true,ifeq2(sorti2(B),true,op1(j(B),j(A)),j(op2(B,A))),j(op2(B,A))) = j(op2(B,A)).
% 0.71/1.09 14 (wt=10) [] ifeq2(sorti2(A),true,h(j(A)),A) = A.
% 0.71/1.09 end_of_list.
% 0.71/1.09
% 0.71/1.09 Passive:
% 0.71/1.09 end_of_list.
% 0.71/1.09
% 0.71/1.09 UNIT CONFLICT from 141 and x=x at 0.01 seconds.
% 0.71/1.09
% 0.71/1.09 ---------------- PROOF ----------------
% 0.71/1.09 % SZS output start Refutation
% See solution above
% 0.71/1.09 ------------ end of proof -------------
% 0.71/1.09
% 0.71/1.09
% 0.71/1.09 ------------- memory usage ------------
% 0.71/1.09 Memory dynamically allocated (tp_alloc): 488.
% 0.71/1.09 type (bytes each) gets frees in use avail bytes
% 0.71/1.09 sym_ent ( 96) 71 0 71 0 6.7 K
% 0.71/1.09 term ( 16) 8364 6342 2022 37 39.7 K
% 0.71/1.09 gen_ptr ( 8) 10056 870 9186 18 71.9 K
% 0.71/1.09 context ( 808) 36236 36234 2 2 3.2 K
% 0.71/1.09 trail ( 12) 68 68 0 3 0.0 K
% 0.71/1.09 bt_node ( 68) 17033 17030 3 18 1.4 K
% 0.71/1.09 ac_position (285432) 0 0 0 0 0.0 K
% 0.71/1.09 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.71/1.09 ac_match_free_vars_pos (4020)
% 0.71/1.09 0 0 0 0 0.0 K
% 0.71/1.09 discrim ( 12) 2016 9 2007 9 23.6 K
% 0.71/1.09 flat ( 40) 9387 9387 0 19 0.7 K
% 0.71/1.09 discrim_pos ( 12) 308 308 0 1 0.0 K
% 0.71/1.09 fpa_head ( 12) 1677 0 1677 0 19.7 K
% 0.71/1.09 fpa_tree ( 28) 776 776 0 17 0.5 K
% 0.71/1.09 fpa_pos ( 36) 268 268 0 1 0.0 K
% 0.71/1.09 literal ( 12) 386 245 141 0 1.7 K
% 0.71/1.09 clause ( 24) 386 245 141 0 3.3 K
% 0.71/1.09 list ( 12) 187 130 57 2 0.7 K
% 0.71/1.09 list_pos ( 20) 564 18 546 3 10.7 K
% 0.71/1.09 pair_index ( 40) 2 0 2 0 0.1 K
% 0.71/1.09
% 0.71/1.09 -------------- statistics -------------
% 0.71/1.09 Clauses input 14
% 0.71/1.09 Usable input 0
% 0.71/1.09 Sos input 14
% 0.71/1.09 Demodulators input 0
% 0.71/1.09 Passive input 0
% 0.71/1.09
% 0.71/1.09 Processed BS (before search) 14
% 0.71/1.09 Forward subsumed BS 0
% 0.71/1.09 Kept BS 14
% 0.71/1.09 New demodulators BS 13
% 0.71/1.09 Back demodulated BS 0
% 0.71/1.09
% 0.71/1.09 Clauses or pairs given 1515
% 0.71/1.09 Clauses generated 244
% 0.71/1.09 Forward subsumed 117
% 0.71/1.09 Deleted by weight 0
% 0.71/1.09 Deleted by variable count 0
% 0.71/1.09 Kept 127
% 0.71/1.09 New demodulators 115
% 0.71/1.09 Back demodulated 1
% 0.71/1.09 Ordered paramod prunes 0
% 0.71/1.09 Basic paramod prunes 524
% 0.71/1.09 Prime paramod prunes 0
% 0.71/1.09 Semantic prunes 0
% 0.71/1.09
% 0.71/1.09 Rewrite attmepts 4040
% 0.71/1.09 Rewrites 308
% 0.71/1.09
% 0.71/1.09 FPA overloads 0
% 0.71/1.09 FPA underloads 0
% 0.71/1.09
% 0.71/1.09 Usable size 0
% 0.71/1.09 Sos size 139
% 0.71/1.09 Demodulators size 128
% 0.71/1.09 Passive size 0
% 0.71/1.09 Disabled size 1
% 0.71/1.09
% 0.71/1.09 Proofs found 1
% 0.71/1.09
% 0.71/1.09 ----------- times (seconds) ----------- Wed Jun 8 08:05:08 2022
% 0.71/1.09
% 0.71/1.09 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.71/1.09 system CPU time 0.02 (0 hr, 0 min, 0 sec)
% 0.71/1.09 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.71/1.09 input time 0.00
% 0.71/1.09 paramodulation time 0.00
% 0.71/1.09 demodulation time 0.00
% 0.71/1.09 orient time 0.00
% 0.71/1.09 weigh time 0.00
% 0.71/1.09 forward subsume time 0.00
% 0.71/1.09 back demod find time 0.00
% 0.71/1.09 conflict time 0.00
% 0.71/1.09 LRPO time 0.00
% 0.71/1.09 store clause time 0.00
% 0.71/1.09 disable clause time 0.00
% 0.71/1.09 prime paramod time 0.00
% 0.71/1.09 semantics time 0.00
% 0.71/1.09
% 0.71/1.09 EQP interrupted
%------------------------------------------------------------------------------