TSTP Solution File: GRP595-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP595-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n014.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.69s 1.08s
% Output : Refutation 0.69s
% Verified :
% SZS Type : Refutation
% Derivation depth : 16
% Number of leaves : 2
% Syntax : Number of clauses : 41 ( 41 unt; 0 nHn; 3 RR)
% Number of literals : 41 ( 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 : 141 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(inverse(double_divide(double_divide(A,B),inverse(double_divide(A,inverse(double_divide(C,B)))))),C),
file('GRP595-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(multiply(multiply(multiply(A,B),C),double_divide(C,A)),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[1]),2,2,2]),
[iquote('back_demod(1),demod([2,2,2])')] ).
cnf(4,plain,
~ equal(multiply(multiply(a3,b3),c3),multiply(a3,multiply(b3,c3))),
file('GRP595-1.p',unknown),
[] ).
cnf(5,plain,
equal(multiply(multiply(A,B),double_divide(B,multiply(multiply(C,A),D))),double_divide(D,C)),
inference(para,[status(thm),theory(equality)],[3,3]),
[iquote('para(3,3)')] ).
cnf(6,plain,
equal(multiply(A,double_divide(double_divide(B,C),multiply(C,A))),B),
inference(para,[status(thm),theory(equality)],[3,3]),
[iquote('para(3,3)')] ).
cnf(7,plain,
equal(multiply(multiply(A,B),double_divide(B,C)),double_divide(double_divide(A,D),multiply(D,C))),
inference(para,[status(thm),theory(equality)],[6,3]),
[iquote('para(6,3)')] ).
cnf(8,plain,
equal(double_divide(double_divide(A,B),multiply(B,C)),multiply(multiply(A,D),double_divide(D,C))),
inference(flip,[status(thm),theory(equality)],[7]),
[iquote('flip(7)')] ).
cnf(18,plain,
equal(double_divide(multiply(A,double_divide(B,multiply(C,A))),C),B),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[6,5]),1]),
[iquote('para(6,5),flip(1)')] ).
cnf(25,plain,
equal(double_divide(double_divide(multiply(A,B),C),multiply(C,A)),B),
inference(para,[status(thm),theory(equality)],[7,3]),
[iquote('para(7,3)')] ).
cnf(28,plain,
equal(inverse(A),multiply(multiply(B,C),double_divide(multiply(C,A),B))),
inference(para,[status(thm),theory(equality)],[25,2]),
[iquote('para(25,2)')] ).
cnf(29,plain,
equal(multiply(multiply(A,B),double_divide(multiply(B,C),A)),inverse(C)),
inference(flip,[status(thm),theory(equality)],[28]),
[iquote('flip(28)')] ).
cnf(33,plain,
equal(multiply(multiply(multiply(multiply(A,B),C),double_divide(multiply(B,D),A)),D),C),
inference(para,[status(thm),theory(equality)],[25,3]),
[iquote('para(25,3)')] ).
cnf(35,plain,
equal(double_divide(double_divide(A,B),multiply(B,multiply(multiply(C,A),D))),double_divide(D,C)),
inference(para,[status(thm),theory(equality)],[7,5]),
[iquote('para(7,5)')] ).
cnf(50,plain,
equal(multiply(inverse(A),double_divide(double_divide(multiply(B,A),C),C)),B),
inference(para,[status(thm),theory(equality)],[29,3]),
[iquote('para(29,3)')] ).
cnf(52,plain,
equal(multiply(multiply(A,B),double_divide(double_divide(multiply(C,double_divide(B,A)),D),D)),C),
inference(para,[status(thm),theory(equality)],[2,50]),
[iquote('para(2,50)')] ).
cnf(53,plain,
equal(multiply(A,multiply(multiply(B,C),double_divide(C,A))),B),
inference(para,[status(thm),theory(equality)],[8,6]),
[iquote('para(8,6)')] ).
cnf(56,plain,
equal(multiply(A,multiply(B,double_divide(double_divide(C,D),A))),multiply(multiply(D,B),C)),
inference(para,[status(thm),theory(equality)],[3,53]),
[iquote('para(3,53)')] ).
cnf(57,plain,
equal(multiply(multiply(A,B),C),multiply(D,multiply(B,double_divide(double_divide(C,A),D)))),
inference(flip,[status(thm),theory(equality)],[56]),
[iquote('flip(56)')] ).
cnf(59,plain,
equal(multiply(multiply(A,multiply(B,double_divide(C,A))),C),B),
inference(para,[status(thm),theory(equality)],[6,53]),
[iquote('para(6,53)')] ).
cnf(62,plain,
equal(multiply(A,multiply(multiply(B,multiply(C,double_divide(D,multiply(A,C)))),D)),B),
inference(para,[status(thm),theory(equality)],[18,53]),
[iquote('para(18,53)')] ).
cnf(74,plain,
equal(multiply(multiply(A,B),double_divide(B,inverse(C))),double_divide(double_divide(multiply(A,C),D),D)),
inference(para,[status(thm),theory(equality)],[50,3]),
[iquote('para(50,3)')] ).
cnf(75,plain,
equal(double_divide(double_divide(multiply(A,B),C),C),multiply(multiply(A,D),double_divide(D,inverse(B)))),
inference(flip,[status(thm),theory(equality)],[74]),
[iquote('flip(74)')] ).
cnf(80,plain,
equal(multiply(multiply(A,multiply(multiply(B,C),D)),double_divide(C,A)),multiply(B,D)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[35,2]),2]),1]),
[iquote('para(35,2),demod([2]),flip(1)')] ).
cnf(141,plain,
equal(multiply(multiply(A,double_divide(multiply(B,C),multiply(D,A))),C),double_divide(B,D)),
inference(para,[status(thm),theory(equality)],[25,5]),
[iquote('para(25,5)')] ).
cnf(201,plain,
equal(multiply(multiply(A,double_divide(multiply(B,C),D)),C),multiply(multiply(A,E),double_divide(E,multiply(D,B)))),
inference(para,[status(thm),theory(equality)],[53,33]),
[iquote('para(53,33)')] ).
cnf(202,plain,
equal(multiply(multiply(A,B),double_divide(B,multiply(C,D))),multiply(multiply(A,double_divide(multiply(D,E),C)),E)),
inference(flip,[status(thm),theory(equality)],[201]),
[iquote('flip(201)')] ).
cnf(212,plain,
equal(multiply(multiply(A,B),double_divide(B,multiply(C,D))),double_divide(double_divide(multiply(A,double_divide(D,C)),E),E)),
inference(para,[status(thm),theory(equality)],[52,3]),
[iquote('para(52,3)')] ).
cnf(213,plain,
equal(double_divide(double_divide(multiply(A,double_divide(B,C)),D),D),multiply(multiply(A,E),double_divide(E,multiply(C,B)))),
inference(flip,[status(thm),theory(equality)],[212]),
[iquote('flip(212)')] ).
cnf(256,plain,
~ equal(multiply(A,multiply(b3,double_divide(double_divide(c3,a3),A))),multiply(a3,multiply(b3,c3))),
inference(para,[status(thm),theory(equality)],[57,4]),
[iquote('para(57,4)')] ).
cnf(267,plain,
equal(multiply(A,multiply(B,C)),multiply(D,multiply(B,double_divide(multiply(E,double_divide(C,multiply(A,E))),D)))),
inference(para,[status(thm),theory(equality)],[59,62]),
[iquote('para(59,62)')] ).
cnf(268,plain,
equal(multiply(A,multiply(B,double_divide(multiply(C,double_divide(D,multiply(E,C))),A))),multiply(E,multiply(B,D))),
inference(flip,[status(thm),theory(equality)],[267]),
[iquote('flip(267)')] ).
cnf(298,plain,
equal(multiply(A,double_divide(double_divide(B,C),C)),multiply(A,B)),
inference(para,[status(thm),theory(equality)],[80,59]),
[iquote('para(80,59)')] ).
cnf(308,plain,
equal(multiply(inverse(A),multiply(B,A)),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[50]),298]),
[iquote('back_demod(50),demod([298])')] ).
cnf(358,plain,
equal(multiply(multiply(A,B),double_divide(B,inverse(C))),multiply(A,C)),
inference(para,[status(thm),theory(equality)],[308,3]),
[iquote('para(308,3)')] ).
cnf(359,plain,
equal(double_divide(double_divide(multiply(A,B),C),C),multiply(A,B)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[75]),358]),
[iquote('back_demod(75),demod([358])')] ).
cnf(361,plain,
equal(multiply(multiply(A,B),double_divide(B,multiply(C,D))),multiply(A,double_divide(D,C))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[213]),359]),1]),
[iquote('back_demod(213),demod([359]),flip(1)')] ).
cnf(376,plain,
equal(multiply(multiply(A,double_divide(multiply(B,C),D)),C),multiply(A,double_divide(B,D))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[202]),361]),1]),
[iquote('back_demod(202),demod([361]),flip(1)')] ).
cnf(381,plain,
equal(multiply(A,double_divide(B,multiply(C,A))),double_divide(B,C)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[141]),376]),
[iquote('back_demod(141),demod([376])')] ).
cnf(383,plain,
equal(multiply(A,multiply(B,double_divide(double_divide(C,D),A))),multiply(D,multiply(B,C))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[268]),381]),
[iquote('back_demod(268),demod([381])')] ).
cnf(384,plain,
$false,
inference(conflict,[status(thm)],[383,256]),
[iquote('conflict(383,256)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12 % Problem : GRP595-1 : TPTP v8.1.0. Released v2.6.0.
% 0.11/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n014.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 : Mon Jun 13 12:01:37 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.69/1.08 ----- EQP 0.9e, May 2009 -----
% 0.69/1.08 The job began on n014.cluster.edu, Mon Jun 13 12:01:38 2022
% 0.69/1.08 The command was "./eqp09e".
% 0.69/1.08
% 0.69/1.08 set(prolog_style_variables).
% 0.69/1.08 set(lrpo).
% 0.69/1.08 set(basic_paramod).
% 0.69/1.08 set(functional_subsume).
% 0.69/1.08 set(ordered_paramod).
% 0.69/1.08 set(prime_paramod).
% 0.69/1.08 set(para_pairs).
% 0.69/1.08 assign(pick_given_ratio,4).
% 0.69/1.08 clear(print_kept).
% 0.69/1.08 clear(print_new_demod).
% 0.69/1.08 clear(print_back_demod).
% 0.69/1.08 clear(print_given).
% 0.69/1.08 assign(max_mem,64000).
% 0.69/1.08 end_of_commands.
% 0.69/1.08
% 0.69/1.08 Usable:
% 0.69/1.08 end_of_list.
% 0.69/1.08
% 0.69/1.08 Sos:
% 0.69/1.08 0 (wt=-1) [] inverse(double_divide(double_divide(A,B),inverse(double_divide(A,inverse(double_divide(C,B)))))) = C.
% 0.69/1.08 0 (wt=-1) [] multiply(A,B) = inverse(double_divide(B,A)).
% 0.69/1.08 0 (wt=-1) [] -(multiply(multiply(a3,b3),c3) = multiply(a3,multiply(b3,c3))).
% 0.69/1.08 end_of_list.
% 0.69/1.08
% 0.69/1.08 Demodulators:
% 0.69/1.08 end_of_list.
% 0.69/1.08
% 0.69/1.08 Passive:
% 0.69/1.08 end_of_list.
% 0.69/1.08
% 0.69/1.08 Starting to process input.
% 0.69/1.08
% 0.69/1.08 ** KEPT: 1 (wt=14) [] inverse(double_divide(double_divide(A,B),inverse(double_divide(A,inverse(double_divide(C,B)))))) = C.
% 0.69/1.08 1 is a new demodulator.
% 0.69/1.08
% 0.69/1.08 ** KEPT: 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.69/1.08 2 is a new demodulator.
% 0.69/1.08 -> 2 back demodulating 1.
% 0.69/1.08
% 0.69/1.08 ** KEPT: 3 (wt=11) [back_demod(1),demod([2,2,2])] multiply(multiply(multiply(A,B),C),double_divide(C,A)) = B.
% 0.69/1.08 3 is a new demodulator.
% 0.69/1.08
% 0.69/1.08 ** KEPT: 4 (wt=11) [] -(multiply(multiply(a3,b3),c3) = multiply(a3,multiply(b3,c3))).
% 0.69/1.08 ---------------- PROOF FOUND ----------------
% 0.69/1.08 % SZS status Unsatisfiable
% 0.69/1.08
% 0.69/1.08
% 0.69/1.08 After processing input:
% 0.69/1.08
% 0.69/1.08 Usable:
% 0.69/1.08 end_of_list.
% 0.69/1.08
% 0.69/1.08 Sos:
% 0.69/1.08 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.69/1.08 3 (wt=11) [back_demod(1),demod([2,2,2])] multiply(multiply(multiply(A,B),C),double_divide(C,A)) = B.
% 0.69/1.08 4 (wt=11) [] -(multiply(multiply(a3,b3),c3) = multiply(a3,multiply(b3,c3))).
% 0.69/1.08 end_of_list.
% 0.69/1.08
% 0.69/1.08 Demodulators:
% 0.69/1.08 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.69/1.08 3 (wt=11) [back_demod(1),demod([2,2,2])] multiply(multiply(multiply(A,B),C),double_divide(C,A)) = B.
% 0.69/1.08 end_of_list.
% 0.69/1.08
% 0.69/1.08 Passive:
% 0.69/1.08 end_of_list.
% 0.69/1.08
% 0.69/1.08 UNIT CONFLICT from 383 and 256 at 0.02 seconds.
% 0.69/1.08
% 0.69/1.08 ---------------- PROOF ----------------
% 0.69/1.08 % SZS output start Refutation
% See solution above
% 0.69/1.08 ------------ end of proof -------------
% 0.69/1.08
% 0.69/1.08
% 0.69/1.08 ------------- memory usage ------------
% 0.69/1.08 Memory dynamically allocated (tp_alloc): 976.
% 0.69/1.08 type (bytes each) gets frees in use avail bytes
% 0.69/1.08 sym_ent ( 96) 57 0 57 0 5.3 K
% 0.69/1.08 term ( 16) 17802 10561 7241 22 140.3 K
% 0.69/1.08 gen_ptr ( 8) 32586 3186 29400 40 230.0 K
% 0.69/1.08 context ( 808) 11225 11223 2 5 5.5 K
% 0.69/1.08 trail ( 12) 2377 2377 0 7 0.1 K
% 0.69/1.08 bt_node ( 68) 3164 3161 3 12 1.0 K
% 0.69/1.08 ac_position (285432) 0 0 0 0 0.0 K
% 0.69/1.08 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.69/1.08 ac_match_free_vars_pos (4020)
% 0.69/1.08 0 0 0 0 0.0 K
% 0.69/1.08 discrim ( 12) 5723 1358 4365 210 53.6 K
% 0.69/1.08 flat ( 40) 41855 41855 0 31 1.2 K
% 0.69/1.08 discrim_pos ( 12) 409 409 0 1 0.0 K
% 0.69/1.08 fpa_head ( 12) 2309 0 2309 0 27.1 K
% 0.69/1.08 fpa_tree ( 28) 1619 1619 0 27 0.7 K
% 0.69/1.08 fpa_pos ( 36) 545 545 0 1 0.0 K
% 0.69/1.08 literal ( 12) 1149 766 383 1 4.5 K
% 0.69/1.08 clause ( 24) 1149 766 383 1 9.0 K
% 0.69/1.08 list ( 12) 221 160 61 1 0.7 K
% 0.69/1.08 list_pos ( 20) 1544 368 1176 3 23.0 K
% 0.69/1.08 pair_index ( 40) 2 0 2 0 0.1 K
% 0.69/1.08
% 0.69/1.08 -------------- statistics -------------
% 0.69/1.08 Clauses input 3
% 0.69/1.08 Usable input 0
% 0.69/1.08 Sos input 3
% 0.69/1.08 Demodulators input 0
% 0.69/1.08 Passive input 0
% 0.69/1.08
% 0.69/1.08 Processed BS (before search) 4
% 0.69/1.08 Forward subsumed BS 0
% 0.69/1.08 Kept BS 4
% 0.69/1.08 New demodulators BS 3
% 0.69/1.08 Back demodulated BS 1
% 0.69/1.08
% 0.69/1.08 Clauses or pairs given 434
% 0.69/1.08 Clauses generated 611
% 0.69/1.08 Forward subsumed 232
% 0.69/1.08 Deleted by weight 0
% 0.69/1.08 Deleted by variable count 0
% 0.69/1.08 Kept 379
% 0.69/1.08 New demodulators 159
% 0.69/1.08 Back demodulated 82
% 0.69/1.08 Ordered paramod prunes 0
% 0.69/1.08 Basic paramod prunes 1566
% 0.69/1.08 Prime paramod prunes 6
% 0.69/1.08 Semantic prunes 0
% 0.69/1.08
% 0.69/1.08 Rewrite attmepts 5989
% 0.69/1.08 Rewrites 246
% 0.69/1.08
% 0.69/1.08 FPA overloads 0
% 0.69/1.08 FPA underloads 0
% 0.69/1.08
% 0.69/1.08 Usable size 0
% 0.69/1.08 Sos size 299
% 0.69/1.08 Demodulators size 129
% 0.69/1.08 Passive size 0
% 0.69/1.08 Disabled size 83
% 0.69/1.08
% 0.69/1.08 Proofs found 1
% 0.69/1.08
% 0.69/1.08 ----------- times (seconds) ----------- Mon Jun 13 12:01:38 2022
% 0.69/1.08
% 0.69/1.08 user CPU time 0.02 (0 hr, 0 min, 0 sec)
% 0.69/1.08 system CPU time 0.02 (0 hr, 0 min, 0 sec)
% 0.69/1.08 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.69/1.08 input time 0.00
% 0.69/1.08 paramodulation time 0.00
% 0.69/1.08 demodulation time 0.00
% 0.69/1.08 orient time 0.00
% 0.69/1.08 weigh time 0.00
% 0.69/1.08 forward subsume time 0.00
% 0.69/1.08 back demod find time 0.00
% 0.69/1.08 conflict time 0.00
% 0.69/1.08 LRPO time 0.00
% 0.69/1.08 store clause time 0.00
% 0.69/1.08 disable clause time 0.00
% 0.69/1.08 prime paramod time 0.00
% 0.69/1.08 semantics time 0.00
% 0.69/1.08
% 0.69/1.08 EQP interrupted
%------------------------------------------------------------------------------