TSTP Solution File: GRP523-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP523-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:47:48 EDT 2022
% Result : Unsatisfiable 0.75s 1.26s
% Output : Refutation 0.75s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 4
% Syntax : Number of clauses : 26 ( 26 unt; 0 nHn; 3 RR)
% Number of literals : 26 ( 0 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 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 : 55 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(divide(A,divide(B,divide(C,divide(A,B)))),C),
file('GRP523-1.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,B),divide(A,divide(divide(C,C),B))),
file('GRP523-1.p',unknown),
[] ).
cnf(3,plain,
equal(divide(A,divide(divide(B,B),C)),multiply(A,C)),
inference(flip,[status(thm),theory(equality)],[2]),
[iquote('flip(2)')] ).
cnf(4,plain,
equal(inverse(A),divide(divide(B,B),A)),
file('GRP523-1.p',unknown),
[] ).
cnf(5,plain,
equal(divide(divide(A,A),B),inverse(B)),
inference(flip,[status(thm),theory(equality)],[4]),
[iquote('flip(4)')] ).
cnf(6,plain,
~ equal(multiply(multiply(a3,b3),c3),multiply(a3,multiply(b3,c3))),
file('GRP523-1.p',unknown),
[] ).
cnf(7,plain,
equal(divide(divide(A,A),B),divide(divide(C,C),B)),
inference(para,[status(thm),theory(equality)],[4,4]),
[iquote('para(4,4)')] ).
cnf(13,plain,
equal(divide(A,divide(divide(B,divide(C,A)),B)),C),
inference(para,[status(thm),theory(equality)],[1,1]),
[iquote('para(1,1)')] ).
cnf(30,plain,
equal(divide(divide(A,A),divide(B,multiply(C,B))),C),
inference(para,[status(thm),theory(equality)],[3,1]),
[iquote('para(3,1)')] ).
cnf(50,plain,
equal(divide(A,inverse(B)),multiply(A,B)),
inference(para,[status(thm),theory(equality)],[5,3]),
[iquote('para(5,3)')] ).
cnf(51,plain,
equal(multiply(A,B),divide(A,inverse(B))),
inference(flip,[status(thm),theory(equality)],[50]),
[iquote('flip(50)')] ).
cnf(72,plain,
equal(divide(A,A),divide(B,B)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[7,1]),1]),
[iquote('para(7,1),demod([1])')] ).
cnf(74,plain,
equal(inverse(divide(A,A)),divide(B,B)),
inference(para,[status(thm),theory(equality)],[5,72]),
[iquote('para(5,72)')] ).
cnf(197,plain,
equal(multiply(A,divide(B,A)),B),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[13,3]),1]),
[iquote('para(13,3),flip(1)')] ).
cnf(199,plain,
equal(divide(A,inverse(divide(B,A))),B),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[197,51]),1]),
[iquote('para(197,51),flip(1)')] ).
cnf(204,plain,
equal(divide(A,divide(B,B)),A),
inference(para,[status(thm),theory(equality)],[74,199]),
[iquote('para(74,199)')] ).
cnf(253,plain,
equal(inverse(divide(A,multiply(B,A))),B),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[30,5]),1]),
[iquote('para(30,5),flip(1)')] ).
cnf(254,plain,
equal(divide(multiply(A,B),A),B),
inference(para,[status(thm),theory(equality)],[253,199]),
[iquote('para(253,199)')] ).
cnf(348,plain,
~ equal(divide(multiply(a3,b3),inverse(c3)),multiply(a3,multiply(b3,c3))),
inference(para,[status(thm),theory(equality)],[51,6]),
[iquote('para(51,6)')] ).
cnf(355,plain,
equal(divide(A,divide(A,B)),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[72,1]),204]),
[iquote('para(72,1),demod([204])')] ).
cnf(358,plain,
equal(divide(multiply(A,B),B),A),
inference(para,[status(thm),theory(equality)],[254,355]),
[iquote('para(254,355)')] ).
cnf(364,plain,
equal(divide(A,multiply(A,B)),inverse(B)),
inference(para,[status(thm),theory(equality)],[50,355]),
[iquote('para(50,355)')] ).
cnf(646,plain,
equal(divide(multiply(A,B),divide(B,divide(C,A))),C),
inference(para,[status(thm),theory(equality)],[358,1]),
[iquote('para(358,1)')] ).
cnf(702,plain,
equal(divide(multiply(A,B),divide(B,C)),multiply(A,C)),
inference(para,[status(thm),theory(equality)],[254,646]),
[iquote('para(254,646)')] ).
cnf(1164,plain,
equal(divide(multiply(A,B),inverse(C)),multiply(A,multiply(B,C))),
inference(para,[status(thm),theory(equality)],[364,702]),
[iquote('para(364,702)')] ).
cnf(1165,plain,
$false,
inference(conflict,[status(thm)],[1164,348]),
[iquote('conflict(1164,348)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : GRP523-1 : TPTP v8.1.0. Released v2.6.0.
% 0.03/0.14 % Command : tptp2X_and_run_eqp %s
% 0.13/0.35 % Computer : n021.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Tue Jun 14 09:50:58 EDT 2022
% 0.13/0.36 % CPUTime :
% 0.75/1.26 ----- EQP 0.9e, May 2009 -----
% 0.75/1.26 The job began on n021.cluster.edu, Tue Jun 14 09:50:58 2022
% 0.75/1.26 The command was "./eqp09e".
% 0.75/1.26
% 0.75/1.26 set(prolog_style_variables).
% 0.75/1.26 set(lrpo).
% 0.75/1.26 set(basic_paramod).
% 0.75/1.26 set(functional_subsume).
% 0.75/1.26 set(ordered_paramod).
% 0.75/1.26 set(prime_paramod).
% 0.75/1.26 set(para_pairs).
% 0.75/1.26 assign(pick_given_ratio,4).
% 0.75/1.26 clear(print_kept).
% 0.75/1.26 clear(print_new_demod).
% 0.75/1.26 clear(print_back_demod).
% 0.75/1.26 clear(print_given).
% 0.75/1.26 assign(max_mem,64000).
% 0.75/1.26 end_of_commands.
% 0.75/1.26
% 0.75/1.26 Usable:
% 0.75/1.26 end_of_list.
% 0.75/1.26
% 0.75/1.26 Sos:
% 0.75/1.26 0 (wt=-1) [] divide(A,divide(B,divide(C,divide(A,B)))) = C.
% 0.75/1.26 0 (wt=-1) [] multiply(A,B) = divide(A,divide(divide(C,C),B)).
% 0.75/1.26 0 (wt=-1) [] inverse(A) = divide(divide(B,B),A).
% 0.75/1.26 0 (wt=-1) [] -(multiply(multiply(a3,b3),c3) = multiply(a3,multiply(b3,c3))).
% 0.75/1.26 end_of_list.
% 0.75/1.26
% 0.75/1.26 Demodulators:
% 0.75/1.26 end_of_list.
% 0.75/1.26
% 0.75/1.26 Passive:
% 0.75/1.26 end_of_list.
% 0.75/1.26
% 0.75/1.26 Starting to process input.
% 0.75/1.26
% 0.75/1.26 ** KEPT: 1 (wt=11) [] divide(A,divide(B,divide(C,divide(A,B)))) = C.
% 0.75/1.26 1 is a new demodulator.
% 0.75/1.26
% 0.75/1.26 ** KEPT: 2 (wt=11) [] multiply(A,B) = divide(A,divide(divide(C,C),B)).
% 0.75/1.26
% 0.75/1.26 ** KEPT: 3 (wt=11) [flip(2)] divide(A,divide(divide(B,B),C)) = multiply(A,C).
% 0.75/1.26 clause forward subsumed: 0 (wt=11) [flip(3)] multiply(A,C) = divide(A,divide(divide(B,B),C)).
% 0.75/1.26
% 0.75/1.26 ** KEPT: 4 (wt=8) [] inverse(A) = divide(divide(B,B),A).
% 0.75/1.26
% 0.75/1.26 ** KEPT: 5 (wt=8) [flip(4)] divide(divide(A,A),B) = inverse(B).
% 0.75/1.26 clause forward subsumed: 0 (wt=8) [flip(5)] inverse(B) = divide(divide(A,A),B).
% 0.75/1.26
% 0.75/1.26 ** KEPT: 6 (wt=11) [] -(multiply(multiply(a3,b3),c3) = multiply(a3,multiply(b3,c3))).
% 0.75/1.26 ---------------- PROOF FOUND ----------------
% 0.75/1.26 % SZS status Unsatisfiable
% 0.75/1.26
% 0.75/1.26
% 0.75/1.26 After processing input:
% 0.75/1.26
% 0.75/1.26 Usable:
% 0.75/1.26 end_of_list.
% 0.75/1.26
% 0.75/1.26 Sos:
% 0.75/1.26 4 (wt=8) [] inverse(A) = divide(divide(B,B),A).
% 0.75/1.26 5 (wt=8) [flip(4)] divide(divide(A,A),B) = inverse(B).
% 0.75/1.26 1 (wt=11) [] divide(A,divide(B,divide(C,divide(A,B)))) = C.
% 0.75/1.26 2 (wt=11) [] multiply(A,B) = divide(A,divide(divide(C,C),B)).
% 0.75/1.26 3 (wt=11) [flip(2)] divide(A,divide(divide(B,B),C)) = multiply(A,C).
% 0.75/1.26 6 (wt=11) [] -(multiply(multiply(a3,b3),c3) = multiply(a3,multiply(b3,c3))).
% 0.75/1.26 end_of_list.
% 0.75/1.26
% 0.75/1.26 Demodulators:
% 0.75/1.26 1 (wt=11) [] divide(A,divide(B,divide(C,divide(A,B)))) = C.
% 0.75/1.26 end_of_list.
% 0.75/1.26
% 0.75/1.26 Passive:
% 0.75/1.26 end_of_list.
% 0.75/1.26
% 0.75/1.26 UNIT CONFLICT from 1164 and 348 at 0.06 seconds.
% 0.75/1.26
% 0.75/1.26 ---------------- PROOF ----------------
% 0.75/1.26 % SZS output start Refutation
% See solution above
% 0.75/1.26 ------------ end of proof -------------
% 0.75/1.26
% 0.75/1.26
% 0.75/1.26 ------------- memory usage ------------
% 0.75/1.26 Memory dynamically allocated (tp_alloc): 1464.
% 0.75/1.26 type (bytes each) gets frees in use avail bytes
% 0.75/1.26 sym_ent ( 96) 57 0 57 0 5.3 K
% 0.75/1.26 term ( 16) 95097 77148 17949 13 346.3 K
% 0.75/1.26 gen_ptr ( 8) 99951 26210 73741 25 576.3 K
% 0.75/1.26 context ( 808) 63993 63991 2 3 3.9 K
% 0.75/1.26 trail ( 12) 10561 10561 0 9 0.1 K
% 0.75/1.26 bt_node ( 68) 27385 27382 3 18 1.4 K
% 0.75/1.26 ac_position (285432) 0 0 0 0 0.0 K
% 0.75/1.26 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.75/1.26 ac_match_free_vars_pos (4020)
% 0.75/1.26 0 0 0 0 0.0 K
% 0.75/1.26 discrim ( 12) 11888 5408 6480 178 78.0 K
% 0.75/1.26 flat ( 40) 196311 196311 0 35 1.4 K
% 0.75/1.26 discrim_pos ( 12) 5009 5009 0 1 0.0 K
% 0.75/1.26 fpa_head ( 12) 2700 0 2700 0 31.6 K
% 0.75/1.26 fpa_tree ( 28) 2986 2986 0 23 0.6 K
% 0.75/1.26 fpa_pos ( 36) 1674 1674 0 1 0.0 K
% 0.75/1.26 literal ( 12) 6556 5392 1164 1 13.7 K
% 0.75/1.26 clause ( 24) 6556 5392 1164 1 27.3 K
% 0.75/1.26 list ( 12) 569 513 56 6 0.7 K
% 0.75/1.26 list_pos ( 20) 5055 2305 2750 27 54.2 K
% 0.75/1.26 pair_index ( 40) 2 0 2 0 0.1 K
% 0.75/1.26
% 0.75/1.26 -------------- statistics -------------
% 0.75/1.26 Clauses input 4
% 0.75/1.26 Usable input 0
% 0.75/1.26 Sos input 4
% 0.75/1.26 Demodulators input 0
% 0.75/1.26 Passive input 0
% 0.75/1.26
% 0.75/1.26 Processed BS (before search) 8
% 0.75/1.26 Forward subsumed BS 2
% 0.75/1.26 Kept BS 6
% 0.75/1.26 New demodulators BS 1
% 0.75/1.26 Back demodulated BS 0
% 0.75/1.26
% 0.75/1.26 Clauses or pairs given 5532
% 0.75/1.26 Clauses generated 3882
% 0.75/1.26 Forward subsumed 2724
% 0.75/1.26 Deleted by weight 0
% 0.75/1.26 Deleted by variable count 0
% 0.75/1.26 Kept 1158
% 0.75/1.26 New demodulators 509
% 0.75/1.26 Back demodulated 511
% 0.75/1.26 Ordered paramod prunes 0
% 0.75/1.26 Basic paramod prunes 13796
% 0.75/1.26 Prime paramod prunes 488
% 0.75/1.26 Semantic prunes 0
% 0.75/1.26
% 0.75/1.26 Rewrite attmepts 27739
% 0.75/1.26 Rewrites 3082
% 0.75/1.26
% 0.75/1.26 FPA overloads 0
% 0.75/1.26 FPA underloads 0
% 0.75/1.26
% 0.75/1.26 Usable size 0
% 0.75/1.26 Sos size 652
% 0.75/1.26 Demodulators size 283
% 0.75/1.26 Passive size 0
% 0.75/1.26 Disabled size 511
% 0.75/1.26
% 0.75/1.26 Proofs found 1
% 0.75/1.26
% 0.75/1.26 ----------- times (seconds) ----------- Tue Jun 14 09:50:58 2022
% 0.75/1.26
% 0.75/1.26 user CPU time 0.06 (0 hr, 0 min, 0 sec)
% 0.75/1.26 system CPU time 0.10 (0 hr, 0 min, 0 sec)
% 0.75/1.26 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.75/1.26 input time 0.00
% 0.75/1.26 paramodulation time 0.02
% 0.75/1.26 demodulation time 0.01
% 0.75/1.26 orient time 0.01
% 0.75/1.26 weigh time 0.00
% 0.75/1.26 forward subsume time 0.01
% 0.75/1.26 back demod find time 0.00
% 0.75/1.26 conflict time 0.00
% 0.75/1.26 LRPO time 0.00
% 0.75/1.26 store clause time 0.01
% 0.75/1.26 disable clause time 0.00
% 0.75/1.26 prime paramod time 0.01
% 0.75/1.26 semantics time 0.00
% 0.75/1.26
% 0.75/1.26 EQP interrupted
%------------------------------------------------------------------------------