TSTP Solution File: GRP190-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP190-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n032.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:52 EDT 2022
% Result : Unsatisfiable 0.57s 1.02s
% Output : Refutation 0.57s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of clauses : 19 ( 19 unt; 0 nHn; 5 RR)
% Number of literals : 19 ( 0 equ; 2 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 : 25 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(multiply(identity,A),A),
file('GRP190-1.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(inverse(A),A),identity),
file('GRP190-1.p',unknown),
[] ).
cnf(3,plain,
equal(multiply(multiply(A,B),C),multiply(A,multiply(B,C))),
file('GRP190-1.p',unknown),
[] ).
cnf(5,plain,
equal(least_upper_bound(A,B),least_upper_bound(B,A)),
file('GRP190-1.p',unknown),
[] ).
cnf(12,plain,
equal(multiply(A,least_upper_bound(B,C)),least_upper_bound(multiply(A,B),multiply(A,C))),
file('GRP190-1.p',unknown),
[] ).
cnf(14,plain,
equal(multiply(least_upper_bound(A,B),C),least_upper_bound(multiply(A,C),multiply(B,C))),
file('GRP190-1.p',unknown),
[] ).
cnf(16,plain,
equal(least_upper_bound(a,b),a),
file('GRP190-1.p',unknown),
[] ).
cnf(17,plain,
~ equal(least_upper_bound(inverse(a),inverse(b)),inverse(b)),
file('GRP190-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(48,plain,
equal(multiply(inverse(inverse(A)),identity),A),
inference(para,[status(thm),theory(equality)],[2,18]),
[iquote('para(2,18)')] ).
cnf(52,plain,
~ equal(least_upper_bound(inverse(b),inverse(a)),inverse(b)),
inference(para,[status(thm),theory(equality)],[5,17]),
[iquote('para(5,17)')] ).
cnf(56,plain,
equal(multiply(inverse(inverse(A)),B),multiply(A,B)),
inference(para,[status(thm),theory(equality)],[18,18]),
[iquote('para(18,18)')] ).
cnf(57,plain,
equal(multiply(A,identity),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[48]),56]),
[iquote('back_demod(48),demod([56])')] ).
cnf(61,plain,
equal(inverse(inverse(A)),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[56,57]),57]),1]),
[iquote('para(56,57),demod([57]),flip(1)')] ).
cnf(62,plain,
equal(multiply(A,inverse(A)),identity),
inference(para,[status(thm),theory(equality)],[61,2]),
[iquote('para(61,2)')] ).
cnf(64,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(418,plain,
equal(least_upper_bound(A,multiply(inverse(a),multiply(b,A))),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[16,64]),18,16]),
[iquote('para(16,64),demod([18,16])')] ).
cnf(421,plain,
equal(least_upper_bound(inverse(b),inverse(a)),inverse(b)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[62,418]),57]),
[iquote('para(62,418),demod([57])')] ).
cnf(422,plain,
$false,
inference(conflict,[status(thm)],[421,52]),
[iquote('conflict(421,52)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11 % Problem : GRP190-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.06/0.11 % Command : tptp2X_and_run_eqp %s
% 0.10/0.31 % Computer : n032.cluster.edu
% 0.10/0.31 % Model : x86_64 x86_64
% 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.31 % Memory : 8042.1875MB
% 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.10/0.31 % CPULimit : 300
% 0.10/0.31 % WCLimit : 600
% 0.10/0.31 % DateTime : Mon Jun 13 12:53:41 EDT 2022
% 0.10/0.31 % CPUTime :
% 0.57/1.02 ----- EQP 0.9e, May 2009 -----
% 0.57/1.02 The job began on n032.cluster.edu, Mon Jun 13 12:53:42 2022
% 0.57/1.02 The command was "./eqp09e".
% 0.57/1.02
% 0.57/1.02 set(prolog_style_variables).
% 0.57/1.02 set(lrpo).
% 0.57/1.02 set(basic_paramod).
% 0.57/1.02 set(functional_subsume).
% 0.57/1.02 set(ordered_paramod).
% 0.57/1.02 set(prime_paramod).
% 0.57/1.02 set(para_pairs).
% 0.57/1.02 assign(pick_given_ratio,4).
% 0.57/1.02 clear(print_kept).
% 0.57/1.02 clear(print_new_demod).
% 0.57/1.02 clear(print_back_demod).
% 0.57/1.02 clear(print_given).
% 0.57/1.02 assign(max_mem,64000).
% 0.57/1.02 end_of_commands.
% 0.57/1.02
% 0.57/1.02 Usable:
% 0.57/1.02 end_of_list.
% 0.57/1.02
% 0.57/1.02 Sos:
% 0.57/1.02 0 (wt=-1) [] multiply(identity,A) = A.
% 0.57/1.02 0 (wt=-1) [] multiply(inverse(A),A) = identity.
% 0.57/1.02 0 (wt=-1) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.57/1.02 0 (wt=-1) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.57/1.02 0 (wt=-1) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.57/1.02 0 (wt=-1) [] greatest_lower_bound(A,greatest_lower_bound(B,C)) = greatest_lower_bound(greatest_lower_bound(A,B),C).
% 0.57/1.02 0 (wt=-1) [] least_upper_bound(A,least_upper_bound(B,C)) = least_upper_bound(least_upper_bound(A,B),C).
% 0.57/1.02 0 (wt=-1) [] least_upper_bound(A,A) = A.
% 0.57/1.02 0 (wt=-1) [] greatest_lower_bound(A,A) = A.
% 0.57/1.02 0 (wt=-1) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.57/1.02 0 (wt=-1) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.57/1.02 0 (wt=-1) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.57/1.02 0 (wt=-1) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.57/1.02 0 (wt=-1) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.57/1.02 0 (wt=-1) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.57/1.02 0 (wt=-1) [] least_upper_bound(a,b) = a.
% 0.57/1.02 0 (wt=-1) [] -(least_upper_bound(inverse(a),inverse(b)) = inverse(b)).
% 0.57/1.02 end_of_list.
% 0.57/1.02
% 0.57/1.02 Demodulators:
% 0.57/1.02 end_of_list.
% 0.57/1.02
% 0.57/1.02 Passive:
% 0.57/1.02 end_of_list.
% 0.57/1.02
% 0.57/1.02 Starting to process input.
% 0.57/1.02
% 0.57/1.02 ** KEPT: 1 (wt=5) [] multiply(identity,A) = A.
% 0.57/1.02 1 is a new demodulator.
% 0.57/1.02
% 0.57/1.02 ** KEPT: 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.57/1.02 2 is a new demodulator.
% 0.57/1.02
% 0.57/1.02 ** KEPT: 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.57/1.02 3 is a new demodulator.
% 0.57/1.02
% 0.57/1.02 ** KEPT: 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.57/1.02 clause forward subsumed: 0 (wt=7) [flip(4)] greatest_lower_bound(B,A) = greatest_lower_bound(A,B).
% 0.57/1.02
% 0.57/1.02 ** KEPT: 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.57/1.02 clause forward subsumed: 0 (wt=7) [flip(5)] least_upper_bound(B,A) = least_upper_bound(A,B).
% 0.57/1.02
% 0.57/1.02 ** 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.57/1.02 6 is a new demodulator.
% 0.57/1.02
% 0.57/1.02 ** 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.57/1.02 7 is a new demodulator.
% 0.57/1.02
% 0.57/1.02 ** KEPT: 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.57/1.02 8 is a new demodulator.
% 0.57/1.02
% 0.57/1.02 ** KEPT: 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.57/1.02 9 is a new demodulator.
% 0.57/1.02
% 0.57/1.02 ** KEPT: 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.57/1.02 10 is a new demodulator.
% 0.57/1.02
% 0.57/1.02 ** KEPT: 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.57/1.02 11 is a new demodulator.
% 0.57/1.02
% 0.57/1.02 ** KEPT: 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.57/1.02 12 is a new demodulator.
% 0.57/1.02
% 0.57/1.02 ** KEPT: 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.57/1.02 13 is a new demodulator.
% 0.57/1.02
% 0.57/1.02 ** KEPT: 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.57/1.02 14 is a new demodulator.
% 0.57/1.02
% 0.57/1.02 ** KEPT: 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.57/1.02 15 is a new demodulator.
% 0.57/1.02
% 0.57/1.02 ** KEPT: 16 (wt=5) [] least_upper_bound(a,b) = a.
% 0.57/1.02 16 is a new demodulator.
% 0.57/1.02
% 0.57/1.02 ** KEPT: 17 (wt=8) [] -(least_upper_bound(inverse(a),inverse(b)) = inverse(b)).
% 0.57/1.02 ---------------- PROOF FOUND ----------------
% 0.57/1.02 % SZS status Unsatisfiable
% 0.57/1.02
% 0.57/1.02
% 0.57/1.02 After processing input:
% 0.57/1.02
% 0.57/1.02 Usable:
% 0.57/1.02 end_of_list.
% 0.57/1.02
% 0.57/1.02 Sos:
% 0.57/1.02 1 (wt=5) [] multiply(identity,A) = A.
% 0.57/1.02 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.57/1.02 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.57/1.02 16 (wt=5) [] least_upper_bound(a,b) = a.
% 0.57/1.02 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.57/1.02 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.57/1.02 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.57/1.02 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.57/1.02 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.57/1.02 17 (wt=8) [] -(least_upper_bound(inverse(a),inverse(b)) = inverse(b)).
% 0.57/1.02 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.57/1.02 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 0.57/1.02 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 0.57/1.02 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.57/1.02 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.57/1.02 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.57/1.02 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.57/1.02 end_of_list.
% 0.57/1.02
% 0.57/1.02 Demodulators:
% 0.57/1.02 1 (wt=5) [] multiply(identity,A) = A.
% 0.57/1.02 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.57/1.02 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.57/1.02 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 0.57/1.02 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 0.57/1.02 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.57/1.02 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.57/1.02 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.57/1.02 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.57/1.02 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.57/1.02 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.57/1.02 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.57/1.02 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.57/1.02 16 (wt=5) [] least_upper_bound(a,b) = a.
% 0.57/1.02 end_of_list.
% 0.57/1.02
% 0.57/1.02 Passive:
% 0.57/1.02 end_of_list.
% 0.57/1.02
% 0.57/1.02 UNIT CONFLICT from 421 and 52 at 0.03 seconds.
% 0.57/1.02
% 0.57/1.02 ---------------- PROOF ----------------
% 0.57/1.02 % SZS output start Refutation
% See solution above
% 0.57/1.02 ------------ end of proof -------------
% 0.57/1.02
% 0.57/1.02
% 0.57/1.02 ------------- memory usage ------------
% 0.57/1.02 Memory dynamically allocated (tp_alloc): 976.
% 0.57/1.02 type (bytes each) gets frees in use avail bytes
% 0.57/1.02 sym_ent ( 96) 58 0 58 0 5.4 K
% 0.57/1.02 term ( 16) 43286 36200 7086 21 137.2 K
% 0.57/1.02 gen_ptr ( 8) 36217 8516 27701 18 216.6 K
% 0.57/1.02 context ( 808) 47443 47441 2 4 4.7 K
% 0.57/1.02 trail ( 12) 1908 1908 0 5 0.1 K
% 0.57/1.02 bt_node ( 68) 21574 21571 3 12 1.0 K
% 0.57/1.02 ac_position (285432) 0 0 0 0 0.0 K
% 0.57/1.02 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.57/1.02 ac_match_free_vars_pos (4020)
% 0.57/1.02 0 0 0 0 0.0 K
% 0.57/1.02 discrim ( 12) 6411 259 6152 0 72.1 K
% 0.57/1.02 flat ( 40) 68938 68938 0 35 1.4 K
% 0.57/1.02 discrim_pos ( 12) 2470 2470 0 1 0.0 K
% 0.57/1.02 fpa_head ( 12) 2058 0 2058 0 24.1 K
% 0.57/1.02 fpa_tree ( 28) 1307 1307 0 15 0.4 K
% 0.57/1.02 fpa_pos ( 36) 771 771 0 1 0.0 K
% 0.57/1.02 literal ( 12) 2351 1930 421 1 4.9 K
% 0.57/1.02 clause ( 24) 2351 1930 421 1 9.9 K
% 0.57/1.02 list ( 12) 409 353 56 3 0.7 K
% 0.57/1.02 list_pos ( 20) 1691 161 1530 0 29.9 K
% 0.57/1.02 pair_index ( 40) 2 0 2 0 0.1 K
% 0.57/1.02
% 0.57/1.02 -------------- statistics -------------
% 0.57/1.02 Clauses input 17
% 0.57/1.02 Usable input 0
% 0.57/1.02 Sos input 17
% 0.57/1.02 Demodulators input 0
% 0.57/1.02 Passive input 0
% 0.57/1.02
% 0.57/1.02 Processed BS (before search) 19
% 0.57/1.02 Forward subsumed BS 2
% 0.57/1.02 Kept BS 17
% 0.57/1.02 New demodulators BS 14
% 0.57/1.02 Back demodulated BS 0
% 0.57/1.02
% 0.57/1.02 Clauses or pairs given 5019
% 0.57/1.02 Clauses generated 1656
% 0.57/1.02 Forward subsumed 1252
% 0.57/1.02 Deleted by weight 0
% 0.57/1.02 Deleted by variable count 0
% 0.57/1.02 Kept 404
% 0.57/1.02 New demodulators 336
% 0.57/1.02 Back demodulated 32
% 0.57/1.02 Ordered paramod prunes 0
% 0.57/1.02 Basic paramod prunes 15376
% 0.57/1.02 Prime paramod prunes 40
% 0.57/1.02 Semantic prunes 0
% 0.57/1.02
% 0.57/1.02 Rewrite attmepts 15763
% 0.57/1.02 Rewrites 2254
% 0.57/1.02
% 0.57/1.02 FPA overloads 0
% 0.57/1.02 FPA underloads 0
% 0.57/1.02
% 0.57/1.02 Usable size 0
% 0.57/1.02 Sos size 388
% 0.57/1.02 Demodulators size 334
% 0.57/1.02 Passive size 0
% 0.57/1.02 Disabled size 32
% 0.57/1.02
% 0.57/1.02 Proofs found 1
% 0.57/1.02
% 0.57/1.02 ----------- times (seconds) ----------- Mon Jun 13 12:53:42 2022
% 0.57/1.02
% 0.57/1.02 user CPU time 0.03 (0 hr, 0 min, 0 sec)
% 0.57/1.02 system CPU time 0.05 (0 hr, 0 min, 0 sec)
% 0.57/1.02 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.57/1.02 input time 0.00
% 0.57/1.02 paramodulation time 0.01
% 0.57/1.02 demodulation time 0.00
% 0.57/1.02 orient time 0.00
% 0.57/1.02 weigh time 0.00
% 0.57/1.02 forward subsume time 0.00
% 0.57/1.02 back demod find time 0.00
% 0.57/1.02 conflict time 0.00
% 0.57/1.02 LRPO time 0.00
% 0.57/1.02 store clause time 0.00
% 0.57/1.02 disable clause time 0.00
% 0.57/1.02 prime paramod time 0.00
% 0.57/1.02 semantics time 0.00
% 0.57/1.02
% 0.57/1.02 EQP interrupted
%------------------------------------------------------------------------------