%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP166-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n005.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:37 EDT 2022
% Result : Unsatisfiable 0.50s 1.15s
% Output : Refutation 0.50s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 14 ( 14 unt; 0 nHn; 4 RR)
% Number of literals : 14 ( 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 : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 17 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(multiply(identity,A),A),
file('GRP166-2.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(inverse(A),A),identity),
file('GRP166-2.p',unknown),
[] ).
cnf(3,plain,
equal(multiply(multiply(A,B),C),multiply(A,multiply(B,C))),
file('GRP166-2.p',unknown),
[] ).
cnf(4,plain,
equal(greatest_lower_bound(A,B),greatest_lower_bound(B,A)),
file('GRP166-2.p',unknown),
[] ).
cnf(13,plain,
equal(multiply(A,greatest_lower_bound(B,C)),greatest_lower_bound(multiply(A,B),multiply(A,C))),
file('GRP166-2.p',unknown),
[] ).
cnf(17,plain,
equal(greatest_lower_bound(b,identity),identity),
file('GRP166-2.p',unknown),
[] ).
cnf(18,plain,
~ equal(greatest_lower_bound(a,multiply(a,b)),a),
file('GRP166-2.p',unknown),
[] ).
cnf(19,plain,
equal(multiply(inverse(A),multiply(A,B)),B),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[2,3]),1]),1]),
[iquote('para(2,3),demod([1]),flip(1)')] ).
cnf(22,plain,
equal(greatest_lower_bound(identity,b),identity),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[17,4]),1]),
[iquote('para(17,4),flip(1)')] ).
cnf(53,plain,
equal(multiply(inverse(inverse(A)),identity),A),
inference(para,[status(thm),theory(equality)],[2,19]),
[iquote('para(2,19)')] ).
cnf(71,plain,
equal(multiply(inverse(inverse(A)),B),multiply(A,B)),
inference(para,[status(thm),theory(equality)],[19,19]),
[iquote('para(19,19)')] ).
cnf(72,plain,
equal(multiply(A,identity),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[53]),71]),
[iquote('back_demod(53),demod([71])')] ).
cnf(81,plain,
equal(greatest_lower_bound(A,multiply(A,b)),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[22,13]),72,72]),1]),
[iquote('para(22,13),demod([72,72]),flip(1)')] ).
cnf(82,plain,
$false,
inference(conflict,[status(thm)],[81,18]),
[iquote('conflict(81,18)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14 % Problem : GRP166-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.08/0.15 % Command : tptp2X_and_run_eqp %s
% 0.14/0.36 % Computer : n005.cluster.edu
% 0.14/0.36 % Model : x86_64 x86_64
% 0.14/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36 % Memory : 8042.1875MB
% 0.14/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37 % CPULimit : 300
% 0.14/0.37 % WCLimit : 600
% 0.14/0.37 % DateTime : Mon Jun 13 19:19:54 EDT 2022
% 0.14/0.37 % CPUTime :
% 0.50/1.15 ----- EQP 0.9e, May 2009 -----
% 0.50/1.15 The job began on n005.cluster.edu, Mon Jun 13 19:19:54 2022
% 0.50/1.15 The command was "./eqp09e".
% 0.50/1.15
% 0.50/1.15 set(prolog_style_variables).
% 0.50/1.15 set(lrpo).
% 0.50/1.15 set(basic_paramod).
% 0.50/1.15 set(functional_subsume).
% 0.50/1.15 set(ordered_paramod).
% 0.50/1.15 set(prime_paramod).
% 0.50/1.15 set(para_pairs).
% 0.50/1.15 assign(pick_given_ratio,4).
% 0.50/1.15 clear(print_kept).
% 0.50/1.15 clear(print_new_demod).
% 0.50/1.15 clear(print_back_demod).
% 0.50/1.15 clear(print_given).
% 0.50/1.15 assign(max_mem,64000).
% 0.50/1.15 end_of_commands.
% 0.50/1.15
% 0.50/1.15 Usable:
% 0.50/1.15 end_of_list.
% 0.50/1.15
% 0.50/1.15 Sos:
% 0.50/1.15 0 (wt=-1) [] multiply(identity,A) = A.
% 0.50/1.15 0 (wt=-1) [] multiply(inverse(A),A) = identity.
% 0.50/1.15 0 (wt=-1) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.50/1.15 0 (wt=-1) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.50/1.15 0 (wt=-1) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.50/1.15 0 (wt=-1) [] greatest_lower_bound(A,greatest_lower_bound(B,C)) = greatest_lower_bound(greatest_lower_bound(A,B),C).
% 0.50/1.15 0 (wt=-1) [] least_upper_bound(A,least_upper_bound(B,C)) = least_upper_bound(least_upper_bound(A,B),C).
% 0.50/1.15 0 (wt=-1) [] least_upper_bound(A,A) = A.
% 0.50/1.15 0 (wt=-1) [] greatest_lower_bound(A,A) = A.
% 0.50/1.15 0 (wt=-1) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.50/1.15 0 (wt=-1) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.50/1.15 0 (wt=-1) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.50/1.15 0 (wt=-1) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.50/1.15 0 (wt=-1) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.50/1.15 0 (wt=-1) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.50/1.15 0 (wt=-1) [] greatest_lower_bound(a,identity) = identity.
% 0.50/1.15 0 (wt=-1) [] greatest_lower_bound(b,identity) = identity.
% 0.50/1.15 0 (wt=-1) [] -(greatest_lower_bound(a,multiply(a,b)) = a).
% 0.50/1.15 end_of_list.
% 0.50/1.15
% 0.50/1.15 Demodulators:
% 0.50/1.15 end_of_list.
% 0.50/1.15
% 0.50/1.15 Passive:
% 0.50/1.15 end_of_list.
% 0.50/1.15
% 0.50/1.15 Starting to process input.
% 0.50/1.15
% 0.50/1.15 ** KEPT: 1 (wt=5) [] multiply(identity,A) = A.
% 0.50/1.15 1 is a new demodulator.
% 0.50/1.15
% 0.50/1.15 ** KEPT: 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.50/1.15 2 is a new demodulator.
% 0.50/1.15
% 0.50/1.15 ** KEPT: 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.50/1.15 3 is a new demodulator.
% 0.50/1.15
% 0.50/1.15 ** KEPT: 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.50/1.15 clause forward subsumed: 0 (wt=7) [flip(4)] greatest_lower_bound(B,A) = greatest_lower_bound(A,B).
% 0.50/1.15
% 0.50/1.15 ** KEPT: 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.50/1.15 clause forward subsumed: 0 (wt=7) [flip(5)] least_upper_bound(B,A) = least_upper_bound(A,B).
% 0.50/1.15
% 0.50/1.15 ** 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.50/1.15 6 is a new demodulator.
% 0.50/1.15
% 0.50/1.15 ** 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.50/1.15 7 is a new demodulator.
% 0.50/1.15
% 0.50/1.15 ** KEPT: 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.50/1.15 8 is a new demodulator.
% 0.50/1.15
% 0.50/1.15 ** KEPT: 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.50/1.15 9 is a new demodulator.
% 0.50/1.15
% 0.50/1.15 ** KEPT: 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.50/1.15 10 is a new demodulator.
% 0.50/1.15
% 0.50/1.15 ** KEPT: 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.50/1.15 11 is a new demodulator.
% 0.50/1.15
% 0.50/1.15 ** KEPT: 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.50/1.15 12 is a new demodulator.
% 0.50/1.15
% 0.50/1.15 ** KEPT: 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.50/1.15 13 is a new demodulator.
% 0.50/1.15
% 0.50/1.15 ** KEPT: 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.50/1.15 14 is a new demodulator.
% 0.50/1.15
% 0.50/1.15 ** KEPT: 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.50/1.15 15 is a new demodulator.
% 0.50/1.15
% 0.50/1.15 ** KEPT: 16 (wt=5) [] greatest_lower_bound(a,identity) = identity.
% 0.50/1.15 16 is a new demodulator.
% 0.50/1.15
% 0.50/1.15 ** KEPT: 17 (wt=5) [] greatest_lower_bound(b,identity) = identity.
% 0.50/1.15 17 is a new demodulator.
% 0.50/1.15
% 0.50/1.15 ** KEPT: 18 (wt=7) [] -(greatest_lower_bound(a,multiply(a,b)) = a).
% 0.50/1.15 ---------------- PROOF FOUND ----------------
% 0.50/1.15 % SZS status Unsatisfiable
% 0.50/1.15
% 0.50/1.15
% 0.50/1.15 After processing input:
% 0.50/1.15
% 0.50/1.15 Usable:
% 0.50/1.15 end_of_list.
% 0.50/1.15
% 0.50/1.15 Sos:
% 0.50/1.15 1 (wt=5) [] multiply(identity,A) = A.
% 0.50/1.15 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.50/1.15 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.50/1.15 16 (wt=5) [] greatest_lower_bound(a,identity) = identity.
% 0.50/1.15 17 (wt=5) [] greatest_lower_bound(b,identity) = identity.
% 0.50/1.15 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.50/1.15 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.50/1.15 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.50/1.15 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.50/1.15 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.50/1.15 18 (wt=7) [] -(greatest_lower_bound(a,multiply(a,b)) = a).
% 0.50/1.15 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.50/1.15 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 0.50/1.15 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 0.50/1.15 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.50/1.15 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.50/1.15 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.50/1.15 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.50/1.15 end_of_list.
% 0.50/1.15
% 0.50/1.15 Demodulators:
% 0.50/1.15 1 (wt=5) [] multiply(identity,A) = A.
% 0.50/1.15 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.50/1.15 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.50/1.15 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 0.50/1.15 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 0.50/1.15 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.50/1.15 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.50/1.15 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.50/1.15 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.50/1.15 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.50/1.15 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.50/1.15 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.50/1.15 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.50/1.15 16 (wt=5) [] greatest_lower_bound(a,identity) = identity.
% 0.50/1.15 17 (wt=5) [] greatest_lower_bound(b,identity) = identity.
% 0.50/1.15 end_of_list.
% 0.50/1.15
% 0.50/1.15 Passive:
% 0.50/1.15 end_of_list.
% 0.50/1.15
% 0.50/1.15 UNIT CONFLICT from 81 and 18 at 0.00 seconds.
% 0.50/1.15
% 0.50/1.15 ---------------- PROOF ----------------
% 0.50/1.15 % SZS output start Refutation
% See solution above
% 0.50/1.15 ------------ end of proof -------------
% 0.50/1.15
% 0.50/1.15
% 0.50/1.15 ------------- memory usage ------------
% 0.50/1.15 Memory dynamically allocated (tp_alloc): 488.
% 0.50/1.15 type (bytes each) gets frees in use avail bytes
% 0.50/1.15 sym_ent ( 96) 58 0 58 0 5.4 K
% 0.50/1.15 term ( 16) 5318 4548 770 15 15.0 K
% 0.50/1.15 gen_ptr ( 8) 3770 1224 2546 13 20.0 K
% 0.50/1.15 context ( 808) 5628 5626 2 3 3.9 K
% 0.50/1.15 trail ( 12) 230 230 0 4 0.0 K
% 0.50/1.15 bt_node ( 68) 2654 2651 3 3 0.4 K
% 0.50/1.15 ac_position (285432) 0 0 0 0 0.0 K
% 0.50/1.15 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.50/1.15 ac_match_free_vars_pos (4020)
% 0.50/1.15 0 0 0 0 0.0 K
% 0.50/1.15 discrim ( 12) 741 53 688 0 8.1 K
% 0.50/1.15 flat ( 40) 5232 5232 0 13 0.5 K
% 0.50/1.15 discrim_pos ( 12) 266 266 0 1 0.0 K
% 0.50/1.15 fpa_head ( 12) 461 0 461 0 5.4 K
% 0.50/1.15 fpa_tree ( 28) 151 151 0 7 0.2 K
% 0.50/1.15 fpa_pos ( 36) 152 152 0 1 0.0 K
% 0.50/1.15 literal ( 12) 357 276 81 1 1.0 K
% 0.50/1.15 clause ( 24) 357 276 81 1 1.9 K
% 0.50/1.15 list ( 12) 130 74 56 3 0.7 K
% 0.50/1.15 list_pos ( 20) 343 53 290 0 5.7 K
% 0.50/1.15 pair_index ( 40) 2 0 2 0 0.1 K
% 0.50/1.15
% 0.50/1.15 -------------- statistics -------------
% 0.50/1.15 Clauses input 18
% 0.50/1.15 Usable input 0
% 0.50/1.15 Sos input 18
% 0.50/1.15 Demodulators input 0
% 0.50/1.15 Passive input 0
% 0.50/1.15
% 0.50/1.15 Processed BS (before search) 20
% 0.50/1.15 Forward subsumed BS 2
% 0.50/1.15 Kept BS 18
% 0.50/1.15 New demodulators BS 15
% 0.50/1.15 Back demodulated BS 0
% 0.50/1.15
% 0.50/1.15 Clauses or pairs given 745
% 0.50/1.15 Clauses generated 229
% 0.50/1.15 Forward subsumed 166
% 0.50/1.15 Deleted by weight 0
% 0.50/1.15 Deleted by variable count 0
% 0.50/1.15 Kept 63
% 0.50/1.15 New demodulators 56
% 0.50/1.15 Back demodulated 7
% 0.50/1.15 Ordered paramod prunes 0
% 0.50/1.15 Basic paramod prunes 1046
% 0.50/1.15 Prime paramod prunes 2
% 0.50/1.15 Semantic prunes 0
% 0.50/1.15
% 0.50/1.15 Rewrite attmepts 1537
% 0.50/1.15 Rewrites 252
% 0.50/1.15
% 0.50/1.15 FPA overloads 0
% 0.50/1.15 FPA underloads 0
% 0.50/1.15
% 0.50/1.15 Usable size 0
% 0.50/1.15 Sos size 73
% 0.50/1.15 Demodulators size 64
% 0.50/1.15 Passive size 0
% 0.50/1.15 Disabled size 7
% 0.50/1.15
% 0.50/1.15 Proofs found 1
% 0.50/1.15
% 0.50/1.15 ----------- times (seconds) ----------- Mon Jun 13 19:19:54 2022
% 0.50/1.15
% 0.50/1.15 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.50/1.15 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.50/1.15 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.50/1.15 input time 0.00
% 0.50/1.15 paramodulation time 0.00
% 0.50/1.15 demodulation time 0.00
% 0.50/1.15 orient time 0.00
% 0.50/1.15 weigh time 0.00
% 0.50/1.15 forward subsume time 0.00
% 0.50/1.15 back demod find time 0.00
% 0.50/1.15 conflict time 0.00
% 0.50/1.15 LRPO time 0.00
% 0.50/1.15 store clause time 0.00
% 0.50/1.15 disable clause time 0.00
% 0.50/1.15 prime paramod time 0.00
% 0.50/1.15 semantics time 0.00
% 0.50/1.15
% 0.50/1.15 EQP interrupted
%------------------------------------------------------------------------------