TSTP Solution File: GRP175-3 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP175-3 : 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:43 EDT 2022
% Result : Unsatisfiable 0.48s 0.97s
% Output : Refutation 0.48s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 8
% Syntax : Number of clauses : 18 ( 18 unt; 0 nHn; 4 RR)
% Number of literals : 18 ( 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 : 7 ( 7 usr; 3 con; 0-2 aty)
% Number of variables : 26 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(multiply(identity,A),A),
file('GRP175-3.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(inverse(A),A),identity),
file('GRP175-3.p',unknown),
[] ).
cnf(3,plain,
equal(multiply(multiply(A,B),C),multiply(A,multiply(B,C))),
file('GRP175-3.p',unknown),
[] ).
cnf(11,plain,
equal(greatest_lower_bound(A,least_upper_bound(A,B)),A),
file('GRP175-3.p',unknown),
[] ).
cnf(13,plain,
equal(multiply(A,greatest_lower_bound(B,C)),greatest_lower_bound(multiply(A,B),multiply(A,C))),
file('GRP175-3.p',unknown),
[] ).
cnf(15,plain,
equal(multiply(greatest_lower_bound(A,B),C),greatest_lower_bound(multiply(A,C),multiply(B,C))),
file('GRP175-3.p',unknown),
[] ).
cnf(16,plain,
equal(least_upper_bound(identity,b),b),
file('GRP175-3.p',unknown),
[] ).
cnf(17,plain,
~ equal(greatest_lower_bound(identity,multiply(inverse(a),multiply(b,a))),identity),
file('GRP175-3.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(20,plain,
equal(greatest_lower_bound(identity,b),identity),
inference(para,[status(thm),theory(equality)],[16,11]),
[iquote('para(16,11)')] ).
cnf(48,plain,
equal(multiply(inverse(inverse(A)),identity),A),
inference(para,[status(thm),theory(equality)],[2,18]),
[iquote('para(2,18)')] ).
cnf(54,plain,
equal(multiply(inverse(inverse(A)),B),multiply(A,B)),
inference(para,[status(thm),theory(equality)],[18,18]),
[iquote('para(18,18)')] ).
cnf(55,plain,
equal(multiply(A,identity),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[48]),54]),
[iquote('back_demod(48),demod([54])')] ).
cnf(66,plain,
equal(greatest_lower_bound(multiply(inverse(greatest_lower_bound(A,B)),multiply(A,C)),multiply(inverse(greatest_lower_bound(A,B)),multiply(B,C))),C),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[15,18]),13]),
[iquote('para(15,18),demod([13])')] ).
cnf(74,plain,
equal(greatest_lower_bound(A,multiply(b,A)),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[20,15]),1,1]),1]),
[iquote('para(20,15),demod([1,1]),flip(1)')] ).
cnf(582,plain,
equal(greatest_lower_bound(A,multiply(inverse(B),multiply(b,multiply(B,A)))),A),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[74,66]),18,74,3]),
[iquote('para(74,66),demod([18,74,3])')] ).
cnf(712,plain,
equal(greatest_lower_bound(identity,multiply(inverse(A),multiply(b,A))),identity),
inference(para,[status(thm),theory(equality)],[55,582]),
[iquote('para(55,582)')] ).
cnf(713,plain,
$false,
inference(conflict,[status(thm)],[712,17]),
[iquote('conflict(712,17)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.08 % Problem : GRP175-3 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.02/0.08 % Command : tptp2X_and_run_eqp %s
% 0.07/0.27 % Computer : n032.cluster.edu
% 0.07/0.27 % Model : x86_64 x86_64
% 0.07/0.27 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.27 % Memory : 8042.1875MB
% 0.07/0.27 % OS : Linux 3.10.0-693.el7.x86_64
% 0.07/0.27 % CPULimit : 300
% 0.07/0.27 % WCLimit : 600
% 0.07/0.27 % DateTime : Tue Jun 14 05:48:42 EDT 2022
% 0.11/0.27 % CPUTime :
% 0.48/0.97 ----- EQP 0.9e, May 2009 -----
% 0.48/0.97 The job began on n032.cluster.edu, Tue Jun 14 05:48:43 2022
% 0.48/0.97 The command was "./eqp09e".
% 0.48/0.97
% 0.48/0.97 set(prolog_style_variables).
% 0.48/0.97 set(lrpo).
% 0.48/0.97 set(basic_paramod).
% 0.48/0.97 set(functional_subsume).
% 0.48/0.97 set(ordered_paramod).
% 0.48/0.97 set(prime_paramod).
% 0.48/0.97 set(para_pairs).
% 0.48/0.97 assign(pick_given_ratio,4).
% 0.48/0.97 clear(print_kept).
% 0.48/0.97 clear(print_new_demod).
% 0.48/0.97 clear(print_back_demod).
% 0.48/0.97 clear(print_given).
% 0.48/0.97 assign(max_mem,64000).
% 0.48/0.97 end_of_commands.
% 0.48/0.97
% 0.48/0.97 Usable:
% 0.48/0.97 end_of_list.
% 0.48/0.97
% 0.48/0.97 Sos:
% 0.48/0.97 0 (wt=-1) [] multiply(identity,A) = A.
% 0.48/0.97 0 (wt=-1) [] multiply(inverse(A),A) = identity.
% 0.48/0.97 0 (wt=-1) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.48/0.97 0 (wt=-1) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.48/0.97 0 (wt=-1) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.48/0.97 0 (wt=-1) [] greatest_lower_bound(A,greatest_lower_bound(B,C)) = greatest_lower_bound(greatest_lower_bound(A,B),C).
% 0.48/0.97 0 (wt=-1) [] least_upper_bound(A,least_upper_bound(B,C)) = least_upper_bound(least_upper_bound(A,B),C).
% 0.48/0.97 0 (wt=-1) [] least_upper_bound(A,A) = A.
% 0.48/0.97 0 (wt=-1) [] greatest_lower_bound(A,A) = A.
% 0.48/0.97 0 (wt=-1) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.48/0.97 0 (wt=-1) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.48/0.97 0 (wt=-1) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.48/0.97 0 (wt=-1) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.48/0.97 0 (wt=-1) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.48/0.97 0 (wt=-1) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.48/0.97 0 (wt=-1) [] least_upper_bound(identity,b) = b.
% 0.48/0.97 0 (wt=-1) [] -(greatest_lower_bound(identity,multiply(inverse(a),multiply(b,a))) = identity).
% 0.48/0.97 end_of_list.
% 0.48/0.97
% 0.48/0.97 Demodulators:
% 0.48/0.97 end_of_list.
% 0.48/0.97
% 0.48/0.97 Passive:
% 0.48/0.97 end_of_list.
% 0.48/0.97
% 0.48/0.97 Starting to process input.
% 0.48/0.97
% 0.48/0.97 ** KEPT: 1 (wt=5) [] multiply(identity,A) = A.
% 0.48/0.97 1 is a new demodulator.
% 0.48/0.97
% 0.48/0.97 ** KEPT: 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.48/0.97 2 is a new demodulator.
% 0.48/0.97
% 0.48/0.97 ** KEPT: 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.48/0.97 3 is a new demodulator.
% 0.48/0.97
% 0.48/0.97 ** KEPT: 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.48/0.97 clause forward subsumed: 0 (wt=7) [flip(4)] greatest_lower_bound(B,A) = greatest_lower_bound(A,B).
% 0.48/0.97
% 0.48/0.97 ** KEPT: 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.48/0.97 clause forward subsumed: 0 (wt=7) [flip(5)] least_upper_bound(B,A) = least_upper_bound(A,B).
% 0.48/0.97
% 0.48/0.97 ** 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.48/0.97 6 is a new demodulator.
% 0.48/0.97
% 0.48/0.97 ** 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.48/0.97 7 is a new demodulator.
% 0.48/0.97
% 0.48/0.97 ** KEPT: 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.48/0.97 8 is a new demodulator.
% 0.48/0.97
% 0.48/0.97 ** KEPT: 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.48/0.97 9 is a new demodulator.
% 0.48/0.97
% 0.48/0.97 ** KEPT: 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.48/0.97 10 is a new demodulator.
% 0.48/0.97
% 0.48/0.97 ** KEPT: 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.48/0.97 11 is a new demodulator.
% 0.48/0.97
% 0.48/0.97 ** KEPT: 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.48/0.97 12 is a new demodulator.
% 0.48/0.97
% 0.48/0.97 ** KEPT: 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.48/0.97 13 is a new demodulator.
% 0.48/0.97
% 0.48/0.97 ** KEPT: 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.48/0.97 14 is a new demodulator.
% 0.48/0.97
% 0.48/0.97 ** KEPT: 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.48/0.97 15 is a new demodulator.
% 0.48/0.97
% 0.48/0.97 ** KEPT: 16 (wt=5) [] least_upper_bound(identity,b) = b.
% 0.48/0.97 16 is a new demodulator.
% 0.48/0.97
% 0.48/0.97 ** KEPT: 17 (wt=10) [] -(greatest_lower_bound(identity,multiply(inverse(a),multiply(b,a))) = identity).
% 0.48/0.97 ---------------- PROOF FOUND ----------------
% 0.48/0.97 % SZS status Unsatisfiable
% 0.48/0.97
% 0.48/0.97
% 0.48/0.97 After processing input:
% 0.48/0.97
% 0.48/0.97 Usable:
% 0.48/0.97 end_of_list.
% 0.48/0.97
% 0.48/0.97 Sos:
% 0.48/0.97 1 (wt=5) [] multiply(identity,A) = A.
% 0.48/0.97 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.48/0.97 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.48/0.97 16 (wt=5) [] least_upper_bound(identity,b) = b.
% 0.48/0.97 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.48/0.97 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.48/0.97 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.48/0.97 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.48/0.97 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.48/0.97 17 (wt=10) [] -(greatest_lower_bound(identity,multiply(inverse(a),multiply(b,a))) = identity).
% 0.48/0.97 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.48/0.97 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 0.48/0.97 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 0.48/0.97 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.48/0.97 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.48/0.97 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.48/0.97 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.48/0.97 end_of_list.
% 0.48/0.97
% 0.48/0.97 Demodulators:
% 0.48/0.97 1 (wt=5) [] multiply(identity,A) = A.
% 0.48/0.97 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.48/0.97 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.48/0.97 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 0.48/0.97 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 0.48/0.97 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.48/0.97 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.48/0.97 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.48/0.97 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.48/0.97 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.48/0.97 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.48/0.97 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.48/0.97 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.48/0.97 16 (wt=5) [] least_upper_bound(identity,b) = b.
% 0.48/0.97 end_of_list.
% 0.48/0.97
% 0.48/0.97 Passive:
% 0.48/0.97 end_of_list.
% 0.48/0.97
% 0.48/0.97 UNIT CONFLICT from 712 and 17 at 0.04 seconds.
% 0.48/0.97
% 0.48/0.97 ---------------- PROOF ----------------
% 0.48/0.97 % SZS output start Refutation
% See solution above
% 0.48/0.97 ------------ end of proof -------------
% 0.48/0.97
% 0.48/0.97
% 0.48/0.97 ------------- memory usage ------------
% 0.48/0.97 Memory dynamically allocated (tp_alloc): 1464.
% 0.48/0.97 type (bytes each) gets frees in use avail bytes
% 0.48/0.97 sym_ent ( 96) 58 0 58 0 5.4 K
% 0.48/0.97 term ( 16) 71256 58618 12638 20 244.4 K
% 0.48/0.97 gen_ptr ( 8) 65169 13549 51620 17 403.4 K
% 0.48/0.97 context ( 808) 82577 82575 2 5 5.5 K
% 0.48/0.97 trail ( 12) 3910 3910 0 5 0.1 K
% 0.48/0.97 bt_node ( 68) 38095 38092 3 14 1.1 K
% 0.48/0.97 ac_position (285432) 0 0 0 0 0.0 K
% 0.48/0.97 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.48/0.97 ac_match_free_vars_pos (4020)
% 0.48/0.97 0 0 0 0 0.0 K
% 0.48/0.97 discrim ( 12) 11287 602 10685 14 125.4 K
% 0.48/0.97 flat ( 40) 123461 123461 0 91 3.6 K
% 0.48/0.97 discrim_pos ( 12) 4165 4165 0 1 0.0 K
% 0.48/0.97 fpa_head ( 12) 2989 0 2989 0 35.0 K
% 0.48/0.97 fpa_tree ( 28) 2312 2312 0 39 1.1 K
% 0.48/0.97 fpa_pos ( 36) 1278 1278 0 1 0.0 K
% 0.48/0.97 literal ( 12) 3853 3141 712 1 8.4 K
% 0.48/0.97 clause ( 24) 3853 3141 712 1 16.7 K
% 0.48/0.97 list ( 12) 625 569 56 3 0.7 K
% 0.48/0.97 list_pos ( 20) 2846 304 2542 4 49.7 K
% 0.48/0.97 pair_index ( 40) 2 0 2 0 0.1 K
% 0.48/0.97
% 0.48/0.97 -------------- statistics -------------
% 0.48/0.97 Clauses input 17
% 0.48/0.97 Usable input 0
% 0.48/0.97 Sos input 17
% 0.48/0.97 Demodulators input 0
% 0.48/0.97 Passive input 0
% 0.48/0.97
% 0.48/0.97 Processed BS (before search) 19
% 0.48/0.97 Forward subsumed BS 2
% 0.48/0.97 Kept BS 17
% 0.48/0.97 New demodulators BS 14
% 0.48/0.97 Back demodulated BS 0
% 0.48/0.97
% 0.48/0.97 Clauses or pairs given 8814
% 0.48/0.97 Clauses generated 2624
% 0.48/0.97 Forward subsumed 1929
% 0.48/0.97 Deleted by weight 0
% 0.48/0.97 Deleted by variable count 0
% 0.48/0.97 Kept 695
% 0.48/0.97 New demodulators 552
% 0.48/0.97 Back demodulated 65
% 0.48/0.97 Ordered paramod prunes 0
% 0.48/0.97 Basic paramod prunes 30553
% 0.48/0.97 Prime paramod prunes 131
% 0.48/0.97 Semantic prunes 0
% 0.48/0.97
% 0.48/0.97 Rewrite attmepts 26539
% 0.48/0.97 Rewrites 3664
% 0.48/0.97
% 0.48/0.97 FPA overloads 0
% 0.48/0.97 FPA underloads 0
% 0.48/0.97
% 0.48/0.97 Usable size 0
% 0.48/0.97 Sos size 646
% 0.48/0.97 Demodulators size 539
% 0.48/0.97 Passive size 0
% 0.48/0.97 Disabled size 65
% 0.48/0.97
% 0.48/0.97 Proofs found 1
% 0.48/0.97
% 0.48/0.97 ----------- times (seconds) ----------- Tue Jun 14 05:48:43 2022
% 0.48/0.97
% 0.48/0.97 user CPU time 0.04 (0 hr, 0 min, 0 sec)
% 0.48/0.97 system CPU time 0.07 (0 hr, 0 min, 0 sec)
% 0.48/0.97 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.48/0.97 input time 0.00
% 0.48/0.97 paramodulation time 0.01
% 0.48/0.97 demodulation time 0.00
% 0.48/0.97 orient time 0.00
% 0.48/0.97 weigh time 0.00
% 0.48/0.97 forward subsume time 0.00
% 0.48/0.97 back demod find time 0.00
% 0.48/0.97 conflict time 0.00
% 0.48/0.97 LRPO time 0.00
% 0.48/0.97 store clause time 0.01
% 0.48/0.97 disable clause time 0.00
% 0.48/0.97 prime paramod time 0.00
% 0.48/0.97 semantics time 0.00
% 0.48/0.97
% 0.48/0.97 EQP interrupted
%------------------------------------------------------------------------------