TSTP Solution File: GRP597-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP597-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n019.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:08 EDT 2022
% Result : Unsatisfiable 0.70s 1.11s
% Output : Refutation 0.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 26
% Number of leaves : 1
% Syntax : Number of clauses : 34 ( 34 unt; 0 nHn; 2 RR)
% Number of literals : 34 ( 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 : 70 ( 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('GRP597-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(inverse(b1),b1),multiply(inverse(a1),a1)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
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(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(84,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(91,plain,
equal(double_divide(double_divide(A,inverse(A)),inverse(B)),B),
inference(para,[status(thm),theory(equality)],[83,3]),
[iquote('para(83,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)],[83,84]),
[iquote('para(83,84)')] ).
cnf(107,plain,
equal(double_divide(inverse(A),multiply(inverse(B),B)),A),
inference(para,[status(thm),theory(equality)],[93,84]),
[iquote('para(93,84)')] ).
cnf(108,plain,
equal(multiply(multiply(inverse(A),A),inverse(B)),inverse(B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[107,2]),1]),
[iquote('para(107,2),flip(1)')] ).
cnf(110,plain,
equal(double_divide(A,multiply(inverse(B),inverse(A))),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[107,3]),108]),
[iquote('para(107,3),demod([108])')] ).
cnf(111,plain,
equal(multiply(multiply(inverse(A),inverse(B)),B),inverse(A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[110,2]),1]),
[iquote('para(110,2),flip(1)')] ).
cnf(114,plain,
equal(inverse(inverse(inverse(A))),inverse(A)),
inference(para,[status(thm),theory(equality)],[111,108]),
[iquote('para(111,108)')] ).
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(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(188,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(190,plain,
equal(multiply(inverse(A),inverse(B)),double_divide(B,A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[116,188]),1]),
[iquote('para(116,188),flip(1)')] ).
cnf(195,plain,
equal(double_divide(A,double_divide(A,B)),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[110]),190]),
[iquote('back_demod(110),demod([190])')] ).
cnf(199,plain,
equal(double_divide(A,double_divide(B,A)),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[82]),190]),
[iquote('back_demod(82),demod([190])')] ).
cnf(214,plain,
equal(double_divide(A,B),double_divide(B,A)),
inference(para,[status(thm),theory(equality)],[199,195]),
[iquote('para(199,195)')] ).
cnf(227,plain,
equal(multiply(A,B),multiply(B,A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[214,2]),2]),
[iquote('para(214,2),demod([2])')] ).
cnf(274,plain,
equal(double_divide(multiply(inverse(A),A),B),inverse(B)),
inference(para,[status(thm),theory(equality)],[107,199]),
[iquote('para(107,199)')] ).
cnf(301,plain,
equal(multiply(A,multiply(inverse(B),B)),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[274,195]),2]),
[iquote('para(274,195),demod([2])')] ).
cnf(303,plain,
equal(multiply(multiply(inverse(A),A),B),B),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[301,227]),1]),
[iquote('para(301,227),flip(1)')] ).
cnf(317,plain,
equal(multiply(inverse(A),A),multiply(inverse(B),B)),
inference(para,[status(thm),theory(equality)],[303,301]),
[iquote('para(303,301)')] ).
cnf(318,plain,
$false,
inference(conflict,[status(thm)],[317,4]),
[iquote('conflict(317,4)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : GRP597-1 : TPTP v8.1.0. Released v2.6.0.
% 0.13/0.13 % Command : tptp2X_and_run_eqp %s
% 0.13/0.35 % Computer : n019.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 : Mon Jun 13 04:16:39 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.70/1.11 ----- EQP 0.9e, May 2009 -----
% 0.70/1.11 The job began on n019.cluster.edu, Mon Jun 13 04:16:40 2022
% 0.70/1.11 The command was "./eqp09e".
% 0.70/1.11
% 0.70/1.11 set(prolog_style_variables).
% 0.70/1.11 set(lrpo).
% 0.70/1.11 set(basic_paramod).
% 0.70/1.11 set(functional_subsume).
% 0.70/1.11 set(ordered_paramod).
% 0.70/1.11 set(prime_paramod).
% 0.70/1.11 set(para_pairs).
% 0.70/1.11 assign(pick_given_ratio,4).
% 0.70/1.11 clear(print_kept).
% 0.70/1.11 clear(print_new_demod).
% 0.70/1.11 clear(print_back_demod).
% 0.70/1.11 clear(print_given).
% 0.70/1.11 assign(max_mem,64000).
% 0.70/1.11 end_of_commands.
% 0.70/1.11
% 0.70/1.11 Usable:
% 0.70/1.11 end_of_list.
% 0.70/1.11
% 0.70/1.11 Sos:
% 0.70/1.11 0 (wt=-1) [] double_divide(double_divide(A,B),inverse(double_divide(A,inverse(double_divide(inverse(C),B))))) = C.
% 0.70/1.11 0 (wt=-1) [] multiply(A,B) = inverse(double_divide(B,A)).
% 0.70/1.11 0 (wt=-1) [] -(multiply(inverse(a1),a1) = multiply(inverse(b1),b1)).
% 0.70/1.11 end_of_list.
% 0.70/1.11
% 0.70/1.11 Demodulators:
% 0.70/1.11 end_of_list.
% 0.70/1.11
% 0.70/1.11 Passive:
% 0.70/1.11 end_of_list.
% 0.70/1.11
% 0.70/1.11 Starting to process input.
% 0.70/1.11
% 0.70/1.11 ** KEPT: 1 (wt=14) [] double_divide(double_divide(A,B),inverse(double_divide(A,inverse(double_divide(inverse(C),B))))) = C.
% 0.70/1.11 1 is a new demodulator.
% 0.70/1.11
% 0.70/1.11 ** KEPT: 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.70/1.11 2 is a new demodulator.
% 0.70/1.11 -> 2 back demodulating 1.
% 0.70/1.11
% 0.70/1.11 ** KEPT: 3 (wt=12) [back_demod(1),demod([2,2])] double_divide(double_divide(A,B),multiply(multiply(B,inverse(C)),A)) = C.
% 0.70/1.11 3 is a new demodulator.
% 0.70/1.11
% 0.70/1.11 ** KEPT: 4 (wt=9) [flip(1)] -(multiply(inverse(b1),b1) = multiply(inverse(a1),a1)).
% 0.70/1.11 ---------------- PROOF FOUND ----------------
% 0.70/1.11 % SZS status Unsatisfiable
% 0.70/1.11
% 0.70/1.11
% 0.70/1.11 After processing input:
% 0.70/1.11
% 0.70/1.11 Usable:
% 0.70/1.11 end_of_list.
% 0.70/1.11
% 0.70/1.11 Sos:
% 0.70/1.11 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.70/1.11 4 (wt=9) [flip(1)] -(multiply(inverse(b1),b1) = multiply(inverse(a1),a1)).
% 0.70/1.11 3 (wt=12) [back_demod(1),demod([2,2])] double_divide(double_divide(A,B),multiply(multiply(B,inverse(C)),A)) = C.
% 0.70/1.11 end_of_list.
% 0.70/1.11
% 0.70/1.11 Demodulators:
% 0.70/1.11 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.70/1.11 3 (wt=12) [back_demod(1),demod([2,2])] double_divide(double_divide(A,B),multiply(multiply(B,inverse(C)),A)) = C.
% 0.70/1.11 end_of_list.
% 0.70/1.11
% 0.70/1.11 Passive:
% 0.70/1.11 end_of_list.
% 0.70/1.11
% 0.70/1.11 UNIT CONFLICT from 317 and 4 at 0.01 seconds.
% 0.70/1.11
% 0.70/1.11 ---------------- PROOF ----------------
% 0.70/1.11 % SZS output start Refutation
% See solution above
% 0.70/1.11 ------------ end of proof -------------
% 0.70/1.11
% 0.70/1.11
% 0.70/1.11 ------------- memory usage ------------
% 0.70/1.11 Memory dynamically allocated (tp_alloc): 488.
% 0.70/1.11 type (bytes each) gets frees in use avail bytes
% 0.70/1.11 sym_ent ( 96) 56 0 56 0 5.2 K
% 0.70/1.11 term ( 16) 18317 13611 4706 28 91.2 K
% 0.70/1.11 gen_ptr ( 8) 23390 3615 19775 33 154.8 K
% 0.70/1.11 context ( 808) 16862 16860 2 2 3.2 K
% 0.70/1.11 trail ( 12) 2164 2164 0 8 0.1 K
% 0.70/1.11 bt_node ( 68) 8602 8599 3 20 1.5 K
% 0.70/1.11 ac_position (285432) 0 0 0 0 0.0 K
% 0.70/1.11 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.70/1.11 ac_match_free_vars_pos (4020)
% 0.70/1.11 0 0 0 0 0.0 K
% 0.70/1.11 discrim ( 12) 4044 861 3183 0 37.3 K
% 0.70/1.11 flat ( 40) 37941 37941 0 33 1.3 K
% 0.70/1.11 discrim_pos ( 12) 583 583 0 1 0.0 K
% 0.70/1.11 fpa_head ( 12) 1257 0 1257 0 14.7 K
% 0.70/1.11 fpa_tree ( 28) 1043 1043 0 15 0.4 K
% 0.70/1.11 fpa_pos ( 36) 503 503 0 1 0.0 K
% 0.70/1.11 literal ( 12) 1202 885 317 1 3.7 K
% 0.70/1.11 clause ( 24) 1202 885 317 1 7.5 K
% 0.70/1.11 list ( 12) 245 189 56 4 0.7 K
% 0.70/1.11 list_pos ( 20) 1231 236 995 0 19.4 K
% 0.70/1.11 pair_index ( 40) 2 0 2 0 0.1 K
% 0.70/1.11
% 0.70/1.11 -------------- statistics -------------
% 0.70/1.11 Clauses input 3
% 0.70/1.11 Usable input 0
% 0.70/1.11 Sos input 3
% 0.70/1.11 Demodulators input 0
% 0.70/1.11 Passive input 0
% 0.70/1.11
% 0.70/1.11 Processed BS (before search) 4
% 0.70/1.11 Forward subsumed BS 0
% 0.70/1.11 Kept BS 4
% 0.70/1.11 New demodulators BS 3
% 0.70/1.11 Back demodulated BS 1
% 0.70/1.11
% 0.70/1.11 Clauses or pairs given 1412
% 0.70/1.11 Clauses generated 743
% 0.70/1.11 Forward subsumed 430
% 0.70/1.11 Deleted by weight 0
% 0.70/1.11 Deleted by variable count 0
% 0.70/1.11 Kept 313
% 0.70/1.11 New demodulators 183
% 0.70/1.11 Back demodulated 46
% 0.70/1.11 Ordered paramod prunes 0
% 0.70/1.11 Basic paramod prunes 6295
% 0.70/1.11 Prime paramod prunes 30
% 0.70/1.11 Semantic prunes 0
% 0.70/1.11
% 0.70/1.11 Rewrite attmepts 5970
% 0.70/1.11 Rewrites 411
% 0.70/1.11
% 0.70/1.11 FPA overloads 0
% 0.70/1.11 FPA underloads 0
% 0.70/1.11
% 0.70/1.11 Usable size 0
% 0.70/1.11 Sos size 269
% 0.70/1.11 Demodulators size 141
% 0.70/1.11 Passive size 0
% 0.70/1.11 Disabled size 47
% 0.70/1.11
% 0.70/1.11 Proofs found 1
% 0.70/1.11
% 0.70/1.11 ----------- times (seconds) ----------- Mon Jun 13 04:16:40 2022
% 0.70/1.11
% 0.70/1.11 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.70/1.11 system CPU time 0.02 (0 hr, 0 min, 0 sec)
% 0.70/1.11 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.70/1.11 input time 0.00
% 0.70/1.11 paramodulation time 0.00
% 0.70/1.11 demodulation time 0.00
% 0.70/1.11 orient time 0.00
% 0.70/1.11 weigh time 0.00
% 0.70/1.11 forward subsume time 0.00
% 0.70/1.11 back demod find time 0.00
% 0.70/1.11 conflict time 0.00
% 0.70/1.11 LRPO time 0.00
% 0.70/1.11 store clause time 0.00
% 0.70/1.11 disable clause time 0.00
% 0.70/1.11 prime paramod time 0.00
% 0.70/1.11 semantics time 0.00
% 0.70/1.11
% 0.70/1.11 EQP interrupted
%------------------------------------------------------------------------------