TSTP Solution File: GRP169-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP169-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n026.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.90s 1.24s
% Output : Refutation 0.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 8
% Syntax : Number of clauses : 20 ( 20 unt; 0 nHn; 5 RR)
% Number of literals : 20 ( 0 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 5 ( 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 : 27 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(multiply(identity,A),A),
file('GRP169-1.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(inverse(A),A),identity),
file('GRP169-1.p',unknown),
[] ).
cnf(3,plain,
equal(multiply(multiply(A,B),C),multiply(A,multiply(B,C))),
file('GRP169-1.p',unknown),
[] ).
cnf(5,plain,
equal(least_upper_bound(A,B),least_upper_bound(B,A)),
file('GRP169-1.p',unknown),
[] ).
cnf(12,plain,
equal(multiply(A,least_upper_bound(B,C)),least_upper_bound(multiply(A,B),multiply(A,C))),
file('GRP169-1.p',unknown),
[] ).
cnf(14,plain,
equal(multiply(least_upper_bound(A,B),C),least_upper_bound(multiply(A,C),multiply(B,C))),
file('GRP169-1.p',unknown),
[] ).
cnf(16,plain,
equal(least_upper_bound(inverse(a),inverse(b)),inverse(b)),
file('GRP169-1.p',unknown),
[] ).
cnf(17,plain,
~ equal(least_upper_bound(a,b),a),
file('GRP169-1.p',unknown),
[] ).
cnf(18,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(41,plain,
equal(multiply(inverse(inverse(A)),identity),A),
inference(para,[status(thm),theory(equality)],[2,18]),
[iquote('para(2,18)')] ).
cnf(52,plain,
equal(multiply(inverse(inverse(A)),B),multiply(A,B)),
inference(para,[status(thm),theory(equality)],[18,18]),
[iquote('para(18,18)')] ).
cnf(53,plain,
equal(multiply(A,identity),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[41]),52]),
[iquote('back_demod(41),demod([52])')] ).
cnf(54,plain,
equal(inverse(inverse(A)),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[52,53]),53]),1]),
[iquote('para(52,53),demod([53]),flip(1)')] ).
cnf(56,plain,
equal(multiply(A,inverse(A)),identity),
inference(para,[status(thm),theory(equality)],[54,2]),
[iquote('para(54,2)')] ).
cnf(63,plain,
equal(least_upper_bound(multiply(inverse(least_upper_bound(A,B)),multiply(A,C)),multiply(inverse(least_upper_bound(A,B)),multiply(B,C))),C),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[14,18]),12]),
[iquote('para(14,18),demod([12])')] ).
cnf(94,plain,
equal(multiply(A,multiply(inverse(A),B)),B),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[56,3]),1]),1]),
[iquote('para(56,3),demod([1]),flip(1)')] ).
cnf(434,plain,
equal(least_upper_bound(multiply(b,multiply(inverse(a),A)),A),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[16,63]),54,16,54,94]),
[iquote('para(16,63),demod([54,16,54,94])')] ).
cnf(435,plain,
equal(least_upper_bound(b,a),a),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[2,434]),53]),
[iquote('para(2,434),demod([53])')] ).
cnf(438,plain,
equal(least_upper_bound(a,b),a),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[435,5]),1]),
[iquote('para(435,5),flip(1)')] ).
cnf(439,plain,
$false,
inference(conflict,[status(thm)],[438,17]),
[iquote('conflict(438,17)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : GRP169-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.10/0.12 % Command : tptp2X_and_run_eqp %s
% 0.13/0.33 % Computer : n026.cluster.edu
% 0.13/0.33 % Model : x86_64 x86_64
% 0.13/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33 % Memory : 8042.1875MB
% 0.13/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33 % CPULimit : 300
% 0.13/0.33 % WCLimit : 600
% 0.13/0.33 % DateTime : Mon Jun 13 15:45:21 EDT 2022
% 0.13/0.34 % CPUTime :
% 0.90/1.24 ----- EQP 0.9e, May 2009 -----
% 0.90/1.24 The job began on n026.cluster.edu, Mon Jun 13 15:45:21 2022
% 0.90/1.24 The command was "./eqp09e".
% 0.90/1.24
% 0.90/1.24 set(prolog_style_variables).
% 0.90/1.24 set(lrpo).
% 0.90/1.24 set(basic_paramod).
% 0.90/1.24 set(functional_subsume).
% 0.90/1.24 set(ordered_paramod).
% 0.90/1.24 set(prime_paramod).
% 0.90/1.24 set(para_pairs).
% 0.90/1.24 assign(pick_given_ratio,4).
% 0.90/1.24 clear(print_kept).
% 0.90/1.24 clear(print_new_demod).
% 0.90/1.24 clear(print_back_demod).
% 0.90/1.24 clear(print_given).
% 0.90/1.24 assign(max_mem,64000).
% 0.90/1.24 end_of_commands.
% 0.90/1.24
% 0.90/1.24 Usable:
% 0.90/1.24 end_of_list.
% 0.90/1.24
% 0.90/1.24 Sos:
% 0.90/1.24 0 (wt=-1) [] multiply(identity,A) = A.
% 0.90/1.24 0 (wt=-1) [] multiply(inverse(A),A) = identity.
% 0.90/1.24 0 (wt=-1) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.90/1.24 0 (wt=-1) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.90/1.24 0 (wt=-1) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.90/1.24 0 (wt=-1) [] greatest_lower_bound(A,greatest_lower_bound(B,C)) = greatest_lower_bound(greatest_lower_bound(A,B),C).
% 0.90/1.24 0 (wt=-1) [] least_upper_bound(A,least_upper_bound(B,C)) = least_upper_bound(least_upper_bound(A,B),C).
% 0.90/1.24 0 (wt=-1) [] least_upper_bound(A,A) = A.
% 0.90/1.24 0 (wt=-1) [] greatest_lower_bound(A,A) = A.
% 0.90/1.24 0 (wt=-1) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.90/1.24 0 (wt=-1) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.90/1.24 0 (wt=-1) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.90/1.24 0 (wt=-1) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.90/1.24 0 (wt=-1) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.90/1.24 0 (wt=-1) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.90/1.24 0 (wt=-1) [] least_upper_bound(inverse(a),inverse(b)) = inverse(b).
% 0.90/1.24 0 (wt=-1) [] -(least_upper_bound(a,b) = a).
% 0.90/1.24 end_of_list.
% 0.90/1.24
% 0.90/1.24 Demodulators:
% 0.90/1.24 end_of_list.
% 0.90/1.24
% 0.90/1.24 Passive:
% 0.90/1.24 end_of_list.
% 0.90/1.24
% 0.90/1.24 Starting to process input.
% 0.90/1.24
% 0.90/1.24 ** KEPT: 1 (wt=5) [] multiply(identity,A) = A.
% 0.90/1.24 1 is a new demodulator.
% 0.90/1.24
% 0.90/1.24 ** KEPT: 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.90/1.24 2 is a new demodulator.
% 0.90/1.24
% 0.90/1.24 ** KEPT: 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.90/1.24 3 is a new demodulator.
% 0.90/1.24
% 0.90/1.24 ** KEPT: 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.90/1.24 clause forward subsumed: 0 (wt=7) [flip(4)] greatest_lower_bound(B,A) = greatest_lower_bound(A,B).
% 0.90/1.24
% 0.90/1.24 ** KEPT: 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.90/1.24 clause forward subsumed: 0 (wt=7) [flip(5)] least_upper_bound(B,A) = least_upper_bound(A,B).
% 0.90/1.24
% 0.90/1.24 ** 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.90/1.24 6 is a new demodulator.
% 0.90/1.24
% 0.90/1.24 ** 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.90/1.24 7 is a new demodulator.
% 0.90/1.24
% 0.90/1.24 ** KEPT: 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.90/1.24 8 is a new demodulator.
% 0.90/1.24
% 0.90/1.24 ** KEPT: 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.90/1.24 9 is a new demodulator.
% 0.90/1.24
% 0.90/1.24 ** KEPT: 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.90/1.24 10 is a new demodulator.
% 0.90/1.24
% 0.90/1.24 ** KEPT: 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.90/1.24 11 is a new demodulator.
% 0.90/1.24
% 0.90/1.24 ** KEPT: 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.90/1.24 12 is a new demodulator.
% 0.90/1.24
% 0.90/1.24 ** KEPT: 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.90/1.24 13 is a new demodulator.
% 0.90/1.24
% 0.90/1.24 ** KEPT: 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.90/1.24 14 is a new demodulator.
% 0.90/1.24
% 0.90/1.24 ** KEPT: 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.90/1.24 15 is a new demodulator.
% 0.90/1.24
% 0.90/1.24 ** KEPT: 16 (wt=8) [] least_upper_bound(inverse(a),inverse(b)) = inverse(b).
% 0.90/1.24 16 is a new demodulator.
% 0.90/1.24
% 0.90/1.24 ** KEPT: 17 (wt=5) [] -(least_upper_bound(a,b) = a).
% 0.90/1.24 ---------------- PROOF FOUND ----------------
% 0.90/1.24 % SZS status Unsatisfiable
% 0.90/1.24
% 0.90/1.24
% 0.90/1.24 After processing input:
% 0.90/1.24
% 0.90/1.24 Usable:
% 0.90/1.24 end_of_list.
% 0.90/1.24
% 0.90/1.24 Sos:
% 0.90/1.24 1 (wt=5) [] multiply(identity,A) = A.
% 0.90/1.24 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.90/1.24 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.90/1.24 17 (wt=5) [] -(least_upper_bound(a,b) = a).
% 0.90/1.24 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.90/1.24 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.90/1.24 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.90/1.24 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.90/1.24 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.90/1.24 16 (wt=8) [] least_upper_bound(inverse(a),inverse(b)) = inverse(b).
% 0.90/1.24 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.90/1.24 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 0.90/1.24 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 0.90/1.24 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.90/1.24 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.90/1.24 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.90/1.24 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.90/1.24 end_of_list.
% 0.90/1.24
% 0.90/1.24 Demodulators:
% 0.90/1.24 1 (wt=5) [] multiply(identity,A) = A.
% 0.90/1.24 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.90/1.24 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.90/1.24 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 0.90/1.24 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 0.90/1.24 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.90/1.24 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.90/1.24 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.90/1.24 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.90/1.24 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.90/1.24 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.90/1.24 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.90/1.24 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.90/1.24 16 (wt=8) [] least_upper_bound(inverse(a),inverse(b)) = inverse(b).
% 0.90/1.24 end_of_list.
% 0.90/1.24
% 0.90/1.24 Passive:
% 0.90/1.24 end_of_list.
% 0.90/1.24
% 0.90/1.24 UNIT CONFLICT from 438 and 17 at 0.04 seconds.
% 0.90/1.24
% 0.90/1.24 ---------------- PROOF ----------------
% 0.90/1.24 % SZS output start Refutation
% See solution above
% 0.90/1.24 ------------ end of proof -------------
% 0.90/1.24
% 0.90/1.24
% 0.90/1.24 ------------- memory usage ------------
% 0.90/1.24 Memory dynamically allocated (tp_alloc): 976.
% 0.90/1.24 type (bytes each) gets frees in use avail bytes
% 0.90/1.24 sym_ent ( 96) 58 0 58 0 5.4 K
% 0.90/1.24 term ( 16) 51358 43754 7604 31 147.4 K
% 0.90/1.24 gen_ptr ( 8) 39395 9551 29844 19 233.3 K
% 0.90/1.24 context ( 808) 50096 50094 2 5 5.5 K
% 0.90/1.24 trail ( 12) 2170 2170 0 5 0.1 K
% 0.90/1.24 bt_node ( 68) 21112 21109 3 12 1.0 K
% 0.90/1.24 ac_position (285432) 0 0 0 0 0.0 K
% 0.90/1.24 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.90/1.24 ac_match_free_vars_pos (4020)
% 0.90/1.24 0 0 0 0 0.0 K
% 0.90/1.24 discrim ( 12) 6821 225 6596 0 77.3 K
% 0.90/1.24 flat ( 40) 82553 82553 0 35 1.4 K
% 0.90/1.24 discrim_pos ( 12) 2792 2792 0 1 0.0 K
% 0.90/1.24 fpa_head ( 12) 2178 0 2178 0 25.5 K
% 0.90/1.24 fpa_tree ( 28) 1298 1298 0 15 0.4 K
% 0.90/1.24 fpa_pos ( 36) 806 806 0 1 0.0 K
% 0.90/1.24 literal ( 12) 2591 2153 438 1 5.1 K
% 0.90/1.24 clause ( 24) 2591 2153 438 1 10.3 K
% 0.90/1.24 list ( 12) 427 371 56 3 0.7 K
% 0.90/1.24 list_pos ( 20) 1740 119 1621 0 31.7 K
% 0.90/1.24 pair_index ( 40) 2 0 2 0 0.1 K
% 0.90/1.24
% 0.90/1.24 -------------- statistics -------------
% 0.90/1.24 Clauses input 17
% 0.90/1.24 Usable input 0
% 0.90/1.24 Sos input 17
% 0.90/1.24 Demodulators input 0
% 0.90/1.24 Passive input 0
% 0.90/1.24
% 0.90/1.24 Processed BS (before search) 19
% 0.90/1.24 Forward subsumed BS 2
% 0.90/1.24 Kept BS 17
% 0.90/1.24 New demodulators BS 14
% 0.90/1.24 Back demodulated BS 0
% 0.90/1.24
% 0.90/1.24 Clauses or pairs given 4769
% 0.90/1.24 Clauses generated 1844
% 0.90/1.24 Forward subsumed 1423
% 0.90/1.24 Deleted by weight 0
% 0.90/1.24 Deleted by variable count 0
% 0.90/1.24 Kept 421
% 0.90/1.24 New demodulators 354
% 0.90/1.24 Back demodulated 22
% 0.90/1.24 Ordered paramod prunes 0
% 0.90/1.24 Basic paramod prunes 14211
% 0.90/1.24 Prime paramod prunes 56
% 0.90/1.24 Semantic prunes 0
% 0.90/1.24
% 0.90/1.24 Rewrite attmepts 17962
% 0.90/1.24 Rewrites 2527
% 0.90/1.24
% 0.90/1.24 FPA overloads 0
% 0.90/1.24 FPA underloads 0
% 0.90/1.24
% 0.90/1.24 Usable size 0
% 0.90/1.24 Sos size 415
% 0.90/1.24 Demodulators size 354
% 0.90/1.24 Passive size 0
% 0.90/1.24 Disabled size 22
% 0.90/1.24
% 0.90/1.24 Proofs found 1
% 0.90/1.24
% 0.90/1.24 ----------- times (seconds) ----------- Mon Jun 13 15:45:22 2022
% 0.90/1.24
% 0.90/1.24 user CPU time 0.04 (0 hr, 0 min, 0 sec)
% 0.90/1.24 system CPU time 0.06 (0 hr, 0 min, 0 sec)
% 0.90/1.24 wall-clock time 1 (0 hr, 0 min, 1 sec)
% 0.90/1.24 input time 0.00
% 0.90/1.24 paramodulation time 0.01
% 0.90/1.24 demodulation time 0.01
% 0.90/1.24 orient time 0.01
% 0.90/1.24 weigh time 0.00
% 0.90/1.24 forward subsume time 0.00
% 0.90/1.24 back demod find time 0.00
% 0.90/1.24 conflict time 0.00
% 0.90/1.24 LRPO time 0.00
% 0.90/1.24 store clause time 0.00
% 0.90/1.24 disable clause time 0.00
% 0.90/1.24 prime paramod time 0.01
% 0.90/1.24 semantics time 0.00
% 0.90/1.24
% 0.90/1.24 EQP interrupted
%------------------------------------------------------------------------------