TSTP Solution File: GRP599-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP599-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n021.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.86s 1.26s
% Output : Refutation 0.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 25
% Number of leaves : 2
% Syntax : Number of clauses : 32 ( 32 unt; 0 nHn; 2 RR)
% Number of literals : 32 ( 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 : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 72 ( 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('GRP599-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(a3,b3),c3),multiply(a3,multiply(b3,c3))),
file('GRP599-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(15,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(71,plain,
equal(double_divide(A,multiply(inverse(A),inverse(B))),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[15,7]),3]),
[iquote('para(15,7),demod([3])')] ).
cnf(72,plain,
equal(double_divide(double_divide(A,B),multiply(multiply(B,A),inverse(C))),C),
inference(para,[status(thm),theory(equality)],[2,71]),
[iquote('para(2,71)')] ).
cnf(74,plain,
equal(multiply(multiply(inverse(A),inverse(B)),A),inverse(B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[71,2]),1]),
[iquote('para(71,2),flip(1)')] ).
cnf(78,plain,
equal(double_divide(A,multiply(multiply(multiply(inverse(B),inverse(A)),inverse(C)),B)),C),
inference(para,[status(thm),theory(equality)],[71,3]),
[iquote('para(71,3)')] ).
cnf(80,plain,
equal(double_divide(double_divide(A,inverse(A)),inverse(B)),B),
inference(para,[status(thm),theory(equality)],[74,3]),
[iquote('para(74,3)')] ).
cnf(82,plain,
equal(double_divide(double_divide(A,inverse(A)),multiply(B,C)),double_divide(C,B)),
inference(para,[status(thm),theory(equality)],[2,80]),
[iquote('para(2,80)')] ).
cnf(86,plain,
equal(double_divide(double_divide(inverse(A),inverse(inverse(B))),inverse(A)),B),
inference(para,[status(thm),theory(equality)],[74,72]),
[iquote('para(74,72)')] ).
cnf(98,plain,
equal(double_divide(inverse(A),multiply(inverse(B),B)),A),
inference(para,[status(thm),theory(equality)],[82,72]),
[iquote('para(82,72)')] ).
cnf(99,plain,
equal(multiply(multiply(inverse(A),A),inverse(B)),inverse(B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[98,2]),1]),
[iquote('para(98,2),flip(1)')] ).
cnf(100,plain,
equal(double_divide(A,multiply(inverse(B),inverse(A))),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[98,3]),99]),
[iquote('para(98,3),demod([99])')] ).
cnf(101,plain,
equal(multiply(multiply(inverse(A),inverse(B)),B),inverse(A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[100,2]),1]),
[iquote('para(100,2),flip(1)')] ).
cnf(103,plain,
equal(inverse(inverse(inverse(A))),inverse(A)),
inference(para,[status(thm),theory(equality)],[101,99]),
[iquote('para(101,99)')] ).
cnf(105,plain,
equal(inverse(inverse(A)),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[103,71]),71]),1]),
[iquote('para(103,71),demod([71]),flip(1)')] ).
cnf(115,plain,
equal(double_divide(double_divide(inverse(A),B),inverse(A)),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[86]),105]),
[iquote('back_demod(86),demod([105])')] ).
cnf(124,plain,
equal(double_divide(A,multiply(inverse(A),B)),inverse(B)),
inference(para,[status(thm),theory(equality)],[105,71]),
[iquote('para(105,71)')] ).
cnf(130,plain,
equal(double_divide(double_divide(A,B),A),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[105,115]),105]),
[iquote('para(105,115),demod([105])')] ).
cnf(133,plain,
equal(inverse(A),multiply(B,double_divide(B,A))),
inference(para,[status(thm),theory(equality)],[130,2]),
[iquote('para(130,2)')] ).
cnf(134,plain,
equal(multiply(A,double_divide(A,B)),inverse(B)),
inference(flip,[status(thm),theory(equality)],[133]),
[iquote('flip(133)')] ).
cnf(170,plain,
equal(double_divide(A,inverse(B)),multiply(B,inverse(A))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[134,124]),2]),
[iquote('para(134,124),demod([2])')] ).
cnf(172,plain,
equal(multiply(inverse(A),inverse(B)),double_divide(B,A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[105,170]),1]),
[iquote('para(105,170),flip(1)')] ).
cnf(178,plain,
equal(double_divide(A,multiply(multiply(double_divide(A,B),inverse(C)),B)),C),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[78]),172]),
[iquote('back_demod(78),demod([172])')] ).
cnf(315,plain,
equal(multiply(double_divide(A,B),inverse(C)),double_divide(C,multiply(B,A))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[2,170]),1]),
[iquote('para(2,170),flip(1)')] ).
cnf(316,plain,
equal(double_divide(A,multiply(double_divide(B,multiply(C,A)),C)),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[178]),315]),
[iquote('back_demod(178),demod([315])')] ).
cnf(1001,plain,
equal(double_divide(A,multiply(B,C)),double_divide(multiply(C,A),B)),
inference(para,[status(thm),theory(equality)],[130,316]),
[iquote('para(130,316)')] ).
cnf(1834,plain,
equal(multiply(multiply(A,B),C),multiply(A,multiply(B,C))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1001,2]),2]),1]),
[iquote('para(1001,2),demod([2]),flip(1)')] ).
cnf(1835,plain,
$false,
inference(conflict,[status(thm)],[1834,4]),
[iquote('conflict(1834,4)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.08 % Problem : GRP599-1 : TPTP v8.1.0. Released v2.6.0.
% 0.00/0.09 % Command : tptp2X_and_run_eqp %s
% 0.08/0.28 % Computer : n021.cluster.edu
% 0.08/0.28 % Model : x86_64 x86_64
% 0.08/0.28 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.28 % Memory : 8042.1875MB
% 0.08/0.28 % OS : Linux 3.10.0-693.el7.x86_64
% 0.08/0.28 % CPULimit : 300
% 0.08/0.28 % WCLimit : 600
% 0.08/0.28 % DateTime : Mon Jun 13 08:12:26 EDT 2022
% 0.08/0.28 % CPUTime :
% 0.86/1.26 ----- EQP 0.9e, May 2009 -----
% 0.86/1.26 The job began on n021.cluster.edu, Mon Jun 13 08:12:27 2022
% 0.86/1.26 The command was "./eqp09e".
% 0.86/1.26
% 0.86/1.26 set(prolog_style_variables).
% 0.86/1.26 set(lrpo).
% 0.86/1.26 set(basic_paramod).
% 0.86/1.26 set(functional_subsume).
% 0.86/1.26 set(ordered_paramod).
% 0.86/1.26 set(prime_paramod).
% 0.86/1.26 set(para_pairs).
% 0.86/1.26 assign(pick_given_ratio,4).
% 0.86/1.26 clear(print_kept).
% 0.86/1.26 clear(print_new_demod).
% 0.86/1.26 clear(print_back_demod).
% 0.86/1.26 clear(print_given).
% 0.86/1.26 assign(max_mem,64000).
% 0.86/1.26 end_of_commands.
% 0.86/1.26
% 0.86/1.26 Usable:
% 0.86/1.26 end_of_list.
% 0.86/1.26
% 0.86/1.26 Sos:
% 0.86/1.26 0 (wt=-1) [] double_divide(double_divide(A,B),inverse(double_divide(A,inverse(double_divide(inverse(C),B))))) = C.
% 0.86/1.26 0 (wt=-1) [] multiply(A,B) = inverse(double_divide(B,A)).
% 0.86/1.26 0 (wt=-1) [] -(multiply(multiply(a3,b3),c3) = multiply(a3,multiply(b3,c3))).
% 0.86/1.26 end_of_list.
% 0.86/1.26
% 0.86/1.26 Demodulators:
% 0.86/1.26 end_of_list.
% 0.86/1.26
% 0.86/1.26 Passive:
% 0.86/1.26 end_of_list.
% 0.86/1.26
% 0.86/1.26 Starting to process input.
% 0.86/1.26
% 0.86/1.26 ** KEPT: 1 (wt=14) [] double_divide(double_divide(A,B),inverse(double_divide(A,inverse(double_divide(inverse(C),B))))) = C.
% 0.86/1.26 1 is a new demodulator.
% 0.86/1.26
% 0.86/1.26 ** KEPT: 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.86/1.26 2 is a new demodulator.
% 0.86/1.26 -> 2 back demodulating 1.
% 0.86/1.26
% 0.86/1.26 ** KEPT: 3 (wt=12) [back_demod(1),demod([2,2])] double_divide(double_divide(A,B),multiply(multiply(B,inverse(C)),A)) = C.
% 0.86/1.26 3 is a new demodulator.
% 0.86/1.26
% 0.86/1.26 ** KEPT: 4 (wt=11) [] -(multiply(multiply(a3,b3),c3) = multiply(a3,multiply(b3,c3))).
% 0.86/1.26 ---------------- PROOF FOUND ----------------
% 0.86/1.26 % SZS status Unsatisfiable
% 0.86/1.26
% 0.86/1.26
% 0.86/1.26 After processing input:
% 0.86/1.26
% 0.86/1.26 Usable:
% 0.86/1.26 end_of_list.
% 0.86/1.26
% 0.86/1.26 Sos:
% 0.86/1.26 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.86/1.26 4 (wt=11) [] -(multiply(multiply(a3,b3),c3) = multiply(a3,multiply(b3,c3))).
% 0.86/1.26 3 (wt=12) [back_demod(1),demod([2,2])] double_divide(double_divide(A,B),multiply(multiply(B,inverse(C)),A)) = C.
% 0.86/1.26 end_of_list.
% 0.86/1.26
% 0.86/1.26 Demodulators:
% 0.86/1.26 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.86/1.26 3 (wt=12) [back_demod(1),demod([2,2])] double_divide(double_divide(A,B),multiply(multiply(B,inverse(C)),A)) = C.
% 0.86/1.26 end_of_list.
% 0.86/1.26
% 0.86/1.26 Passive:
% 0.86/1.26 end_of_list.
% 0.86/1.26
% 0.86/1.26 UNIT CONFLICT from 1834 and 4 at 0.12 seconds.
% 0.86/1.26
% 0.86/1.26 ---------------- PROOF ----------------
% 0.86/1.26 % SZS output start Refutation
% See solution above
% 0.86/1.26 ------------ end of proof -------------
% 0.86/1.26
% 0.86/1.26
% 0.86/1.26 ------------- memory usage ------------
% 0.86/1.26 Memory dynamically allocated (tp_alloc): 2441.
% 0.86/1.26 type (bytes each) gets frees in use avail bytes
% 0.86/1.26 sym_ent ( 96) 57 0 57 0 5.3 K
% 0.86/1.26 term ( 16) 138162 109780 28382 19 547.5 K
% 0.86/1.26 gen_ptr ( 8) 145443 30121 115322 31 901.2 K
% 0.86/1.26 context ( 808) 110547 110545 2 3 3.9 K
% 0.86/1.26 trail ( 12) 11016 11016 0 10 0.1 K
% 0.86/1.26 bt_node ( 68) 46659 46656 3 24 1.8 K
% 0.86/1.26 ac_position (285432) 0 0 0 0 0.0 K
% 0.86/1.26 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.86/1.26 ac_match_free_vars_pos (4020)
% 0.86/1.26 0 0 0 0 0.0 K
% 0.86/1.26 discrim ( 12) 19265 6012 13253 219 157.9 K
% 0.86/1.26 flat ( 40) 297980 297980 0 37 1.4 K
% 0.86/1.26 discrim_pos ( 12) 5917 5917 0 1 0.0 K
% 0.86/1.26 fpa_head ( 12) 4503 0 4503 0 52.8 K
% 0.86/1.26 fpa_tree ( 28) 5840 5840 0 25 0.7 K
% 0.86/1.26 fpa_pos ( 36) 2647 2647 0 1 0.0 K
% 0.86/1.26 literal ( 12) 8804 6970 1834 1 21.5 K
% 0.86/1.26 clause ( 24) 8804 6970 1834 1 43.0 K
% 0.86/1.26 list ( 12) 872 816 56 4 0.7 K
% 0.86/1.26 list_pos ( 20) 6891 1421 5470 0 106.8 K
% 0.86/1.26 pair_index ( 40) 2 0 2 0 0.1 K
% 0.86/1.26
% 0.86/1.26 -------------- statistics -------------
% 0.86/1.26 Clauses input 3
% 0.86/1.26 Usable input 0
% 0.86/1.26 Sos input 3
% 0.86/1.26 Demodulators input 0
% 0.86/1.26 Passive input 0
% 0.86/1.26
% 0.86/1.26 Processed BS (before search) 4
% 0.86/1.26 Forward subsumed BS 0
% 0.86/1.26 Kept BS 4
% 0.86/1.26 New demodulators BS 3
% 0.86/1.26 Back demodulated BS 1
% 0.86/1.26
% 0.86/1.26 Clauses or pairs given 12449
% 0.86/1.26 Clauses generated 5409
% 0.86/1.26 Forward subsumed 3579
% 0.86/1.26 Deleted by weight 0
% 0.86/1.26 Deleted by variable count 0
% 0.86/1.26 Kept 1830
% 0.86/1.26 New demodulators 810
% 0.86/1.26 Back demodulated 287
% 0.86/1.26 Ordered paramod prunes 0
% 0.86/1.26 Basic paramod prunes 47275
% 0.86/1.26 Prime paramod prunes 505
% 0.86/1.26 Semantic prunes 0
% 0.86/1.26
% 0.86/1.26 Rewrite attmepts 44119
% 0.86/1.26 Rewrites 3848
% 0.86/1.26
% 0.86/1.26 FPA overloads 0
% 0.86/1.26 FPA underloads 0
% 0.86/1.26
% 0.86/1.26 Usable size 0
% 0.86/1.26 Sos size 1545
% 0.86/1.26 Demodulators size 547
% 0.86/1.26 Passive size 0
% 0.86/1.26 Disabled size 288
% 0.86/1.26
% 0.86/1.26 Proofs found 1
% 0.86/1.26
% 0.86/1.26 ----------- times (seconds) ----------- Mon Jun 13 08:12:27 2022
% 0.86/1.26
% 0.86/1.26 user CPU time 0.12 (0 hr, 0 min, 0 sec)
% 0.86/1.26 system CPU time 0.14 (0 hr, 0 min, 0 sec)
% 0.86/1.26 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.86/1.26 input time 0.00
% 0.86/1.26 paramodulation time 0.04
% 0.86/1.26 demodulation time 0.01
% 0.86/1.26 orient time 0.02
% 0.86/1.26 weigh time 0.00
% 0.86/1.26 forward subsume time 0.01
% 0.86/1.26 back demod find time 0.00
% 0.86/1.26 conflict time 0.00
% 0.86/1.26 LRPO time 0.00
% 0.86/1.26 store clause time 0.01
% 0.86/1.26 disable clause time 0.00
% 0.86/1.26 prime paramod time 0.01
% 0.86/1.26 semantics time 0.00
% 0.86/1.26
% 0.86/1.26 EQP interrupted
%------------------------------------------------------------------------------