TSTP Solution File: GRP591-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP591-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n016.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:07 EDT 2022
% Result : Unsatisfiable 0.75s 1.41s
% Output : Refutation 0.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 2
% Syntax : Number of clauses : 45 ( 45 unt; 0 nHn; 3 RR)
% Number of literals : 45 ( 0 equ; 2 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 : 97 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(double_divide(inverse(double_divide(double_divide(A,B),inverse(double_divide(A,inverse(C))))),B),C),
file('GRP591-1.p',unknown),
[] ).
cnf(2,plain,
equal(inverse(double_divide(A,B)),multiply(B,A)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(3,plain,
equal(double_divide(multiply(multiply(inverse(A),B),double_divide(B,C)),C),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[1]),2,2]),
[iquote('back_demod(1),demod([2,2])')] ).
cnf(4,plain,
~ equal(multiply(multiply(a3,b3),c3),multiply(a3,multiply(b3,c3))),
file('GRP591-1.p',unknown),
[] ).
cnf(6,plain,
equal(multiply(A,multiply(multiply(inverse(B),C),double_divide(C,A))),inverse(B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3,2]),1]),
[iquote('para(3,2),flip(1)')] ).
cnf(7,plain,
equal(double_divide(multiply(multiply(inverse(A),multiply(multiply(inverse(B),C),double_divide(C,D))),B),D),A),
inference(para,[status(thm),theory(equality)],[3,3]),
[iquote('para(3,3)')] ).
cnf(24,plain,
equal(double_divide(multiply(inverse(A),A),inverse(B)),B),
inference(para,[status(thm),theory(equality)],[6,7]),
[iquote('para(6,7)')] ).
cnf(26,plain,
equal(multiply(inverse(A),multiply(inverse(B),B)),inverse(A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[24,2]),1]),
[iquote('para(24,2),flip(1)')] ).
cnf(27,plain,
equal(double_divide(inverse(multiply(inverse(A),A)),inverse(B)),B),
inference(para,[status(thm),theory(equality)],[26,24]),
[iquote('para(26,24)')] ).
cnf(33,plain,
equal(double_divide(multiply(inverse(A),B),inverse(B)),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[24,3]),26]),
[iquote('para(24,3),demod([26])')] ).
cnf(34,plain,
equal(multiply(inverse(A),multiply(inverse(B),A)),inverse(B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[33,2]),1]),
[iquote('para(33,2),flip(1)')] ).
cnf(36,plain,
equal(double_divide(inverse(A),inverse(multiply(inverse(B),B))),A),
inference(para,[status(thm),theory(equality)],[26,33]),
[iquote('para(26,33)')] ).
cnf(40,plain,
equal(double_divide(inverse(A),inverse(multiply(inverse(A),B))),B),
inference(para,[status(thm),theory(equality)],[34,33]),
[iquote('para(34,33)')] ).
cnf(41,plain,
equal(multiply(inverse(multiply(inverse(A),B)),inverse(A)),inverse(B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[40,2]),1]),
[iquote('para(40,2),flip(1)')] ).
cnf(43,plain,
equal(multiply(inverse(A),A),multiply(inverse(B),B)),
inference(para,[status(thm),theory(equality)],[36,27]),
[iquote('para(36,27)')] ).
cnf(86,plain,
equal(multiply(inverse(multiply(inverse(A),A)),B),B),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[40,27]),1]),
[iquote('para(40,27),flip(1)')] ).
cnf(100,plain,
equal(double_divide(inverse(A),inverse(inverse(B))),multiply(inverse(B),A)),
inference(para,[status(thm),theory(equality)],[41,33]),
[iquote('para(41,33)')] ).
cnf(101,plain,
equal(multiply(inverse(A),B),double_divide(inverse(B),inverse(inverse(A)))),
inference(flip,[status(thm),theory(equality)],[100]),
[iquote('flip(100)')] ).
cnf(102,plain,
equal(inverse(multiply(inverse(A),B)),multiply(inverse(inverse(A)),inverse(B))),
inference(para,[status(thm),theory(equality)],[100,2]),
[iquote('para(100,2)')] ).
cnf(103,plain,
equal(multiply(multiply(inverse(inverse(A)),inverse(A)),B),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[86]),102]),
[iquote('back_demod(86),demod([102])')] ).
cnf(105,plain,
equal(double_divide(inverse(A),multiply(inverse(inverse(A)),inverse(B))),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[40]),102]),
[iquote('back_demod(40),demod([102])')] ).
cnf(109,plain,
equal(multiply(multiply(inverse(A),A),B),B),
inference(para,[status(thm),theory(equality)],[43,103]),
[iquote('para(43,103)')] ).
cnf(113,plain,
equal(double_divide(double_divide(inverse(A),inverse(inverse(B))),inverse(A)),B),
inference(para,[status(thm),theory(equality)],[101,33]),
[iquote('para(101,33)')] ).
cnf(120,plain,
equal(double_divide(double_divide(A,B),B),A),
inference(para,[status(thm),theory(equality)],[109,3]),
[iquote('para(109,3)')] ).
cnf(141,plain,
equal(inverse(inverse(A)),A),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[113,120]),1]),
[iquote('para(113,120),flip(1)')] ).
cnf(145,plain,
equal(double_divide(double_divide(inverse(A),B),inverse(A)),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[113]),141]),
[iquote('back_demod(113),demod([141])')] ).
cnf(149,plain,
equal(double_divide(inverse(A),multiply(A,inverse(B))),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[105]),141]),
[iquote('back_demod(105),demod([141])')] ).
cnf(171,plain,
equal(double_divide(double_divide(A,B),A),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[141,145]),141]),
[iquote('para(141,145),demod([141])')] ).
cnf(172,plain,
equal(double_divide(A,double_divide(A,B)),B),
inference(para,[status(thm),theory(equality)],[120,171]),
[iquote('para(120,171)')] ).
cnf(174,plain,
equal(double_divide(A,B),double_divide(B,A)),
inference(para,[status(thm),theory(equality)],[172,171]),
[iquote('para(172,171)')] ).
cnf(177,plain,
equal(double_divide(inverse(A),multiply(A,B)),inverse(B)),
inference(para,[status(thm),theory(equality)],[141,149]),
[iquote('para(141,149)')] ).
cnf(188,plain,
equal(double_divide(A,multiply(inverse(A),B)),inverse(B)),
inference(para,[status(thm),theory(equality)],[141,177]),
[iquote('para(141,177)')] ).
cnf(190,plain,
equal(inverse(A),multiply(B,double_divide(B,A))),
inference(para,[status(thm),theory(equality)],[171,2]),
[iquote('para(171,2)')] ).
cnf(196,plain,
equal(multiply(A,B),multiply(B,A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[174,2]),2]),
[iquote('para(174,2),demod([2])')] ).
cnf(203,plain,
equal(multiply(A,double_divide(A,double_divide(B,C))),multiply(C,B)),
inference(para,[status(thm),theory(equality)],[190,2]),
[iquote('para(190,2)')] ).
cnf(421,plain,
equal(multiply(multiply(inverse(A),B),double_divide(B,C)),double_divide(A,C)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[43,7]),109]),1]),
[iquote('para(43,7),demod([109]),flip(1)')] ).
cnf(461,plain,
equal(double_divide(multiply(multiply(inverse(A),double_divide(B,C)),B),C),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[7]),421]),
[iquote('back_demod(7),demod([421])')] ).
cnf(1267,plain,
~ equal(multiply(c3,multiply(a3,b3)),multiply(a3,multiply(b3,c3))),
inference(para,[status(thm),theory(equality)],[196,4]),
[iquote('para(196,4)')] ).
cnf(2010,plain,
equal(multiply(double_divide(A,B),inverse(C)),double_divide(C,multiply(B,A))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[203,188]),2]),1]),
[iquote('para(203,188),demod([2]),flip(1)')] ).
cnf(2136,plain,
equal(double_divide(multiply(double_divide(A,multiply(B,C)),C),B),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[196,461]),2010]),
[iquote('para(196,461),demod([2010])')] ).
cnf(2138,plain,
equal(double_divide(multiply(A,B),C),double_divide(A,multiply(C,B))),
inference(para,[status(thm),theory(equality)],[120,2136]),
[iquote('para(120,2136)')] ).
cnf(2235,plain,
equal(multiply(multiply(A,B),C),multiply(A,multiply(C,B))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[2138,2]),2]),
[iquote('para(2138,2),demod([2])')] ).
cnf(2238,plain,
equal(multiply(multiply(A,B),C),multiply(B,multiply(C,A))),
inference(para,[status(thm),theory(equality)],[196,2235]),
[iquote('para(196,2235)')] ).
cnf(2241,plain,
equal(multiply(A,multiply(B,C)),multiply(B,multiply(C,A))),
inference(para,[status(thm),theory(equality)],[2238,196]),
[iquote('para(2238,196)')] ).
cnf(2242,plain,
$false,
inference(conflict,[status(thm)],[2241,1267]),
[iquote('conflict(2241,1267)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.13 % Problem : GRP591-1 : TPTP v8.1.0. Released v2.6.0.
% 0.07/0.13 % Command : tptp2X_and_run_eqp %s
% 0.13/0.35 % Computer : n016.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Tue Jun 14 06:09:00 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.75/1.41 ----- EQP 0.9e, May 2009 -----
% 0.75/1.41 The job began on n016.cluster.edu, Tue Jun 14 06:09:01 2022
% 0.75/1.41 The command was "./eqp09e".
% 0.75/1.41
% 0.75/1.41 set(prolog_style_variables).
% 0.75/1.41 set(lrpo).
% 0.75/1.41 set(basic_paramod).
% 0.75/1.41 set(functional_subsume).
% 0.75/1.41 set(ordered_paramod).
% 0.75/1.41 set(prime_paramod).
% 0.75/1.41 set(para_pairs).
% 0.75/1.41 assign(pick_given_ratio,4).
% 0.75/1.41 clear(print_kept).
% 0.75/1.41 clear(print_new_demod).
% 0.75/1.41 clear(print_back_demod).
% 0.75/1.41 clear(print_given).
% 0.75/1.41 assign(max_mem,64000).
% 0.75/1.41 end_of_commands.
% 0.75/1.41
% 0.75/1.41 Usable:
% 0.75/1.41 end_of_list.
% 0.75/1.41
% 0.75/1.41 Sos:
% 0.75/1.41 0 (wt=-1) [] double_divide(inverse(double_divide(double_divide(A,B),inverse(double_divide(A,inverse(C))))),B) = C.
% 0.75/1.41 0 (wt=-1) [] multiply(A,B) = inverse(double_divide(B,A)).
% 0.75/1.41 0 (wt=-1) [] -(multiply(multiply(a3,b3),c3) = multiply(a3,multiply(b3,c3))).
% 0.75/1.41 end_of_list.
% 0.75/1.41
% 0.75/1.41 Demodulators:
% 0.75/1.41 end_of_list.
% 0.75/1.41
% 0.75/1.41 Passive:
% 0.75/1.41 end_of_list.
% 0.75/1.41
% 0.75/1.41 Starting to process input.
% 0.75/1.41
% 0.75/1.41 ** KEPT: 1 (wt=14) [] double_divide(inverse(double_divide(double_divide(A,B),inverse(double_divide(A,inverse(C))))),B) = C.
% 0.75/1.41 1 is a new demodulator.
% 0.75/1.41
% 0.75/1.41 ** KEPT: 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.75/1.41 2 is a new demodulator.
% 0.75/1.41 -> 2 back demodulating 1.
% 0.75/1.41
% 0.75/1.41 ** KEPT: 3 (wt=12) [back_demod(1),demod([2,2])] double_divide(multiply(multiply(inverse(A),B),double_divide(B,C)),C) = A.
% 0.75/1.41 3 is a new demodulator.
% 0.75/1.41
% 0.75/1.41 ** KEPT: 4 (wt=11) [] -(multiply(multiply(a3,b3),c3) = multiply(a3,multiply(b3,c3))).
% 0.75/1.41 ---------------- PROOF FOUND ----------------
% 0.75/1.41 % SZS status Unsatisfiable
% 0.75/1.41
% 0.75/1.41
% 0.75/1.41 After processing input:
% 0.75/1.41
% 0.75/1.41 Usable:
% 0.75/1.41 end_of_list.
% 0.75/1.41
% 0.75/1.41 Sos:
% 0.75/1.41 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.75/1.41 4 (wt=11) [] -(multiply(multiply(a3,b3),c3) = multiply(a3,multiply(b3,c3))).
% 0.75/1.41 3 (wt=12) [back_demod(1),demod([2,2])] double_divide(multiply(multiply(inverse(A),B),double_divide(B,C)),C) = A.
% 0.75/1.41 end_of_list.
% 0.75/1.41
% 0.75/1.41 Demodulators:
% 0.75/1.41 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.75/1.41 3 (wt=12) [back_demod(1),demod([2,2])] double_divide(multiply(multiply(inverse(A),B),double_divide(B,C)),C) = A.
% 0.75/1.41 end_of_list.
% 0.75/1.41
% 0.75/1.41 Passive:
% 0.75/1.41 end_of_list.
% 0.75/1.41
% 0.75/1.41 UNIT CONFLICT from 2241 and 1267 at 0.12 seconds.
% 0.75/1.41
% 0.75/1.41 ---------------- PROOF ----------------
% 0.75/1.41 % SZS output start Refutation
% See solution above
% 0.75/1.41 ------------ end of proof -------------
% 0.75/1.41
% 0.75/1.41
% 0.75/1.41 ------------- memory usage ------------
% 0.75/1.41 Memory dynamically allocated (tp_alloc): 1953.
% 0.75/1.41 type (bytes each) gets frees in use avail bytes
% 0.75/1.41 sym_ent ( 96) 57 0 57 0 5.3 K
% 0.75/1.41 term ( 16) 162937 133285 29652 20 570.8 K
% 0.75/1.41 gen_ptr ( 8) 143083 35221 107862 44 843.0 K
% 0.75/1.41 context ( 808) 148586 148584 2 3 3.9 K
% 0.75/1.41 trail ( 12) 10800 10800 0 9 0.1 K
% 0.75/1.41 bt_node ( 68) 68282 68279 3 21 1.6 K
% 0.75/1.41 ac_position (285432) 0 0 0 0 0.0 K
% 0.75/1.41 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.75/1.41 ac_match_free_vars_pos (4020)
% 0.75/1.41 0 0 0 0 0.0 K
% 0.75/1.41 discrim ( 12) 16308 3722 12586 246 150.4 K
% 0.75/1.41 flat ( 40) 302715 302715 0 32 1.2 K
% 0.75/1.41 discrim_pos ( 12) 8255 8255 0 1 0.0 K
% 0.75/1.41 fpa_head ( 12) 3009 0 3009 0 35.3 K
% 0.75/1.41 fpa_tree ( 28) 4479 4479 0 21 0.6 K
% 0.75/1.41 fpa_pos ( 36) 3234 3234 0 1 0.0 K
% 0.75/1.41 literal ( 12) 12620 10379 2241 1 26.3 K
% 0.75/1.41 clause ( 24) 12620 10379 2241 1 52.5 K
% 0.75/1.41 list ( 12) 1052 996 56 4 0.7 K
% 0.75/1.41 list_pos ( 20) 8308 1439 6869 0 134.2 K
% 0.75/1.41 pair_index ( 40) 2 0 2 0 0.1 K
% 0.75/1.41
% 0.75/1.41 -------------- statistics -------------
% 0.75/1.41 Clauses input 3
% 0.75/1.41 Usable input 0
% 0.75/1.41 Sos input 3
% 0.75/1.41 Demodulators input 0
% 0.75/1.41 Passive input 0
% 0.75/1.41
% 0.75/1.41 Processed BS (before search) 4
% 0.75/1.41 Forward subsumed BS 0
% 0.75/1.41 Kept BS 4
% 0.75/1.41 New demodulators BS 3
% 0.75/1.41 Back demodulated BS 1
% 0.75/1.41
% 0.75/1.41 Clauses or pairs given 17031
% 0.75/1.41 Clauses generated 7693
% 0.75/1.41 Forward subsumed 5456
% 0.75/1.41 Deleted by weight 0
% 0.75/1.41 Deleted by variable count 0
% 0.75/1.41 Kept 2237
% 0.75/1.41 New demodulators 990
% 0.75/1.41 Back demodulated 295
% 0.75/1.41 Ordered paramod prunes 0
% 0.75/1.41 Basic paramod prunes 47611
% 0.75/1.41 Prime paramod prunes 839
% 0.75/1.41 Semantic prunes 0
% 0.75/1.41
% 0.75/1.41 Rewrite attmepts 50478
% 0.75/1.41 Rewrites 4749
% 0.75/1.41
% 0.75/1.41 FPA overloads 0
% 0.75/1.41 FPA underloads 0
% 0.75/1.41
% 0.75/1.41 Usable size 0
% 0.75/1.41 Sos size 1944
% 0.75/1.41 Demodulators size 741
% 0.75/1.41 Passive size 0
% 0.75/1.41 Disabled size 296
% 0.75/1.41
% 0.75/1.41 Proofs found 1
% 0.75/1.41
% 0.75/1.41 ----------- times (seconds) ----------- Tue Jun 14 06:09:01 2022
% 0.75/1.41
% 0.75/1.41 user CPU time 0.12 (0 hr, 0 min, 0 sec)
% 0.75/1.41 system CPU time 0.18 (0 hr, 0 min, 0 sec)
% 0.75/1.41 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.75/1.41 input time 0.00
% 0.75/1.41 paramodulation time 0.03
% 0.75/1.41 demodulation time 0.01
% 0.75/1.41 orient time 0.02
% 0.75/1.41 weigh time 0.00
% 0.75/1.41 forward subsume time 0.00
% 0.75/1.41 back demod find time 0.00
% 0.75/1.41 conflict time 0.00
% 0.75/1.41 LRPO time 0.01
% 0.75/1.41 store clause time 0.02
% 0.75/1.41 disable clause time 0.00
% 0.75/1.41 prime paramod time 0.01
% 0.75/1.41 semantics time 0.00
% 0.75/1.41
% 0.75/1.41 EQP interrupted
%------------------------------------------------------------------------------