%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : ALG235-1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n025.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:49 EDT 2022
% Result : Unsatisfiable 0.70s 1.07s
% Output : Refutation 0.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of clauses : 17 ( 17 unt; 0 nHn; 3 RR)
% Number of literals : 17 ( 0 equ; 2 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; 4 con; 0-2 aty)
% Number of variables : 46 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(mult(A,mult(B,mult(A,B))),mult(A,B)),
file('ALG235-1.p',unknown),
[] ).
cnf(2,plain,
equal(mult(A,mult(B,mult(C,D))),mult(C,mult(B,mult(A,D)))),
file('ALG235-1.p',unknown),
[] ).
cnf(3,plain,
equal(mult(mult(A,mult(B,mult(C,B))),D),mult(A,mult(D,mult(mult(C,B),D)))),
file('ALG235-1.p',unknown),
[] ).
cnf(5,plain,
~ equal(mult(a,mult(b,mult(a,mult(c,mult(d,c))))),mult(a,mult(b,mult(d,c)))),
file('ALG235-1.p',unknown),
[] ).
cnf(9,plain,
equal(mult(A,mult(B,mult(C,mult(B,A)))),mult(C,mult(B,A))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,2]),1]),
[iquote('para(1,2),flip(1)')] ).
cnf(14,plain,
equal(mult(mult(A,B),mult(B,mult(A,B))),mult(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,9]),1]),
[iquote('para(1,9),demod([1])')] ).
cnf(22,plain,
equal(mult(A,mult(B,mult(mult(A,B),B))),mult(A,B)),
inference(para,[status(thm),theory(equality)],[2,14]),
[iquote('para(2,14)')] ).
cnf(29,plain,
equal(mult(A,mult(B,mult(mult(A,C),B))),mult(mult(A,C),B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,3]),1]),
[iquote('para(1,3),flip(1)')] ).
cnf(30,plain,
equal(mult(mult(A,B),B),mult(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[22]),29]),
[iquote('back_demod(22),demod([29])')] ).
cnf(33,plain,
equal(mult(mult(A,mult(B,mult(C,D))),mult(B,mult(A,D))),mult(C,mult(B,mult(A,D)))),
inference(para,[status(thm),theory(equality)],[2,30]),
[iquote('para(2,30)')] ).
cnf(35,plain,
equal(mult(A,mult(B,mult(C,D))),mult(mult(C,D),mult(B,mult(A,D)))),
inference(para,[status(thm),theory(equality)],[30,2]),
[iquote('para(30,2)')] ).
cnf(36,plain,
equal(mult(mult(A,B),mult(C,mult(D,B))),mult(D,mult(C,mult(A,B)))),
inference(flip,[status(thm),theory(equality)],[35]),
[iquote('flip(35)')] ).
cnf(61,plain,
equal(mult(mult(A,B),mult(C,mult(D,B))),mult(A,mult(C,mult(D,B)))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[36,30]),33]),1]),
[iquote('para(36,30),demod([33]),flip(1)')] ).
cnf(137,plain,
equal(mult(A,mult(B,mult(C,mult(D,mult(A,B))))),mult(C,mult(D,mult(A,B)))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[9,2]),1]),
[iquote('para(9,2),flip(1)')] ).
cnf(138,plain,
equal(mult(A,mult(B,mult(A,mult(C,mult(D,B))))),mult(A,mult(C,mult(D,B)))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[137,30]),61,137]),
[iquote('para(137,30),demod([61,137])')] ).
cnf(140,plain,
~ equal(mult(a,mult(b,mult(d,c))),mult(a,mult(b,mult(d,c)))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[2,5]),138]),
[iquote('para(2,5),demod([138])')] ).
cnf(141,plain,
$false,
inference(conflict,[status(thm)],[140]),
[iquote('xx_conflict(140)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : ALG235-1 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12 % Command : tptp2X_and_run_eqp %s
% 0.13/0.33 % Computer : n025.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Wed Jun 8 16:05:20 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.70/1.07 ----- EQP 0.9e, May 2009 -----
% 0.70/1.07 The job began on n025.cluster.edu, Wed Jun 8 16:05:20 2022
% 0.70/1.07 The command was "./eqp09e".
% 0.70/1.07
% 0.70/1.07 set(prolog_style_variables).
% 0.70/1.07 set(lrpo).
% 0.70/1.07 set(basic_paramod).
% 0.70/1.07 set(functional_subsume).
% 0.70/1.07 set(ordered_paramod).
% 0.70/1.07 set(prime_paramod).
% 0.70/1.07 set(para_pairs).
% 0.70/1.07 assign(pick_given_ratio,4).
% 0.70/1.07 clear(print_kept).
% 0.70/1.07 clear(print_new_demod).
% 0.70/1.07 clear(print_back_demod).
% 0.70/1.07 clear(print_given).
% 0.70/1.07 assign(max_mem,64000).
% 0.70/1.07 end_of_commands.
% 0.70/1.07
% 0.70/1.07 Usable:
% 0.70/1.07 end_of_list.
% 0.70/1.07
% 0.70/1.07 Sos:
% 0.70/1.07 0 (wt=-1) [] mult(A,mult(B,mult(A,B))) = mult(A,B).
% 0.70/1.07 0 (wt=-1) [] mult(A,mult(B,mult(C,D))) = mult(C,mult(B,mult(A,D))).
% 0.70/1.07 0 (wt=-1) [] mult(mult(A,mult(B,mult(C,B))),D) = mult(A,mult(D,mult(mult(C,B),D))).
% 0.70/1.07 0 (wt=-1) [] -(mult(a,mult(b,mult(a,mult(c,mult(d,c))))) = mult(a,mult(b,mult(d,c)))).
% 0.70/1.07 end_of_list.
% 0.70/1.07
% 0.70/1.07 Demodulators:
% 0.70/1.07 end_of_list.
% 0.70/1.07
% 0.70/1.07 Passive:
% 0.70/1.07 end_of_list.
% 0.70/1.07
% 0.70/1.07 Starting to process input.
% 0.70/1.07
% 0.70/1.07 ** KEPT: 1 (wt=11) [] mult(A,mult(B,mult(A,B))) = mult(A,B).
% 0.70/1.07 1 is a new demodulator.
% 0.70/1.07
% 0.70/1.07 ** KEPT: 2 (wt=15) [] mult(A,mult(B,mult(C,D))) = mult(C,mult(B,mult(A,D))).
% 0.70/1.07 clause forward subsumed: 0 (wt=15) [flip(2)] mult(C,mult(B,mult(A,D))) = mult(A,mult(B,mult(C,D))).
% 0.70/1.07
% 0.70/1.07 ** KEPT: 3 (wt=19) [] mult(mult(A,mult(B,mult(C,B))),D) = mult(A,mult(D,mult(mult(C,B),D))).
% 0.70/1.07
% 0.70/1.07 ** KEPT: 4 (wt=19) [flip(3)] mult(A,mult(B,mult(mult(C,D),B))) = mult(mult(A,mult(D,mult(C,D))),B).
% 0.70/1.07 clause forward subsumed: 0 (wt=19) [flip(4)] mult(mult(A,mult(D,mult(C,D))),B) = mult(A,mult(B,mult(mult(C,D),B))).
% 0.70/1.07
% 0.70/1.07 ** KEPT: 5 (wt=19) [] -(mult(a,mult(b,mult(a,mult(c,mult(d,c))))) = mult(a,mult(b,mult(d,c)))).
% 0.70/1.07 ---------------- PROOF FOUND ----------------
% 0.70/1.07 % SZS status Unsatisfiable
% 0.70/1.07
% 0.70/1.07
% 0.70/1.07 After processing input:
% 0.70/1.07
% 0.70/1.07 Usable:
% 0.70/1.07 end_of_list.
% 0.70/1.07
% 0.70/1.07 Sos:
% 0.70/1.07 1 (wt=11) [] mult(A,mult(B,mult(A,B))) = mult(A,B).
% 0.70/1.07 2 (wt=15) [] mult(A,mult(B,mult(C,D))) = mult(C,mult(B,mult(A,D))).
% 0.70/1.07 3 (wt=19) [] mult(mult(A,mult(B,mult(C,B))),D) = mult(A,mult(D,mult(mult(C,B),D))).
% 0.70/1.07 4 (wt=19) [flip(3)] mult(A,mult(B,mult(mult(C,D),B))) = mult(mult(A,mult(D,mult(C,D))),B).
% 0.70/1.07 5 (wt=19) [] -(mult(a,mult(b,mult(a,mult(c,mult(d,c))))) = mult(a,mult(b,mult(d,c)))).
% 0.70/1.07 end_of_list.
% 0.70/1.07
% 0.70/1.07 Demodulators:
% 0.70/1.07 1 (wt=11) [] mult(A,mult(B,mult(A,B))) = mult(A,B).
% 0.70/1.07 end_of_list.
% 0.70/1.07
% 0.70/1.07 Passive:
% 0.70/1.07 end_of_list.
% 0.70/1.07
% 0.70/1.07 UNIT CONFLICT from 140 and x=x at 0.01 seconds.
% 0.70/1.07
% 0.70/1.07 ---------------- PROOF ----------------
% 0.70/1.07 % SZS output start Refutation
% See solution above
% 0.70/1.07 ------------ end of proof -------------
% 0.70/1.07
% 0.70/1.07
% 0.70/1.07 ------------- memory usage ------------
% 0.70/1.07 Memory dynamically allocated (tp_alloc): 488.
% 0.70/1.07 type (bytes each) gets frees in use avail bytes
% 0.70/1.07 sym_ent ( 96) 57 0 57 0 5.3 K
% 0.70/1.07 term ( 16) 11806 8312 3494 22 68.1 K
% 0.70/1.07 gen_ptr ( 8) 17757 2355 15402 16 120.5 K
% 0.70/1.07 context ( 808) 5716 5714 2 3 3.9 K
% 0.70/1.07 trail ( 12) 1593 1593 0 5 0.1 K
% 0.70/1.07 bt_node ( 68) 1002 995 7 7 0.9 K
% 0.70/1.07 ac_position (285432) 0 0 0 0 0.0 K
% 0.70/1.07 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.70/1.07 ac_match_free_vars_pos (4020)
% 0.70/1.07 0 0 0 0 0.0 K
% 0.70/1.07 discrim ( 12) 2582 902 1680 168 21.7 K
% 0.70/1.07 flat ( 40) 31393 31393 0 45 1.8 K
% 0.70/1.07 discrim_pos ( 12) 323 323 0 1 0.0 K
% 0.70/1.07 fpa_head ( 12) 501 0 501 0 5.9 K
% 0.70/1.07 fpa_tree ( 28) 227 227 0 31 0.8 K
% 0.70/1.07 fpa_pos ( 36) 194 194 0 1 0.0 K
% 0.70/1.07 literal ( 12) 562 422 140 0 1.6 K
% 0.70/1.07 clause ( 24) 562 422 140 0 3.3 K
% 0.70/1.07 list ( 12) 114 58 56 3 0.7 K
% 0.70/1.07 list_pos ( 20) 557 185 372 13 7.5 K
% 0.70/1.07 pair_index ( 40) 2 0 2 0 0.1 K
% 0.70/1.07
% 0.70/1.07 -------------- statistics -------------
% 0.70/1.07 Clauses input 4
% 0.70/1.07 Usable input 0
% 0.70/1.07 Sos input 4
% 0.70/1.07 Demodulators input 0
% 0.70/1.07 Passive input 0
% 0.70/1.07
% 0.70/1.07 Processed BS (before search) 7
% 0.70/1.07 Forward subsumed BS 2
% 0.70/1.07 Kept BS 5
% 0.70/1.07 New demodulators BS 1
% 0.70/1.07 Back demodulated BS 0
% 0.70/1.07
% 0.70/1.07 Clauses or pairs given 50
% 0.70/1.07 Clauses generated 299
% 0.70/1.07 Forward subsumed 164
% 0.70/1.07 Deleted by weight 0
% 0.70/1.07 Deleted by variable count 0
% 0.70/1.07 Kept 135
% 0.70/1.07 New demodulators 54
% 0.70/1.07 Back demodulated 40
% 0.70/1.07 Ordered paramod prunes 0
% 0.70/1.07 Basic paramod prunes 31
% 0.70/1.07 Prime paramod prunes 0
% 0.70/1.07 Semantic prunes 0
% 0.70/1.07
% 0.70/1.07 Rewrite attmepts 4122
% 0.70/1.07 Rewrites 238
% 0.70/1.07
% 0.70/1.07 FPA overloads 0
% 0.70/1.07 FPA underloads 0
% 0.70/1.07
% 0.70/1.07 Usable size 0
% 0.70/1.07 Sos size 99
% 0.70/1.07 Demodulators size 35
% 0.70/1.07 Passive size 0
% 0.70/1.07 Disabled size 40
% 0.70/1.07
% 0.70/1.07 Proofs found 1
% 0.70/1.07
% 0.70/1.07 ----------- times (seconds) ----------- Wed Jun 8 16:05:20 2022
% 0.70/1.07
% 0.70/1.07 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.70/1.07 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.70/1.07 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.70/1.07 input time 0.00
% 0.70/1.07 paramodulation time 0.00
% 0.70/1.07 demodulation time 0.00
% 0.70/1.07 orient time 0.00
% 0.70/1.07 weigh time 0.00
% 0.70/1.07 forward subsume time 0.00
% 0.70/1.07 back demod find time 0.00
% 0.70/1.07 conflict time 0.00
% 0.70/1.07 LRPO time 0.00
% 0.70/1.07 store clause time 0.00
% 0.70/1.07 disable clause time 0.00
% 0.70/1.07 prime paramod time 0.00
% 0.70/1.07 semantics time 0.00
% 0.70/1.07
% 0.70/1.07 EQP interrupted
%------------------------------------------------------------------------------