TSTP Solution File: GRP601-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP601-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n011.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.45s 0.91s
% Output : Refutation 0.45s
% Verified :
% SZS Type : Refutation
% Derivation depth : 23
% Number of leaves : 1
% Syntax : Number of clauses : 43 ( 43 unt; 0 nHn; 2 RR)
% Number of literals : 43 ( 0 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 8 ( 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 : 126 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(inverse(double_divide(inverse(double_divide(A,inverse(double_divide(B,double_divide(A,C))))),C)),B),
file('GRP601-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(A,multiply(multiply(double_divide(B,A),C),B)),C),
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(inverse(b1),b1),multiply(inverse(a1),a1)),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(5,plain,
equal(multiply(multiply(double_divide(A,double_divide(B,C)),D),A),multiply(C,multiply(D,B))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[3,3]),1]),
[iquote('para(3,3),flip(1)')] ).
cnf(6,plain,
equal(multiply(double_divide(A,B),multiply(B,multiply(C,A))),C),
inference(para,[status(thm),theory(equality)],[5,3]),
[iquote('para(5,3)')] ).
cnf(9,plain,
equal(multiply(double_divide(multiply(A,B),double_divide(B,C)),A),C),
inference(para,[status(thm),theory(equality)],[6,6]),
[iquote('para(6,6)')] ).
cnf(13,plain,
equal(multiply(double_divide(A,B),multiply(B,C)),double_divide(multiply(A,D),double_divide(D,C))),
inference(para,[status(thm),theory(equality)],[9,6]),
[iquote('para(9,6)')] ).
cnf(80,plain,
equal(double_divide(multiply(A,B),double_divide(B,multiply(C,A))),C),
inference(para,[status(thm),theory(equality)],[13,6]),
[iquote('para(13,6)')] ).
cnf(88,plain,
equal(inverse(A),multiply(double_divide(B,multiply(A,C)),multiply(C,B))),
inference(para,[status(thm),theory(equality)],[80,2]),
[iquote('para(80,2)')] ).
cnf(89,plain,
equal(multiply(double_divide(A,multiply(B,C)),multiply(C,A)),inverse(B)),
inference(flip,[status(thm),theory(equality)],[88]),
[iquote('flip(88)')] ).
cnf(99,plain,
equal(multiply(double_divide(A,multiply(B,C)),multiply(multiply(B,D),multiply(C,A))),D),
inference(para,[status(thm),theory(equality)],[80,3]),
[iquote('para(80,3)')] ).
cnf(101,plain,
equal(multiply(multiply(A,B),multiply(inverse(A),C)),multiply(B,C)),
inference(para,[status(thm),theory(equality)],[89,3]),
[iquote('para(89,3)')] ).
cnf(102,plain,
equal(multiply(multiply(double_divide(A,B),C),multiply(multiply(B,A),D)),multiply(C,D)),
inference(para,[status(thm),theory(equality)],[2,101]),
[iquote('para(2,101)')] ).
cnf(105,plain,
equal(multiply(double_divide(A,double_divide(A,multiply(B,C))),inverse(B)),C),
inference(para,[status(thm),theory(equality)],[89,6]),
[iquote('para(89,6)')] ).
cnf(106,plain,
equal(multiply(double_divide(A,double_divide(A,multiply(double_divide(B,C),D))),multiply(C,B)),D),
inference(para,[status(thm),theory(equality)],[2,105]),
[iquote('para(2,105)')] ).
cnf(114,plain,
equal(multiply(double_divide(inverse(A),B),multiply(B,C)),double_divide(D,double_divide(D,multiply(A,C)))),
inference(para,[status(thm),theory(equality)],[105,6]),
[iquote('para(105,6)')] ).
cnf(115,plain,
equal(double_divide(A,double_divide(A,multiply(B,C))),multiply(double_divide(inverse(B),D),multiply(D,C))),
inference(flip,[status(thm),theory(equality)],[114]),
[iquote('flip(114)')] ).
cnf(156,plain,
equal(double_divide(multiply(multiply(multiply(double_divide(A,B),C),A),D),double_divide(D,C)),B),
inference(para,[status(thm),theory(equality)],[13,9]),
[iquote('para(13,9)')] ).
cnf(159,plain,
equal(inverse(A),multiply(double_divide(B,C),multiply(multiply(multiply(double_divide(D,A),C),D),B))),
inference(para,[status(thm),theory(equality)],[156,2]),
[iquote('para(156,2)')] ).
cnf(163,plain,
equal(multiply(double_divide(A,B),multiply(multiply(C,multiply(B,D)),A)),multiply(C,D)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[159,2]),5]),
[iquote('para(159,2),demod([5])')] ).
cnf(221,plain,
equal(multiply(double_divide(multiply(multiply(A,B),C),D),multiply(D,multiply(E,C))),multiply(double_divide(B,A),E)),
inference(para,[status(thm),theory(equality)],[102,6]),
[iquote('para(102,6)')] ).
cnf(231,plain,
equal(multiply(double_divide(multiply(A,B),C),multiply(C,D)),double_divide(E,double_divide(E,multiply(double_divide(B,A),D)))),
inference(para,[status(thm),theory(equality)],[106,6]),
[iquote('para(106,6)')] ).
cnf(232,plain,
equal(double_divide(A,double_divide(A,multiply(double_divide(B,C),D))),multiply(double_divide(multiply(C,B),E),multiply(E,D))),
inference(flip,[status(thm),theory(equality)],[231]),
[iquote('flip(231)')] ).
cnf(260,plain,
equal(multiply(double_divide(A,double_divide(A,B)),C),multiply(B,C)),
inference(para,[status(thm),theory(equality)],[163,3]),
[iquote('para(163,3)')] ).
cnf(267,plain,
equal(multiply(multiply(A,B),inverse(A)),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[105]),260]),
[iquote('back_demod(105),demod([260])')] ).
cnf(272,plain,
equal(multiply(A,inverse(multiply(B,A))),inverse(B)),
inference(para,[status(thm),theory(equality)],[267,267]),
[iquote('para(267,267)')] ).
cnf(273,plain,
equal(inverse(multiply(A,B)),multiply(inverse(A),inverse(B))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[272,267]),1]),
[iquote('para(272,267),flip(1)')] ).
cnf(288,plain,
equal(multiply(double_divide(inverse(A),B),multiply(B,C)),multiply(A,C)),
inference(para,[status(thm),theory(equality)],[267,6]),
[iquote('para(267,6)')] ).
cnf(289,plain,
equal(double_divide(A,double_divide(A,multiply(B,C))),multiply(B,C)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[115]),288]),
[iquote('back_demod(115),demod([288])')] ).
cnf(291,plain,
equal(multiply(double_divide(multiply(A,B),C),multiply(C,D)),multiply(double_divide(B,A),D)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[232]),289]),1]),
[iquote('back_demod(232),demod([289]),flip(1)')] ).
cnf(292,plain,
equal(multiply(double_divide(A,multiply(B,C)),multiply(D,A)),multiply(double_divide(C,B),D)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[221]),291]),
[iquote('back_demod(221),demod([291])')] ).
cnf(298,plain,
equal(multiply(double_divide(A,B),A),inverse(B)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[89]),292]),
[iquote('back_demod(89),demod([292])')] ).
cnf(478,plain,
equal(multiply(inverse(A),multiply(A,B)),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[298,267]),2]),
[iquote('para(298,267),demod([2])')] ).
cnf(480,plain,
equal(multiply(A,inverse(inverse(B))),multiply(B,A)),
inference(para,[status(thm),theory(equality)],[478,267]),
[iquote('para(478,267)')] ).
cnf(481,plain,
equal(multiply(A,B),multiply(B,inverse(inverse(A)))),
inference(flip,[status(thm),theory(equality)],[480]),
[iquote('flip(480)')] ).
cnf(486,plain,
equal(multiply(inverse(inverse(A)),B),multiply(A,B)),
inference(para,[status(thm),theory(equality)],[478,478]),
[iquote('para(478,478)')] ).
cnf(505,plain,
equal(inverse(inverse(A)),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[481,267]),273,273,486,478]),
[iquote('para(481,267),demod([273,273,486,478])')] ).
cnf(528,plain,
equal(multiply(double_divide(inverse(A),A),B),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[101,99]),292]),
[iquote('para(101,99),demod([292])')] ).
cnf(645,plain,
equal(multiply(A,multiply(B,inverse(B))),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[528,267]),2]),
[iquote('para(528,267),demod([2])')] ).
cnf(646,plain,
equal(multiply(A,multiply(inverse(B),B)),A),
inference(para,[status(thm),theory(equality)],[505,645]),
[iquote('para(505,645)')] ).
cnf(789,plain,
equal(multiply(inverse(A),A),multiply(inverse(B),B)),
inference(para,[status(thm),theory(equality)],[646,478]),
[iquote('para(646,478)')] ).
cnf(790,plain,
$false,
inference(conflict,[status(thm)],[789,4]),
[iquote('conflict(789,4)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.07 % Problem : GRP601-1 : TPTP v8.1.0. Released v2.6.0.
% 0.02/0.07 % Command : tptp2X_and_run_eqp %s
% 0.06/0.26 % Computer : n011.cluster.edu
% 0.06/0.26 % Model : x86_64 x86_64
% 0.06/0.26 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.26 % Memory : 8042.1875MB
% 0.06/0.26 % OS : Linux 3.10.0-693.el7.x86_64
% 0.06/0.26 % CPULimit : 300
% 0.06/0.26 % WCLimit : 600
% 0.06/0.26 % DateTime : Mon Jun 13 21:11:03 EDT 2022
% 0.06/0.26 % CPUTime :
% 0.45/0.91 ----- EQP 0.9e, May 2009 -----
% 0.45/0.91 The job began on n011.cluster.edu, Mon Jun 13 21:11:04 2022
% 0.45/0.91 The command was "./eqp09e".
% 0.45/0.91
% 0.45/0.91 set(prolog_style_variables).
% 0.45/0.91 set(lrpo).
% 0.45/0.91 set(basic_paramod).
% 0.45/0.91 set(functional_subsume).
% 0.45/0.91 set(ordered_paramod).
% 0.45/0.91 set(prime_paramod).
% 0.45/0.91 set(para_pairs).
% 0.45/0.91 assign(pick_given_ratio,4).
% 0.45/0.91 clear(print_kept).
% 0.45/0.91 clear(print_new_demod).
% 0.45/0.91 clear(print_back_demod).
% 0.45/0.91 clear(print_given).
% 0.45/0.91 assign(max_mem,64000).
% 0.45/0.91 end_of_commands.
% 0.45/0.91
% 0.45/0.91 Usable:
% 0.45/0.91 end_of_list.
% 0.45/0.91
% 0.45/0.91 Sos:
% 0.45/0.91 0 (wt=-1) [] inverse(double_divide(inverse(double_divide(A,inverse(double_divide(B,double_divide(A,C))))),C)) = B.
% 0.45/0.91 0 (wt=-1) [] multiply(A,B) = inverse(double_divide(B,A)).
% 0.45/0.91 0 (wt=-1) [] -(multiply(inverse(a1),a1) = multiply(inverse(b1),b1)).
% 0.45/0.91 end_of_list.
% 0.45/0.91
% 0.45/0.91 Demodulators:
% 0.45/0.91 end_of_list.
% 0.45/0.91
% 0.45/0.91 Passive:
% 0.45/0.91 end_of_list.
% 0.45/0.91
% 0.45/0.91 Starting to process input.
% 0.45/0.91
% 0.45/0.91 ** KEPT: 1 (wt=14) [] inverse(double_divide(inverse(double_divide(A,inverse(double_divide(B,double_divide(A,C))))),C)) = B.
% 0.45/0.91 1 is a new demodulator.
% 0.45/0.91
% 0.45/0.91 ** KEPT: 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.45/0.91 2 is a new demodulator.
% 0.45/0.91 -> 2 back demodulating 1.
% 0.45/0.91
% 0.45/0.91 ** KEPT: 3 (wt=11) [back_demod(1),demod([2,2,2])] multiply(A,multiply(multiply(double_divide(B,A),C),B)) = C.
% 0.45/0.91 3 is a new demodulator.
% 0.45/0.91
% 0.45/0.91 ** KEPT: 4 (wt=9) [flip(1)] -(multiply(inverse(b1),b1) = multiply(inverse(a1),a1)).
% 0.45/0.91 ---------------- PROOF FOUND ----------------
% 0.45/0.91 % SZS status Unsatisfiable
% 0.45/0.91
% 0.45/0.91
% 0.45/0.91 After processing input:
% 0.45/0.91
% 0.45/0.91 Usable:
% 0.45/0.91 end_of_list.
% 0.45/0.91
% 0.45/0.91 Sos:
% 0.45/0.91 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.45/0.91 4 (wt=9) [flip(1)] -(multiply(inverse(b1),b1) = multiply(inverse(a1),a1)).
% 0.45/0.91 3 (wt=11) [back_demod(1),demod([2,2,2])] multiply(A,multiply(multiply(double_divide(B,A),C),B)) = C.
% 0.45/0.91 end_of_list.
% 0.45/0.91
% 0.45/0.91 Demodulators:
% 0.45/0.91 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.45/0.91 3 (wt=11) [back_demod(1),demod([2,2,2])] multiply(A,multiply(multiply(double_divide(B,A),C),B)) = C.
% 0.45/0.91 end_of_list.
% 0.45/0.91
% 0.45/0.91 Passive:
% 0.45/0.91 end_of_list.
% 0.45/0.91
% 0.45/0.91 UNIT CONFLICT from 789 and 4 at 0.04 seconds.
% 0.45/0.91
% 0.45/0.91 ---------------- PROOF ----------------
% 0.45/0.91 % SZS output start Refutation
% See solution above
% 0.45/0.91 ------------ end of proof -------------
% 0.45/0.91
% 0.45/0.91
% 0.45/0.91 ------------- memory usage ------------
% 0.45/0.91 Memory dynamically allocated (tp_alloc): 1464.
% 0.45/0.91 type (bytes each) gets frees in use avail bytes
% 0.45/0.91 sym_ent ( 96) 56 0 56 0 5.2 K
% 0.45/0.91 term ( 16) 39504 24743 14761 22 285.6 K
% 0.45/0.91 gen_ptr ( 8) 72031 11594 60437 42 472.5 K
% 0.45/0.91 context ( 808) 24083 24081 2 4 4.7 K
% 0.45/0.91 trail ( 12) 6841 6841 0 8 0.1 K
% 0.45/0.91 bt_node ( 68) 5584 5581 3 14 1.1 K
% 0.45/0.91 ac_position (285432) 0 0 0 0 0.0 K
% 0.45/0.91 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.45/0.91 ac_match_free_vars_pos (4020)
% 0.45/0.91 0 0 0 0 0.0 K
% 0.45/0.91 discrim ( 12) 10333 4471 5862 0 68.7 K
% 0.45/0.91 flat ( 40) 92841 92841 0 31 1.2 K
% 0.45/0.91 discrim_pos ( 12) 1234 1234 0 1 0.0 K
% 0.45/0.91 fpa_head ( 12) 3014 0 3014 0 35.3 K
% 0.45/0.91 fpa_tree ( 28) 1992 1992 0 19 0.5 K
% 0.45/0.91 fpa_pos ( 36) 1107 1107 0 1 0.0 K
% 0.45/0.91 literal ( 12) 2634 1845 789 1 9.3 K
% 0.45/0.91 clause ( 24) 2634 1845 789 1 18.5 K
% 0.45/0.91 list ( 12) 377 321 56 9 0.8 K
% 0.45/0.91 list_pos ( 20) 3340 1411 1929 0 37.7 K
% 0.45/0.91 pair_index ( 40) 2 0 2 0 0.1 K
% 0.45/0.91
% 0.45/0.91 -------------- statistics -------------
% 0.45/0.91 Clauses input 3
% 0.45/0.91 Usable input 0
% 0.45/0.91 Sos input 3
% 0.45/0.91 Demodulators input 0
% 0.45/0.91 Passive input 0
% 0.45/0.91
% 0.45/0.91 Processed BS (before search) 4
% 0.45/0.91 Forward subsumed BS 0
% 0.45/0.91 Kept BS 4
% 0.45/0.91 New demodulators BS 3
% 0.45/0.91 Back demodulated BS 1
% 0.45/0.91
% 0.45/0.91 Clauses or pairs given 1146
% 0.45/0.91 Clauses generated 1432
% 0.45/0.91 Forward subsumed 647
% 0.45/0.91 Deleted by weight 0
% 0.45/0.91 Deleted by variable count 0
% 0.45/0.91 Kept 785
% 0.45/0.91 New demodulators 315
% 0.45/0.91 Back demodulated 306
% 0.45/0.91 Ordered paramod prunes 0
% 0.45/0.91 Basic paramod prunes 3219
% 0.45/0.91 Prime paramod prunes 34
% 0.45/0.91 Semantic prunes 0
% 0.45/0.91
% 0.45/0.91 Rewrite attmepts 14001
% 0.45/0.91 Rewrites 805
% 0.45/0.91
% 0.45/0.91 FPA overloads 0
% 0.45/0.91 FPA underloads 0
% 0.45/0.91
% 0.45/0.91 Usable size 0
% 0.45/0.91 Sos size 481
% 0.45/0.91 Demodulators size 179
% 0.45/0.91 Passive size 0
% 0.45/0.91 Disabled size 307
% 0.45/0.91
% 0.45/0.91 Proofs found 1
% 0.45/0.91
% 0.45/0.91 ----------- times (seconds) ----------- Mon Jun 13 21:11:04 2022
% 0.45/0.91
% 0.45/0.91 user CPU time 0.04 (0 hr, 0 min, 0 sec)
% 0.45/0.91 system CPU time 0.04 (0 hr, 0 min, 0 sec)
% 0.45/0.91 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.45/0.91 input time 0.00
% 0.45/0.91 paramodulation time 0.01
% 0.45/0.91 demodulation time 0.00
% 0.45/0.91 orient time 0.00
% 0.45/0.91 weigh time 0.00
% 0.45/0.91 forward subsume time 0.00
% 0.45/0.91 back demod find time 0.00
% 0.45/0.91 conflict time 0.00
% 0.45/0.91 LRPO time 0.00
% 0.45/0.91 store clause time 0.01
% 0.45/0.91 disable clause time 0.00
% 0.45/0.91 prime paramod time 0.00
% 0.45/0.91 semantics time 0.00
% 0.45/0.91
% 0.45/0.91 EQP interrupted
%------------------------------------------------------------------------------