TSTP Solution File: GRP446-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP446-1 : TPTP v8.1.0. Released v2.6.0.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n025.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:28 EDT 2022
% Result : Unsatisfiable 1.00s 1.36s
% Output : Refutation 1.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 4
% Syntax : Number of clauses : 38 ( 38 unt; 0 nHn; 5 RR)
% Number of literals : 38 ( 0 equ; 4 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 11 ( 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 : 93 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(divide(A,divide(divide(divide(divide(A,A),B),C),divide(divide(divide(A,A),A),C))),B),
file('GRP446-1.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(A,B),divide(A,divide(divide(C,C),B))),
file('GRP446-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('GRP446-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('GRP446-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(8,plain,
equal(divide(inverse(divide(A,A)),B),inverse(B)),
inference(para,[status(thm),theory(equality)],[5,5]),
[iquote('para(5,5)')] ).
cnf(9,plain,
equal(inverse(A),divide(inverse(divide(B,B)),A)),
inference(flip,[status(thm),theory(equality)],[8]),
[iquote('flip(8)')] ).
cnf(11,plain,
equal(divide(A,divide(divide(B,C),divide(divide(divide(A,A),A),C))),divide(divide(divide(divide(divide(A,A),divide(A,A)),B),D),divide(divide(divide(divide(A,A),divide(A,A)),divide(A,A)),D))),
inference(para,[status(thm),theory(equality)],[1,1]),
[iquote('para(1,1)')] ).
cnf(12,plain,
equal(divide(divide(divide(divide(divide(A,A),divide(A,A)),B),C),divide(divide(divide(divide(A,A),divide(A,A)),divide(A,A)),C)),divide(A,divide(divide(B,D),divide(divide(divide(A,A),A),D)))),
inference(flip,[status(thm),theory(equality)],[11]),
[iquote('flip(11)')] ).
cnf(14,plain,
equal(divide(A,divide(divide(divide(divide(A,A),B),divide(divide(divide(divide(divide(divide(A,A),A),divide(divide(A,A),A)),C),D),divide(divide(divide(divide(divide(A,A),A),divide(divide(A,A),A)),divide(divide(A,A),A)),D))),C)),B),
inference(para,[status(thm),theory(equality)],[1,1]),
[iquote('para(1,1)')] ).
cnf(19,plain,
equal(divide(inverse(divide(A,A)),B),divide(divide(C,C),B)),
inference(para,[status(thm),theory(equality)],[9,4]),
[iquote('para(9,4)')] ).
cnf(20,plain,
equal(divide(divide(A,A),B),divide(inverse(divide(C,C)),B)),
inference(flip,[status(thm),theory(equality)],[19]),
[iquote('flip(19)')] ).
cnf(53,plain,
equal(divide(A,inverse(B)),multiply(A,B)),
inference(para,[status(thm),theory(equality)],[5,3]),
[iquote('para(5,3)')] ).
cnf(55,plain,
equal(inverse(divide(divide(A,A),B)),multiply(divide(C,C),B)),
inference(para,[status(thm),theory(equality)],[5,3]),
[iquote('para(5,3)')] ).
cnf(56,plain,
equal(multiply(divide(A,A),B),inverse(divide(divide(C,C),B))),
inference(flip,[status(thm),theory(equality)],[55]),
[iquote('flip(55)')] ).
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(61,plain,
equal(multiply(divide(A,A),B),inverse(inverse(B))),
inference(para,[status(thm),theory(equality)],[53,5]),
[iquote('para(53,5)')] ).
cnf(62,plain,
equal(inverse(inverse(A)),multiply(divide(B,B),A)),
inference(flip,[status(thm),theory(equality)],[61]),
[iquote('flip(61)')] ).
cnf(64,plain,
equal(divide(A,divide(divide(inverse(B),C),divide(divide(divide(A,A),A),C))),B),
inference(para,[status(thm),theory(equality)],[5,1]),
[iquote('para(5,1)')] ).
cnf(65,plain,
equal(divide(A,divide(inverse(B),divide(divide(divide(A,A),A),B))),divide(A,A)),
inference(para,[status(thm),theory(equality)],[5,1]),
[iquote('para(5,1)')] ).
cnf(77,plain,
equal(inverse(inverse(A)),multiply(multiply(inverse(B),B),A)),
inference(para,[status(thm),theory(equality)],[59,53]),
[iquote('para(59,53)')] ).
cnf(78,plain,
equal(multiply(multiply(inverse(A),A),B),inverse(inverse(B))),
inference(flip,[status(thm),theory(equality)],[77]),
[iquote('flip(77)')] ).
cnf(81,plain,
equal(divide(A,divide(divide(divide(B,B),C),divide(divide(divide(A,A),A),C))),divide(A,A)),
inference(para,[status(thm),theory(equality)],[7,1]),
[iquote('para(7,1)')] ).
cnf(158,plain,
~ equal(inverse(inverse(a2)),a2),
inference(para,[status(thm),theory(equality)],[78,6]),
[iquote('para(78,6)')] ).
cnf(162,plain,
equal(divide(divide(divide(divide(divide(A,A),divide(A,A)),divide(B,B)),C),divide(divide(divide(divide(A,A),divide(A,A)),divide(A,A)),C)),divide(A,A)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[5,11]),65]),1]),
[iquote('para(5,11),demod([65]),flip(1)')] ).
cnf(171,plain,
~ equal(multiply(divide(A,A),a2),a2),
inference(para,[status(thm),theory(equality)],[62,158]),
[iquote('para(62,158)')] ).
cnf(204,plain,
equal(divide(divide(divide(divide(divide(divide(divide(A,A),divide(A,A)),divide(divide(A,A),divide(A,A))),divide(divide(divide(A,A),divide(A,A)),divide(divide(A,A),divide(A,A)))),B),C),divide(divide(divide(divide(divide(divide(A,A),divide(A,A)),divide(divide(A,A),divide(A,A))),divide(divide(divide(A,A),divide(A,A)),divide(divide(A,A),divide(A,A)))),divide(divide(divide(A,A),divide(A,A)),divide(divide(A,A),divide(A,A)))),C)),divide(divide(divide(A,A),divide(A,A)),divide(divide(B,divide(divide(divide(divide(A,A),divide(A,A)),divide(A,A)),divide(divide(A,A),divide(A,A)))),divide(A,A)))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[12,11]),81]),1]),
[iquote('para(12,11),demod([81]),flip(1)')] ).
cnf(231,plain,
equal(inverse(divide(divide(divide(divide(divide(A,A),divide(A,A)),B),divide(divide(divide(divide(divide(divide(divide(A,A),divide(A,A)),divide(A,A)),divide(divide(divide(A,A),divide(A,A)),divide(A,A))),C),D),divide(divide(divide(divide(divide(divide(A,A),divide(A,A)),divide(A,A)),divide(divide(divide(A,A),divide(A,A)),divide(A,A))),divide(divide(divide(A,A),divide(A,A)),divide(A,A))),D))),C)),B),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[14,5]),1]),
[iquote('para(14,5),flip(1)')] ).
cnf(358,plain,
equal(divide(A,A),divide(B,B)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[20,11]),64,162]),
[iquote('para(20,11),demod([64,162])')] ).
cnf(958,plain,
~ equal(inverse(divide(divide(A,A),a2)),a2),
inference(para,[status(thm),theory(equality)],[56,171]),
[iquote('para(56,171)')] ).
cnf(2072,plain,
equal(divide(A,divide(divide(inverse(B),C),divide(inverse(A),C))),B),
inference(para,[status(thm),theory(equality)],[5,64]),
[iquote('para(5,64)')] ).
cnf(2165,plain,
equal(divide(A,divide(B,B)),A),
inference(para,[status(thm),theory(equality)],[358,2072]),
[iquote('para(358,2072)')] ).
cnf(2440,plain,
equal(inverse(divide(divide(divide(divide(A,A),B),divide(divide(divide(divide(A,A),C),D),divide(divide(A,A),D))),C)),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[231]),2165,2165,2165,2165,2165,2165,2165,2165,2165,2165,2165,2165,2165,2165]),
[iquote('back_demod(231),demod([2165,2165,2165,2165,2165,2165,2165,2165,2165,2165,2165,2165,2165,2165])')] ).
cnf(2452,plain,
equal(divide(divide(divide(divide(A,A),B),C),divide(divide(A,A),C)),divide(divide(A,A),B)),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[204]),2165,2165,2165,2165,2165,2165,2165,2165,2165,2165,2165,2165,2165,2165,2165,2165,2165,2165,2165,2165,2165,2165,2165,2165,2165]),
[iquote('back_demod(204),demod([2165,2165,2165,2165,2165,2165,2165,2165,2165,2165,2165,2165,2165,2165,2165,2165,2165,2165,2165,2165,2165,2165,2165,2165,2165])')] ).
cnf(2456,plain,
equal(inverse(divide(divide(divide(divide(A,A),B),divide(divide(A,A),C)),C)),B),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[2440]),2452]),
[iquote('back_demod(2440),demod([2452])')] ).
cnf(2457,plain,
$false,
inference(conflict,[status(thm)],[2456,958]),
[iquote('conflict(2456,958)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP446-1 : TPTP v8.1.0. Released v2.6.0.
% 0.03/0.12 % Command : tptp2X_and_run_eqp %s
% 0.14/0.34 % Computer : n025.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 03:52:09 EDT 2022
% 0.14/0.34 % CPUTime :
% 1.00/1.36 ----- EQP 0.9e, May 2009 -----
% 1.00/1.36 The job began on n025.cluster.edu, Tue Jun 14 03:52:10 2022
% 1.00/1.36 The command was "./eqp09e".
% 1.00/1.36
% 1.00/1.36 set(prolog_style_variables).
% 1.00/1.36 set(lrpo).
% 1.00/1.36 set(basic_paramod).
% 1.00/1.36 set(functional_subsume).
% 1.00/1.36 set(ordered_paramod).
% 1.00/1.36 set(prime_paramod).
% 1.00/1.36 set(para_pairs).
% 1.00/1.36 assign(pick_given_ratio,4).
% 1.00/1.36 clear(print_kept).
% 1.00/1.36 clear(print_new_demod).
% 1.00/1.36 clear(print_back_demod).
% 1.00/1.36 clear(print_given).
% 1.00/1.36 assign(max_mem,64000).
% 1.00/1.36 end_of_commands.
% 1.00/1.36
% 1.00/1.36 Usable:
% 1.00/1.36 end_of_list.
% 1.00/1.36
% 1.00/1.36 Sos:
% 1.00/1.36 0 (wt=-1) [] divide(A,divide(divide(divide(divide(A,A),B),C),divide(divide(divide(A,A),A),C))) = B.
% 1.00/1.36 0 (wt=-1) [] multiply(A,B) = divide(A,divide(divide(C,C),B)).
% 1.00/1.36 0 (wt=-1) [] inverse(A) = divide(divide(B,B),A).
% 1.00/1.36 0 (wt=-1) [] -(multiply(multiply(inverse(b2),b2),a2) = a2).
% 1.00/1.36 end_of_list.
% 1.00/1.36
% 1.00/1.36 Demodulators:
% 1.00/1.36 end_of_list.
% 1.00/1.36
% 1.00/1.36 Passive:
% 1.00/1.36 end_of_list.
% 1.00/1.36
% 1.00/1.36 Starting to process input.
% 1.00/1.36
% 1.00/1.36 ** KEPT: 1 (wt=19) [] divide(A,divide(divide(divide(divide(A,A),B),C),divide(divide(divide(A,A),A),C))) = B.
% 1.00/1.36 1 is a new demodulator.
% 1.00/1.36
% 1.00/1.36 ** KEPT: 2 (wt=11) [] multiply(A,B) = divide(A,divide(divide(C,C),B)).
% 1.00/1.36
% 1.00/1.36 ** KEPT: 3 (wt=11) [flip(2)] divide(A,divide(divide(B,B),C)) = multiply(A,C).
% 1.00/1.36 clause forward subsumed: 0 (wt=11) [flip(3)] multiply(A,C) = divide(A,divide(divide(B,B),C)).
% 1.00/1.36
% 1.00/1.36 ** KEPT: 4 (wt=8) [] inverse(A) = divide(divide(B,B),A).
% 1.00/1.36
% 1.00/1.36 ** KEPT: 5 (wt=8) [flip(4)] divide(divide(A,A),B) = inverse(B).
% 1.00/1.36 clause forward subsumed: 0 (wt=8) [flip(5)] inverse(B) = divide(divide(A,A),B).
% 1.00/1.36
% 1.00/1.36 ** KEPT: 6 (wt=8) [] -(multiply(multiply(inverse(b2),b2),a2) = a2).
% 1.00/1.36 ---------------- PROOF FOUND ----------------
% 1.00/1.36 % SZS status Unsatisfiable
% 1.00/1.36
% 1.00/1.36
% 1.00/1.36 After processing input:
% 1.00/1.36
% 1.00/1.36 Usable:
% 1.00/1.36 end_of_list.
% 1.00/1.36
% 1.00/1.36 Sos:
% 1.00/1.36 4 (wt=8) [] inverse(A) = divide(divide(B,B),A).
% 1.00/1.36 5 (wt=8) [flip(4)] divide(divide(A,A),B) = inverse(B).
% 1.00/1.36 6 (wt=8) [] -(multiply(multiply(inverse(b2),b2),a2) = a2).
% 1.00/1.36 2 (wt=11) [] multiply(A,B) = divide(A,divide(divide(C,C),B)).
% 1.00/1.36 3 (wt=11) [flip(2)] divide(A,divide(divide(B,B),C)) = multiply(A,C).
% 1.00/1.36 1 (wt=19) [] divide(A,divide(divide(divide(divide(A,A),B),C),divide(divide(divide(A,A),A),C))) = B.
% 1.00/1.36 end_of_list.
% 1.00/1.36
% 1.00/1.36 Demodulators:
% 1.00/1.36 1 (wt=19) [] divide(A,divide(divide(divide(divide(A,A),B),C),divide(divide(divide(A,A),A),C))) = B.
% 1.00/1.37 end_of_list.
% 1.00/1.37
% 1.00/1.37 Passive:
% 1.00/1.37 end_of_list.
% 1.00/1.37
% 1.00/1.37 UNIT CONFLICT from 2456 and 958 at 0.20 seconds.
% 1.00/1.37
% 1.00/1.37 ---------------- PROOF ----------------
% 1.00/1.37 % SZS output start Refutation
% See solution above
% 1.00/1.37 ------------ end of proof -------------
% 1.00/1.37
% 1.00/1.37
% 1.00/1.37 ------------- memory usage ------------
% 1.00/1.37 Memory dynamically allocated (tp_alloc): 4882.
% 1.00/1.37 type (bytes each) gets frees in use avail bytes
% 1.00/1.37 sym_ent ( 96) 56 0 56 0 5.2 K
% 1.00/1.37 term ( 16) 182997 120107 62890 135 1221.4 K
% 1.00/1.37 gen_ptr ( 8) 374227 55274 318953 37 2492.1 K
% 1.00/1.37 context ( 808) 121968 121966 2 2 3.2 K
% 1.00/1.37 trail ( 12) 14975 14975 0 6 0.1 K
% 1.00/1.37 bt_node ( 68) 23028 23022 6 21 1.8 K
% 1.00/1.37 ac_position (285432) 0 0 0 0 0.0 K
% 1.00/1.37 ac_match_pos (14044) 0 0 0 0 0.0 K
% 1.00/1.37 ac_match_free_vars_pos (4020)
% 1.00/1.37 0 0 0 0 0.0 K
% 1.00/1.37 discrim ( 12) 40687 22971 17716 17215 409.3 K
% 1.00/1.37 flat ( 40) 488085 488085 0 143 5.6 K
% 1.00/1.37 discrim_pos ( 12) 6607 6607 0 1 0.0 K
% 1.00/1.37 fpa_head ( 12) 10985 0 10985 0 128.7 K
% 1.00/1.37 fpa_tree ( 28) 10580 10580 0 39 1.1 K
% 1.00/1.37 fpa_pos ( 36) 2776 2776 0 1 0.0 K
% 1.00/1.37 literal ( 12) 11385 8929 2456 1 28.8 K
% 1.00/1.37 clause ( 24) 11385 8929 2456 1 57.6 K
% 1.00/1.37 list ( 12) 379 321 58 4 0.7 K
% 1.00/1.37 list_pos ( 20) 10607 5446 5161 2288 145.5 K
% 1.00/1.37 pair_index ( 40) 2 0 2 0 0.1 K
% 1.00/1.37
% 1.00/1.37 -------------- statistics -------------
% 1.00/1.37 Clauses input 4
% 1.00/1.37 Usable input 0
% 1.00/1.37 Sos input 4
% 1.00/1.37 Demodulators input 0
% 1.00/1.37 Passive input 0
% 1.00/1.37
% 1.00/1.37 Processed BS (before search) 8
% 1.00/1.37 Forward subsumed BS 2
% 1.00/1.37 Kept BS 6
% 1.00/1.37 New demodulators BS 1
% 1.00/1.37 Back demodulated BS 0
% 1.00/1.37
% 1.00/1.37 Clauses or pairs given 7331
% 1.00/1.37 Clauses generated 5785
% 1.00/1.37 Forward subsumed 3335
% 1.00/1.37 Deleted by weight 0
% 1.00/1.37 Deleted by variable count 0
% 1.00/1.37 Kept 2450
% 1.00/1.37 New demodulators 319
% 1.00/1.37 Back demodulated 1271
% 1.00/1.37 Ordered paramod prunes 0
% 1.00/1.37 Basic paramod prunes 16687
% 1.00/1.37 Prime paramod prunes 3
% 1.00/1.37 Semantic prunes 0
% 1.00/1.37
% 1.00/1.37 Rewrite attmepts 75360
% 1.00/1.37 Rewrites 3437
% 1.00/1.37
% 1.00/1.37 FPA overloads 0
% 1.00/1.37 FPA underloads 0
% 1.00/1.37
% 1.00/1.37 Usable size 0
% 1.00/1.37 Sos size 1184
% 1.00/1.37 Demodulators size 179
% 1.00/1.37 Passive size 0
% 1.00/1.37 Disabled size 1271
% 1.00/1.37
% 1.00/1.37 Proofs found 1
% 1.00/1.37
% 1.00/1.37 ----------- times (seconds) ----------- Tue Jun 14 03:52:10 2022
% 1.00/1.37
% 1.00/1.37 user CPU time 0.20 (0 hr, 0 min, 0 sec)
% 1.00/1.37 system CPU time 0.10 (0 hr, 0 min, 0 sec)
% 1.00/1.37 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 1.00/1.37 input time 0.00
% 1.00/1.37 paramodulation time 0.02
% 1.00/1.37 demodulation time 0.01
% 1.00/1.37 orient time 0.02
% 1.00/1.37 weigh time 0.01
% 1.00/1.37 forward subsume time 0.01
% 1.00/1.37 back demod find time 0.00
% 1.00/1.37 conflict time 0.01
% 1.00/1.37 LRPO time 0.01
% 1.00/1.37 store clause time 0.06
% 1.00/1.37 disable clause time 0.01
% 1.00/1.37 prime paramod time 0.00
% 1.00/1.37 semantics time 0.00
% 1.00/1.37
% 1.00/1.37 EQP interrupted
%------------------------------------------------------------------------------