%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP704-10 : TPTP v8.1.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n014.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 : Sat Jul 16 08:48:58 EDT 2022
% Result : Unsatisfiable 0.71s 1.11s
% Output : Refutation 0.71s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 3
% Syntax : Number of clauses : 11 ( 11 unt; 0 nHn; 4 RR)
% Number of literals : 11 ( 0 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 12 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(mult(A,ld(A,B)),B),
file('GRP704-10.p',unknown),
[] ).
cnf(2,plain,
equal(ld(A,mult(A,B)),B),
file('GRP704-10.p',unknown),
[] ).
cnf(5,plain,
equal(mult(A,unit),A),
file('GRP704-10.p',unknown),
[] ).
cnf(8,plain,
equal(mult(mult(op_c,A),B),mult(op_c,mult(A,B))),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(13,plain,
equal(mult(A,mult(B,ld(mult(A,B),op_c))),op_f),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(14,plain,
~ equal(mult(mult(op_f,x4),x5),mult(op_f,mult(x4,x5))),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(15,plain,
equal(ld(A,A),unit),
inference(para,[status(thm),theory(equality)],[5,2]),
[iquote('para(5,2)')] ).
cnf(65,plain,
equal(mult(A,mult(ld(A,B),ld(B,op_c))),op_f),
inference(para,[status(thm),theory(equality)],[1,13]),
[iquote('para(1,13)')] ).
cnf(118,plain,
equal(op_f,op_c),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[15,65]),5,1]),1]),
[iquote('para(15,65),demod([5,1]),flip(1)')] ).
cnf(121,plain,
~ equal(mult(op_c,mult(x4,x5)),mult(op_c,mult(x4,x5))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[14]),118,8,118]),
[iquote('back_demod(14),demod([118,8,118])')] ).
cnf(122,plain,
$false,
inference(conflict,[status(thm)],[121]),
[iquote('xx_conflict(121)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GRP704-10 : TPTP v8.1.0. Released v8.1.0.
% 0.07/0.13 % Command : tptp2X_and_run_eqp %s
% 0.13/0.34 % Computer : n014.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jun 13 14:00:37 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.71/1.11 ----- EQP 0.9e, May 2009 -----
% 0.71/1.11 The job began on n014.cluster.edu, Mon Jun 13 14:00:38 2022
% 0.71/1.11 The command was "./eqp09e".
% 0.71/1.11
% 0.71/1.11 set(prolog_style_variables).
% 0.71/1.11 set(lrpo).
% 0.71/1.11 set(basic_paramod).
% 0.71/1.11 set(functional_subsume).
% 0.71/1.11 set(ordered_paramod).
% 0.71/1.11 set(prime_paramod).
% 0.71/1.11 set(para_pairs).
% 0.71/1.11 assign(pick_given_ratio,4).
% 0.71/1.11 clear(print_kept).
% 0.71/1.11 clear(print_new_demod).
% 0.71/1.11 clear(print_back_demod).
% 0.71/1.11 clear(print_given).
% 0.71/1.11 assign(max_mem,64000).
% 0.71/1.11 end_of_commands.
% 0.71/1.11
% 0.71/1.11 Usable:
% 0.71/1.11 end_of_list.
% 0.71/1.11
% 0.71/1.11 Sos:
% 0.71/1.11 0 (wt=-1) [] mult(A,ld(A,B)) = B.
% 0.71/1.11 0 (wt=-1) [] ld(A,mult(A,B)) = B.
% 0.71/1.11 0 (wt=-1) [] mult(rd(A,B),B) = A.
% 0.71/1.11 0 (wt=-1) [] rd(mult(A,B),B) = A.
% 0.71/1.11 0 (wt=-1) [] mult(A,unit) = A.
% 0.71/1.11 0 (wt=-1) [] mult(unit,A) = A.
% 0.71/1.11 0 (wt=-1) [] mult(A,mult(B,mult(B,C))) = mult(mult(mult(A,B),B),C).
% 0.71/1.11 0 (wt=-1) [] mult(op_c,mult(A,B)) = mult(mult(op_c,A),B).
% 0.71/1.11 0 (wt=-1) [] mult(A,mult(B,op_c)) = mult(mult(A,B),op_c).
% 0.71/1.11 0 (wt=-1) [] mult(A,mult(op_c,B)) = mult(mult(A,op_c),B).
% 0.71/1.11 0 (wt=-1) [] op_d = ld(A,mult(op_c,A)).
% 0.71/1.11 0 (wt=-1) [] op_e = mult(mult(rd(op_c,mult(A,B)),B),A).
% 0.71/1.11 0 (wt=-1) [] op_f = mult(A,mult(B,ld(mult(A,B),op_c))).
% 0.71/1.11 0 (wt=-1) [] -(mult(op_f,mult(x4,x5)) = mult(mult(op_f,x4),x5)).
% 0.71/1.11 end_of_list.
% 0.71/1.11
% 0.71/1.11 Demodulators:
% 0.71/1.11 end_of_list.
% 0.71/1.11
% 0.71/1.11 Passive:
% 0.71/1.11 end_of_list.
% 0.71/1.11
% 0.71/1.11 Starting to process input.
% 0.71/1.11
% 0.71/1.11 ** KEPT: 1 (wt=7) [] mult(A,ld(A,B)) = B.
% 0.71/1.11 1 is a new demodulator.
% 0.71/1.11
% 0.71/1.11 ** KEPT: 2 (wt=7) [] ld(A,mult(A,B)) = B.
% 0.71/1.11 2 is a new demodulator.
% 0.71/1.11
% 0.71/1.11 ** KEPT: 3 (wt=7) [] mult(rd(A,B),B) = A.
% 0.71/1.11 3 is a new demodulator.
% 0.71/1.11
% 0.71/1.11 ** KEPT: 4 (wt=7) [] rd(mult(A,B),B) = A.
% 0.71/1.11 4 is a new demodulator.
% 0.71/1.11
% 0.71/1.11 ** KEPT: 5 (wt=5) [] mult(A,unit) = A.
% 0.71/1.11 5 is a new demodulator.
% 0.71/1.11
% 0.71/1.11 ** KEPT: 6 (wt=5) [] mult(unit,A) = A.
% 0.71/1.11 6 is a new demodulator.
% 0.71/1.11
% 0.71/1.11 ** KEPT: 7 (wt=15) [flip(1)] mult(mult(mult(A,B),B),C) = mult(A,mult(B,mult(B,C))).
% 0.71/1.11 7 is a new demodulator.
% 0.71/1.11
% 0.71/1.11 ** KEPT: 8 (wt=11) [flip(1)] mult(mult(op_c,A),B) = mult(op_c,mult(A,B)).
% 0.71/1.11 8 is a new demodulator.
% 0.71/1.11
% 0.71/1.11 ** KEPT: 9 (wt=11) [flip(1)] mult(mult(A,B),op_c) = mult(A,mult(B,op_c)).
% 0.71/1.11 9 is a new demodulator.
% 0.71/1.11
% 0.71/1.11 ** KEPT: 10 (wt=11) [flip(1)] mult(mult(A,op_c),B) = mult(A,mult(op_c,B)).
% 0.71/1.11 10 is a new demodulator.
% 0.71/1.11
% 0.71/1.11 ** KEPT: 11 (wt=7) [flip(1)] ld(A,mult(op_c,A)) = op_d.
% 0.71/1.11 11 is a new demodulator.
% 0.71/1.11
% 0.71/1.11 ** KEPT: 12 (wt=11) [flip(1)] mult(mult(rd(op_c,mult(A,B)),B),A) = op_e.
% 0.71/1.11 12 is a new demodulator.
% 0.71/1.11
% 0.71/1.11 ** KEPT: 13 (wt=11) [flip(1)] mult(A,mult(B,ld(mult(A,B),op_c))) = op_f.
% 0.71/1.11 13 is a new demodulator.
% 0.71/1.11
% 0.71/1.11 ** KEPT: 14 (wt=11) [flip(1)] -(mult(mult(op_f,x4),x5) = mult(op_f,mult(x4,x5))).
% 0.71/1.11 ---------------- PROOF FOUND ----------------
% 0.71/1.11 % SZS status Unsatisfiable
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 After processing input:
% 0.71/1.11
% 0.71/1.11 Usable:
% 0.71/1.11 end_of_list.
% 0.71/1.11
% 0.71/1.11 Sos:
% 0.71/1.11 5 (wt=5) [] mult(A,unit) = A.
% 0.71/1.11 6 (wt=5) [] mult(unit,A) = A.
% 0.71/1.11 1 (wt=7) [] mult(A,ld(A,B)) = B.
% 0.71/1.11 2 (wt=7) [] ld(A,mult(A,B)) = B.
% 0.71/1.11 3 (wt=7) [] mult(rd(A,B),B) = A.
% 0.71/1.11 4 (wt=7) [] rd(mult(A,B),B) = A.
% 0.71/1.11 11 (wt=7) [flip(1)] ld(A,mult(op_c,A)) = op_d.
% 0.71/1.11 8 (wt=11) [flip(1)] mult(mult(op_c,A),B) = mult(op_c,mult(A,B)).
% 0.71/1.11 9 (wt=11) [flip(1)] mult(mult(A,B),op_c) = mult(A,mult(B,op_c)).
% 0.71/1.11 10 (wt=11) [flip(1)] mult(mult(A,op_c),B) = mult(A,mult(op_c,B)).
% 0.71/1.11 12 (wt=11) [flip(1)] mult(mult(rd(op_c,mult(A,B)),B),A) = op_e.
% 0.71/1.11 13 (wt=11) [flip(1)] mult(A,mult(B,ld(mult(A,B),op_c))) = op_f.
% 0.71/1.11 14 (wt=11) [flip(1)] -(mult(mult(op_f,x4),x5) = mult(op_f,mult(x4,x5))).
% 0.71/1.11 7 (wt=15) [flip(1)] mult(mult(mult(A,B),B),C) = mult(A,mult(B,mult(B,C))).
% 0.71/1.11 end_of_list.
% 0.71/1.11
% 0.71/1.11 Demodulators:
% 0.71/1.11 1 (wt=7) [] mult(A,ld(A,B)) = B.
% 0.71/1.11 2 (wt=7) [] ld(A,mult(A,B)) = B.
% 0.71/1.11 3 (wt=7) [] mult(rd(A,B),B) = A.
% 0.71/1.11 4 (wt=7) [] rd(mult(A,B),B) = A.
% 0.71/1.11 5 (wt=5) [] mult(A,unit) = A.
% 0.71/1.11 6 (wt=5) [] mult(unit,A) = A.
% 0.71/1.11 7 (wt=15) [flip(1)] mult(mult(mult(A,B),B),C) = mult(A,mult(B,mult(B,C))).
% 0.71/1.11 8 (wt=11) [flip(1)] mult(mult(op_c,A),B) = mult(op_c,mult(A,B)).
% 0.71/1.11 9 (wt=11) [flip(1)] mult(mult(A,B),op_c) = mult(A,mult(B,op_c)).
% 0.71/1.11 10 (wt=11) [flip(1)] mult(mult(A,op_c),B) = mult(A,mult(op_c,B)).
% 0.71/1.11 11 (wt=7) [flip(1)] ld(A,mult(op_c,A)) = op_d.
% 0.71/1.11 12 (wt=11) [flip(1)] mult(mult(rd(op_c,mult(A,B)),B),A) = op_e.
% 0.71/1.11 13 (wt=11) [flip(1)] mult(A,mult(B,ld(mult(A,B),op_c))) = op_f.
% 0.71/1.11 end_of_list.
% 0.71/1.11
% 0.71/1.11 Passive:
% 0.71/1.11 end_of_list.
% 0.71/1.11
% 0.71/1.11 UNIT CONFLICT from 121 and x=x at 0.01 seconds.
% 0.71/1.11
% 0.71/1.11 ---------------- PROOF ----------------
% 0.71/1.11 % SZS output start Refutation
% See solution above
% 0.71/1.11 ------------ end of proof -------------
% 0.71/1.11
% 0.71/1.11
% 0.71/1.11 ------------- memory usage ------------
% 0.71/1.11 Memory dynamically allocated (tp_alloc): 488.
% 0.71/1.11 type (bytes each) gets frees in use avail bytes
% 0.71/1.11 sym_ent ( 96) 61 0 61 0 5.7 K
% 0.71/1.11 term ( 16) 6290 4749 1541 12 29.8 K
% 0.71/1.11 gen_ptr ( 8) 7449 1580 5869 10 45.9 K
% 0.71/1.11 context ( 808) 7240 7238 2 4 4.7 K
% 0.71/1.11 trail ( 12) 374 374 0 4 0.0 K
% 0.71/1.11 bt_node ( 68) 3096 3093 3 6 0.6 K
% 0.71/1.11 ac_position (285432) 0 0 0 0 0.0 K
% 0.71/1.11 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.71/1.11 ac_match_free_vars_pos (4020)
% 0.71/1.11 0 0 0 0 0.0 K
% 0.71/1.11 discrim ( 12) 1531 317 1214 11 14.4 K
% 0.71/1.11 flat ( 40) 8783 8783 0 19 0.7 K
% 0.71/1.11 discrim_pos ( 12) 253 253 0 1 0.0 K
% 0.71/1.11 fpa_head ( 12) 779 0 779 0 9.1 K
% 0.71/1.11 fpa_tree ( 28) 307 307 0 15 0.4 K
% 0.71/1.11 fpa_pos ( 36) 235 235 0 1 0.0 K
% 0.71/1.11 literal ( 12) 405 284 121 0 1.4 K
% 0.71/1.11 clause ( 24) 405 284 121 0 2.8 K
% 0.71/1.11 list ( 12) 174 117 57 2 0.7 K
% 0.71/1.11 list_pos ( 20) 552 164 388 3 7.6 K
% 0.71/1.11 pair_index ( 40) 2 0 2 0 0.1 K
% 0.71/1.11
% 0.71/1.11 -------------- statistics -------------
% 0.71/1.11 Clauses input 14
% 0.71/1.11 Usable input 0
% 0.71/1.11 Sos input 14
% 0.71/1.11 Demodulators input 0
% 0.71/1.11 Passive input 0
% 0.71/1.11
% 0.71/1.11 Processed BS (before search) 14
% 0.71/1.11 Forward subsumed BS 0
% 0.71/1.11 Kept BS 14
% 0.71/1.11 New demodulators BS 13
% 0.71/1.11 Back demodulated BS 0
% 0.71/1.11
% 0.71/1.11 Clauses or pairs given 743
% 0.71/1.11 Clauses generated 268
% 0.71/1.11 Forward subsumed 161
% 0.71/1.11 Deleted by weight 0
% 0.71/1.11 Deleted by variable count 0
% 0.71/1.11 Kept 107
% 0.71/1.11 New demodulators 102
% 0.71/1.11 Back demodulated 30
% 0.71/1.11 Ordered paramod prunes 0
% 0.71/1.11 Basic paramod prunes 1156
% 0.71/1.11 Prime paramod prunes 28
% 0.71/1.11 Semantic prunes 0
% 0.71/1.11
% 0.71/1.11 Rewrite attmepts 2131
% 0.71/1.11 Rewrites 221
% 0.71/1.11
% 0.71/1.11 FPA overloads 0
% 0.71/1.11 FPA underloads 0
% 0.71/1.11
% 0.71/1.11 Usable size 0
% 0.71/1.11 Sos size 90
% 0.71/1.11 Demodulators size 88
% 0.71/1.11 Passive size 0
% 0.71/1.11 Disabled size 30
% 0.71/1.11
% 0.71/1.11 Proofs found 1
% 0.71/1.11
% 0.71/1.11 ----------- times (seconds) ----------- Mon Jun 13 14:00:38 2022
% 0.71/1.11
% 0.71/1.11 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.71/1.11 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.71/1.11 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.71/1.11 input time 0.00
% 0.71/1.11 paramodulation time 0.00
% 0.71/1.11 demodulation time 0.00
% 0.71/1.11 orient time 0.00
% 0.71/1.11 weigh time 0.00
% 0.71/1.11 forward subsume time 0.00
% 0.71/1.11 back demod find time 0.00
% 0.71/1.11 conflict time 0.00
% 0.71/1.11 LRPO time 0.00
% 0.71/1.11 store clause time 0.00
% 0.71/1.11 disable clause time 0.00
% 0.71/1.11 prime paramod time 0.00
% 0.71/1.11 semantics time 0.00
% 0.71/1.11
% 0.71/1.11 EQP interrupted
%------------------------------------------------------------------------------