TSTP Solution File: GRP535-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP535-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n003.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:52 EDT 2022
% Result : Unsatisfiable 0.42s 1.07s
% Output : Refutation 0.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 2
% Syntax : Number of clauses : 19 ( 19 unt; 0 nHn; 4 RR)
% Number of literals : 19 ( 0 equ; 3 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; 4 con; 0-2 aty)
% Number of variables : 33 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(divide(divide(A,divide(divide(A,B),C)),B),C),
file('GRP535-1.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,B),divide(A,divide(divide(C,C),B))),
file('GRP535-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(6,plain,
equal(divide(A,A),identity),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(8,plain,
equal(multiply(A,B),divide(A,divide(identity,B))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[3]),6]),1]),
[iquote('back_demod(3),demod([6]),flip(1)')] ).
cnf(9,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)],[8,8,8,8]),
[iquote('demod([8,8,8,8])')] ).
cnf(11,plain,
equal(divide(divide(A,B),divide(divide(A,C),B)),C),
inference(para,[status(thm),theory(equality)],[1,1]),
[iquote('para(1,1)')] ).
cnf(12,plain,
equal(divide(divide(A,divide(identity,B)),A),B),
inference(para,[status(thm),theory(equality)],[6,1]),
[iquote('para(6,1)')] ).
cnf(14,plain,
equal(divide(identity,divide(identity,A)),A),
inference(para,[status(thm),theory(equality)],[6,12]),
[iquote('para(6,12)')] ).
cnf(16,plain,
equal(divide(divide(A,B),A),divide(identity,B)),
inference(para,[status(thm),theory(equality)],[14,12]),
[iquote('para(14,12)')] ).
cnf(17,plain,
equal(divide(A,identity),A),
inference(para,[status(thm),theory(equality)],[14,12]),
[iquote('para(14,12)')] ).
cnf(18,plain,
equal(divide(A,divide(A,B)),B),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[17,1]),17]),
[iquote('para(17,1),demod([17])')] ).
cnf(19,plain,
equal(divide(A,B),divide(identity,divide(B,A))),
inference(para,[status(thm),theory(equality)],[18,16]),
[iquote('para(18,16)')] ).
cnf(25,plain,
equal(divide(A,divide(identity,divide(B,A))),B),
inference(para,[status(thm),theory(equality)],[19,18]),
[iquote('para(19,18)')] ).
cnf(44,plain,
equal(divide(identity,divide(divide(A,B),C)),divide(B,divide(A,C))),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[11,16]),1]),
[iquote('para(11,16),flip(1)')] ).
cnf(54,plain,
~ equal(divide(divide(b3,divide(identity,a3)),divide(identity,c3)),divide(a3,divide(identity,divide(b3,divide(identity,c3))))),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[19,9]),44]),
[iquote('para(19,9),demod([44])')] ).
cnf(69,plain,
equal(divide(divide(A,B),C),divide(identity,divide(B,divide(A,C)))),
inference(para,[status(thm),theory(equality)],[25,1]),
[iquote('para(25,1)')] ).
cnf(79,plain,
~ equal(divide(a3,divide(identity,divide(b3,divide(identity,c3)))),divide(a3,divide(identity,divide(b3,divide(identity,c3))))),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[54]),69,69,18]),
[iquote('back_demod(54),demod([69,69,18])')] ).
cnf(80,plain,
$false,
inference(conflict,[status(thm)],[79]),
[iquote('xx_conflict(79)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.01/0.12 % Problem : GRP535-1 : TPTP v8.1.0. Released v2.6.0.
% 0.01/0.12 % Command : tptp2X_and_run_eqp %s
% 0.13/0.33 % Computer : n003.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Tue Jun 14 00:33:54 EDT 2022
% 0.13/0.33 % CPUTime :
% 0.42/1.07 ----- EQP 0.9e, May 2009 -----
% 0.42/1.07 The job began on n003.cluster.edu, Tue Jun 14 00:33:55 2022
% 0.42/1.07 The command was "./eqp09e".
% 0.42/1.07
% 0.42/1.07 set(prolog_style_variables).
% 0.42/1.07 set(lrpo).
% 0.42/1.07 set(basic_paramod).
% 0.42/1.07 set(functional_subsume).
% 0.42/1.07 set(ordered_paramod).
% 0.42/1.07 set(prime_paramod).
% 0.42/1.07 set(para_pairs).
% 0.42/1.07 assign(pick_given_ratio,4).
% 0.42/1.07 clear(print_kept).
% 0.42/1.07 clear(print_new_demod).
% 0.42/1.07 clear(print_back_demod).
% 0.42/1.07 clear(print_given).
% 0.42/1.07 assign(max_mem,64000).
% 0.42/1.07 end_of_commands.
% 0.42/1.07
% 0.42/1.07 Usable:
% 0.42/1.07 end_of_list.
% 0.42/1.07
% 0.42/1.07 Sos:
% 0.42/1.07 0 (wt=-1) [] divide(divide(A,divide(divide(A,B),C)),B) = C.
% 0.42/1.07 0 (wt=-1) [] multiply(A,B) = divide(A,divide(divide(C,C),B)).
% 0.42/1.07 0 (wt=-1) [] inverse(A) = divide(divide(B,B),A).
% 0.42/1.07 0 (wt=-1) [] identity = divide(A,A).
% 0.42/1.07 0 (wt=-1) [] -(multiply(multiply(a3,b3),c3) = multiply(a3,multiply(b3,c3))).
% 0.42/1.07 end_of_list.
% 0.42/1.07
% 0.42/1.07 Demodulators:
% 0.42/1.07 end_of_list.
% 0.42/1.07
% 0.42/1.07 Passive:
% 0.42/1.07 end_of_list.
% 0.42/1.07
% 0.42/1.07 Starting to process input.
% 0.42/1.07
% 0.42/1.07 ** KEPT: 1 (wt=11) [] divide(divide(A,divide(divide(A,B),C)),B) = C.
% 0.42/1.07 1 is a new demodulator.
% 0.42/1.07
% 0.42/1.07 ** KEPT: 2 (wt=11) [] multiply(A,B) = divide(A,divide(divide(C,C),B)).
% 0.42/1.07
% 0.42/1.07 ** KEPT: 3 (wt=11) [flip(2)] divide(A,divide(divide(B,B),C)) = multiply(A,C).
% 0.42/1.07 clause forward subsumed: 0 (wt=11) [flip(3)] multiply(A,C) = divide(A,divide(divide(B,B),C)).
% 0.42/1.07
% 0.42/1.07 ** KEPT: 4 (wt=8) [] inverse(A) = divide(divide(B,B),A).
% 0.42/1.07
% 0.42/1.07 ** KEPT: 5 (wt=8) [flip(4)] divide(divide(A,A),B) = inverse(B).
% 0.42/1.07 clause forward subsumed: 0 (wt=8) [flip(5)] inverse(B) = divide(divide(A,A),B).
% 0.42/1.07
% 0.42/1.07 ** KEPT: 6 (wt=5) [flip(1)] divide(A,A) = identity.
% 0.42/1.07 6 is a new demodulator.
% 0.42/1.07 -> 6 back demodulating 5.
% 0.42/1.07
% 0.42/1.07 ** KEPT: 7 (wt=6) [back_demod(5),demod([6]),flip(1)] inverse(A) = divide(identity,A).
% 0.42/1.07 7 is a new demodulator.
% 0.42/1.07 -> 7 back demodulating 4.
% 0.42/1.07 clause forward subsumed: 0 (wt=7) [back_demod(4),demod([7,6])] divide(identity,A) = divide(identity,A).
% 0.42/1.07 -> 6 back demodulating 3.
% 0.42/1.07
% 0.42/1.07 ** KEPT: 8 (wt=9) [back_demod(3),demod([6]),flip(1)] multiply(A,B) = divide(A,divide(identity,B)).
% 0.42/1.07 8 is a new demodulator.
% 0.42/1.07 -> 8 back demodulating 2.
% 0.42/1.07 clause forward subsumed: 0 (wt=11) [back_demod(2),demod([8,6])] divide(A,divide(identity,B)) = divide(A,divide(identity,B)).
% 0.42/1.07
% 0.42/1.07 ** KEPT: 9 (wt=19) [demod([8,8,8,8])] -(divide(divide(a3,divide(identity,b3)),divide(identity,c3)) = divide(a3,divide(identity,divide(b3,divide(identity,c3))))).
% 0.42/1.07 ---------------- PROOF FOUND ----------------
% 0.42/1.07 % SZS status Unsatisfiable
% 0.42/1.07
% 0.42/1.07
% 0.42/1.07 After processing input:
% 0.42/1.07
% 0.42/1.07 Usable:
% 0.42/1.07 end_of_list.
% 0.42/1.07
% 0.42/1.07 Sos:
% 0.42/1.07 6 (wt=5) [flip(1)] divide(A,A) = identity.
% 0.42/1.07 7 (wt=6) [back_demod(5),demod([6]),flip(1)] inverse(A) = divide(identity,A).
% 0.42/1.07 8 (wt=9) [back_demod(3),demod([6]),flip(1)] multiply(A,B) = divide(A,divide(identity,B)).
% 0.42/1.07 1 (wt=11) [] divide(divide(A,divide(divide(A,B),C)),B) = C.
% 0.42/1.07 9 (wt=19) [demod([8,8,8,8])] -(divide(divide(a3,divide(identity,b3)),divide(identity,c3)) = divide(a3,divide(identity,divide(b3,divide(identity,c3))))).
% 0.42/1.07 end_of_list.
% 0.42/1.07
% 0.42/1.07 Demodulators:
% 0.42/1.07 1 (wt=11) [] divide(divide(A,divide(divide(A,B),C)),B) = C.
% 0.42/1.07 6 (wt=5) [flip(1)] divide(A,A) = identity.
% 0.42/1.07 7 (wt=6) [back_demod(5),demod([6]),flip(1)] inverse(A) = divide(identity,A).
% 0.42/1.07 8 (wt=9) [back_demod(3),demod([6]),flip(1)] multiply(A,B) = divide(A,divide(identity,B)).
% 0.42/1.07 end_of_list.
% 0.42/1.07
% 0.42/1.07 Passive:
% 0.42/1.07 end_of_list.
% 0.42/1.07
% 0.42/1.07 UNIT CONFLICT from 79 and x=x at 0.01 seconds.
% 0.42/1.07
% 0.42/1.07 ---------------- PROOF ----------------
% 0.42/1.07 % SZS output start Refutation
% See solution above
% 0.42/1.07 ------------ end of proof -------------
% 0.42/1.07
% 0.42/1.07
% 0.42/1.07 ------------- memory usage ------------
% 0.42/1.07 Memory dynamically allocated (tp_alloc): 488.
% 0.42/1.07 type (bytes each) gets frees in use avail bytes
% 0.42/1.07 sym_ent ( 96) 58 0 58 0 5.4 K
% 0.42/1.07 term ( 16) 7239 6173 1066 20 20.9 K
% 0.42/1.07 gen_ptr ( 8) 6122 1876 4246 18 33.3 K
% 0.42/1.07 context ( 808) 3745 3743 2 11 10.3 K
% 0.42/1.07 trail ( 12) 761 761 0 6 0.1 K
% 0.42/1.07 bt_node ( 68) 1358 1355 3 10 0.9 K
% 0.42/1.07 ac_position (285432) 0 0 0 0 0.0 K
% 0.42/1.07 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.42/1.07 ac_match_free_vars_pos (4020)
% 0.42/1.07 0 0 0 0 0.0 K
% 0.42/1.07 discrim ( 12) 907 408 499 70 6.7 K
% 0.42/1.07 flat ( 40) 10511 10511 0 23 0.9 K
% 0.42/1.07 discrim_pos ( 12) 352 352 0 1 0.0 K
% 0.42/1.07 fpa_head ( 12) 369 0 369 0 4.3 K
% 0.42/1.07 fpa_tree ( 28) 267 267 0 31 0.8 K
% 0.42/1.07 fpa_pos ( 36) 132 132 0 1 0.0 K
% 0.42/1.07 literal ( 12) 350 271 79 0 0.9 K
% 0.42/1.07 clause ( 24) 350 271 79 0 1.9 K
% 0.42/1.07 list ( 12) 113 56 57 3 0.7 K
% 0.42/1.07 list_pos ( 20) 387 180 207 7 4.2 K
% 0.42/1.07 pair_index ( 40) 2 0 2 0 0.1 K
% 0.42/1.07
% 0.42/1.07 -------------- statistics -------------
% 0.42/1.07 Clauses input 5
% 0.42/1.07 Usable input 0
% 0.42/1.07 Sos input 5
% 0.42/1.07 Demodulators input 0
% 0.42/1.07 Passive input 0
% 0.42/1.07
% 0.42/1.07 Processed BS (before search) 13
% 0.42/1.07 Forward subsumed BS 4
% 0.42/1.07 Kept BS 9
% 0.42/1.07 New demodulators BS 4
% 0.42/1.07 Back demodulated BS 4
% 0.42/1.07
% 0.42/1.07 Clauses or pairs given 205
% 0.42/1.07 Clauses generated 233
% 0.42/1.07 Forward subsumed 163
% 0.42/1.07 Deleted by weight 0
% 0.42/1.07 Deleted by variable count 0
% 0.42/1.07 Kept 70
% 0.42/1.07 New demodulators 50
% 0.42/1.07 Back demodulated 32
% 0.42/1.07 Ordered paramod prunes 0
% 0.42/1.07 Basic paramod prunes 489
% 0.42/1.07 Prime paramod prunes 18
% 0.42/1.07 Semantic prunes 0
% 0.42/1.07
% 0.42/1.07 Rewrite attmepts 1962
% 0.42/1.07 Rewrites 304
% 0.42/1.07
% 0.42/1.07 FPA overloads 0
% 0.42/1.07 FPA underloads 0
% 0.42/1.07
% 0.42/1.07 Usable size 0
% 0.42/1.07 Sos size 42
% 0.42/1.07 Demodulators size 25
% 0.42/1.07 Passive size 0
% 0.42/1.07 Disabled size 36
% 0.42/1.07
% 0.42/1.07 Proofs found 1
% 0.42/1.07
% 0.42/1.07 ----------- times (seconds) ----------- Tue Jun 14 00:33:55 2022
% 0.42/1.07
% 0.42/1.07 user CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.42/1.07 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.42/1.07 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.42/1.07 input time 0.00
% 0.42/1.07 paramodulation time 0.00
% 0.42/1.07 demodulation time 0.00
% 0.42/1.07 orient time 0.00
% 0.42/1.07 weigh time 0.00
% 0.42/1.07 forward subsume time 0.00
% 0.42/1.07 back demod find time 0.00
% 0.42/1.07 conflict time 0.00
% 0.42/1.07 LRPO time 0.00
% 0.42/1.07 store clause time 0.00
% 0.42/1.07 disable clause time 0.00
% 0.42/1.07 prime paramod time 0.00
% 0.42/1.07 semantics time 0.00
% 0.42/1.07
% 0.42/1.07 EQP interrupted
%------------------------------------------------------------------------------