TSTP Solution File: GRP679-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP679-1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n006.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:50 EDT 2022
% Result : Unsatisfiable 3.24s 3.65s
% Output : Refutation 3.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 8
% Syntax : Number of clauses : 38 ( 38 unt; 0 nHn; 5 RR)
% Number of literals : 38 ( 0 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 60 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(mult(A,ld(A,B)),B),
file('GRP679-1.p',unknown),
[] ).
cnf(2,plain,
equal(ld(A,mult(A,B)),B),
file('GRP679-1.p',unknown),
[] ).
cnf(3,plain,
equal(mult(rd(A,B),B),A),
file('GRP679-1.p',unknown),
[] ).
cnf(4,plain,
equal(rd(mult(A,B),B),A),
file('GRP679-1.p',unknown),
[] ).
cnf(5,plain,
equal(mult(A,unit),A),
file('GRP679-1.p',unknown),
[] ).
cnf(6,plain,
equal(mult(unit,A),A),
file('GRP679-1.p',unknown),
[] ).
cnf(7,plain,
equal(mult(mult(A,mult(B,A)),C),mult(A,mult(B,mult(A,C)))),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(8,plain,
equal(mult(op_c,A),mult(A,op_c)),
file('GRP679-1.p',unknown),
[] ).
cnf(9,plain,
equal(mult(A,op_c),mult(op_c,A)),
inference(flip,[status(thm),theory(equality)],[8]),
[iquote('flip(8)')] ).
cnf(10,plain,
~ equal(mult(mult(op_c,op_c),a),mult(a,mult(op_c,op_c))),
file('GRP679-1.p',unknown),
[] ).
cnf(11,plain,
equal(ld(A,A),unit),
inference(para,[status(thm),theory(equality)],[5,2]),
[iquote('para(5,2)')] ).
cnf(18,plain,
equal(mult(mult(ld(A,B),B),C),mult(ld(A,B),mult(A,mult(ld(A,B),C)))),
inference(para,[status(thm),theory(equality)],[1,7]),
[iquote('para(1,7)')] ).
cnf(21,plain,
equal(rd(mult(A,mult(B,mult(A,C))),C),mult(A,mult(B,A))),
inference(para,[status(thm),theory(equality)],[7,4]),
[iquote('para(7,4)')] ).
cnf(22,plain,
equal(mult(mult(A,A),B),mult(A,mult(A,B))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[6,7]),6]),
[iquote('para(6,7),demod([6])')] ).
cnf(23,plain,
~ equal(mult(op_c,mult(op_c,a)),mult(a,mult(op_c,op_c))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[10]),22]),
[iquote('back_demod(10),demod([22])')] ).
cnf(27,plain,
equal(ld(op_c,mult(A,op_c)),A),
inference(para,[status(thm),theory(equality)],[8,2]),
[iquote('para(8,2)')] ).
cnf(31,plain,
equal(ld(A,mult(op_c,A)),op_c),
inference(para,[status(thm),theory(equality)],[9,2]),
[iquote('para(9,2)')] ).
cnf(40,plain,
equal(mult(ld(A,B),mult(A,mult(ld(A,B),ld(mult(ld(A,B),B),C)))),C),
inference(para,[status(thm),theory(equality)],[18,1]),
[iquote('para(18,1)')] ).
cnf(42,plain,
equal(mult(ld(A,unit),mult(A,mult(ld(A,unit),B))),mult(ld(A,unit),B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[5,18]),1]),
[iquote('para(5,18),flip(1)')] ).
cnf(52,plain,
equal(rd(mult(A,B),C),mult(A,mult(rd(B,mult(A,C)),A))),
inference(para,[status(thm),theory(equality)],[3,21]),
[iquote('para(3,21)')] ).
cnf(54,plain,
equal(mult(A,mult(rd(B,mult(A,B)),A)),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[4]),52]),
[iquote('back_demod(4),demod([52])')] ).
cnf(97,plain,
equal(mult(rd(A,mult(B,A)),B),unit),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[54,2]),11]),1]),
[iquote('para(54,2),demod([11]),flip(1)')] ).
cnf(104,plain,
equal(rd(A,mult(op_c,A)),ld(op_c,unit)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[97,27]),1]),
[iquote('para(97,27),flip(1)')] ).
cnf(109,plain,
equal(mult(ld(op_c,unit),mult(op_c,A)),A),
inference(para,[status(thm),theory(equality)],[104,3]),
[iquote('para(104,3)')] ).
cnf(110,plain,
equal(mult(op_c,A),ld(ld(op_c,unit),A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[109,2]),1]),
[iquote('para(109,2),flip(1)')] ).
cnf(139,plain,
equal(ld(A,ld(ld(op_c,unit),A)),op_c),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[31]),110]),
[iquote('back_demod(31),demod([110])')] ).
cnf(141,plain,
~ equal(mult(a,ld(ld(op_c,unit),op_c)),ld(ld(op_c,unit),ld(ld(op_c,unit),a))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[23]),110,110,110]),1]),
[iquote('back_demod(23),demod([110,110,110]),flip(1)')] ).
cnf(154,plain,
equal(mult(A,mult(ld(A,B),ld(mult(ld(A,B),B),C))),ld(ld(A,B),C)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[40,2]),1]),
[iquote('para(40,2),flip(1)')] ).
cnf(156,plain,
equal(mult(ld(A,unit),mult(A,B)),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,42]),1]),
[iquote('para(1,42),demod([1])')] ).
cnf(162,plain,
equal(mult(ld(A,unit),B),ld(A,B)),
inference(para,[status(thm),theory(equality)],[1,156]),
[iquote('para(1,156)')] ).
cnf(163,plain,
equal(ld(A,ld(ld(A,unit),B)),B),
inference(para,[status(thm),theory(equality)],[162,1]),
[iquote('para(162,1)')] ).
cnf(172,plain,
equal(mult(A,B),ld(ld(A,unit),B)),
inference(para,[status(thm),theory(equality)],[163,1]),
[iquote('para(163,1)')] ).
cnf(185,plain,
equal(ld(ld(A,unit),ld(ld(ld(A,B),unit),ld(ld(ld(ld(A,B),unit),B),C))),ld(ld(A,B),C)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[154]),172,172,172]),
[iquote('back_demod(154),demod([172,172,172])')] ).
cnf(199,plain,
~ equal(ld(ld(op_c,unit),ld(ld(op_c,unit),a)),ld(ld(a,unit),ld(ld(op_c,unit),op_c))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[141]),172]),1]),
[iquote('back_demod(141),demod([172]),flip(1)')] ).
cnf(334,plain,
equal(ld(ld(A,unit),ld(ld(ld(A,B),unit),op_c)),ld(ld(A,B),ld(ld(op_c,unit),ld(ld(ld(A,B),unit),B)))),
inference(para,[status(thm),theory(equality)],[139,185]),
[iquote('para(139,185)')] ).
cnf(2643,plain,
equal(ld(ld(A,unit),ld(ld(op_c,unit),op_c)),ld(ld(op_c,unit),ld(ld(op_c,unit),A))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[139,334]),139,139,163]),
[iquote('para(139,334),demod([139,139,163])')] ).
cnf(2644,plain,
equal(ld(ld(op_c,unit),ld(ld(op_c,unit),A)),ld(ld(A,unit),ld(ld(op_c,unit),op_c))),
inference(flip,[status(thm),theory(equality)],[2643]),
[iquote('flip(2643)')] ).
cnf(2645,plain,
$false,
inference(conflict,[status(thm)],[2644,199]),
[iquote('conflict(2644,199)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP679-1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12 % Command : tptp2X_and_run_eqp %s
% 0.13/0.33 % Computer : n006.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 : Mon Jun 13 21:46:11 EDT 2022
% 0.13/0.33 % CPUTime :
% 3.24/3.65 ----- EQP 0.9e, May 2009 -----
% 3.24/3.65 The job began on n006.cluster.edu, Mon Jun 13 21:46:12 2022
% 3.24/3.65 The command was "./eqp09e".
% 3.24/3.65
% 3.24/3.65 set(prolog_style_variables).
% 3.24/3.65 set(lrpo).
% 3.24/3.65 set(basic_paramod).
% 3.24/3.65 set(functional_subsume).
% 3.24/3.65 set(ordered_paramod).
% 3.24/3.65 set(prime_paramod).
% 3.24/3.65 set(para_pairs).
% 3.24/3.65 assign(pick_given_ratio,4).
% 3.24/3.65 clear(print_kept).
% 3.24/3.65 clear(print_new_demod).
% 3.24/3.65 clear(print_back_demod).
% 3.24/3.65 clear(print_given).
% 3.24/3.65 assign(max_mem,64000).
% 3.24/3.65 end_of_commands.
% 3.24/3.65
% 3.24/3.65 Usable:
% 3.24/3.65 end_of_list.
% 3.24/3.65
% 3.24/3.65 Sos:
% 3.24/3.65 0 (wt=-1) [] mult(A,ld(A,B)) = B.
% 3.24/3.65 0 (wt=-1) [] ld(A,mult(A,B)) = B.
% 3.24/3.65 0 (wt=-1) [] mult(rd(A,B),B) = A.
% 3.24/3.65 0 (wt=-1) [] rd(mult(A,B),B) = A.
% 3.24/3.65 0 (wt=-1) [] mult(A,unit) = A.
% 3.24/3.65 0 (wt=-1) [] mult(unit,A) = A.
% 3.24/3.65 0 (wt=-1) [] mult(A,mult(B,mult(A,C))) = mult(mult(A,mult(B,A)),C).
% 3.24/3.65 0 (wt=-1) [] mult(op_c,A) = mult(A,op_c).
% 3.24/3.65 0 (wt=-1) [] -(mult(mult(op_c,op_c),a) = mult(a,mult(op_c,op_c))).
% 3.24/3.65 end_of_list.
% 3.24/3.65
% 3.24/3.65 Demodulators:
% 3.24/3.65 end_of_list.
% 3.24/3.65
% 3.24/3.65 Passive:
% 3.24/3.65 end_of_list.
% 3.24/3.65
% 3.24/3.65 Starting to process input.
% 3.24/3.65
% 3.24/3.65 ** KEPT: 1 (wt=7) [] mult(A,ld(A,B)) = B.
% 3.24/3.65 1 is a new demodulator.
% 3.24/3.65
% 3.24/3.65 ** KEPT: 2 (wt=7) [] ld(A,mult(A,B)) = B.
% 3.24/3.65 2 is a new demodulator.
% 3.24/3.65
% 3.24/3.65 ** KEPT: 3 (wt=7) [] mult(rd(A,B),B) = A.
% 3.24/3.65 3 is a new demodulator.
% 3.24/3.65
% 3.24/3.65 ** KEPT: 4 (wt=7) [] rd(mult(A,B),B) = A.
% 3.24/3.65 4 is a new demodulator.
% 3.24/3.65
% 3.24/3.65 ** KEPT: 5 (wt=5) [] mult(A,unit) = A.
% 3.24/3.65 5 is a new demodulator.
% 3.24/3.65
% 3.24/3.65 ** KEPT: 6 (wt=5) [] mult(unit,A) = A.
% 3.24/3.65 6 is a new demodulator.
% 3.24/3.65
% 3.24/3.65 ** KEPT: 7 (wt=15) [flip(1)] mult(mult(A,mult(B,A)),C) = mult(A,mult(B,mult(A,C))).
% 3.24/3.65 7 is a new demodulator.
% 3.24/3.65
% 3.24/3.65 ** KEPT: 8 (wt=7) [] mult(op_c,A) = mult(A,op_c).
% 3.24/3.65
% 3.24/3.65 ** KEPT: 9 (wt=7) [flip(8)] mult(A,op_c) = mult(op_c,A).
% 3.24/3.65 clause forward subsumed: 0 (wt=7) [flip(9)] mult(op_c,A) = mult(A,op_c).
% 3.24/3.65
% 3.24/3.65 ** KEPT: 10 (wt=11) [] -(mult(mult(op_c,op_c),a) = mult(a,mult(op_c,op_c))).
% 3.24/3.65 ---------------- PROOF FOUND ----------------
% 3.24/3.65 % SZS status Unsatisfiable
% 3.24/3.65
% 3.24/3.65
% 3.24/3.65 After processing input:
% 3.24/3.65
% 3.24/3.65 Usable:
% 3.24/3.65 end_of_list.
% 3.24/3.65
% 3.24/3.65 Sos:
% 3.24/3.65 5 (wt=5) [] mult(A,unit) = A.
% 3.24/3.65 6 (wt=5) [] mult(unit,A) = A.
% 3.24/3.65 1 (wt=7) [] mult(A,ld(A,B)) = B.
% 3.24/3.65 2 (wt=7) [] ld(A,mult(A,B)) = B.
% 3.24/3.65 3 (wt=7) [] mult(rd(A,B),B) = A.
% 3.24/3.65 4 (wt=7) [] rd(mult(A,B),B) = A.
% 3.24/3.65 8 (wt=7) [] mult(op_c,A) = mult(A,op_c).
% 3.24/3.65 9 (wt=7) [flip(8)] mult(A,op_c) = mult(op_c,A).
% 3.24/3.65 10 (wt=11) [] -(mult(mult(op_c,op_c),a) = mult(a,mult(op_c,op_c))).
% 3.24/3.65 7 (wt=15) [flip(1)] mult(mult(A,mult(B,A)),C) = mult(A,mult(B,mult(A,C))).
% 3.24/3.65 end_of_list.
% 3.24/3.65
% 3.24/3.65 Demodulators:
% 3.24/3.65 1 (wt=7) [] mult(A,ld(A,B)) = B.
% 3.24/3.65 2 (wt=7) [] ld(A,mult(A,B)) = B.
% 3.24/3.65 3 (wt=7) [] mult(rd(A,B),B) = A.
% 3.24/3.65 4 (wt=7) [] rd(mult(A,B),B) = A.
% 3.24/3.65 5 (wt=5) [] mult(A,unit) = A.
% 3.24/3.65 6 (wt=5) [] mult(unit,A) = A.
% 3.24/3.65 7 (wt=15) [flip(1)] mult(mult(A,mult(B,A)),C) = mult(A,mult(B,mult(A,C))).
% 3.24/3.65 end_of_list.
% 3.24/3.65
% 3.24/3.65 Passive:
% 3.24/3.65 end_of_list.
% 3.24/3.65
% 3.24/3.65 UNIT CONFLICT from 2644 and 199 at 2.40 seconds.
% 3.24/3.65
% 3.24/3.65 ---------------- PROOF ----------------
% 3.24/3.65 % SZS output start Refutation
% See solution above
% 3.24/3.65 ------------ end of proof -------------
% 3.24/3.65
% 3.24/3.65
% 3.24/3.65 ------------- memory usage ------------
% 3.24/3.65 Memory dynamically allocated (tp_alloc): 35156.
% 3.24/3.65 type (bytes each) gets frees in use avail bytes
% 3.24/3.65 sym_ent ( 96) 57 0 57 0 5.3 K
% 3.24/3.65 term ( 16) 3250588 2866962 383626 28 7482.9 K
% 3.24/3.65 gen_ptr ( 8) 3342169 350946 2991223 37 23369.2 K
% 3.24/3.65 context ( 808) 1494635 1494633 2 6 6.3 K
% 3.24/3.65 trail ( 12) 187720 187720 0 8 0.1 K
% 3.24/3.65 bt_node ( 68) 112123 112120 3 60 4.2 K
% 3.24/3.65 ac_position (285432) 0 0 0 0 0.0 K
% 3.24/3.65 ac_match_pos (14044) 0 0 0 0 0.0 K
% 3.24/3.65 ac_match_free_vars_pos (4020)
% 3.24/3.65 0 0 0 0 0.0 K
% 3.24/3.65 discrim ( 12) 428509 176660 251849 4591 3005.2 K
% 3.24/3.65 flat ( 40) 11777082 11777082 0 779 30.4 K
% 3.24/3.65 discrim_pos ( 12) 96157 96157 0 1 0.0 K
% 3.24/3.65 fpa_head ( 12) 5589 0 5589 0 65.5 K
% 3.24/3.65 fpa_tree ( 28) 41289 41289 0 95 2.6 K
% 3.24/3.65 fpa_pos ( 36) 4654 4654 0 1 0.0 K
% 3.24/3.65 literal ( 12) 12953 10309 2644 1 31.0 K
% 3.24/3.65 clause ( 24) 12953 10309 2644 1 62.0 K
% 3.24/3.65 list ( 12) 2069 2013 56 3 0.7 K
% 3.24/3.65 list_pos ( 20) 12623 6333 6290 14 123.1 K
% 3.24/3.65 pair_index ( 40) 2 0 2 0 0.1 K
% 3.24/3.65
% 3.24/3.65 -------------- statistics -------------
% 3.24/3.65 Clauses input 9
% 3.24/3.65 Usable input 0
% 3.24/3.65 Sos input 9
% 3.24/3.65 Demodulators input 0
% 3.24/3.65 Passive input 0
% 3.24/3.65
% 3.24/3.65 Processed BS (before search) 11
% 3.24/3.65 Forward subsumed BS 1
% 3.24/3.65 Kept BS 10
% 3.24/3.65 New demodulators BS 7
% 3.24/3.65 Back demodulated BS 0
% 3.24/3.65
% 3.24/3.65 Clauses or pairs given 5210
% 3.24/3.65 Clauses generated 8962
% 3.24/3.65 Forward subsumed 6328
% 3.24/3.65 Deleted by weight 0
% 3.24/3.65 Deleted by variable count 0
% 3.24/3.65 Kept 2634
% 3.24/3.65 New demodulators 2003
% 3.24/3.65 Back demodulated 1310
% 3.24/3.65 Ordered paramod prunes 0
% 3.24/3.65 Basic paramod prunes 18093
% 3.24/3.65 Prime paramod prunes 1059
% 3.24/3.65 Semantic prunes 0
% 3.24/3.65
% 3.24/3.65 Rewrite attmepts 1335978
% 3.24/3.65 Rewrites 94217
% 3.24/3.65
% 3.24/3.65 FPA overloads 0
% 3.24/3.65 FPA underloads 0
% 3.24/3.65
% 3.24/3.65 Usable size 0
% 3.24/3.65 Sos size 1333
% 3.24/3.65 Demodulators size 981
% 3.24/3.65 Passive size 0
% 3.24/3.65 Disabled size 1310
% 3.24/3.65
% 3.24/3.65 Proofs found 1
% 3.24/3.65
% 3.24/3.65 ----------- times (seconds) ----------- Mon Jun 13 21:46:15 2022
% 3.24/3.65
% 3.24/3.65 user CPU time 2.40 (0 hr, 0 min, 2 sec)
% 3.24/3.65 system CPU time 0.16 (0 hr, 0 min, 0 sec)
% 3.24/3.65 wall-clock time 3 (0 hr, 0 min, 3 sec)
% 3.24/3.65 input time 0.00
% 3.24/3.65 paramodulation time 0.09
% 3.24/3.65 demodulation time 0.63
% 3.24/3.65 orient time 0.04
% 3.24/3.65 weigh time 0.02
% 3.24/3.65 forward subsume time 0.02
% 3.24/3.65 back demod find time 1.14
% 3.24/3.65 conflict time 0.00
% 3.24/3.65 LRPO time 0.03
% 3.24/3.65 store clause time 0.34
% 3.24/3.65 disable clause time 0.04
% 3.24/3.65 prime paramod time 0.02
% 3.24/3.65 semantics time 0.00
% 3.24/3.65
% 3.24/3.65 EQP interrupted
%------------------------------------------------------------------------------