TSTP Solution File: GRP547-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP547-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n012.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:55 EDT 2022
% Result : Unsatisfiable 0.72s 1.11s
% Output : Refutation 0.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 2
% Syntax : Number of clauses : 22 ( 22 unt; 0 nHn; 3 RR)
% Number of literals : 22 ( 0 equ; 2 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 47 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(divide(divide(identity,divide(A,B)),divide(divide(B,C),A)),C),
file('GRP547-1.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,B),divide(A,divide(identity,B))),
file('GRP547-1.p',unknown),
[] ).
cnf(4,plain,
equal(divide(A,A),identity),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(5,plain,
~ equal(divide(divide(a3,divide(identity,b3)),divide(identity,c3)),divide(a3,divide(identity,divide(b3,divide(identity,c3))))),
inference(demod,[status(thm),theory(equality)],[2,2,2,2]),
[iquote('demod([2,2,2,2])')] ).
cnf(7,plain,
equal(divide(divide(identity,divide(A,divide(identity,divide(B,C)))),divide(D,A)),divide(divide(C,D),B)),
inference(para,[status(thm),theory(equality)],[1,1]),
[iquote('para(1,1)')] ).
cnf(9,plain,
equal(divide(divide(identity,divide(divide(divide(A,B),C),identity)),B),divide(C,A)),
inference(para,[status(thm),theory(equality)],[1,1]),
[iquote('para(1,1)')] ).
cnf(10,plain,
equal(divide(identity,divide(divide(A,B),A)),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4,1]),4]),
[iquote('para(4,1),demod([4])')] ).
cnf(11,plain,
equal(divide(divide(identity,divide(A,B)),divide(identity,A)),B),
inference(para,[status(thm),theory(equality)],[4,1]),
[iquote('para(4,1)')] ).
cnf(12,plain,
equal(divide(A,identity),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4,1]),10]),
[iquote('para(4,1),demod([10])')] ).
cnf(13,plain,
equal(divide(divide(identity,divide(divide(A,B),C)),B),divide(C,A)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[9]),12]),
[iquote('back_demod(9),demod([12])')] ).
cnf(14,plain,
equal(divide(identity,divide(identity,A)),A),
inference(para,[status(thm),theory(equality)],[4,10]),
[iquote('para(4,10)')] ).
cnf(18,plain,
equal(divide(A,divide(A,B)),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[12,1]),14]),
[iquote('para(12,1),demod([14])')] ).
cnf(22,plain,
equal(divide(divide(identity,A),divide(identity,B)),divide(B,A)),
inference(para,[status(thm),theory(equality)],[18,11]),
[iquote('para(18,11)')] ).
cnf(38,plain,
equal(divide(A,divide(identity,B)),divide(B,divide(identity,A))),
inference(para,[status(thm),theory(equality)],[18,22]),
[iquote('para(18,22)')] ).
cnf(51,plain,
equal(divide(identity,divide(A,B)),divide(B,A)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[12,13]),12]),
[iquote('para(12,13),demod([12])')] ).
cnf(82,plain,
equal(divide(divide(identity,divide(divide(identity,A),divide(identity,divide(B,C)))),D),divide(divide(C,divide(identity,divide(A,D))),B)),
inference(para,[status(thm),theory(equality)],[11,7]),
[iquote('para(11,7)')] ).
cnf(83,plain,
equal(divide(divide(A,divide(identity,divide(B,C))),D),divide(divide(identity,divide(divide(identity,B),divide(identity,divide(D,A)))),C)),
inference(flip,[status(thm),theory(equality)],[82]),
[iquote('flip(82)')] ).
cnf(90,plain,
equal(divide(divide(identity,A),divide(identity,B)),divide(identity,divide(A,B))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[22,51]),1]),
[iquote('para(22,51),flip(1)')] ).
cnf(92,plain,
equal(divide(divide(A,divide(identity,divide(B,C))),D),divide(divide(B,divide(D,A)),C)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[83]),90,18]),
[iquote('back_demod(83),demod([90,18])')] ).
cnf(193,plain,
~ equal(divide(divide(b3,divide(identity,a3)),divide(identity,c3)),divide(a3,divide(identity,divide(b3,divide(identity,c3))))),
inference(para,[status(thm),theory(equality)],[38,5]),
[iquote('para(38,5)')] ).
cnf(271,plain,
equal(divide(divide(A,divide(identity,B)),C),divide(B,divide(identity,divide(A,C)))),
inference(para,[status(thm),theory(equality)],[92,12]),
[iquote('para(92,12)')] ).
cnf(272,plain,
$false,
inference(conflict,[status(thm)],[271,193]),
[iquote('conflict(271,193)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : GRP547-1 : TPTP v8.1.0. Released v2.6.0.
% 0.06/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n012.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Mon Jun 13 14:58:10 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.72/1.11 ----- EQP 0.9e, May 2009 -----
% 0.72/1.11 The job began on n012.cluster.edu, Mon Jun 13 14:58:11 2022
% 0.72/1.11 The command was "./eqp09e".
% 0.72/1.11
% 0.72/1.11 set(prolog_style_variables).
% 0.72/1.11 set(lrpo).
% 0.72/1.11 set(basic_paramod).
% 0.72/1.11 set(functional_subsume).
% 0.72/1.11 set(ordered_paramod).
% 0.72/1.11 set(prime_paramod).
% 0.72/1.11 set(para_pairs).
% 0.72/1.11 assign(pick_given_ratio,4).
% 0.72/1.11 clear(print_kept).
% 0.72/1.11 clear(print_new_demod).
% 0.72/1.11 clear(print_back_demod).
% 0.72/1.11 clear(print_given).
% 0.72/1.11 assign(max_mem,64000).
% 0.72/1.11 end_of_commands.
% 0.72/1.11
% 0.72/1.11 Usable:
% 0.72/1.11 end_of_list.
% 0.72/1.11
% 0.72/1.11 Sos:
% 0.72/1.11 0 (wt=-1) [] divide(divide(identity,divide(A,B)),divide(divide(B,C),A)) = C.
% 0.72/1.11 0 (wt=-1) [] multiply(A,B) = divide(A,divide(identity,B)).
% 0.72/1.11 0 (wt=-1) [] inverse(A) = divide(identity,A).
% 0.72/1.11 0 (wt=-1) [] identity = divide(A,A).
% 0.72/1.11 0 (wt=-1) [] -(multiply(multiply(a3,b3),c3) = multiply(a3,multiply(b3,c3))).
% 0.72/1.11 end_of_list.
% 0.72/1.11
% 0.72/1.11 Demodulators:
% 0.72/1.11 end_of_list.
% 0.72/1.11
% 0.72/1.11 Passive:
% 0.72/1.11 end_of_list.
% 0.72/1.11
% 0.72/1.11 Starting to process input.
% 0.72/1.11
% 0.72/1.11 ** KEPT: 1 (wt=13) [] divide(divide(identity,divide(A,B)),divide(divide(B,C),A)) = C.
% 0.72/1.11 1 is a new demodulator.
% 0.72/1.11
% 0.72/1.11 ** KEPT: 2 (wt=9) [] multiply(A,B) = divide(A,divide(identity,B)).
% 0.72/1.11 2 is a new demodulator.
% 0.72/1.11
% 0.72/1.11 ** KEPT: 3 (wt=6) [] inverse(A) = divide(identity,A).
% 0.72/1.11 3 is a new demodulator.
% 0.72/1.11
% 0.72/1.11 ** KEPT: 4 (wt=5) [flip(1)] divide(A,A) = identity.
% 0.72/1.11 4 is a new demodulator.
% 0.72/1.11
% 0.72/1.11 ** KEPT: 5 (wt=19) [demod([2,2,2,2])] -(divide(divide(a3,divide(identity,b3)),divide(identity,c3)) = divide(a3,divide(identity,divide(b3,divide(identity,c3))))).
% 0.72/1.11 ---------------- PROOF FOUND ----------------
% 0.72/1.11 % SZS status Unsatisfiable
% 0.72/1.11
% 0.72/1.11
% 0.72/1.11 After processing input:
% 0.72/1.11
% 0.72/1.11 Usable:
% 0.72/1.11 end_of_list.
% 0.72/1.11
% 0.72/1.11 Sos:
% 0.72/1.11 4 (wt=5) [flip(1)] divide(A,A) = identity.
% 0.72/1.11 3 (wt=6) [] inverse(A) = divide(identity,A).
% 0.72/1.11 2 (wt=9) [] multiply(A,B) = divide(A,divide(identity,B)).
% 0.72/1.11 1 (wt=13) [] divide(divide(identity,divide(A,B)),divide(divide(B,C),A)) = C.
% 0.72/1.11 5 (wt=19) [demod([2,2,2,2])] -(divide(divide(a3,divide(identity,b3)),divide(identity,c3)) = divide(a3,divide(identity,divide(b3,divide(identity,c3))))).
% 0.72/1.11 end_of_list.
% 0.72/1.11
% 0.72/1.11 Demodulators:
% 0.72/1.11 1 (wt=13) [] divide(divide(identity,divide(A,B)),divide(divide(B,C),A)) = C.
% 0.72/1.11 2 (wt=9) [] multiply(A,B) = divide(A,divide(identity,B)).
% 0.72/1.11 3 (wt=6) [] inverse(A) = divide(identity,A).
% 0.72/1.11 4 (wt=5) [flip(1)] divide(A,A) = identity.
% 0.72/1.11 end_of_list.
% 0.72/1.11
% 0.72/1.11 Passive:
% 0.72/1.11 end_of_list.
% 0.72/1.11
% 0.72/1.11 UNIT CONFLICT from 271 and 193 at 0.02 seconds.
% 0.72/1.11
% 0.72/1.11 ---------------- PROOF ----------------
% 0.72/1.11 % SZS output start Refutation
% See solution above
% 0.72/1.11 ------------ end of proof -------------
% 0.72/1.11
% 0.72/1.11
% 0.72/1.11 ------------- memory usage ------------
% 0.72/1.11 Memory dynamically allocated (tp_alloc): 488.
% 0.72/1.11 type (bytes each) gets frees in use avail bytes
% 0.72/1.11 sym_ent ( 96) 58 0 58 0 5.4 K
% 0.72/1.11 term ( 16) 23245 18369 4876 24 94.6 K
% 0.72/1.11 gen_ptr ( 8) 28354 8110 20244 22 158.3 K
% 0.72/1.11 context ( 808) 16466 16464 2 5 5.5 K
% 0.72/1.11 trail ( 12) 3863 3863 0 6 0.1 K
% 0.72/1.11 bt_node ( 68) 4986 4983 3 14 1.1 K
% 0.72/1.11 ac_position (285432) 0 0 0 0 0.0 K
% 0.72/1.11 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.72/1.11 ac_match_free_vars_pos (4020)
% 0.72/1.11 0 0 0 0 0.0 K
% 0.72/1.11 discrim ( 12) 3343 2264 1079 328 16.5 K
% 0.72/1.11 flat ( 40) 47805 47805 0 33 1.3 K
% 0.72/1.11 discrim_pos ( 12) 1394 1394 0 1 0.0 K
% 0.72/1.11 fpa_head ( 12) 666 0 666 0 7.8 K
% 0.72/1.11 fpa_tree ( 28) 1672 1672 0 53 1.4 K
% 0.72/1.11 fpa_pos ( 36) 379 379 0 1 0.0 K
% 0.72/1.11 literal ( 12) 1389 1118 271 1 3.2 K
% 0.72/1.11 clause ( 24) 1389 1118 271 1 6.4 K
% 0.72/1.11 list ( 12) 167 111 56 3 0.7 K
% 0.72/1.11 list_pos ( 20) 1261 751 510 68 11.3 K
% 0.72/1.11 pair_index ( 40) 2 0 2 0 0.1 K
% 0.72/1.11
% 0.72/1.11 -------------- statistics -------------
% 0.72/1.11 Clauses input 5
% 0.72/1.11 Usable input 0
% 0.72/1.11 Sos input 5
% 0.72/1.11 Demodulators input 0
% 0.72/1.11 Passive input 0
% 0.72/1.11
% 0.72/1.11 Processed BS (before search) 5
% 0.72/1.11 Forward subsumed BS 0
% 0.72/1.11 Kept BS 5
% 0.72/1.11 New demodulators BS 4
% 0.72/1.11 Back demodulated BS 0
% 0.72/1.11
% 0.72/1.11 Clauses or pairs given 580
% 0.72/1.11 Clauses generated 880
% 0.72/1.11 Forward subsumed 614
% 0.72/1.11 Deleted by weight 0
% 0.72/1.11 Deleted by variable count 0
% 0.72/1.11 Kept 266
% 0.72/1.11 New demodulators 104
% 0.72/1.11 Back demodulated 169
% 0.72/1.11 Ordered paramod prunes 0
% 0.72/1.11 Basic paramod prunes 1201
% 0.72/1.11 Prime paramod prunes 49
% 0.72/1.11 Semantic prunes 0
% 0.72/1.11
% 0.72/1.11 Rewrite attmepts 9692
% 0.72/1.11 Rewrites 1113
% 0.72/1.11
% 0.72/1.11 FPA overloads 0
% 0.72/1.11 FPA underloads 0
% 0.72/1.11
% 0.72/1.11 Usable size 0
% 0.72/1.11 Sos size 101
% 0.72/1.11 Demodulators size 38
% 0.72/1.11 Passive size 0
% 0.72/1.11 Disabled size 169
% 0.72/1.11
% 0.72/1.11 Proofs found 1
% 0.72/1.11
% 0.72/1.11 ----------- times (seconds) ----------- Mon Jun 13 14:58:11 2022
% 0.72/1.11
% 0.72/1.11 user CPU time 0.02 (0 hr, 0 min, 0 sec)
% 0.72/1.11 system CPU time 0.03 (0 hr, 0 min, 0 sec)
% 0.72/1.11 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.72/1.11 input time 0.00
% 0.72/1.11 paramodulation time 0.01
% 0.72/1.11 demodulation time 0.00
% 0.72/1.11 orient time 0.00
% 0.72/1.11 weigh time 0.00
% 0.72/1.11 forward subsume time 0.00
% 0.72/1.11 back demod find time 0.00
% 0.72/1.11 conflict time 0.00
% 0.72/1.11 LRPO time 0.00
% 0.72/1.11 store clause time 0.00
% 0.72/1.11 disable clause time 0.00
% 0.72/1.11 prime paramod time 0.00
% 0.72/1.11 semantics time 0.00
% 0.72/1.11
% 0.72/1.11 EQP interrupted
%------------------------------------------------------------------------------