TSTP Solution File: GRP168-2 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP168-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n006.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:45:39 EDT 2022
% Result : Unsatisfiable 0.73s 1.18s
% Output : Refutation 0.73s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 6
% Syntax : Number of clauses : 9 ( 9 unt; 0 nHn; 3 RR)
% Number of literals : 9 ( 0 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-2 aty)
% Number of variables : 13 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(multiply(identity,A),A),
file('GRP168-2.p',unknown),
[] ).
cnf(3,plain,
equal(multiply(multiply(A,B),C),multiply(A,multiply(B,C))),
file('GRP168-2.p',unknown),
[] ).
cnf(13,plain,
equal(multiply(A,greatest_lower_bound(B,C)),greatest_lower_bound(multiply(A,B),multiply(A,C))),
file('GRP168-2.p',unknown),
[] ).
cnf(15,plain,
equal(multiply(greatest_lower_bound(A,B),C),greatest_lower_bound(multiply(A,C),multiply(B,C))),
file('GRP168-2.p',unknown),
[] ).
cnf(16,plain,
equal(greatest_lower_bound(a,b),a),
file('GRP168-2.p',unknown),
[] ).
cnf(17,plain,
~ equal(greatest_lower_bound(multiply(inverse(c),multiply(a,c)),multiply(inverse(c),multiply(b,c))),multiply(inverse(c),multiply(a,c))),
file('GRP168-2.p',unknown),
[] ).
cnf(60,plain,
equal(greatest_lower_bound(multiply(A,a),multiply(A,b)),multiply(A,a)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[16,13]),1]),
[iquote('para(16,13),flip(1)')] ).
cnf(386,plain,
equal(greatest_lower_bound(multiply(A,multiply(a,B)),multiply(A,multiply(b,B))),multiply(A,multiply(a,B))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[60,15]),3,3,3]),1]),
[iquote('para(60,15),demod([3,3,3]),flip(1)')] ).
cnf(387,plain,
$false,
inference(conflict,[status(thm)],[386,17]),
[iquote('conflict(386,17)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP168-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.03/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n006.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 18:40:41 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.73/1.18 ----- EQP 0.9e, May 2009 -----
% 0.73/1.18 The job began on n006.cluster.edu, Mon Jun 13 18:40:42 2022
% 0.73/1.18 The command was "./eqp09e".
% 0.73/1.18
% 0.73/1.18 set(prolog_style_variables).
% 0.73/1.18 set(lrpo).
% 0.73/1.18 set(basic_paramod).
% 0.73/1.18 set(functional_subsume).
% 0.73/1.18 set(ordered_paramod).
% 0.73/1.18 set(prime_paramod).
% 0.73/1.18 set(para_pairs).
% 0.73/1.18 assign(pick_given_ratio,4).
% 0.73/1.18 clear(print_kept).
% 0.73/1.18 clear(print_new_demod).
% 0.73/1.18 clear(print_back_demod).
% 0.73/1.18 clear(print_given).
% 0.73/1.18 assign(max_mem,64000).
% 0.73/1.18 end_of_commands.
% 0.73/1.18
% 0.73/1.18 Usable:
% 0.73/1.18 end_of_list.
% 0.73/1.18
% 0.73/1.18 Sos:
% 0.73/1.18 0 (wt=-1) [] multiply(identity,A) = A.
% 0.73/1.18 0 (wt=-1) [] multiply(inverse(A),A) = identity.
% 0.73/1.18 0 (wt=-1) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.73/1.18 0 (wt=-1) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.73/1.18 0 (wt=-1) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.73/1.18 0 (wt=-1) [] greatest_lower_bound(A,greatest_lower_bound(B,C)) = greatest_lower_bound(greatest_lower_bound(A,B),C).
% 0.73/1.18 0 (wt=-1) [] least_upper_bound(A,least_upper_bound(B,C)) = least_upper_bound(least_upper_bound(A,B),C).
% 0.73/1.18 0 (wt=-1) [] least_upper_bound(A,A) = A.
% 0.73/1.18 0 (wt=-1) [] greatest_lower_bound(A,A) = A.
% 0.73/1.18 0 (wt=-1) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.73/1.18 0 (wt=-1) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.73/1.18 0 (wt=-1) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.73/1.18 0 (wt=-1) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.73/1.18 0 (wt=-1) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.73/1.18 0 (wt=-1) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.73/1.18 0 (wt=-1) [] greatest_lower_bound(a,b) = a.
% 0.73/1.18 0 (wt=-1) [] -(greatest_lower_bound(multiply(inverse(c),multiply(a,c)),multiply(inverse(c),multiply(b,c))) = multiply(inverse(c),multiply(a,c))).
% 0.73/1.18 end_of_list.
% 0.73/1.18
% 0.73/1.18 Demodulators:
% 0.73/1.18 end_of_list.
% 0.73/1.18
% 0.73/1.18 Passive:
% 0.73/1.18 end_of_list.
% 0.73/1.18
% 0.73/1.18 Starting to process input.
% 0.73/1.18
% 0.73/1.18 ** KEPT: 1 (wt=5) [] multiply(identity,A) = A.
% 0.73/1.18 1 is a new demodulator.
% 0.73/1.18
% 0.73/1.18 ** KEPT: 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.73/1.18 2 is a new demodulator.
% 0.73/1.18
% 0.73/1.18 ** KEPT: 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.73/1.18 3 is a new demodulator.
% 0.73/1.18
% 0.73/1.18 ** KEPT: 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.73/1.18 clause forward subsumed: 0 (wt=7) [flip(4)] greatest_lower_bound(B,A) = greatest_lower_bound(A,B).
% 0.73/1.18
% 0.73/1.18 ** KEPT: 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.73/1.18 clause forward subsumed: 0 (wt=7) [flip(5)] least_upper_bound(B,A) = least_upper_bound(A,B).
% 0.73/1.18
% 0.73/1.18 ** KEPT: 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 0.73/1.18 6 is a new demodulator.
% 0.73/1.18
% 0.73/1.18 ** KEPT: 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 0.73/1.18 7 is a new demodulator.
% 0.73/1.18
% 0.73/1.18 ** KEPT: 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.73/1.18 8 is a new demodulator.
% 0.73/1.18
% 0.73/1.18 ** KEPT: 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.73/1.18 9 is a new demodulator.
% 0.73/1.18
% 0.73/1.18 ** KEPT: 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.73/1.18 10 is a new demodulator.
% 0.73/1.18
% 0.73/1.18 ** KEPT: 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.73/1.18 11 is a new demodulator.
% 0.73/1.18
% 0.73/1.18 ** KEPT: 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.73/1.18 12 is a new demodulator.
% 0.73/1.18
% 0.73/1.18 ** KEPT: 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.73/1.18 13 is a new demodulator.
% 0.73/1.18
% 0.73/1.18 ** KEPT: 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.73/1.18 14 is a new demodulator.
% 0.73/1.18
% 0.73/1.18 ** KEPT: 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.73/1.18 15 is a new demodulator.
% 0.73/1.18
% 0.73/1.18 ** KEPT: 16 (wt=5) [] greatest_lower_bound(a,b) = a.
% 0.73/1.18 16 is a new demodulator.
% 0.73/1.18
% 0.73/1.18 ** KEPT: 17 (wt=20) [] -(greatest_lower_bound(multiply(inverse(c),multiply(a,c)),multiply(inverse(c),multiply(b,c))) = multiply(inverse(c),multiply(a,c))).
% 0.73/1.18 ---------------- PROOF FOUND ----------------
% 0.73/1.18 % SZS status Unsatisfiable
% 0.73/1.18
% 0.73/1.18
% 0.73/1.18 After processing input:
% 0.73/1.18
% 0.73/1.18 Usable:
% 0.73/1.18 end_of_list.
% 0.73/1.18
% 0.73/1.18 Sos:
% 0.73/1.18 1 (wt=5) [] multiply(identity,A) = A.
% 0.73/1.18 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.73/1.18 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.73/1.18 16 (wt=5) [] greatest_lower_bound(a,b) = a.
% 0.73/1.18 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.73/1.18 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.73/1.18 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.73/1.18 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.73/1.18 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.73/1.18 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.73/1.18 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 0.73/1.18 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 0.73/1.18 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.73/1.18 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.73/1.18 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.73/1.18 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.73/1.18 17 (wt=20) [] -(greatest_lower_bound(multiply(inverse(c),multiply(a,c)),multiply(inverse(c),multiply(b,c))) = multiply(inverse(c),multiply(a,c))).
% 0.73/1.18 end_of_list.
% 0.73/1.18
% 0.73/1.18 Demodulators:
% 0.73/1.18 1 (wt=5) [] multiply(identity,A) = A.
% 0.73/1.18 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.73/1.18 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.73/1.18 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 0.73/1.18 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 0.73/1.18 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.73/1.18 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.73/1.18 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.73/1.18 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.73/1.18 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.73/1.18 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.73/1.18 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.73/1.18 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.73/1.18 16 (wt=5) [] greatest_lower_bound(a,b) = a.
% 0.73/1.18 end_of_list.
% 0.73/1.18
% 0.73/1.18 Passive:
% 0.73/1.18 end_of_list.
% 0.73/1.18
% 0.73/1.18 UNIT CONFLICT from 386 and 17 at 0.03 seconds.
% 0.73/1.18
% 0.73/1.18 ---------------- PROOF ----------------
% 0.73/1.18 % SZS output start Refutation
% See solution above
% 0.73/1.18 ------------ end of proof -------------
% 0.73/1.18
% 0.73/1.18
% 0.73/1.18 ------------- memory usage ------------
% 0.73/1.18 Memory dynamically allocated (tp_alloc): 976.
% 0.73/1.18 type (bytes each) gets frees in use avail bytes
% 0.73/1.18 sym_ent ( 96) 59 0 59 0 5.5 K
% 0.73/1.18 term ( 16) 39938 33485 6453 21 124.9 K
% 0.73/1.18 gen_ptr ( 8) 32887 7928 24959 8 195.1 K
% 0.73/1.18 context ( 808) 44224 44222 2 4 4.7 K
% 0.73/1.18 trail ( 12) 1756 1756 0 5 0.1 K
% 0.73/1.18 bt_node ( 68) 20168 20165 3 12 1.0 K
% 0.73/1.18 ac_position (285432) 0 0 0 0 0.0 K
% 0.73/1.18 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.73/1.18 ac_match_free_vars_pos (4020)
% 0.73/1.18 0 0 0 0 0.0 K
% 0.73/1.18 discrim ( 12) 5712 196 5516 0 64.6 K
% 0.73/1.18 flat ( 40) 63216 63216 0 35 1.4 K
% 0.73/1.18 discrim_pos ( 12) 2295 2295 0 1 0.0 K
% 0.73/1.18 fpa_head ( 12) 1912 0 1912 0 22.4 K
% 0.73/1.18 fpa_tree ( 28) 1122 1122 0 11 0.3 K
% 0.73/1.18 fpa_pos ( 36) 702 702 0 1 0.0 K
% 0.73/1.18 literal ( 12) 2209 1823 386 1 4.5 K
% 0.73/1.18 clause ( 24) 2209 1823 386 1 9.1 K
% 0.73/1.18 list ( 12) 375 319 56 3 0.7 K
% 0.73/1.18 list_pos ( 20) 1546 146 1400 0 27.3 K
% 0.73/1.18 pair_index ( 40) 2 0 2 0 0.1 K
% 0.73/1.18
% 0.73/1.18 -------------- statistics -------------
% 0.73/1.18 Clauses input 17
% 0.73/1.19 Usable input 0
% 0.73/1.19 Sos input 17
% 0.73/1.19 Demodulators input 0
% 0.73/1.19 Passive input 0
% 0.73/1.19
% 0.73/1.19 Processed BS (before search) 19
% 0.73/1.19 Forward subsumed BS 2
% 0.73/1.19 Kept BS 17
% 0.73/1.19 New demodulators BS 14
% 0.73/1.19 Back demodulated BS 0
% 0.73/1.19
% 0.73/1.19 Clauses or pairs given 4630
% 0.73/1.19 Clauses generated 1554
% 0.73/1.19 Forward subsumed 1185
% 0.73/1.19 Deleted by weight 0
% 0.73/1.19 Deleted by variable count 0
% 0.73/1.19 Kept 369
% 0.73/1.19 New demodulators 302
% 0.73/1.19 Back demodulated 29
% 0.73/1.19 Ordered paramod prunes 0
% 0.73/1.19 Basic paramod prunes 14221
% 0.73/1.19 Prime paramod prunes 37
% 0.73/1.19 Semantic prunes 0
% 0.73/1.19
% 0.73/1.19 Rewrite attmepts 14496
% 0.73/1.19 Rewrites 2084
% 0.73/1.19
% 0.73/1.19 FPA overloads 0
% 0.73/1.19 FPA underloads 0
% 0.73/1.19
% 0.73/1.19 Usable size 0
% 0.73/1.19 Sos size 356
% 0.73/1.19 Demodulators size 303
% 0.73/1.19 Passive size 0
% 0.73/1.19 Disabled size 29
% 0.73/1.19
% 0.73/1.19 Proofs found 1
% 0.73/1.19
% 0.73/1.19 ----------- times (seconds) ----------- Mon Jun 13 18:40:42 2022
% 0.73/1.19
% 0.73/1.19 user CPU time 0.03 (0 hr, 0 min, 0 sec)
% 0.73/1.19 system CPU time 0.06 (0 hr, 0 min, 0 sec)
% 0.73/1.19 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.73/1.19 input time 0.00
% 0.73/1.19 paramodulation time 0.01
% 0.73/1.19 demodulation time 0.01
% 0.73/1.19 orient time 0.00
% 0.73/1.19 weigh time 0.00
% 0.73/1.19 forward subsume time 0.00
% 0.73/1.19 back demod find time 0.00
% 0.73/1.19 conflict time 0.00
% 0.73/1.19 LRPO time 0.00
% 0.73/1.19 store clause time 0.00
% 0.73/1.19 disable clause time 0.00
% 0.73/1.19 prime paramod time 0.01
% 0.73/1.19 semantics time 0.00
% 0.73/1.19
% 0.73/1.19 EQP interrupted
%------------------------------------------------------------------------------