TSTP Solution File: GRP456-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP456-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n026.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:30 EDT 2022
% Result : Unsatisfiable 0.74s 1.14s
% Output : Refutation 0.74s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 2
% 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 : 8 ( 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 : 26 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(divide(divide(identity,divide(A,divide(B,divide(divide(divide(A,A),A),C)))),C),B),
file('GRP456-1.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,B),divide(A,divide(identity,B))),
file('GRP456-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(identity,divide(A,divide(B,divide(divide(identity,A),C)))),C),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[1]),4]),
[iquote('back_demod(1),demod([4])')] ).
cnf(6,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(identity,divide(A,divide(identity,B)))),B),A),
inference(para,[status(thm),theory(equality)],[4,5]),
[iquote('para(4,5)')] ).
cnf(8,plain,
equal(divide(divide(identity,divide(A,divide(B,identity))),divide(identity,A)),B),
inference(para,[status(thm),theory(equality)],[4,5]),
[iquote('para(4,5)')] ).
cnf(10,plain,
equal(divide(divide(identity,divide(identity,divide(A,identity))),identity),A),
inference(para,[status(thm),theory(equality)],[4,7]),
[iquote('para(4,7)')] ).
cnf(11,plain,
equal(divide(identity,divide(identity,divide(A,identity))),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[4,8]),4]),
[iquote('para(4,8),demod([4])')] ).
cnf(12,plain,
equal(divide(A,identity),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[10]),11]),
[iquote('back_demod(10),demod([11])')] ).
cnf(13,plain,
equal(divide(identity,divide(identity,A)),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[11]),12]),
[iquote('back_demod(11),demod([12])')] ).
cnf(14,plain,
equal(divide(divide(A,divide(identity,B)),B),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[7]),13]),
[iquote('back_demod(7),demod([13])')] ).
cnf(15,plain,
equal(divide(divide(identity,divide(A,B)),divide(identity,A)),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[8]),12]),
[iquote('back_demod(8),demod([12])')] ).
cnf(21,plain,
equal(divide(A,B),divide(identity,divide(B,A))),
inference(para,[status(thm),theory(equality)],[15,14]),
[iquote('para(15,14)')] ).
cnf(27,plain,
equal(divide(divide(identity,divide(A,B)),C),divide(B,divide(identity,divide(divide(identity,A),C)))),
inference(para,[status(thm),theory(equality)],[14,5]),
[iquote('para(14,5)')] ).
cnf(37,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(para,[status(thm),theory(equality)],[21,6]),27,13]),
[iquote('para(21,6),demod([27,13])')] ).
cnf(38,plain,
$false,
inference(conflict,[status(thm)],[37]),
[iquote('xx_conflict(37)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.05/0.13 % Problem : GRP456-1 : TPTP v8.1.0. Released v2.6.0.
% 0.05/0.14 % Command : tptp2X_and_run_eqp %s
% 0.13/0.35 % Computer : n026.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 : Mon Jun 13 23:57:06 EDT 2022
% 0.13/0.36 % CPUTime :
% 0.74/1.14 ----- EQP 0.9e, May 2009 -----
% 0.74/1.14 The job began on n026.cluster.edu, Mon Jun 13 23:57:07 2022
% 0.74/1.14 The command was "./eqp09e".
% 0.74/1.14
% 0.74/1.14 set(prolog_style_variables).
% 0.74/1.14 set(lrpo).
% 0.74/1.14 set(basic_paramod).
% 0.74/1.14 set(functional_subsume).
% 0.74/1.14 set(ordered_paramod).
% 0.74/1.14 set(prime_paramod).
% 0.74/1.14 set(para_pairs).
% 0.74/1.14 assign(pick_given_ratio,4).
% 0.74/1.14 clear(print_kept).
% 0.74/1.14 clear(print_new_demod).
% 0.74/1.14 clear(print_back_demod).
% 0.74/1.14 clear(print_given).
% 0.74/1.14 assign(max_mem,64000).
% 0.74/1.14 end_of_commands.
% 0.74/1.14
% 0.74/1.14 Usable:
% 0.74/1.14 end_of_list.
% 0.74/1.14
% 0.74/1.14 Sos:
% 0.74/1.14 0 (wt=-1) [] divide(divide(identity,divide(A,divide(B,divide(divide(divide(A,A),A),C)))),C) = B.
% 0.74/1.14 0 (wt=-1) [] multiply(A,B) = divide(A,divide(identity,B)).
% 0.74/1.14 0 (wt=-1) [] inverse(A) = divide(identity,A).
% 0.74/1.14 0 (wt=-1) [] identity = divide(A,A).
% 0.74/1.14 0 (wt=-1) [] -(multiply(multiply(a3,b3),c3) = multiply(a3,multiply(b3,c3))).
% 0.74/1.14 end_of_list.
% 0.74/1.14
% 0.74/1.14 Demodulators:
% 0.74/1.14 end_of_list.
% 0.74/1.14
% 0.74/1.14 Passive:
% 0.74/1.14 end_of_list.
% 0.74/1.14
% 0.74/1.14 Starting to process input.
% 0.74/1.14
% 0.74/1.14 ** KEPT: 1 (wt=17) [] divide(divide(identity,divide(A,divide(B,divide(divide(divide(A,A),A),C)))),C) = B.
% 0.74/1.14 1 is a new demodulator.
% 0.74/1.14
% 0.74/1.14 ** KEPT: 2 (wt=9) [] multiply(A,B) = divide(A,divide(identity,B)).
% 0.74/1.14 2 is a new demodulator.
% 0.74/1.14
% 0.74/1.14 ** KEPT: 3 (wt=6) [] inverse(A) = divide(identity,A).
% 0.74/1.14 3 is a new demodulator.
% 0.74/1.14
% 0.74/1.14 ** KEPT: 4 (wt=5) [flip(1)] divide(A,A) = identity.
% 0.74/1.14 4 is a new demodulator.
% 0.74/1.14 -> 4 back demodulating 1.
% 0.74/1.14
% 0.74/1.14 ** KEPT: 5 (wt=15) [back_demod(1),demod([4])] divide(divide(identity,divide(A,divide(B,divide(divide(identity,A),C)))),C) = B.
% 0.74/1.14 5 is a new demodulator.
% 0.74/1.14
% 0.74/1.14 ** KEPT: 6 (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.74/1.14 ---------------- PROOF FOUND ----------------
% 0.74/1.14 % SZS status Unsatisfiable
% 0.74/1.14
% 0.74/1.14
% 0.74/1.14 After processing input:
% 0.74/1.14
% 0.74/1.14 Usable:
% 0.74/1.14 end_of_list.
% 0.74/1.14
% 0.74/1.14 Sos:
% 0.74/1.14 4 (wt=5) [flip(1)] divide(A,A) = identity.
% 0.74/1.14 3 (wt=6) [] inverse(A) = divide(identity,A).
% 0.74/1.14 2 (wt=9) [] multiply(A,B) = divide(A,divide(identity,B)).
% 0.74/1.14 5 (wt=15) [back_demod(1),demod([4])] divide(divide(identity,divide(A,divide(B,divide(divide(identity,A),C)))),C) = B.
% 0.74/1.14 6 (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.74/1.14 end_of_list.
% 0.74/1.14
% 0.74/1.14 Demodulators:
% 0.74/1.14 2 (wt=9) [] multiply(A,B) = divide(A,divide(identity,B)).
% 0.74/1.14 3 (wt=6) [] inverse(A) = divide(identity,A).
% 0.74/1.14 4 (wt=5) [flip(1)] divide(A,A) = identity.
% 0.74/1.14 5 (wt=15) [back_demod(1),demod([4])] divide(divide(identity,divide(A,divide(B,divide(divide(identity,A),C)))),C) = B.
% 0.74/1.14 end_of_list.
% 0.74/1.14
% 0.74/1.14 Passive:
% 0.74/1.14 end_of_list.
% 0.74/1.14
% 0.74/1.14 UNIT CONFLICT from 37 and x=x at 0.00 seconds.
% 0.74/1.14
% 0.74/1.14 ---------------- PROOF ----------------
% 0.74/1.14 % SZS output start Refutation
% See solution above
% 0.74/1.14 ------------ end of proof -------------
% 0.74/1.14
% 0.74/1.14
% 0.74/1.14 ------------- memory usage ------------
% 0.74/1.14 Memory dynamically allocated (tp_alloc): 488.
% 0.74/1.14 type (bytes each) gets frees in use avail bytes
% 0.74/1.14 sym_ent ( 96) 58 0 58 0 5.4 K
% 0.74/1.14 term ( 16) 2815 2337 478 20 9.6 K
% 0.74/1.14 gen_ptr ( 8) 2650 832 1818 16 14.3 K
% 0.74/1.14 context ( 808) 2197 2195 2 3 3.9 K
% 0.74/1.14 trail ( 12) 132 132 0 4 0.0 K
% 0.74/1.14 bt_node ( 68) 970 967 3 10 0.9 K
% 0.74/1.14 ac_position (285432) 0 0 0 0 0.0 K
% 0.74/1.14 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.74/1.14 ac_match_free_vars_pos (4020)
% 0.74/1.14 0 0 0 0 0.0 K
% 0.74/1.14 discrim ( 12) 446 182 264 0 3.1 K
% 0.74/1.14 flat ( 40) 3483 3483 0 23 0.9 K
% 0.74/1.14 discrim_pos ( 12) 138 138 0 1 0.0 K
% 0.74/1.14 fpa_head ( 12) 235 0 235 0 2.8 K
% 0.74/1.14 fpa_tree ( 28) 130 130 0 13 0.4 K
% 0.74/1.14 fpa_pos ( 36) 65 65 0 1 0.0 K
% 0.74/1.14 literal ( 12) 155 118 37 0 0.4 K
% 0.74/1.14 clause ( 24) 155 118 37 0 0.9 K
% 0.74/1.14 list ( 12) 88 32 56 4 0.7 K
% 0.74/1.14 list_pos ( 20) 169 69 100 0 2.0 K
% 0.74/1.14 pair_index ( 40) 2 0 2 0 0.1 K
% 0.74/1.14
% 0.74/1.14 -------------- statistics -------------
% 0.74/1.14 Clauses input 5
% 0.74/1.14 Usable input 0
% 0.74/1.14 Sos input 5
% 0.74/1.14 Demodulators input 0
% 0.74/1.14 Passive input 0
% 0.74/1.14
% 0.74/1.14 Processed BS (before search) 6
% 0.74/1.14 Forward subsumed BS 0
% 0.74/1.14 Kept BS 6
% 0.74/1.14 New demodulators BS 5
% 0.74/1.14 Back demodulated BS 1
% 0.74/1.14
% 0.74/1.14 Clauses or pairs given 120
% 0.74/1.14 Clauses generated 105
% 0.74/1.14 Forward subsumed 74
% 0.74/1.14 Deleted by weight 0
% 0.74/1.14 Deleted by variable count 0
% 0.74/1.14 Kept 31
% 0.74/1.14 New demodulators 24
% 0.74/1.14 Back demodulated 12
% 0.74/1.14 Ordered paramod prunes 0
% 0.74/1.14 Basic paramod prunes 307
% 0.74/1.14 Prime paramod prunes 13
% 0.74/1.14 Semantic prunes 0
% 0.74/1.14
% 0.74/1.14 Rewrite attmepts 933
% 0.74/1.14 Rewrites 117
% 0.74/1.14
% 0.74/1.14 FPA overloads 0
% 0.74/1.14 FPA underloads 0
% 0.74/1.14
% 0.74/1.14 Usable size 0
% 0.74/1.14 Sos size 23
% 0.74/1.14 Demodulators size 18
% 0.74/1.14 Passive size 0
% 0.74/1.14 Disabled size 13
% 0.74/1.14
% 0.74/1.14 Proofs found 1
% 0.74/1.14
% 0.74/1.14 ----------- times (seconds) ----------- Mon Jun 13 23:57:07 2022
% 0.74/1.14
% 0.74/1.14 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.74/1.14 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.74/1.14 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.74/1.14 input time 0.00
% 0.74/1.14 paramodulation time 0.00
% 0.74/1.14 demodulation time 0.00
% 0.74/1.14 orient time 0.00
% 0.74/1.14 weigh time 0.00
% 0.74/1.14 forward subsume time 0.00
% 0.74/1.14 back demod find time 0.00
% 0.74/1.14 conflict time 0.00
% 0.74/1.14 LRPO time 0.00
% 0.74/1.14 store clause time 0.00
% 0.74/1.14 disable clause time 0.00
% 0.74/1.14 prime paramod time 0.00
% 0.74/1.14 semantics time 0.00
% 0.74/1.14
% 0.74/1.14 EQP interrupted
%------------------------------------------------------------------------------