TSTP Solution File: GRP186-3 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP186-3 : TPTP v8.1.0. Bugfixed v1.2.1.
% 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:45:50 EDT 2022
% Result : Unsatisfiable 0.70s 1.10s
% Output : Refutation 0.70s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 5
% Syntax : Number of clauses : 14 ( 14 unt; 0 nHn; 3 RR)
% Number of literals : 14 ( 0 equ; 2 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 : 18 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(multiply(identity,A),A),
file('GRP186-3.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(inverse(A),A),identity),
file('GRP186-3.p',unknown),
[] ).
cnf(3,plain,
equal(multiply(multiply(A,B),C),multiply(A,multiply(B,C))),
file('GRP186-3.p',unknown),
[] ).
cnf(5,plain,
equal(least_upper_bound(A,B),least_upper_bound(B,A)),
file('GRP186-3.p',unknown),
[] ).
cnf(12,plain,
equal(multiply(A,least_upper_bound(B,C)),least_upper_bound(multiply(A,B),multiply(A,C))),
file('GRP186-3.p',unknown),
[] ).
cnf(16,plain,
~ equal(least_upper_bound(multiply(a,inverse(a)),multiply(a,b)),least_upper_bound(multiply(a,b),identity)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[12]),1]),
[iquote('demod([12]),flip(1)')] ).
cnf(17,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(35,plain,
equal(multiply(inverse(inverse(A)),identity),A),
inference(para,[status(thm),theory(equality)],[2,17]),
[iquote('para(2,17)')] ).
cnf(47,plain,
equal(multiply(inverse(inverse(A)),B),multiply(A,B)),
inference(para,[status(thm),theory(equality)],[17,17]),
[iquote('para(17,17)')] ).
cnf(48,plain,
equal(multiply(A,identity),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[35]),47]),
[iquote('back_demod(35),demod([47])')] ).
cnf(49,plain,
equal(inverse(inverse(A)),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[47,48]),48]),1]),
[iquote('para(47,48),demod([48]),flip(1)')] ).
cnf(50,plain,
equal(multiply(A,inverse(A)),identity),
inference(para,[status(thm),theory(equality)],[49,2]),
[iquote('para(49,2)')] ).
cnf(51,plain,
~ equal(least_upper_bound(multiply(a,b),identity),least_upper_bound(identity,multiply(a,b))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[16]),50]),1]),
[iquote('back_demod(16),demod([50]),flip(1)')] ).
cnf(52,plain,
$false,
inference(conflict,[status(thm)],[51,5]),
[iquote('conflict(51,5)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP186-3 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.07/0.13 % Command : tptp2X_and_run_eqp %s
% 0.13/0.34 % Computer : n025.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jun 13 04:13:23 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.70/1.10 ----- EQP 0.9e, May 2009 -----
% 0.70/1.10 The job began on n025.cluster.edu, Mon Jun 13 04:13:24 2022
% 0.70/1.10 The command was "./eqp09e".
% 0.70/1.10
% 0.70/1.10 set(prolog_style_variables).
% 0.70/1.10 set(lrpo).
% 0.70/1.10 set(basic_paramod).
% 0.70/1.10 set(functional_subsume).
% 0.70/1.10 set(ordered_paramod).
% 0.70/1.10 set(prime_paramod).
% 0.70/1.10 set(para_pairs).
% 0.70/1.10 assign(pick_given_ratio,4).
% 0.70/1.10 clear(print_kept).
% 0.70/1.10 clear(print_new_demod).
% 0.70/1.10 clear(print_back_demod).
% 0.70/1.10 clear(print_given).
% 0.70/1.10 assign(max_mem,64000).
% 0.70/1.10 end_of_commands.
% 0.70/1.10
% 0.70/1.10 Usable:
% 0.70/1.10 end_of_list.
% 0.70/1.10
% 0.70/1.10 Sos:
% 0.70/1.10 0 (wt=-1) [] multiply(identity,A) = A.
% 0.70/1.10 0 (wt=-1) [] multiply(inverse(A),A) = identity.
% 0.70/1.10 0 (wt=-1) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.70/1.10 0 (wt=-1) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.70/1.10 0 (wt=-1) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.70/1.10 0 (wt=-1) [] greatest_lower_bound(A,greatest_lower_bound(B,C)) = greatest_lower_bound(greatest_lower_bound(A,B),C).
% 0.70/1.10 0 (wt=-1) [] least_upper_bound(A,least_upper_bound(B,C)) = least_upper_bound(least_upper_bound(A,B),C).
% 0.70/1.10 0 (wt=-1) [] least_upper_bound(A,A) = A.
% 0.70/1.10 0 (wt=-1) [] greatest_lower_bound(A,A) = A.
% 0.70/1.10 0 (wt=-1) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.70/1.10 0 (wt=-1) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.70/1.10 0 (wt=-1) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.70/1.10 0 (wt=-1) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.70/1.10 0 (wt=-1) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.70/1.10 0 (wt=-1) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.70/1.10 0 (wt=-1) [] -(least_upper_bound(multiply(a,b),identity) = multiply(a,least_upper_bound(inverse(a),b))).
% 0.70/1.10 end_of_list.
% 0.70/1.10
% 0.70/1.10 Demodulators:
% 0.70/1.10 end_of_list.
% 0.70/1.10
% 0.70/1.10 Passive:
% 0.70/1.10 end_of_list.
% 0.70/1.10
% 0.70/1.10 Starting to process input.
% 0.70/1.10
% 0.70/1.10 ** KEPT: 1 (wt=5) [] multiply(identity,A) = A.
% 0.70/1.10 1 is a new demodulator.
% 0.70/1.10
% 0.70/1.10 ** KEPT: 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.70/1.10 2 is a new demodulator.
% 0.70/1.10
% 0.70/1.10 ** KEPT: 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.70/1.10 3 is a new demodulator.
% 0.70/1.10
% 0.70/1.10 ** KEPT: 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.70/1.10 clause forward subsumed: 0 (wt=7) [flip(4)] greatest_lower_bound(B,A) = greatest_lower_bound(A,B).
% 0.70/1.10
% 0.70/1.10 ** KEPT: 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.70/1.10 clause forward subsumed: 0 (wt=7) [flip(5)] least_upper_bound(B,A) = least_upper_bound(A,B).
% 0.70/1.10
% 0.70/1.10 ** 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.70/1.10 6 is a new demodulator.
% 0.70/1.10
% 0.70/1.10 ** 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.70/1.10 7 is a new demodulator.
% 0.70/1.10
% 0.70/1.10 ** KEPT: 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.70/1.10 8 is a new demodulator.
% 0.70/1.10
% 0.70/1.10 ** KEPT: 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.70/1.10 9 is a new demodulator.
% 0.70/1.10
% 0.70/1.10 ** KEPT: 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.70/1.10 10 is a new demodulator.
% 0.70/1.10
% 0.70/1.10 ** KEPT: 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.70/1.10 11 is a new demodulator.
% 0.70/1.10
% 0.70/1.10 ** KEPT: 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.70/1.10 12 is a new demodulator.
% 0.70/1.10
% 0.70/1.10 ** KEPT: 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.70/1.10 13 is a new demodulator.
% 0.70/1.10
% 0.70/1.10 ** KEPT: 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.70/1.10 14 is a new demodulator.
% 0.70/1.10
% 0.70/1.10 ** KEPT: 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.70/1.10 15 is a new demodulator.
% 0.70/1.10
% 0.70/1.10 ** KEPT: 16 (wt=14) [demod([12]),flip(1)] -(least_upper_bound(multiply(a,inverse(a)),multiply(a,b)) = least_upper_bound(multiply(a,b),identity)).
% 0.70/1.10 ---------------- PROOF FOUND ----------------
% 0.70/1.10 % SZS status Unsatisfiable
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 After processing input:
% 0.70/1.10
% 0.70/1.10 Usable:
% 0.70/1.10 end_of_list.
% 0.70/1.10
% 0.70/1.10 Sos:
% 0.70/1.10 1 (wt=5) [] multiply(identity,A) = A.
% 0.70/1.10 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.70/1.10 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.70/1.10 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.70/1.10 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.70/1.10 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.70/1.10 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.70/1.10 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.70/1.10 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.70/1.10 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 0.70/1.10 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 0.70/1.10 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.70/1.10 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.70/1.10 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.70/1.10 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.70/1.10 16 (wt=14) [demod([12]),flip(1)] -(least_upper_bound(multiply(a,inverse(a)),multiply(a,b)) = least_upper_bound(multiply(a,b),identity)).
% 0.70/1.10 end_of_list.
% 0.70/1.10
% 0.70/1.10 Demodulators:
% 0.70/1.10 1 (wt=5) [] multiply(identity,A) = A.
% 0.70/1.10 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.70/1.10 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.70/1.10 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 0.70/1.10 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 0.70/1.10 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.70/1.10 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.70/1.10 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.70/1.10 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.70/1.10 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.70/1.10 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.70/1.10 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.70/1.10 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.70/1.10 end_of_list.
% 0.70/1.10
% 0.70/1.10 Passive:
% 0.70/1.10 end_of_list.
% 0.70/1.10
% 0.70/1.10 UNIT CONFLICT from 51 and 5 at 0.00 seconds.
% 0.70/1.10
% 0.70/1.10 ---------------- PROOF ----------------
% 0.70/1.10 % SZS output start Refutation
% See solution above
% 0.70/1.10 ------------ end of proof -------------
% 0.70/1.10
% 0.70/1.10
% 0.70/1.10 ------------- memory usage ------------
% 0.70/1.10 Memory dynamically allocated (tp_alloc): 488.
% 0.70/1.10 type (bytes each) gets frees in use avail bytes
% 0.70/1.10 sym_ent ( 96) 58 0 58 0 5.4 K
% 0.70/1.10 term ( 16) 3546 3070 476 16 9.4 K
% 0.70/1.10 gen_ptr ( 8) 2201 747 1454 13 11.5 K
% 0.70/1.10 context ( 808) 2313 2311 2 3 3.9 K
% 0.70/1.10 trail ( 12) 146 146 0 3 0.0 K
% 0.70/1.10 bt_node ( 68) 981 979 2 4 0.4 K
% 0.70/1.10 ac_position (285432) 0 0 0 0 0.0 K
% 0.70/1.10 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.70/1.10 ac_match_free_vars_pos (4020)
% 0.70/1.10 0 0 0 0 0.0 K
% 0.70/1.10 discrim ( 12) 433 43 390 20 4.8 K
% 0.70/1.10 flat ( 40) 2923 2923 0 11 0.4 K
% 0.70/1.10 discrim_pos ( 12) 136 136 0 1 0.0 K
% 0.70/1.10 fpa_head ( 12) 313 0 313 0 3.7 K
% 0.70/1.10 fpa_tree ( 28) 79 79 0 13 0.4 K
% 0.70/1.10 fpa_pos ( 36) 92 92 0 1 0.0 K
% 0.70/1.10 literal ( 12) 213 162 51 0 0.6 K
% 0.70/1.10 clause ( 24) 213 162 51 0 1.2 K
% 0.70/1.10 list ( 12) 100 43 57 2 0.7 K
% 0.70/1.10 list_pos ( 20) 219 45 174 3 3.5 K
% 0.70/1.10 pair_index ( 40) 2 0 2 0 0.1 K
% 0.70/1.10
% 0.70/1.10 -------------- statistics -------------
% 0.70/1.10 Clauses input 16
% 0.70/1.10 Usable input 0
% 0.70/1.10 Sos input 16
% 0.70/1.10 Demodulators input 0
% 0.70/1.10 Passive input 0
% 0.70/1.10
% 0.70/1.10 Processed BS (before search) 18
% 0.70/1.10 Forward subsumed BS 2
% 0.70/1.10 Kept BS 16
% 0.70/1.10 New demodulators BS 13
% 0.70/1.10 Back demodulated BS 0
% 0.70/1.10
% 0.70/1.10 Clauses or pairs given 312
% 0.70/1.10 Clauses generated 129
% 0.70/1.10 Forward subsumed 94
% 0.70/1.10 Deleted by weight 0
% 0.70/1.10 Deleted by variable count 0
% 0.70/1.10 Kept 35
% 0.70/1.10 New demodulators 28
% 0.70/1.10 Back demodulated 6
% 0.70/1.10 Ordered paramod prunes 0
% 0.70/1.10 Basic paramod prunes 342
% 0.70/1.10 Prime paramod prunes 3
% 0.70/1.10 Semantic prunes 0
% 0.70/1.10
% 0.70/1.10 Rewrite attmepts 785
% 0.70/1.10 Rewrites 125
% 0.70/1.10
% 0.70/1.10 FPA overloads 0
% 0.70/1.10 FPA underloads 0
% 0.70/1.10
% 0.70/1.10 Usable size 0
% 0.70/1.10 Sos size 44
% 0.70/1.10 Demodulators size 36
% 0.70/1.10 Passive size 0
% 0.70/1.10 Disabled size 6
% 0.70/1.10
% 0.70/1.10 Proofs found 1
% 0.70/1.10
% 0.70/1.10 ----------- times (seconds) ----------- Mon Jun 13 04:13:24 2022
% 0.70/1.10
% 0.70/1.10 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.70/1.10 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.70/1.10 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.70/1.10 input time 0.00
% 0.70/1.10 paramodulation time 0.00
% 0.70/1.10 demodulation time 0.00
% 0.70/1.10 orient time 0.00
% 0.70/1.10 weigh time 0.00
% 0.70/1.10 forward subsume time 0.00
% 0.70/1.10 back demod find time 0.00
% 0.70/1.10 conflict time 0.00
% 0.70/1.10 LRPO time 0.00
% 0.70/1.10 store clause time 0.00
% 0.70/1.10 disable clause time 0.00
% 0.70/1.10 prime paramod time 0.00
% 0.70/1.10 semantics time 0.00
% 0.70/1.10
% 0.70/1.10 EQP interrupted
%------------------------------------------------------------------------------