TSTP Solution File: GRP168-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP168-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n003.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:38 EDT 2022
% Result : Unsatisfiable 0.72s 1.14s
% Output : Refutation 0.72s
% 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-1.p',unknown),
[] ).
cnf(3,plain,
equal(multiply(multiply(A,B),C),multiply(A,multiply(B,C))),
file('GRP168-1.p',unknown),
[] ).
cnf(12,plain,
equal(multiply(A,least_upper_bound(B,C)),least_upper_bound(multiply(A,B),multiply(A,C))),
file('GRP168-1.p',unknown),
[] ).
cnf(14,plain,
equal(multiply(least_upper_bound(A,B),C),least_upper_bound(multiply(A,C),multiply(B,C))),
file('GRP168-1.p',unknown),
[] ).
cnf(16,plain,
equal(least_upper_bound(a,b),b),
file('GRP168-1.p',unknown),
[] ).
cnf(17,plain,
~ equal(least_upper_bound(multiply(inverse(c),multiply(a,c)),multiply(inverse(c),multiply(b,c))),multiply(inverse(c),multiply(b,c))),
file('GRP168-1.p',unknown),
[] ).
cnf(60,plain,
equal(least_upper_bound(multiply(A,a),multiply(A,b)),multiply(A,b)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[16,12]),1]),
[iquote('para(16,12),flip(1)')] ).
cnf(386,plain,
equal(least_upper_bound(multiply(A,multiply(a,B)),multiply(A,multiply(b,B))),multiply(A,multiply(b,B))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[60,14]),3,3,3]),1]),
[iquote('para(60,14),demod([3,3,3]),flip(1)')] ).
cnf(387,plain,
$false,
inference(conflict,[status(thm)],[386,17]),
[iquote('conflict(386,17)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : GRP168-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.00/0.12 % Command : tptp2X_and_run_eqp %s
% 0.11/0.33 % Computer : n003.cluster.edu
% 0.11/0.33 % Model : x86_64 x86_64
% 0.11/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33 % Memory : 8042.1875MB
% 0.11/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33 % CPULimit : 300
% 0.11/0.33 % WCLimit : 600
% 0.11/0.33 % DateTime : Mon Jun 13 23:57:39 EDT 2022
% 0.11/0.33 % CPUTime :
% 0.72/1.14 ----- EQP 0.9e, May 2009 -----
% 0.72/1.14 The job began on n003.cluster.edu, Mon Jun 13 23:57:40 2022
% 0.72/1.14 The command was "./eqp09e".
% 0.72/1.14
% 0.72/1.14 set(prolog_style_variables).
% 0.72/1.14 set(lrpo).
% 0.72/1.14 set(basic_paramod).
% 0.72/1.14 set(functional_subsume).
% 0.72/1.14 set(ordered_paramod).
% 0.72/1.14 set(prime_paramod).
% 0.72/1.14 set(para_pairs).
% 0.72/1.14 assign(pick_given_ratio,4).
% 0.72/1.14 clear(print_kept).
% 0.72/1.14 clear(print_new_demod).
% 0.72/1.14 clear(print_back_demod).
% 0.72/1.14 clear(print_given).
% 0.72/1.14 assign(max_mem,64000).
% 0.72/1.14 end_of_commands.
% 0.72/1.14
% 0.72/1.14 Usable:
% 0.72/1.14 end_of_list.
% 0.72/1.14
% 0.72/1.14 Sos:
% 0.72/1.14 0 (wt=-1) [] multiply(identity,A) = A.
% 0.72/1.14 0 (wt=-1) [] multiply(inverse(A),A) = identity.
% 0.72/1.14 0 (wt=-1) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.72/1.14 0 (wt=-1) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.72/1.14 0 (wt=-1) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.72/1.14 0 (wt=-1) [] greatest_lower_bound(A,greatest_lower_bound(B,C)) = greatest_lower_bound(greatest_lower_bound(A,B),C).
% 0.72/1.14 0 (wt=-1) [] least_upper_bound(A,least_upper_bound(B,C)) = least_upper_bound(least_upper_bound(A,B),C).
% 0.72/1.14 0 (wt=-1) [] least_upper_bound(A,A) = A.
% 0.72/1.14 0 (wt=-1) [] greatest_lower_bound(A,A) = A.
% 0.72/1.14 0 (wt=-1) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.72/1.14 0 (wt=-1) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.72/1.14 0 (wt=-1) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.72/1.14 0 (wt=-1) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.72/1.14 0 (wt=-1) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.72/1.14 0 (wt=-1) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.72/1.14 0 (wt=-1) [] least_upper_bound(a,b) = b.
% 0.72/1.14 0 (wt=-1) [] -(least_upper_bound(multiply(inverse(c),multiply(a,c)),multiply(inverse(c),multiply(b,c))) = multiply(inverse(c),multiply(b,c))).
% 0.72/1.14 end_of_list.
% 0.72/1.14
% 0.72/1.14 Demodulators:
% 0.72/1.14 end_of_list.
% 0.72/1.14
% 0.72/1.14 Passive:
% 0.72/1.14 end_of_list.
% 0.72/1.14
% 0.72/1.14 Starting to process input.
% 0.72/1.14
% 0.72/1.14 ** KEPT: 1 (wt=5) [] multiply(identity,A) = A.
% 0.72/1.14 1 is a new demodulator.
% 0.72/1.14
% 0.72/1.14 ** KEPT: 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.72/1.14 2 is a new demodulator.
% 0.72/1.14
% 0.72/1.14 ** KEPT: 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.72/1.14 3 is a new demodulator.
% 0.72/1.14
% 0.72/1.14 ** KEPT: 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.72/1.14 clause forward subsumed: 0 (wt=7) [flip(4)] greatest_lower_bound(B,A) = greatest_lower_bound(A,B).
% 0.72/1.14
% 0.72/1.14 ** KEPT: 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.72/1.14 clause forward subsumed: 0 (wt=7) [flip(5)] least_upper_bound(B,A) = least_upper_bound(A,B).
% 0.72/1.14
% 0.72/1.14 ** 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.72/1.14 6 is a new demodulator.
% 0.72/1.14
% 0.72/1.14 ** 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.72/1.14 7 is a new demodulator.
% 0.72/1.14
% 0.72/1.14 ** KEPT: 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.72/1.14 8 is a new demodulator.
% 0.72/1.14
% 0.72/1.14 ** KEPT: 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.72/1.14 9 is a new demodulator.
% 0.72/1.14
% 0.72/1.14 ** KEPT: 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.72/1.14 10 is a new demodulator.
% 0.72/1.14
% 0.72/1.14 ** KEPT: 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.72/1.14 11 is a new demodulator.
% 0.72/1.14
% 0.72/1.14 ** KEPT: 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.72/1.14 12 is a new demodulator.
% 0.72/1.14
% 0.72/1.14 ** KEPT: 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.72/1.14 13 is a new demodulator.
% 0.72/1.14
% 0.72/1.14 ** KEPT: 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.72/1.14 14 is a new demodulator.
% 0.72/1.14
% 0.72/1.14 ** KEPT: 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.72/1.14 15 is a new demodulator.
% 0.72/1.14
% 0.72/1.14 ** KEPT: 16 (wt=5) [] least_upper_bound(a,b) = b.
% 0.72/1.14 16 is a new demodulator.
% 0.72/1.14
% 0.72/1.14 ** KEPT: 17 (wt=20) [] -(least_upper_bound(multiply(inverse(c),multiply(a,c)),multiply(inverse(c),multiply(b,c))) = multiply(inverse(c),multiply(b,c))).
% 0.72/1.14 ---------------- PROOF FOUND ----------------
% 0.72/1.14 % SZS status Unsatisfiable
% 0.72/1.14
% 0.72/1.14
% 0.72/1.14 After processing input:
% 0.72/1.14
% 0.72/1.14 Usable:
% 0.72/1.14 end_of_list.
% 0.72/1.14
% 0.72/1.14 Sos:
% 0.72/1.14 1 (wt=5) [] multiply(identity,A) = A.
% 0.72/1.14 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.72/1.14 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.72/1.14 16 (wt=5) [] least_upper_bound(a,b) = b.
% 0.72/1.14 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.72/1.14 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.72/1.14 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.72/1.14 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.72/1.14 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.72/1.14 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.72/1.14 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 0.72/1.14 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 0.72/1.14 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.72/1.14 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.72/1.14 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.72/1.14 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.72/1.14 17 (wt=20) [] -(least_upper_bound(multiply(inverse(c),multiply(a,c)),multiply(inverse(c),multiply(b,c))) = multiply(inverse(c),multiply(b,c))).
% 0.72/1.14 end_of_list.
% 0.72/1.14
% 0.72/1.14 Demodulators:
% 0.72/1.14 1 (wt=5) [] multiply(identity,A) = A.
% 0.72/1.14 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.72/1.14 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.72/1.14 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 0.72/1.14 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 0.72/1.14 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.72/1.14 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.72/1.14 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.72/1.14 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.72/1.14 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.72/1.14 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.72/1.14 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.72/1.14 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.72/1.14 16 (wt=5) [] least_upper_bound(a,b) = b.
% 0.72/1.14 end_of_list.
% 0.72/1.14
% 0.72/1.14 Passive:
% 0.72/1.14 end_of_list.
% 0.72/1.14
% 0.72/1.14 UNIT CONFLICT from 386 and 17 at 0.03 seconds.
% 0.72/1.14
% 0.72/1.14 ---------------- PROOF ----------------
% 0.72/1.14 % SZS output start Refutation
% See solution above
% 0.72/1.14 ------------ end of proof -------------
% 0.72/1.14
% 0.72/1.14
% 0.72/1.14 ------------- memory usage ------------
% 0.72/1.14 Memory dynamically allocated (tp_alloc): 976.
% 0.72/1.14 type (bytes each) gets frees in use avail bytes
% 0.72/1.14 sym_ent ( 96) 59 0 59 0 5.5 K
% 0.72/1.14 term ( 16) 40049 33606 6443 21 124.7 K
% 0.72/1.14 gen_ptr ( 8) 32908 8016 24892 12 194.6 K
% 0.72/1.14 context ( 808) 43854 43852 2 4 4.7 K
% 0.72/1.14 trail ( 12) 1754 1754 0 5 0.1 K
% 0.72/1.14 bt_node ( 68) 19984 19981 3 12 1.0 K
% 0.72/1.14 ac_position (285432) 0 0 0 0 0.0 K
% 0.72/1.14 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.72/1.14 ac_match_free_vars_pos (4020)
% 0.72/1.14 0 0 0 0 0.0 K
% 0.72/1.14 discrim ( 12) 5682 192 5490 13 64.5 K
% 0.72/1.14 flat ( 40) 63324 63324 0 35 1.4 K
% 0.72/1.14 discrim_pos ( 12) 2315 2315 0 1 0.0 K
% 0.72/1.14 fpa_head ( 12) 1900 0 1900 0 22.3 K
% 0.72/1.14 fpa_tree ( 28) 1114 1114 0 11 0.3 K
% 0.72/1.14 fpa_pos ( 36) 700 700 0 1 0.0 K
% 0.72/1.14 literal ( 12) 2229 1843 386 1 4.5 K
% 0.72/1.14 clause ( 24) 2229 1843 386 1 9.1 K
% 0.72/1.14 list ( 12) 373 317 56 3 0.7 K
% 0.72/1.14 list_pos ( 20) 1544 146 1398 4 27.4 K
% 0.72/1.14 pair_index ( 40) 2 0 2 0 0.1 K
% 0.72/1.14
% 0.72/1.14 -------------- statistics -------------
% 0.72/1.14 Clauses input 17
% 0.72/1.14 Usable input 0
% 0.72/1.14 Sos input 17
% 0.72/1.14 Demodulators input 0
% 0.72/1.14 Passive input 0
% 0.72/1.14
% 0.72/1.14 Processed BS (before search) 19
% 0.72/1.14 Forward subsumed BS 2
% 0.72/1.14 Kept BS 17
% 0.72/1.14 New demodulators BS 14
% 0.72/1.14 Back demodulated BS 0
% 0.72/1.14
% 0.72/1.14 Clauses or pairs given 4625
% 0.72/1.14 Clauses generated 1569
% 0.72/1.14 Forward subsumed 1200
% 0.72/1.14 Deleted by weight 0
% 0.72/1.14 Deleted by variable count 0
% 0.72/1.14 Kept 369
% 0.72/1.14 New demodulators 300
% 0.72/1.14 Back demodulated 29
% 0.72/1.14 Ordered paramod prunes 0
% 0.72/1.14 Basic paramod prunes 14387
% 0.72/1.14 Prime paramod prunes 37
% 0.72/1.14 Semantic prunes 0
% 0.72/1.14
% 0.72/1.14 Rewrite attmepts 14560
% 0.72/1.14 Rewrites 2092
% 0.72/1.14
% 0.72/1.14 FPA overloads 0
% 0.72/1.14 FPA underloads 0
% 0.72/1.14
% 0.72/1.14 Usable size 0
% 0.72/1.14 Sos size 356
% 0.72/1.14 Demodulators size 301
% 0.72/1.14 Passive size 0
% 0.72/1.14 Disabled size 29
% 0.72/1.14
% 0.72/1.14 Proofs found 1
% 0.72/1.14
% 0.72/1.14 ----------- times (seconds) ----------- Mon Jun 13 23:57:40 2022
% 0.72/1.14
% 0.72/1.14 user CPU time 0.03 (0 hr, 0 min, 0 sec)
% 0.72/1.14 system CPU time 0.06 (0 hr, 0 min, 0 sec)
% 0.72/1.14 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.72/1.14 input time 0.00
% 0.72/1.14 paramodulation time 0.01
% 0.72/1.14 demodulation time 0.00
% 0.72/1.14 orient time 0.00
% 0.72/1.14 weigh time 0.00
% 0.72/1.14 forward subsume time 0.00
% 0.72/1.14 back demod find time 0.00
% 0.72/1.14 conflict time 0.00
% 0.72/1.14 LRPO time 0.00
% 0.72/1.14 store clause time 0.00
% 0.72/1.14 disable clause time 0.00
% 0.72/1.14 prime paramod time 0.00
% 0.72/1.14 semantics time 0.00
% 0.72/1.14
% 0.72/1.14 EQP interrupted
%------------------------------------------------------------------------------