TSTP Solution File: GRP522-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP522-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n006.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.77s 1.16s
% Output : Refutation 0.77s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 4
% Syntax : Number of clauses : 22 ( 22 unt; 0 nHn; 2 RR)
% Number of literals : 22 ( 0 equ; 1 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 : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 44 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(divide(A,divide(B,divide(C,divide(A,B)))),C),
file('GRP522-1.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,B),divide(A,divide(divide(C,C),B))),
file('GRP522-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('GRP522-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(inverse(b2),b2),a2),a2),
file('GRP522-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(12,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(53,plain,
equal(divide(A,inverse(B)),multiply(A,B)),
inference(para,[status(thm),theory(equality)],[5,3]),
[iquote('para(5,3)')] ).
cnf(54,plain,
equal(multiply(A,B),divide(A,inverse(B))),
inference(flip,[status(thm),theory(equality)],[53]),
[iquote('flip(53)')] ).
cnf(59,plain,
equal(divide(multiply(inverse(A),A),B),inverse(B)),
inference(para,[status(thm),theory(equality)],[53,5]),
[iquote('para(53,5)')] ).
cnf(71,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(73,plain,
equal(inverse(divide(A,A)),divide(B,B)),
inference(para,[status(thm),theory(equality)],[5,71]),
[iquote('para(5,71)')] ).
cnf(107,plain,
equal(inverse(inverse(A)),multiply(multiply(inverse(B),B),A)),
inference(para,[status(thm),theory(equality)],[59,53]),
[iquote('para(59,53)')] ).
cnf(108,plain,
equal(multiply(multiply(inverse(A),A),B),inverse(inverse(B))),
inference(flip,[status(thm),theory(equality)],[107]),
[iquote('flip(107)')] ).
cnf(149,plain,
equal(multiply(A,divide(B,A)),B),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[12,3]),1]),
[iquote('para(12,3),flip(1)')] ).
cnf(151,plain,
equal(divide(A,inverse(divide(B,A))),B),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[149,54]),1]),
[iquote('para(149,54),flip(1)')] ).
cnf(155,plain,
equal(inverse(inverse(divide(A,divide(B,B)))),A),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[151,5]),1]),
[iquote('para(151,5),flip(1)')] ).
cnf(157,plain,
equal(divide(A,divide(B,B)),A),
inference(para,[status(thm),theory(equality)],[73,151]),
[iquote('para(73,151)')] ).
cnf(158,plain,
equal(inverse(inverse(A)),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[155]),157]),
[iquote('back_demod(155),demod([157])')] ).
cnf(159,plain,
equal(multiply(multiply(inverse(A),A),B),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[108]),158]),
[iquote('back_demod(108),demod([158])')] ).
cnf(160,plain,
$false,
inference(conflict,[status(thm)],[159,6]),
[iquote('conflict(159,6)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP522-1 : TPTP v8.1.0. Released v2.6.0.
% 0.07/0.13 % Command : tptp2X_and_run_eqp %s
% 0.14/0.34 % Computer : n006.cluster.edu
% 0.14/0.34 % Model : x86_64 x86_64
% 0.14/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34 % Memory : 8042.1875MB
% 0.14/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34 % CPULimit : 300
% 0.14/0.34 % WCLimit : 600
% 0.14/0.34 % DateTime : Tue Jun 14 07:52:56 EDT 2022
% 0.14/0.34 % CPUTime :
% 0.77/1.16 ----- EQP 0.9e, May 2009 -----
% 0.77/1.16 The job began on n006.cluster.edu, Tue Jun 14 07:52:57 2022
% 0.77/1.16 The command was "./eqp09e".
% 0.77/1.16
% 0.77/1.16 set(prolog_style_variables).
% 0.77/1.16 set(lrpo).
% 0.77/1.16 set(basic_paramod).
% 0.77/1.16 set(functional_subsume).
% 0.77/1.16 set(ordered_paramod).
% 0.77/1.16 set(prime_paramod).
% 0.77/1.16 set(para_pairs).
% 0.77/1.16 assign(pick_given_ratio,4).
% 0.77/1.16 clear(print_kept).
% 0.77/1.16 clear(print_new_demod).
% 0.77/1.16 clear(print_back_demod).
% 0.77/1.16 clear(print_given).
% 0.77/1.16 assign(max_mem,64000).
% 0.77/1.16 end_of_commands.
% 0.77/1.16
% 0.77/1.16 Usable:
% 0.77/1.16 end_of_list.
% 0.77/1.16
% 0.77/1.16 Sos:
% 0.77/1.16 0 (wt=-1) [] divide(A,divide(B,divide(C,divide(A,B)))) = C.
% 0.77/1.16 0 (wt=-1) [] multiply(A,B) = divide(A,divide(divide(C,C),B)).
% 0.77/1.16 0 (wt=-1) [] inverse(A) = divide(divide(B,B),A).
% 0.77/1.16 0 (wt=-1) [] -(multiply(multiply(inverse(b2),b2),a2) = a2).
% 0.77/1.16 end_of_list.
% 0.77/1.16
% 0.77/1.16 Demodulators:
% 0.77/1.16 end_of_list.
% 0.77/1.16
% 0.77/1.16 Passive:
% 0.77/1.16 end_of_list.
% 0.77/1.16
% 0.77/1.16 Starting to process input.
% 0.77/1.16
% 0.77/1.16 ** KEPT: 1 (wt=11) [] divide(A,divide(B,divide(C,divide(A,B)))) = C.
% 0.77/1.16 1 is a new demodulator.
% 0.77/1.16
% 0.77/1.16 ** KEPT: 2 (wt=11) [] multiply(A,B) = divide(A,divide(divide(C,C),B)).
% 0.77/1.16
% 0.77/1.16 ** KEPT: 3 (wt=11) [flip(2)] divide(A,divide(divide(B,B),C)) = multiply(A,C).
% 0.77/1.16 clause forward subsumed: 0 (wt=11) [flip(3)] multiply(A,C) = divide(A,divide(divide(B,B),C)).
% 0.77/1.16
% 0.77/1.16 ** KEPT: 4 (wt=8) [] inverse(A) = divide(divide(B,B),A).
% 0.77/1.16
% 0.77/1.16 ** KEPT: 5 (wt=8) [flip(4)] divide(divide(A,A),B) = inverse(B).
% 0.77/1.16 clause forward subsumed: 0 (wt=8) [flip(5)] inverse(B) = divide(divide(A,A),B).
% 0.77/1.16
% 0.77/1.16 ** KEPT: 6 (wt=8) [] -(multiply(multiply(inverse(b2),b2),a2) = a2).
% 0.77/1.16 ---------------- PROOF FOUND ----------------
% 0.77/1.16 % SZS status Unsatisfiable
% 0.77/1.16
% 0.77/1.16
% 0.77/1.16 After processing input:
% 0.77/1.16
% 0.77/1.16 Usable:
% 0.77/1.16 end_of_list.
% 0.77/1.16
% 0.77/1.16 Sos:
% 0.77/1.16 4 (wt=8) [] inverse(A) = divide(divide(B,B),A).
% 0.77/1.16 5 (wt=8) [flip(4)] divide(divide(A,A),B) = inverse(B).
% 0.77/1.16 6 (wt=8) [] -(multiply(multiply(inverse(b2),b2),a2) = a2).
% 0.77/1.16 1 (wt=11) [] divide(A,divide(B,divide(C,divide(A,B)))) = C.
% 0.77/1.16 2 (wt=11) [] multiply(A,B) = divide(A,divide(divide(C,C),B)).
% 0.77/1.16 3 (wt=11) [flip(2)] divide(A,divide(divide(B,B),C)) = multiply(A,C).
% 0.77/1.16 end_of_list.
% 0.77/1.16
% 0.77/1.16 Demodulators:
% 0.77/1.16 1 (wt=11) [] divide(A,divide(B,divide(C,divide(A,B)))) = C.
% 0.77/1.16 end_of_list.
% 0.77/1.16
% 0.77/1.16 Passive:
% 0.77/1.16 end_of_list.
% 0.77/1.16
% 0.77/1.16 UNIT CONFLICT from 159 and 6 at 0.00 seconds.
% 0.77/1.16
% 0.77/1.16 ---------------- PROOF ----------------
% 0.77/1.16 % SZS output start Refutation
% See solution above
% 0.77/1.16 ------------ end of proof -------------
% 0.77/1.16
% 0.77/1.16
% 0.77/1.16 ------------- memory usage ------------
% 0.77/1.16 Memory dynamically allocated (tp_alloc): 488.
% 0.77/1.16 type (bytes each) gets frees in use avail bytes
% 0.77/1.16 sym_ent ( 96) 56 0 56 0 5.2 K
% 0.77/1.16 term ( 16) 5350 3414 1936 14 37.5 K
% 0.77/1.16 gen_ptr ( 8) 7583 532 7051 21 55.2 K
% 0.77/1.16 context ( 808) 4010 4008 2 2 3.2 K
% 0.77/1.16 trail ( 12) 692 692 0 6 0.1 K
% 0.77/1.16 bt_node ( 68) 1136 1132 4 9 0.9 K
% 0.77/1.16 ac_position (285432) 0 0 0 0 0.0 K
% 0.77/1.16 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.77/1.16 ac_match_free_vars_pos (4020)
% 0.77/1.16 0 0 0 0 0.0 K
% 0.77/1.16 discrim ( 12) 1318 60 1258 15 14.9 K
% 0.77/1.16 flat ( 40) 9536 9536 0 21 0.8 K
% 0.77/1.16 discrim_pos ( 12) 123 123 0 1 0.0 K
% 0.77/1.16 fpa_head ( 12) 892 0 892 0 10.5 K
% 0.77/1.16 fpa_tree ( 28) 233 233 0 15 0.4 K
% 0.77/1.16 fpa_pos ( 36) 198 198 0 1 0.0 K
% 0.77/1.16 literal ( 12) 537 378 159 1 1.9 K
% 0.77/1.16 clause ( 24) 537 378 159 1 3.8 K
% 0.77/1.16 list ( 12) 98 40 58 1 0.7 K
% 0.77/1.16 list_pos ( 20) 581 41 540 3 10.6 K
% 0.77/1.16 pair_index ( 40) 2 0 2 0 0.1 K
% 0.77/1.16
% 0.77/1.16 -------------- statistics -------------
% 0.77/1.16 Clauses input 4
% 0.77/1.16 Usable input 0
% 0.77/1.16 Sos input 4
% 0.77/1.16 Demodulators input 0
% 0.77/1.16 Passive input 0
% 0.77/1.16
% 0.77/1.16 Processed BS (before search) 8
% 0.77/1.16 Forward subsumed BS 2
% 0.77/1.16 Kept BS 6
% 0.77/1.16 New demodulators BS 1
% 0.77/1.16 Back demodulated BS 0
% 0.77/1.16
% 0.77/1.16 Clauses or pairs given 267
% 0.77/1.16 Clauses generated 270
% 0.77/1.16 Forward subsumed 117
% 0.77/1.16 Deleted by weight 0
% 0.77/1.16 Deleted by variable count 0
% 0.77/1.16 Kept 153
% 0.77/1.16 New demodulators 38
% 0.77/1.16 Back demodulated 9
% 0.77/1.16 Ordered paramod prunes 0
% 0.77/1.16 Basic paramod prunes 286
% 0.77/1.16 Prime paramod prunes 1
% 0.77/1.16 Semantic prunes 0
% 0.77/1.16
% 0.77/1.16 Rewrite attmepts 1724
% 0.77/1.16 Rewrites 18
% 0.77/1.16
% 0.77/1.16 FPA overloads 0
% 0.77/1.16 FPA underloads 0
% 0.77/1.16
% 0.77/1.16 Usable size 0
% 0.77/1.16 Sos size 149
% 0.77/1.16 Demodulators size 38
% 0.77/1.16 Passive size 0
% 0.77/1.16 Disabled size 9
% 0.77/1.16
% 0.77/1.16 Proofs found 1
% 0.77/1.16
% 0.77/1.16 ----------- times (seconds) ----------- Tue Jun 14 07:52:57 2022
% 0.77/1.16
% 0.77/1.16 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.77/1.16 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.77/1.16 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.77/1.16 input time 0.00
% 0.77/1.16 paramodulation time 0.00
% 0.77/1.16 demodulation time 0.00
% 0.77/1.16 orient time 0.00
% 0.77/1.16 weigh time 0.00
% 0.77/1.16 forward subsume time 0.00
% 0.77/1.16 back demod find time 0.00
% 0.77/1.16 conflict time 0.00
% 0.77/1.16 LRPO time 0.00
% 0.77/1.16 store clause time 0.00
% 0.77/1.16 disable clause time 0.00
% 0.77/1.16 prime paramod time 0.00
% 0.77/1.16 semantics time 0.00
% 0.77/1.16
% 0.77/1.16 EQP interrupted
%------------------------------------------------------------------------------