TSTP Solution File: GRP592-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP592-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n029.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.41s 1.05s
% Output : Refutation 0.41s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 1
% Syntax : Number of clauses : 30 ( 30 unt; 0 nHn; 2 RR)
% Number of literals : 30 ( 0 equ; 1 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 : 60 ( 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('GRP592-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(b,a),multiply(a,b)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(5,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(8,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(23,plain,
equal(double_divide(multiply(inverse(A),A),inverse(B)),B),
inference(para,[status(thm),theory(equality)],[5,8]),
[iquote('para(5,8)')] ).
cnf(25,plain,
equal(multiply(inverse(A),multiply(inverse(B),B)),inverse(A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[23,2]),1]),
[iquote('para(23,2),flip(1)')] ).
cnf(27,plain,
equal(double_divide(inverse(multiply(inverse(A),A)),inverse(B)),B),
inference(para,[status(thm),theory(equality)],[25,23]),
[iquote('para(25,23)')] ).
cnf(34,plain,
equal(double_divide(multiply(inverse(A),B),inverse(B)),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[23,3]),25]),
[iquote('para(23,3),demod([25])')] ).
cnf(35,plain,
equal(multiply(inverse(A),multiply(inverse(B),A)),inverse(B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[34,2]),1]),
[iquote('para(34,2),flip(1)')] ).
cnf(37,plain,
equal(double_divide(inverse(A),inverse(multiply(inverse(B),B))),A),
inference(para,[status(thm),theory(equality)],[25,34]),
[iquote('para(25,34)')] ).
cnf(41,plain,
equal(double_divide(inverse(A),inverse(multiply(inverse(A),B))),B),
inference(para,[status(thm),theory(equality)],[35,34]),
[iquote('para(35,34)')] ).
cnf(42,plain,
equal(multiply(inverse(multiply(inverse(A),B)),inverse(A)),inverse(B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[41,2]),1]),
[iquote('para(41,2),flip(1)')] ).
cnf(46,plain,
equal(multiply(inverse(A),A),multiply(inverse(B),B)),
inference(para,[status(thm),theory(equality)],[37,27]),
[iquote('para(37,27)')] ).
cnf(88,plain,
equal(multiply(inverse(multiply(inverse(A),A)),B),B),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[41,27]),1]),
[iquote('para(41,27),flip(1)')] ).
cnf(103,plain,
equal(double_divide(inverse(A),inverse(inverse(B))),multiply(inverse(B),A)),
inference(para,[status(thm),theory(equality)],[42,34]),
[iquote('para(42,34)')] ).
cnf(104,plain,
equal(multiply(inverse(A),B),double_divide(inverse(B),inverse(inverse(A)))),
inference(flip,[status(thm),theory(equality)],[103]),
[iquote('flip(103)')] ).
cnf(105,plain,
equal(inverse(multiply(inverse(A),B)),multiply(inverse(inverse(A)),inverse(B))),
inference(para,[status(thm),theory(equality)],[103,2]),
[iquote('para(103,2)')] ).
cnf(106,plain,
equal(multiply(multiply(inverse(inverse(A)),inverse(A)),B),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[88]),105]),
[iquote('back_demod(88),demod([105])')] ).
cnf(112,plain,
equal(multiply(multiply(inverse(A),A),B),B),
inference(para,[status(thm),theory(equality)],[46,106]),
[iquote('para(46,106)')] ).
cnf(115,plain,
equal(double_divide(double_divide(inverse(A),inverse(inverse(B))),inverse(A)),B),
inference(para,[status(thm),theory(equality)],[104,34]),
[iquote('para(104,34)')] ).
cnf(121,plain,
equal(double_divide(double_divide(A,B),B),A),
inference(para,[status(thm),theory(equality)],[112,3]),
[iquote('para(112,3)')] ).
cnf(142,plain,
equal(inverse(inverse(A)),A),
inference(para,[status(thm),theory(equality)],[121,115]),
[iquote('para(121,115)')] ).
cnf(146,plain,
equal(double_divide(double_divide(inverse(A),B),inverse(A)),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[115]),142]),
[iquote('back_demod(115),demod([142])')] ).
cnf(173,plain,
equal(double_divide(double_divide(A,B),A),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[142,146]),142]),
[iquote('para(142,146),demod([142])')] ).
cnf(174,plain,
equal(double_divide(A,double_divide(A,B)),B),
inference(para,[status(thm),theory(equality)],[121,173]),
[iquote('para(121,173)')] ).
cnf(177,plain,
equal(double_divide(A,B),double_divide(B,A)),
inference(para,[status(thm),theory(equality)],[174,173]),
[iquote('para(174,173)')] ).
cnf(199,plain,
equal(multiply(A,B),multiply(B,A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[177,2]),2]),
[iquote('para(177,2),demod([2])')] ).
cnf(200,plain,
$false,
inference(conflict,[status(thm)],[199,4]),
[iquote('conflict(199,4)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : GRP592-1 : TPTP v8.1.0. Bugfixed v2.7.0.
% 0.12/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n029.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue Jun 14 12:23:25 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.41/1.05 ----- EQP 0.9e, May 2009 -----
% 0.41/1.05 The job began on n029.cluster.edu, Tue Jun 14 12:23:26 2022
% 0.41/1.05 The command was "./eqp09e".
% 0.41/1.05
% 0.41/1.05 set(prolog_style_variables).
% 0.41/1.05 set(lrpo).
% 0.41/1.05 set(basic_paramod).
% 0.41/1.05 set(functional_subsume).
% 0.41/1.05 set(ordered_paramod).
% 0.41/1.05 set(prime_paramod).
% 0.41/1.05 set(para_pairs).
% 0.41/1.05 assign(pick_given_ratio,4).
% 0.41/1.05 clear(print_kept).
% 0.41/1.05 clear(print_new_demod).
% 0.41/1.05 clear(print_back_demod).
% 0.41/1.05 clear(print_given).
% 0.41/1.05 assign(max_mem,64000).
% 0.41/1.05 end_of_commands.
% 0.41/1.05
% 0.41/1.05 Usable:
% 0.41/1.05 end_of_list.
% 0.41/1.05
% 0.41/1.05 Sos:
% 0.41/1.05 0 (wt=-1) [] double_divide(inverse(double_divide(double_divide(A,B),inverse(double_divide(A,inverse(C))))),B) = C.
% 0.41/1.05 0 (wt=-1) [] multiply(A,B) = inverse(double_divide(B,A)).
% 0.41/1.05 0 (wt=-1) [] -(multiply(a,b) = multiply(b,a)).
% 0.41/1.05 end_of_list.
% 0.41/1.05
% 0.41/1.05 Demodulators:
% 0.41/1.05 end_of_list.
% 0.41/1.05
% 0.41/1.05 Passive:
% 0.41/1.05 end_of_list.
% 0.41/1.05
% 0.41/1.05 Starting to process input.
% 0.41/1.05
% 0.41/1.05 ** KEPT: 1 (wt=14) [] double_divide(inverse(double_divide(double_divide(A,B),inverse(double_divide(A,inverse(C))))),B) = C.
% 0.41/1.05 1 is a new demodulator.
% 0.41/1.05
% 0.41/1.05 ** KEPT: 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.41/1.05 2 is a new demodulator.
% 0.41/1.05 -> 2 back demodulating 1.
% 0.41/1.05
% 0.41/1.05 ** KEPT: 3 (wt=12) [back_demod(1),demod([2,2])] double_divide(multiply(multiply(inverse(A),B),double_divide(B,C)),C) = A.
% 0.41/1.05 3 is a new demodulator.
% 0.41/1.05
% 0.41/1.05 ** KEPT: 4 (wt=7) [flip(1)] -(multiply(b,a) = multiply(a,b)).
% 0.41/1.05 ---------------- PROOF FOUND ----------------
% 0.41/1.05 % SZS status Unsatisfiable
% 0.41/1.05
% 0.41/1.05
% 0.41/1.05 After processing input:
% 0.41/1.05
% 0.41/1.05 Usable:
% 0.41/1.05 end_of_list.
% 0.41/1.05
% 0.41/1.05 Sos:
% 0.41/1.05 4 (wt=7) [flip(1)] -(multiply(b,a) = multiply(a,b)).
% 0.41/1.05 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.41/1.05 3 (wt=12) [back_demod(1),demod([2,2])] double_divide(multiply(multiply(inverse(A),B),double_divide(B,C)),C) = A.
% 0.41/1.05 end_of_list.
% 0.41/1.05
% 0.41/1.05 Demodulators:
% 0.41/1.05 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.41/1.05 3 (wt=12) [back_demod(1),demod([2,2])] double_divide(multiply(multiply(inverse(A),B),double_divide(B,C)),C) = A.
% 0.41/1.05 end_of_list.
% 0.41/1.05
% 0.41/1.05 Passive:
% 0.41/1.05 end_of_list.
% 0.41/1.05
% 0.41/1.05 UNIT CONFLICT from 199 and 4 at 0.00 seconds.
% 0.41/1.05
% 0.41/1.05 ---------------- PROOF ----------------
% 0.41/1.05 % SZS output start Refutation
% See solution above
% 0.41/1.05 ------------ end of proof -------------
% 0.41/1.05
% 0.41/1.05
% 0.41/1.05 ------------- memory usage ------------
% 0.41/1.05 Memory dynamically allocated (tp_alloc): 488.
% 0.41/1.05 type (bytes each) gets frees in use avail bytes
% 0.41/1.05 sym_ent ( 96) 56 0 56 0 5.2 K
% 0.41/1.05 term ( 16) 10697 8001 2696 24 52.3 K
% 0.41/1.05 gen_ptr ( 8) 13341 2177 11164 29 87.4 K
% 0.41/1.05 context ( 808) 10008 10006 2 2 3.2 K
% 0.41/1.05 trail ( 12) 768 768 0 8 0.1 K
% 0.41/1.05 bt_node ( 68) 4795 4792 3 16 1.3 K
% 0.41/1.05 ac_position (285432) 0 0 0 0 0.0 K
% 0.41/1.05 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.41/1.05 ac_match_free_vars_pos (4020)
% 0.41/1.05 0 0 0 0 0.0 K
% 0.41/1.05 discrim ( 12) 2296 435 1861 0 21.8 K
% 0.41/1.05 flat ( 40) 20079 20079 0 29 1.1 K
% 0.41/1.05 discrim_pos ( 12) 349 349 0 1 0.0 K
% 0.41/1.05 fpa_head ( 12) 891 0 891 0 10.4 K
% 0.41/1.05 fpa_tree ( 28) 582 582 0 11 0.3 K
% 0.41/1.05 fpa_pos ( 36) 325 325 0 1 0.0 K
% 0.41/1.05 literal ( 12) 752 553 199 1 2.3 K
% 0.41/1.05 clause ( 24) 752 553 199 1 4.7 K
% 0.41/1.05 list ( 12) 185 129 56 4 0.7 K
% 0.41/1.05 list_pos ( 20) 809 206 603 0 11.8 K
% 0.41/1.05 pair_index ( 40) 2 0 2 0 0.1 K
% 0.41/1.05
% 0.41/1.05 -------------- statistics -------------
% 0.41/1.05 Clauses input 3
% 0.41/1.05 Usable input 0
% 0.41/1.05 Sos input 3
% 0.41/1.05 Demodulators input 0
% 0.41/1.05 Passive input 0
% 0.41/1.05
% 0.41/1.05 Processed BS (before search) 4
% 0.41/1.05 Forward subsumed BS 0
% 0.41/1.05 Kept BS 4
% 0.41/1.05 New demodulators BS 3
% 0.41/1.05 Back demodulated BS 1
% 0.41/1.05
% 0.41/1.05 Clauses or pairs given 782
% 0.41/1.05 Clauses generated 461
% 0.41/1.05 Forward subsumed 266
% 0.41/1.05 Deleted by weight 0
% 0.41/1.05 Deleted by variable count 0
% 0.41/1.05 Kept 195
% 0.41/1.05 New demodulators 123
% 0.41/1.05 Back demodulated 42
% 0.41/1.05 Ordered paramod prunes 0
% 0.41/1.05 Basic paramod prunes 3205
% 0.41/1.05 Prime paramod prunes 1
% 0.41/1.05 Semantic prunes 0
% 0.41/1.05
% 0.41/1.05 Rewrite attmepts 3555
% 0.41/1.05 Rewrites 262
% 0.41/1.05
% 0.41/1.05 FPA overloads 0
% 0.41/1.05 FPA underloads 0
% 0.41/1.05
% 0.41/1.05 Usable size 0
% 0.41/1.05 Sos size 155
% 0.41/1.05 Demodulators size 95
% 0.41/1.05 Passive size 0
% 0.41/1.05 Disabled size 43
% 0.41/1.05
% 0.41/1.05 Proofs found 1
% 0.41/1.05
% 0.41/1.05 ----------- times (seconds) ----------- Tue Jun 14 12:23:26 2022
% 0.41/1.05
% 0.41/1.05 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.41/1.05 system CPU time 0.02 (0 hr, 0 min, 0 sec)
% 0.41/1.05 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.41/1.05 input time 0.00
% 0.41/1.05 paramodulation time 0.00
% 0.41/1.05 demodulation time 0.00
% 0.41/1.05 orient time 0.00
% 0.41/1.05 weigh time 0.00
% 0.41/1.05 forward subsume time 0.00
% 0.41/1.05 back demod find time 0.00
% 0.41/1.05 conflict time 0.00
% 0.41/1.05 LRPO time 0.00
% 0.41/1.05 store clause time 0.00
% 0.41/1.05 disable clause time 0.00
% 0.41/1.05 prime paramod time 0.00
% 0.41/1.05 semantics time 0.00
% 0.41/1.05
% 0.41/1.05 EQP interrupted
%------------------------------------------------------------------------------