TSTP Solution File: GRP598-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP598-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n028.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:09 EDT 2022
% Result : Unsatisfiable 0.69s 1.12s
% Output : Refutation 0.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 2
% Syntax : Number of clauses : 34 ( 34 unt; 0 nHn; 4 RR)
% Number of literals : 34 ( 0 equ; 3 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 : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 69 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(double_divide(double_divide(A,B),inverse(double_divide(A,inverse(double_divide(inverse(C),B))))),C),
file('GRP598-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(double_divide(A,B),multiply(multiply(B,inverse(C)),A)),C),
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(inverse(b2),b2),a2),a2),
file('GRP598-1.p',unknown),
[] ).
cnf(7,plain,
equal(double_divide(A,multiply(multiply(multiply(multiply(B,inverse(A)),C),inverse(D)),double_divide(C,B))),D),
inference(para,[status(thm),theory(equality)],[3,3]),
[iquote('para(3,3)')] ).
cnf(17,plain,
equal(multiply(multiply(multiply(multiply(multiply(A,inverse(B)),C),inverse(D)),double_divide(C,A)),B),inverse(D)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[7,2]),1]),
[iquote('para(7,2),flip(1)')] ).
cnf(82,plain,
equal(double_divide(A,multiply(inverse(A),inverse(B))),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[17,7]),3]),
[iquote('para(17,7),demod([3])')] ).
cnf(83,plain,
equal(double_divide(double_divide(A,B),multiply(multiply(B,A),inverse(C))),C),
inference(para,[status(thm),theory(equality)],[2,82]),
[iquote('para(2,82)')] ).
cnf(85,plain,
equal(multiply(multiply(inverse(A),inverse(B)),A),inverse(B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[82,2]),1]),
[iquote('para(82,2),flip(1)')] ).
cnf(91,plain,
equal(double_divide(double_divide(A,inverse(A)),inverse(B)),B),
inference(para,[status(thm),theory(equality)],[85,3]),
[iquote('para(85,3)')] ).
cnf(93,plain,
equal(double_divide(double_divide(A,inverse(A)),multiply(B,C)),double_divide(C,B)),
inference(para,[status(thm),theory(equality)],[2,91]),
[iquote('para(2,91)')] ).
cnf(95,plain,
equal(double_divide(double_divide(inverse(A),inverse(inverse(B))),inverse(A)),B),
inference(para,[status(thm),theory(equality)],[85,83]),
[iquote('para(85,83)')] ).
cnf(109,plain,
equal(double_divide(inverse(A),multiply(inverse(B),B)),A),
inference(para,[status(thm),theory(equality)],[93,83]),
[iquote('para(93,83)')] ).
cnf(110,plain,
equal(multiply(multiply(inverse(A),A),inverse(B)),inverse(B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[109,2]),1]),
[iquote('para(109,2),flip(1)')] ).
cnf(111,plain,
equal(double_divide(A,multiply(inverse(B),inverse(A))),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[109,3]),110]),
[iquote('para(109,3),demod([110])')] ).
cnf(112,plain,
equal(multiply(multiply(inverse(A),inverse(B)),B),inverse(A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[111,2]),1]),
[iquote('para(111,2),flip(1)')] ).
cnf(114,plain,
equal(inverse(inverse(inverse(A))),inverse(A)),
inference(para,[status(thm),theory(equality)],[112,110]),
[iquote('para(112,110)')] ).
cnf(116,plain,
equal(inverse(inverse(A)),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[114,82]),82]),1]),
[iquote('para(114,82),demod([82]),flip(1)')] ).
cnf(126,plain,
equal(double_divide(double_divide(inverse(A),B),inverse(A)),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[95]),116]),
[iquote('back_demod(95),demod([116])')] ).
cnf(140,plain,
equal(double_divide(A,multiply(inverse(A),B)),inverse(B)),
inference(para,[status(thm),theory(equality)],[116,82]),
[iquote('para(116,82)')] ).
cnf(142,plain,
equal(double_divide(double_divide(A,inverse(A)),B),inverse(B)),
inference(para,[status(thm),theory(equality)],[116,91]),
[iquote('para(116,91)')] ).
cnf(143,plain,
equal(inverse(A),double_divide(double_divide(B,inverse(B)),A)),
inference(flip,[status(thm),theory(equality)],[142]),
[iquote('flip(142)')] ).
cnf(146,plain,
equal(double_divide(double_divide(A,B),A),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[116,126]),116]),
[iquote('para(116,126),demod([116])')] ).
cnf(149,plain,
equal(inverse(A),multiply(B,double_divide(B,A))),
inference(para,[status(thm),theory(equality)],[146,2]),
[iquote('para(146,2)')] ).
cnf(150,plain,
equal(multiply(A,double_divide(A,B)),inverse(B)),
inference(flip,[status(thm),theory(equality)],[149]),
[iquote('flip(149)')] ).
cnf(169,plain,
equal(multiply(multiply(inverse(A),B),A),B),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[140,2]),116]),1]),
[iquote('para(140,2),demod([116]),flip(1)')] ).
cnf(180,plain,
~ equal(multiply(multiply(double_divide(double_divide(A,inverse(A)),b2),b2),a2),a2),
inference(para,[status(thm),theory(equality)],[143,4]),
[iquote('para(143,4)')] ).
cnf(191,plain,
equal(double_divide(A,inverse(B)),multiply(B,inverse(A))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[150,140]),2]),
[iquote('para(150,140),demod([2])')] ).
cnf(193,plain,
equal(multiply(inverse(A),inverse(B)),double_divide(B,A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[116,191]),1]),
[iquote('para(116,191),flip(1)')] ).
cnf(202,plain,
equal(double_divide(A,double_divide(B,A)),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[82]),193]),
[iquote('back_demod(82),demod([193])')] ).
cnf(224,plain,
equal(inverse(A),multiply(double_divide(A,B),B)),
inference(para,[status(thm),theory(equality)],[202,2]),
[iquote('para(202,2)')] ).
cnf(244,plain,
equal(multiply(double_divide(double_divide(A,B),C),C),multiply(B,A)),
inference(para,[status(thm),theory(equality)],[224,2]),
[iquote('para(224,2)')] ).
cnf(245,plain,
~ equal(multiply(multiply(inverse(A),A),a2),a2),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[180]),244]),
[iquote('back_demod(180),demod([244])')] ).
cnf(246,plain,
$false,
inference(conflict,[status(thm)],[245,169]),
[iquote('conflict(245,169)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP598-1 : TPTP v8.1.0. Released v2.6.0.
% 0.07/0.13 % Command : tptp2X_and_run_eqp %s
% 0.13/0.34 % Computer : n028.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 : Tue Jun 14 10:19:24 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.69/1.12 ----- EQP 0.9e, May 2009 -----
% 0.69/1.12 The job began on n028.cluster.edu, Tue Jun 14 10:19:24 2022
% 0.69/1.12 The command was "./eqp09e".
% 0.69/1.12
% 0.69/1.12 set(prolog_style_variables).
% 0.69/1.12 set(lrpo).
% 0.69/1.12 set(basic_paramod).
% 0.69/1.12 set(functional_subsume).
% 0.69/1.12 set(ordered_paramod).
% 0.69/1.12 set(prime_paramod).
% 0.69/1.12 set(para_pairs).
% 0.69/1.12 assign(pick_given_ratio,4).
% 0.69/1.12 clear(print_kept).
% 0.69/1.12 clear(print_new_demod).
% 0.69/1.12 clear(print_back_demod).
% 0.69/1.12 clear(print_given).
% 0.69/1.12 assign(max_mem,64000).
% 0.69/1.12 end_of_commands.
% 0.69/1.12
% 0.69/1.12 Usable:
% 0.69/1.12 end_of_list.
% 0.69/1.12
% 0.69/1.12 Sos:
% 0.69/1.12 0 (wt=-1) [] double_divide(double_divide(A,B),inverse(double_divide(A,inverse(double_divide(inverse(C),B))))) = C.
% 0.69/1.12 0 (wt=-1) [] multiply(A,B) = inverse(double_divide(B,A)).
% 0.69/1.12 0 (wt=-1) [] -(multiply(multiply(inverse(b2),b2),a2) = a2).
% 0.69/1.12 end_of_list.
% 0.69/1.12
% 0.69/1.12 Demodulators:
% 0.69/1.12 end_of_list.
% 0.69/1.12
% 0.69/1.12 Passive:
% 0.69/1.12 end_of_list.
% 0.69/1.12
% 0.69/1.12 Starting to process input.
% 0.69/1.12
% 0.69/1.12 ** KEPT: 1 (wt=14) [] double_divide(double_divide(A,B),inverse(double_divide(A,inverse(double_divide(inverse(C),B))))) = C.
% 0.69/1.12 1 is a new demodulator.
% 0.69/1.12
% 0.69/1.12 ** KEPT: 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.69/1.12 2 is a new demodulator.
% 0.69/1.12 -> 2 back demodulating 1.
% 0.69/1.12
% 0.69/1.12 ** KEPT: 3 (wt=12) [back_demod(1),demod([2,2])] double_divide(double_divide(A,B),multiply(multiply(B,inverse(C)),A)) = C.
% 0.69/1.12 3 is a new demodulator.
% 0.69/1.12
% 0.69/1.12 ** KEPT: 4 (wt=8) [] -(multiply(multiply(inverse(b2),b2),a2) = a2).
% 0.69/1.12 ---------------- PROOF FOUND ----------------
% 0.69/1.12 % SZS status Unsatisfiable
% 0.69/1.12
% 0.69/1.12
% 0.69/1.12 After processing input:
% 0.69/1.12
% 0.69/1.12 Usable:
% 0.69/1.12 end_of_list.
% 0.69/1.12
% 0.69/1.12 Sos:
% 0.69/1.12 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.69/1.12 4 (wt=8) [] -(multiply(multiply(inverse(b2),b2),a2) = a2).
% 0.69/1.12 3 (wt=12) [back_demod(1),demod([2,2])] double_divide(double_divide(A,B),multiply(multiply(B,inverse(C)),A)) = C.
% 0.69/1.12 end_of_list.
% 0.69/1.12
% 0.69/1.12 Demodulators:
% 0.69/1.12 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.69/1.12 3 (wt=12) [back_demod(1),demod([2,2])] double_divide(double_divide(A,B),multiply(multiply(B,inverse(C)),A)) = C.
% 0.69/1.12 end_of_list.
% 0.69/1.12
% 0.69/1.12 Passive:
% 0.69/1.12 end_of_list.
% 0.69/1.12
% 0.69/1.12 UNIT CONFLICT from 245 and 169 at 0.01 seconds.
% 0.69/1.12
% 0.69/1.12 ---------------- PROOF ----------------
% 0.69/1.12 % SZS output start Refutation
% See solution above
% 0.69/1.12 ------------ end of proof -------------
% 0.69/1.12
% 0.69/1.12
% 0.69/1.12 ------------- memory usage ------------
% 0.69/1.12 Memory dynamically allocated (tp_alloc): 488.
% 0.69/1.12 type (bytes each) gets frees in use avail bytes
% 0.69/1.12 sym_ent ( 96) 56 0 56 0 5.2 K
% 0.69/1.12 term ( 16) 13389 9410 3979 19 77.1 K
% 0.69/1.12 gen_ptr ( 8) 20323 2895 17428 33 136.4 K
% 0.69/1.12 context ( 808) 12964 12962 2 2 3.2 K
% 0.69/1.12 trail ( 12) 1982 1982 0 8 0.1 K
% 0.69/1.12 bt_node ( 68) 6418 6416 2 19 1.4 K
% 0.69/1.12 ac_position (285432) 0 0 0 0 0.0 K
% 0.69/1.12 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.69/1.12 ac_match_free_vars_pos (4020)
% 0.69/1.12 0 0 0 0 0.0 K
% 0.69/1.12 discrim ( 12) 3678 863 2815 8 33.1 K
% 0.69/1.12 flat ( 40) 28326 28326 0 31 1.2 K
% 0.69/1.12 discrim_pos ( 12) 367 367 0 1 0.0 K
% 0.69/1.12 fpa_head ( 12) 1241 0 1241 0 14.5 K
% 0.69/1.12 fpa_tree ( 28) 1019 1019 0 13 0.4 K
% 0.69/1.12 fpa_pos ( 36) 410 410 0 1 0.0 K
% 0.69/1.12 literal ( 12) 793 548 245 0 2.9 K
% 0.69/1.12 clause ( 24) 793 548 245 0 5.7 K
% 0.69/1.12 list ( 12) 224 167 57 3 0.7 K
% 0.69/1.12 list_pos ( 20) 994 235 759 3 14.9 K
% 0.69/1.12 pair_index ( 40) 2 0 2 0 0.1 K
% 0.69/1.12
% 0.69/1.12 -------------- statistics -------------
% 0.69/1.12 Clauses input 3
% 0.69/1.12 Usable input 0
% 0.69/1.12 Sos input 3
% 0.69/1.12 Demodulators input 0
% 0.69/1.12 Passive input 0
% 0.69/1.12
% 0.69/1.12 Processed BS (before search) 4
% 0.69/1.12 Forward subsumed BS 0
% 0.69/1.12 Kept BS 4
% 0.69/1.12 New demodulators BS 3
% 0.69/1.12 Back demodulated BS 1
% 0.69/1.12
% 0.69/1.12 Clauses or pairs given 879
% 0.69/1.12 Clauses generated 499
% 0.69/1.12 Forward subsumed 258
% 0.69/1.12 Deleted by weight 0
% 0.69/1.12 Deleted by variable count 0
% 0.69/1.12 Kept 241
% 0.69/1.12 New demodulators 162
% 0.69/1.12 Back demodulated 46
% 0.69/1.12 Ordered paramod prunes 0
% 0.69/1.12 Basic paramod prunes 3975
% 0.69/1.12 Prime paramod prunes 6
% 0.69/1.12 Semantic prunes 0
% 0.69/1.12
% 0.69/1.12 Rewrite attmepts 4459
% 0.69/1.12 Rewrites 306
% 0.69/1.12
% 0.69/1.12 FPA overloads 0
% 0.69/1.12 FPA underloads 0
% 0.69/1.12
% 0.69/1.12 Usable size 0
% 0.69/1.12 Sos size 197
% 0.69/1.12 Demodulators size 121
% 0.69/1.12 Passive size 0
% 0.69/1.12 Disabled size 47
% 0.69/1.12
% 0.69/1.12 Proofs found 1
% 0.69/1.12
% 0.69/1.12 ----------- times (seconds) ----------- Tue Jun 14 10:19:24 2022
% 0.69/1.12
% 0.69/1.12 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.69/1.12 system CPU time 0.02 (0 hr, 0 min, 0 sec)
% 0.69/1.12 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.69/1.12 input time 0.00
% 0.69/1.12 paramodulation time 0.00
% 0.69/1.12 demodulation time 0.00
% 0.69/1.12 orient time 0.00
% 0.69/1.12 weigh time 0.00
% 0.69/1.12 forward subsume time 0.00
% 0.69/1.12 back demod find time 0.00
% 0.69/1.12 conflict time 0.00
% 0.69/1.12 LRPO time 0.00
% 0.69/1.12 store clause time 0.00
% 0.69/1.12 disable clause time 0.00
% 0.69/1.12 prime paramod time 0.00
% 0.69/1.12 semantics time 0.00
% 0.69/1.12
% 0.69/1.12 EQP interrupted
%------------------------------------------------------------------------------