TSTP Solution File: GRP563-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP563-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n017.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:47:59 EDT 2022
% Result : Unsatisfiable 0.72s 1.16s
% Output : Refutation 0.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 3
% Syntax : Number of clauses : 25 ( 25 unt; 0 nHn; 4 RR)
% Number of literals : 25 ( 0 equ; 3 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 : 52 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(divide(divide(divide(A,inverse(B)),C),divide(A,C)),B),
file('GRP563-1.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,B),divide(A,inverse(B))),
file('GRP563-1.p',unknown),
[] ).
cnf(3,plain,
equal(divide(A,inverse(B)),multiply(A,B)),
inference(flip,[status(thm),theory(equality)],[2]),
[iquote('flip(2)')] ).
cnf(4,plain,
~ equal(multiply(multiply(a3,b3),c3),multiply(a3,multiply(b3,c3))),
file('GRP563-1.p',unknown),
[] ).
cnf(6,plain,
~ equal(divide(multiply(a3,b3),inverse(c3)),multiply(a3,multiply(b3,c3))),
inference(para,[status(thm),theory(equality)],[2,4]),
[iquote('para(2,4)')] ).
cnf(8,plain,
equal(divide(divide(divide(divide(divide(A,inverse(B)),C),inverse(D)),divide(A,C)),B),D),
inference(para,[status(thm),theory(equality)],[1,1]),
[iquote('para(1,1)')] ).
cnf(9,plain,
equal(divide(divide(multiply(A,B),C),divide(A,C)),B),
inference(para,[status(thm),theory(equality)],[3,1]),
[iquote('para(3,1)')] ).
cnf(12,plain,
equal(divide(multiply(multiply(A,B),C),divide(A,inverse(C))),B),
inference(para,[status(thm),theory(equality)],[3,9]),
[iquote('para(3,9)')] ).
cnf(14,plain,
equal(divide(multiply(multiply(A,B),C),multiply(A,C)),B),
inference(para,[status(thm),theory(equality)],[3,12]),
[iquote('para(3,12)')] ).
cnf(17,plain,
equal(divide(A,divide(multiply(B,A),multiply(B,C))),C),
inference(para,[status(thm),theory(equality)],[14,9]),
[iquote('para(14,9)')] ).
cnf(46,plain,
equal(divide(divide(A,inverse(B)),A),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[8,8]),1]),
[iquote('para(8,8),demod([1])')] ).
cnf(48,plain,
equal(divide(multiply(A,B),A),B),
inference(para,[status(thm),theory(equality)],[3,46]),
[iquote('para(3,46)')] ).
cnf(51,plain,
equal(multiply(multiply(inverse(A),B),A),B),
inference(para,[status(thm),theory(equality)],[3,48]),
[iquote('para(3,48)')] ).
cnf(52,plain,
equal(divide(A,multiply(inverse(B),A)),B),
inference(para,[status(thm),theory(equality)],[48,46]),
[iquote('para(48,46)')] ).
cnf(57,plain,
equal(divide(A,divide(B,B)),A),
inference(para,[status(thm),theory(equality)],[48,9]),
[iquote('para(48,9)')] ).
cnf(59,plain,
equal(multiply(divide(A,A),B),B),
inference(para,[status(thm),theory(equality)],[57,48]),
[iquote('para(57,48)')] ).
cnf(71,plain,
equal(divide(multiply(A,B),B),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[59,14]),59]),
[iquote('para(59,14),demod([59])')] ).
cnf(77,plain,
equal(multiply(inverse(A),B),divide(B,A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[51,71]),1]),
[iquote('para(51,71),flip(1)')] ).
cnf(78,plain,
equal(divide(A,divide(A,B)),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[52]),77]),
[iquote('back_demod(52),demod([77])')] ).
cnf(93,plain,
equal(divide(A,multiply(A,B)),inverse(B)),
inference(para,[status(thm),theory(equality)],[3,78]),
[iquote('para(3,78)')] ).
cnf(94,plain,
equal(inverse(A),divide(B,multiply(B,A))),
inference(flip,[status(thm),theory(equality)],[93]),
[iquote('flip(93)')] ).
cnf(202,plain,
equal(divide(multiply(A,B),multiply(A,C)),divide(B,C)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[17,78]),1]),
[iquote('para(17,78),flip(1)')] ).
cnf(327,plain,
equal(divide(multiply(A,B),divide(B,C)),multiply(A,C)),
inference(para,[status(thm),theory(equality)],[202,78]),
[iquote('para(202,78)')] ).
cnf(474,plain,
~ equal(divide(multiply(a3,b3),divide(A,multiply(A,c3))),multiply(a3,multiply(b3,c3))),
inference(para,[status(thm),theory(equality)],[94,6]),
[iquote('para(94,6)')] ).
cnf(475,plain,
$false,
inference(conflict,[status(thm)],[474,327]),
[iquote('conflict(474,327)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11 % Problem : GRP563-1 : TPTP v8.1.0. Released v2.6.0.
% 0.11/0.12 % Command : tptp2X_and_run_eqp %s
% 0.11/0.33 % Computer : n017.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Mon Jun 13 16:49:38 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.72/1.16 ----- EQP 0.9e, May 2009 -----
% 0.72/1.16 The job began on n017.cluster.edu, Mon Jun 13 16:49:38 2022
% 0.72/1.16 The command was "./eqp09e".
% 0.72/1.16
% 0.72/1.16 set(prolog_style_variables).
% 0.72/1.16 set(lrpo).
% 0.72/1.16 set(basic_paramod).
% 0.72/1.16 set(functional_subsume).
% 0.72/1.16 set(ordered_paramod).
% 0.72/1.16 set(prime_paramod).
% 0.72/1.16 set(para_pairs).
% 0.72/1.16 assign(pick_given_ratio,4).
% 0.72/1.16 clear(print_kept).
% 0.72/1.16 clear(print_new_demod).
% 0.72/1.16 clear(print_back_demod).
% 0.72/1.16 clear(print_given).
% 0.72/1.16 assign(max_mem,64000).
% 0.72/1.16 end_of_commands.
% 0.72/1.16
% 0.72/1.16 Usable:
% 0.72/1.16 end_of_list.
% 0.72/1.16
% 0.72/1.16 Sos:
% 0.72/1.16 0 (wt=-1) [] divide(divide(divide(A,inverse(B)),C),divide(A,C)) = B.
% 0.72/1.16 0 (wt=-1) [] multiply(A,B) = divide(A,inverse(B)).
% 0.72/1.16 0 (wt=-1) [] -(multiply(multiply(a3,b3),c3) = multiply(a3,multiply(b3,c3))).
% 0.72/1.16 end_of_list.
% 0.72/1.16
% 0.72/1.16 Demodulators:
% 0.72/1.16 end_of_list.
% 0.72/1.16
% 0.72/1.16 Passive:
% 0.72/1.16 end_of_list.
% 0.72/1.16
% 0.72/1.16 Starting to process input.
% 0.72/1.16
% 0.72/1.16 ** KEPT: 1 (wt=12) [] divide(divide(divide(A,inverse(B)),C),divide(A,C)) = B.
% 0.72/1.16 1 is a new demodulator.
% 0.72/1.16
% 0.72/1.16 ** KEPT: 2 (wt=8) [] multiply(A,B) = divide(A,inverse(B)).
% 0.72/1.16
% 0.72/1.16 ** KEPT: 3 (wt=8) [flip(2)] divide(A,inverse(B)) = multiply(A,B).
% 0.72/1.16 clause forward subsumed: 0 (wt=8) [flip(3)] multiply(A,B) = divide(A,inverse(B)).
% 0.72/1.16
% 0.72/1.16 ** KEPT: 4 (wt=11) [] -(multiply(multiply(a3,b3),c3) = multiply(a3,multiply(b3,c3))).
% 0.72/1.16 ---------------- PROOF FOUND ----------------
% 0.72/1.16 % SZS status Unsatisfiable
% 0.72/1.16
% 0.72/1.16
% 0.72/1.16 After processing input:
% 0.72/1.16
% 0.72/1.16 Usable:
% 0.72/1.16 end_of_list.
% 0.72/1.16
% 0.72/1.16 Sos:
% 0.72/1.16 2 (wt=8) [] multiply(A,B) = divide(A,inverse(B)).
% 0.72/1.16 3 (wt=8) [flip(2)] divide(A,inverse(B)) = multiply(A,B).
% 0.72/1.16 4 (wt=11) [] -(multiply(multiply(a3,b3),c3) = multiply(a3,multiply(b3,c3))).
% 0.72/1.16 1 (wt=12) [] divide(divide(divide(A,inverse(B)),C),divide(A,C)) = B.
% 0.72/1.16 end_of_list.
% 0.72/1.16
% 0.72/1.16 Demodulators:
% 0.72/1.16 1 (wt=12) [] divide(divide(divide(A,inverse(B)),C),divide(A,C)) = B.
% 0.72/1.16 end_of_list.
% 0.72/1.16
% 0.72/1.16 Passive:
% 0.72/1.16 end_of_list.
% 0.72/1.16
% 0.72/1.16 UNIT CONFLICT from 474 and 327 at 0.03 seconds.
% 0.72/1.16
% 0.72/1.16 ---------------- PROOF ----------------
% 0.72/1.16 % SZS output start Refutation
% See solution above
% 0.72/1.16 ------------ end of proof -------------
% 0.72/1.16
% 0.72/1.16
% 0.72/1.16 ------------- memory usage ------------
% 0.72/1.16 Memory dynamically allocated (tp_alloc): 488.
% 0.72/1.16 type (bytes each) gets frees in use avail bytes
% 0.72/1.16 sym_ent ( 96) 57 0 57 0 5.3 K
% 0.72/1.16 term ( 16) 38891 32693 6198 17 119.5 K
% 0.72/1.16 gen_ptr ( 8) 36168 11905 24263 24 189.7 K
% 0.72/1.16 context ( 808) 32225 32223 2 3 3.9 K
% 0.72/1.16 trail ( 12) 4265 4265 0 6 0.1 K
% 0.72/1.16 bt_node ( 68) 19279 19277 2 18 1.3 K
% 0.72/1.16 ac_position (285432) 0 0 0 0 0.0 K
% 0.72/1.16 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.72/1.16 ac_match_free_vars_pos (4020)
% 0.72/1.16 0 0 0 0 0.0 K
% 0.72/1.16 discrim ( 12) 4923 2397 2526 0 29.6 K
% 0.72/1.16 flat ( 40) 59361 59361 0 25 1.0 K
% 0.72/1.16 discrim_pos ( 12) 2288 2288 0 1 0.0 K
% 0.72/1.16 fpa_head ( 12) 1825 0 1825 0 21.4 K
% 0.72/1.16 fpa_tree ( 28) 1227 1227 0 23 0.6 K
% 0.72/1.16 fpa_pos ( 36) 769 769 0 1 0.0 K
% 0.72/1.16 literal ( 12) 2745 2271 474 1 5.6 K
% 0.72/1.16 clause ( 24) 2745 2271 474 1 11.1 K
% 0.72/1.16 list ( 12) 354 298 56 3 0.7 K
% 0.72/1.16 list_pos ( 20) 2069 859 1210 0 23.6 K
% 0.72/1.16 pair_index ( 40) 2 0 2 0 0.1 K
% 0.72/1.16
% 0.72/1.16 -------------- statistics -------------
% 0.72/1.16 Clauses input 3
% 0.72/1.16 Usable input 0
% 0.72/1.16 Sos input 3
% 0.72/1.16 Demodulators input 0
% 0.72/1.16 Passive input 0
% 0.72/1.16
% 0.72/1.16 Processed BS (before search) 5
% 0.72/1.16 Forward subsumed BS 1
% 0.72/1.16 Kept BS 4
% 0.72/1.16 New demodulators BS 1
% 0.72/1.16 Back demodulated BS 0
% 0.72/1.16
% 0.72/1.16 Clauses or pairs given 3000
% 0.72/1.16 Clauses generated 1805
% 0.72/1.16 Forward subsumed 1335
% 0.72/1.16 Deleted by weight 0
% 0.72/1.16 Deleted by variable count 0
% 0.72/1.16 Kept 470
% 0.72/1.16 New demodulators 294
% 0.72/1.16 Back demodulated 176
% 0.72/1.16 Ordered paramod prunes 0
% 0.72/1.16 Basic paramod prunes 7254
% 0.72/1.16 Prime paramod prunes 262
% 0.72/1.16 Semantic prunes 0
% 0.72/1.16
% 0.72/1.16 Rewrite attmepts 10489
% 0.72/1.16 Rewrites 1566
% 0.72/1.16
% 0.72/1.16 FPA overloads 0
% 0.72/1.16 FPA underloads 0
% 0.72/1.16
% 0.72/1.16 Usable size 0
% 0.72/1.16 Sos size 297
% 0.72/1.16 Demodulators size 143
% 0.72/1.16 Passive size 0
% 0.72/1.16 Disabled size 176
% 0.72/1.16
% 0.72/1.16 Proofs found 1
% 0.72/1.16
% 0.72/1.16 ----------- times (seconds) ----------- Mon Jun 13 16:49:39 2022
% 0.72/1.16
% 0.72/1.16 user CPU time 0.03 (0 hr, 0 min, 0 sec)
% 0.72/1.16 system CPU time 0.06 (0 hr, 0 min, 0 sec)
% 0.72/1.16 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 0.72/1.16 input time 0.00
% 0.72/1.16 paramodulation time 0.00
% 0.72/1.16 demodulation time 0.00
% 0.72/1.16 orient time 0.00
% 0.72/1.16 weigh time 0.00
% 0.72/1.16 forward subsume time 0.00
% 0.72/1.16 back demod find time 0.00
% 0.72/1.16 conflict time 0.00
% 0.72/1.16 LRPO time 0.00
% 0.72/1.16 store clause time 0.00
% 0.72/1.16 disable clause time 0.00
% 0.72/1.16 prime paramod time 0.00
% 0.72/1.16 semantics time 0.00
% 0.72/1.16
% 0.72/1.16 EQP interrupted
%------------------------------------------------------------------------------