TSTP Solution File: GRP554-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP554-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n010.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:57 EDT 2022
% Result : Unsatisfiable 0.72s 1.09s
% Output : Refutation 0.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 8
% Number of leaves : 3
% Syntax : Number of clauses : 17 ( 17 unt; 0 nHn; 3 RR)
% Number of literals : 17 ( 0 equ; 2 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 : 5 ( 5 usr; 2 con; 0-2 aty)
% Number of variables : 37 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(divide(divide(A,inverse(divide(B,divide(A,C)))),C),B),
file('GRP554-1.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,B),divide(A,inverse(B))),
file('GRP554-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(inverse(b2),b2),a2),a2),
file('GRP554-1.p',unknown),
[] ).
cnf(5,plain,
~ equal(multiply(divide(inverse(b2),inverse(b2)),a2),a2),
inference(para,[status(thm),theory(equality)],[2,4]),
[iquote('para(2,4)')] ).
cnf(6,plain,
equal(divide(divide(divide(A,inverse(divide(B,divide(A,C)))),inverse(divide(D,B))),C),D),
inference(para,[status(thm),theory(equality)],[1,1]),
[iquote('para(1,1)')] ).
cnf(7,plain,
equal(divide(A,inverse(divide(B,divide(A,divide(C,D))))),divide(divide(C,inverse(B)),D)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[1,1]),1]),
[iquote('para(1,1),flip(1)')] ).
cnf(10,plain,
equal(divide(multiply(A,divide(B,divide(A,C))),C),B),
inference(para,[status(thm),theory(equality)],[3,1]),
[iquote('para(3,1)')] ).
cnf(16,plain,
equal(divide(A,inverse(divide(B,A))),B),
inference(para,[status(thm),theory(equality)],[1,6]),
[iquote('para(1,6)')] ).
cnf(17,plain,
equal(multiply(A,divide(B,A)),B),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[16,3]),1]),
[iquote('para(16,3),flip(1)')] ).
cnf(27,plain,
equal(divide(divide(divide(A,inverse(B)),C),divide(A,C)),B),
inference(para,[status(thm),theory(equality)],[7,1]),
[iquote('para(7,1)')] ).
cnf(31,plain,
equal(divide(divide(multiply(A,B),C),divide(A,C)),B),
inference(para,[status(thm),theory(equality)],[3,27]),
[iquote('para(3,27)')] ).
cnf(33,plain,
equal(divide(divide(A,B),divide(C,B)),divide(A,C)),
inference(para,[status(thm),theory(equality)],[17,31]),
[iquote('para(17,31)')] ).
cnf(34,plain,
equal(divide(multiply(A,B),A),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[31]),33]),
[iquote('back_demod(31),demod([33])')] ).
cnf(50,plain,
equal(divide(A,divide(B,B)),A),
inference(para,[status(thm),theory(equality)],[34,10]),
[iquote('para(34,10)')] ).
cnf(51,plain,
equal(multiply(divide(A,A),B),B),
inference(para,[status(thm),theory(equality)],[50,34]),
[iquote('para(50,34)')] ).
cnf(52,plain,
$false,
inference(conflict,[status(thm)],[51,5]),
[iquote('conflict(51,5)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP554-1 : TPTP v8.1.0. Released v2.6.0.
% 0.07/0.13 % Command : tptp2X_and_run_eqp %s
% 0.13/0.34 % Computer : n010.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jun 13 09:12:09 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.72/1.09 ----- EQP 0.9e, May 2009 -----
% 0.72/1.09 The job began on n010.cluster.edu, Mon Jun 13 09:12:10 2022
% 0.72/1.09 The command was "./eqp09e".
% 0.72/1.09
% 0.72/1.09 set(prolog_style_variables).
% 0.72/1.09 set(lrpo).
% 0.72/1.09 set(basic_paramod).
% 0.72/1.09 set(functional_subsume).
% 0.72/1.09 set(ordered_paramod).
% 0.72/1.09 set(prime_paramod).
% 0.72/1.09 set(para_pairs).
% 0.72/1.09 assign(pick_given_ratio,4).
% 0.72/1.09 clear(print_kept).
% 0.72/1.09 clear(print_new_demod).
% 0.72/1.09 clear(print_back_demod).
% 0.72/1.09 clear(print_given).
% 0.72/1.09 assign(max_mem,64000).
% 0.72/1.09 end_of_commands.
% 0.72/1.09
% 0.72/1.09 Usable:
% 0.72/1.09 end_of_list.
% 0.72/1.09
% 0.72/1.09 Sos:
% 0.72/1.09 0 (wt=-1) [] divide(divide(A,inverse(divide(B,divide(A,C)))),C) = B.
% 0.72/1.09 0 (wt=-1) [] multiply(A,B) = divide(A,inverse(B)).
% 0.72/1.09 0 (wt=-1) [] -(multiply(multiply(inverse(b2),b2),a2) = a2).
% 0.72/1.09 end_of_list.
% 0.72/1.09
% 0.72/1.09 Demodulators:
% 0.72/1.09 end_of_list.
% 0.72/1.09
% 0.72/1.09 Passive:
% 0.72/1.09 end_of_list.
% 0.72/1.09
% 0.72/1.09 Starting to process input.
% 0.72/1.09
% 0.72/1.09 ** KEPT: 1 (wt=12) [] divide(divide(A,inverse(divide(B,divide(A,C)))),C) = B.
% 0.72/1.09 1 is a new demodulator.
% 0.72/1.09
% 0.72/1.09 ** KEPT: 2 (wt=8) [] multiply(A,B) = divide(A,inverse(B)).
% 0.72/1.09
% 0.72/1.09 ** KEPT: 3 (wt=8) [flip(2)] divide(A,inverse(B)) = multiply(A,B).
% 0.72/1.09 clause forward subsumed: 0 (wt=8) [flip(3)] multiply(A,B) = divide(A,inverse(B)).
% 0.72/1.09
% 0.72/1.09 ** KEPT: 4 (wt=8) [] -(multiply(multiply(inverse(b2),b2),a2) = a2).
% 0.72/1.09 ---------------- PROOF FOUND ----------------
% 0.72/1.09 % SZS status Unsatisfiable
% 0.72/1.09
% 0.72/1.09
% 0.72/1.09 After processing input:
% 0.72/1.09
% 0.72/1.09 Usable:
% 0.72/1.09 end_of_list.
% 0.72/1.09
% 0.72/1.09 Sos:
% 0.72/1.09 2 (wt=8) [] multiply(A,B) = divide(A,inverse(B)).
% 0.72/1.09 3 (wt=8) [flip(2)] divide(A,inverse(B)) = multiply(A,B).
% 0.72/1.09 4 (wt=8) [] -(multiply(multiply(inverse(b2),b2),a2) = a2).
% 0.72/1.09 1 (wt=12) [] divide(divide(A,inverse(divide(B,divide(A,C)))),C) = B.
% 0.72/1.09 end_of_list.
% 0.72/1.09
% 0.72/1.09 Demodulators:
% 0.72/1.09 1 (wt=12) [] divide(divide(A,inverse(divide(B,divide(A,C)))),C) = B.
% 0.72/1.09 end_of_list.
% 0.72/1.09
% 0.72/1.09 Passive:
% 0.72/1.09 end_of_list.
% 0.72/1.09
% 0.72/1.09 UNIT CONFLICT from 51 and 5 at 0.00 seconds.
% 0.72/1.09
% 0.72/1.09 ---------------- PROOF ----------------
% 0.72/1.09 % SZS output start Refutation
% See solution above
% 0.72/1.09 ------------ end of proof -------------
% 0.72/1.09
% 0.72/1.09
% 0.72/1.09 ------------- memory usage ------------
% 0.72/1.09 Memory dynamically allocated (tp_alloc): 488.
% 0.72/1.09 type (bytes each) gets frees in use avail bytes
% 0.72/1.09 sym_ent ( 96) 56 0 56 0 5.2 K
% 0.72/1.09 term ( 16) 2394 1652 742 18 14.6 K
% 0.72/1.09 gen_ptr ( 8) 3318 271 3047 16 23.9 K
% 0.72/1.09 context ( 808) 2036 2034 2 2 3.2 K
% 0.72/1.09 trail ( 12) 311 311 0 6 0.1 K
% 0.72/1.09 bt_node ( 68) 975 972 3 12 1.0 K
% 0.72/1.09 ac_position (285432) 0 0 0 0 0.0 K
% 0.72/1.09 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.72/1.09 ac_match_free_vars_pos (4020)
% 0.72/1.09 0 0 0 0 0.0 K
% 0.72/1.09 discrim ( 12) 710 26 684 0 8.0 K
% 0.72/1.09 flat ( 40) 3670 3670 0 27 1.1 K
% 0.72/1.09 discrim_pos ( 12) 32 32 0 1 0.0 K
% 0.72/1.09 fpa_head ( 12) 519 0 519 0 6.1 K
% 0.72/1.09 fpa_tree ( 28) 106 106 0 7 0.2 K
% 0.72/1.09 fpa_pos ( 36) 84 84 0 1 0.0 K
% 0.72/1.09 literal ( 12) 151 100 51 1 0.6 K
% 0.72/1.09 clause ( 24) 151 100 51 1 1.2 K
% 0.72/1.09 list ( 12) 92 36 56 3 0.7 K
% 0.72/1.09 list_pos ( 20) 190 13 177 0 3.5 K
% 0.72/1.09 pair_index ( 40) 2 0 2 0 0.1 K
% 0.72/1.09
% 0.72/1.09 -------------- statistics -------------
% 0.72/1.09 Clauses input 3
% 0.72/1.09 Usable input 0
% 0.72/1.09 Sos input 3
% 0.72/1.09 Demodulators input 0
% 0.72/1.09 Passive input 0
% 0.72/1.09
% 0.72/1.09 Processed BS (before search) 5
% 0.72/1.09 Forward subsumed BS 1
% 0.72/1.09 Kept BS 4
% 0.72/1.09 New demodulators BS 1
% 0.72/1.09 Back demodulated BS 0
% 0.72/1.09
% 0.72/1.09 Clauses or pairs given 166
% 0.72/1.09 Clauses generated 89
% 0.72/1.09 Forward subsumed 42
% 0.72/1.09 Deleted by weight 0
% 0.72/1.09 Deleted by variable count 0
% 0.72/1.09 Kept 47
% 0.72/1.09 New demodulators 32
% 0.72/1.09 Back demodulated 2
% 0.72/1.09 Ordered paramod prunes 0
% 0.72/1.09 Basic paramod prunes 470
% 0.72/1.09 Prime paramod prunes 3
% 0.72/1.09 Semantic prunes 0
% 0.72/1.09
% 0.72/1.09 Rewrite attmepts 637
% 0.72/1.09 Rewrites 18
% 0.72/1.09
% 0.72/1.09 FPA overloads 0
% 0.72/1.09 FPA underloads 0
% 0.72/1.09
% 0.72/1.09 Usable size 0
% 0.72/1.09 Sos size 48
% 0.72/1.09 Demodulators size 31
% 0.72/1.09 Passive size 0
% 0.72/1.09 Disabled size 2
% 0.72/1.09
% 0.72/1.09 Proofs found 1
% 0.72/1.09
% 0.72/1.09 ----------- times (seconds) ----------- Mon Jun 13 09:12:10 2022
% 0.72/1.09
% 0.72/1.09 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.72/1.09 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.72/1.09 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.72/1.09 input time 0.00
% 0.72/1.09 paramodulation time 0.00
% 0.72/1.09 demodulation time 0.00
% 0.72/1.09 orient time 0.00
% 0.72/1.09 weigh time 0.00
% 0.72/1.09 forward subsume time 0.00
% 0.72/1.09 back demod find time 0.00
% 0.72/1.09 conflict time 0.00
% 0.72/1.09 LRPO time 0.00
% 0.72/1.09 store clause time 0.00
% 0.72/1.09 disable clause time 0.00
% 0.72/1.09 prime paramod time 0.00
% 0.72/1.09 semantics time 0.00
% 0.72/1.09
% 0.72/1.09 EQP interrupted
%------------------------------------------------------------------------------