TSTP Solution File: GRP602-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP602-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n027.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:10 EDT 2022
% Result : Unsatisfiable 0.73s 1.11s
% Output : Refutation 0.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 13
% Number of leaves : 2
% Syntax : Number of clauses : 23 ( 23 unt; 0 nHn; 4 RR)
% Number of literals : 23 ( 0 equ; 3 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 : 68 ( 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('GRP602-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(multiply(inverse(b2),b2),a2),a2),
file('GRP602-1.p',unknown),
[] ).
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(7,plain,
equal(multiply(double_divide(multiply(multiply(double_divide(A,B),C),A),D),multiply(D,C)),B),
inference(para,[status(thm),theory(equality)],[3,6]),
[iquote('para(3,6)')] ).
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(79,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(82,plain,
equal(inverse(A),multiply(double_divide(B,multiply(A,C)),multiply(C,B))),
inference(para,[status(thm),theory(equality)],[79,2]),
[iquote('para(79,2)')] ).
cnf(83,plain,
equal(multiply(double_divide(A,multiply(B,C)),multiply(C,A)),inverse(B)),
inference(flip,[status(thm),theory(equality)],[82]),
[iquote('flip(82)')] ).
cnf(90,plain,
~ equal(multiply(multiply(multiply(double_divide(A,multiply(b2,B)),multiply(B,A)),b2),a2),a2),
inference(para,[status(thm),theory(equality)],[82,4]),
[iquote('para(82,4)')] ).
cnf(103,plain,
equal(multiply(double_divide(A,double_divide(A,multiply(B,C))),inverse(B)),C),
inference(para,[status(thm),theory(equality)],[83,6]),
[iquote('para(83,6)')] ).
cnf(104,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,103]),
[iquote('para(2,103)')] ).
cnf(160,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,7]),
[iquote('para(13,7)')] ).
cnf(163,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)],[160,2]),
[iquote('para(160,2)')] ).
cnf(165,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)],[163,2]),5]),
[iquote('para(163,2),demod([5])')] ).
cnf(239,plain,
equal(multiply(multiply(A,multiply(B,C)),D),multiply(B,multiply(multiply(A,C),D))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[165,3]),1]),
[iquote('para(165,3),flip(1)')] ).
cnf(248,plain,
~ equal(multiply(multiply(double_divide(A,multiply(b2,B)),A),multiply(multiply(B,b2),a2)),a2),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[90]),239,239]),
[iquote('back_demod(90),demod([239,239])')] ).
cnf(258,plain,
equal(multiply(double_divide(A,double_divide(A,B)),C),multiply(B,C)),
inference(para,[status(thm),theory(equality)],[165,3]),
[iquote('para(165,3)')] ).
cnf(264,plain,
equal(multiply(multiply(double_divide(A,B),C),multiply(B,A)),C),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[104]),258]),
[iquote('back_demod(104),demod([258])')] ).
cnf(265,plain,
$false,
inference(conflict,[status(thm)],[264,248]),
[iquote('conflict(264,248)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP602-1 : TPTP v8.1.0. Released v2.6.0.
% 0.07/0.13 % Command : tptp2X_and_run_eqp %s
% 0.12/0.34 % Computer : n027.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Mon Jun 13 23:13:47 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.73/1.11 ----- EQP 0.9e, May 2009 -----
% 0.73/1.11 The job began on n027.cluster.edu, Mon Jun 13 23:13:48 2022
% 0.73/1.11 The command was "./eqp09e".
% 0.73/1.11
% 0.73/1.11 set(prolog_style_variables).
% 0.73/1.11 set(lrpo).
% 0.73/1.11 set(basic_paramod).
% 0.73/1.11 set(functional_subsume).
% 0.73/1.11 set(ordered_paramod).
% 0.73/1.11 set(prime_paramod).
% 0.73/1.11 set(para_pairs).
% 0.73/1.11 assign(pick_given_ratio,4).
% 0.73/1.11 clear(print_kept).
% 0.73/1.11 clear(print_new_demod).
% 0.73/1.11 clear(print_back_demod).
% 0.73/1.11 clear(print_given).
% 0.73/1.11 assign(max_mem,64000).
% 0.73/1.11 end_of_commands.
% 0.73/1.11
% 0.73/1.11 Usable:
% 0.73/1.11 end_of_list.
% 0.73/1.11
% 0.73/1.11 Sos:
% 0.73/1.11 0 (wt=-1) [] inverse(double_divide(inverse(double_divide(A,inverse(double_divide(B,double_divide(A,C))))),C)) = B.
% 0.73/1.11 0 (wt=-1) [] multiply(A,B) = inverse(double_divide(B,A)).
% 0.73/1.11 0 (wt=-1) [] -(multiply(multiply(inverse(b2),b2),a2) = a2).
% 0.73/1.11 end_of_list.
% 0.73/1.11
% 0.73/1.11 Demodulators:
% 0.73/1.11 end_of_list.
% 0.73/1.11
% 0.73/1.11 Passive:
% 0.73/1.11 end_of_list.
% 0.73/1.11
% 0.73/1.11 Starting to process input.
% 0.73/1.11
% 0.73/1.11 ** KEPT: 1 (wt=14) [] inverse(double_divide(inverse(double_divide(A,inverse(double_divide(B,double_divide(A,C))))),C)) = B.
% 0.73/1.11 1 is a new demodulator.
% 0.73/1.11
% 0.73/1.11 ** KEPT: 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.73/1.11 2 is a new demodulator.
% 0.73/1.11 -> 2 back demodulating 1.
% 0.73/1.11
% 0.73/1.11 ** KEPT: 3 (wt=11) [back_demod(1),demod([2,2,2])] multiply(A,multiply(multiply(double_divide(B,A),C),B)) = C.
% 0.73/1.11 3 is a new demodulator.
% 0.73/1.11
% 0.73/1.11 ** KEPT: 4 (wt=8) [] -(multiply(multiply(inverse(b2),b2),a2) = a2).
% 0.73/1.11 ---------------- PROOF FOUND ----------------
% 0.73/1.11 % SZS status Unsatisfiable
% 0.73/1.11
% 0.73/1.11
% 0.73/1.11 After processing input:
% 0.73/1.11
% 0.73/1.11 Usable:
% 0.73/1.11 end_of_list.
% 0.73/1.11
% 0.73/1.11 Sos:
% 0.73/1.11 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.73/1.11 4 (wt=8) [] -(multiply(multiply(inverse(b2),b2),a2) = a2).
% 0.73/1.11 3 (wt=11) [back_demod(1),demod([2,2,2])] multiply(A,multiply(multiply(double_divide(B,A),C),B)) = C.
% 0.73/1.11 end_of_list.
% 0.73/1.11
% 0.73/1.11 Demodulators:
% 0.73/1.11 2 (wt=8) [flip(1)] inverse(double_divide(A,B)) = multiply(B,A).
% 0.73/1.11 3 (wt=11) [back_demod(1),demod([2,2,2])] multiply(A,multiply(multiply(double_divide(B,A),C),B)) = C.
% 0.73/1.11 end_of_list.
% 0.73/1.11
% 0.73/1.11 Passive:
% 0.73/1.11 end_of_list.
% 0.73/1.11
% 0.73/1.11 UNIT CONFLICT from 264 and 248 at 0.01 seconds.
% 0.73/1.11
% 0.73/1.11 ---------------- PROOF ----------------
% 0.73/1.11 % SZS output start Refutation
% See solution above
% 0.73/1.11 ------------ end of proof -------------
% 0.73/1.11
% 0.73/1.11
% 0.73/1.11 ------------- memory usage ------------
% 0.73/1.11 Memory dynamically allocated (tp_alloc): 488.
% 0.73/1.11 type (bytes each) gets frees in use avail bytes
% 0.73/1.11 sym_ent ( 96) 56 0 56 0 5.2 K
% 0.73/1.11 term ( 16) 12227 6805 5422 18 105.2 K
% 0.73/1.11 gen_ptr ( 8) 24362 1508 22854 22 178.7 K
% 0.73/1.11 context ( 808) 7871 7869 2 4 4.7 K
% 0.73/1.11 trail ( 12) 1097 1097 0 8 0.1 K
% 0.73/1.11 bt_node ( 68) 2393 2386 7 10 1.1 K
% 0.73/1.11 ac_position (285432) 0 0 0 0 0.0 K
% 0.73/1.11 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.73/1.11 ac_match_free_vars_pos (4020)
% 0.73/1.11 0 0 0 0 0.0 K
% 0.73/1.11 discrim ( 12) 4245 493 3752 77 44.9 K
% 0.73/1.11 flat ( 40) 28434 28434 0 31 1.2 K
% 0.73/1.11 discrim_pos ( 12) 174 174 0 1 0.0 K
% 0.73/1.11 fpa_head ( 12) 1870 0 1870 0 21.9 K
% 0.73/1.11 fpa_tree ( 28) 624 624 0 17 0.5 K
% 0.73/1.11 fpa_pos ( 36) 391 391 0 1 0.0 K
% 0.73/1.11 literal ( 12) 743 479 264 1 3.1 K
% 0.73/1.11 clause ( 24) 743 479 264 1 6.2 K
% 0.73/1.11 list ( 12) 186 129 57 3 0.7 K
% 0.73/1.11 list_pos ( 20) 972 129 843 4 16.5 K
% 0.73/1.11 pair_index ( 40) 2 0 2 0 0.1 K
% 0.73/1.11
% 0.73/1.11 -------------- statistics -------------
% 0.73/1.11 Clauses input 3
% 0.73/1.11 Usable input 0
% 0.73/1.11 Sos input 3
% 0.73/1.11 Demodulators input 0
% 0.73/1.11 Passive input 0
% 0.73/1.11
% 0.73/1.11 Processed BS (before search) 4
% 0.73/1.11 Forward subsumed BS 0
% 0.73/1.11 Kept BS 4
% 0.73/1.11 New demodulators BS 3
% 0.73/1.11 Back demodulated BS 1
% 0.73/1.11
% 0.73/1.11 Clauses or pairs given 342
% 0.73/1.11 Clauses generated 400
% 0.73/1.11 Forward subsumed 140
% 0.73/1.11 Deleted by weight 0
% 0.73/1.11 Deleted by variable count 0
% 0.73/1.11 Kept 260
% 0.73/1.11 New demodulators 124
% 0.73/1.11 Back demodulated 25
% 0.73/1.11 Ordered paramod prunes 0
% 0.73/1.11 Basic paramod prunes 1415
% 0.73/1.11 Prime paramod prunes 2
% 0.73/1.11 Semantic prunes 0
% 0.73/1.11
% 0.73/1.11 Rewrite attmepts 3998
% 0.73/1.11 Rewrites 91
% 0.73/1.11
% 0.73/1.11 FPA overloads 0
% 0.73/1.11 FPA underloads 0
% 0.73/1.11
% 0.73/1.11 Usable size 0
% 0.73/1.11 Sos size 237
% 0.73/1.11 Demodulators size 105
% 0.73/1.11 Passive size 0
% 0.73/1.11 Disabled size 26
% 0.73/1.11
% 0.73/1.11 Proofs found 1
% 0.73/1.11
% 0.73/1.11 ----------- times (seconds) ----------- Mon Jun 13 23:13:48 2022
% 0.73/1.11
% 0.73/1.11 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.73/1.11 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.73/1.11 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.73/1.11 input time 0.00
% 0.73/1.11 paramodulation time 0.00
% 0.73/1.11 demodulation time 0.00
% 0.73/1.11 orient time 0.00
% 0.73/1.11 weigh time 0.00
% 0.73/1.11 forward subsume time 0.00
% 0.73/1.11 back demod find time 0.00
% 0.73/1.11 conflict time 0.00
% 0.73/1.11 LRPO time 0.00
% 0.73/1.11 store clause time 0.00
% 0.73/1.11 disable clause time 0.00
% 0.73/1.11 prime paramod time 0.00
% 0.73/1.11 semantics time 0.00
% 0.73/1.11
% 0.73/1.11 EQP interrupted
%------------------------------------------------------------------------------