TSTP Solution File: GRP166-4 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP166-4 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n021.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:37 EDT 2022
% Result : Unsatisfiable 0.46s 1.12s
% Output : Refutation 0.46s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of clauses : 8 ( 8 unt; 0 nHn; 3 RR)
% Number of literals : 8 ( 0 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 3 con; 0-2 aty)
% Number of variables : 8 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(multiply(identity,A),A),
file('GRP166-4.p',unknown),
[] ).
cnf(4,plain,
equal(greatest_lower_bound(A,B),greatest_lower_bound(B,A)),
file('GRP166-4.p',unknown),
[] ).
cnf(15,plain,
equal(multiply(greatest_lower_bound(A,B),C),greatest_lower_bound(multiply(A,C),multiply(B,C))),
file('GRP166-4.p',unknown),
[] ).
cnf(17,plain,
equal(greatest_lower_bound(b,identity),identity),
file('GRP166-4.p',unknown),
[] ).
cnf(18,plain,
~ equal(greatest_lower_bound(a,multiply(b,a)),a),
file('GRP166-4.p',unknown),
[] ).
cnf(64,plain,
equal(greatest_lower_bound(multiply(b,A),A),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[17,15]),1,1]),1]),
[iquote('para(17,15),demod([1,1]),flip(1)')] ).
cnf(67,plain,
equal(greatest_lower_bound(A,multiply(b,A)),A),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[64,4]),1]),
[iquote('para(64,4),flip(1)')] ).
cnf(68,plain,
$false,
inference(conflict,[status(thm)],[67,18]),
[iquote('conflict(67,18)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : GRP166-4 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.08/0.14 % Command : tptp2X_and_run_eqp %s
% 0.13/0.35 % Computer : n021.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Mon Jun 13 03:58:41 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.46/1.12 ----- EQP 0.9e, May 2009 -----
% 0.46/1.12 The job began on n021.cluster.edu, Mon Jun 13 03:58:42 2022
% 0.46/1.12 The command was "./eqp09e".
% 0.46/1.12
% 0.46/1.12 set(prolog_style_variables).
% 0.46/1.12 set(lrpo).
% 0.46/1.12 set(basic_paramod).
% 0.46/1.12 set(functional_subsume).
% 0.46/1.12 set(ordered_paramod).
% 0.46/1.12 set(prime_paramod).
% 0.46/1.12 set(para_pairs).
% 0.46/1.12 assign(pick_given_ratio,4).
% 0.46/1.12 clear(print_kept).
% 0.46/1.12 clear(print_new_demod).
% 0.46/1.12 clear(print_back_demod).
% 0.46/1.12 clear(print_given).
% 0.46/1.12 assign(max_mem,64000).
% 0.46/1.12 end_of_commands.
% 0.46/1.12
% 0.46/1.12 Usable:
% 0.46/1.12 end_of_list.
% 0.46/1.12
% 0.46/1.12 Sos:
% 0.46/1.12 0 (wt=-1) [] multiply(identity,A) = A.
% 0.46/1.12 0 (wt=-1) [] multiply(inverse(A),A) = identity.
% 0.46/1.12 0 (wt=-1) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.46/1.12 0 (wt=-1) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.46/1.12 0 (wt=-1) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.46/1.12 0 (wt=-1) [] greatest_lower_bound(A,greatest_lower_bound(B,C)) = greatest_lower_bound(greatest_lower_bound(A,B),C).
% 0.46/1.12 0 (wt=-1) [] least_upper_bound(A,least_upper_bound(B,C)) = least_upper_bound(least_upper_bound(A,B),C).
% 0.46/1.12 0 (wt=-1) [] least_upper_bound(A,A) = A.
% 0.46/1.12 0 (wt=-1) [] greatest_lower_bound(A,A) = A.
% 0.46/1.12 0 (wt=-1) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.46/1.12 0 (wt=-1) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.46/1.12 0 (wt=-1) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.46/1.12 0 (wt=-1) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.46/1.12 0 (wt=-1) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.46/1.12 0 (wt=-1) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.46/1.12 0 (wt=-1) [] greatest_lower_bound(a,identity) = identity.
% 0.46/1.12 0 (wt=-1) [] greatest_lower_bound(b,identity) = identity.
% 0.46/1.12 0 (wt=-1) [] -(greatest_lower_bound(a,multiply(b,a)) = a).
% 0.46/1.12 end_of_list.
% 0.46/1.12
% 0.46/1.12 Demodulators:
% 0.46/1.12 end_of_list.
% 0.46/1.12
% 0.46/1.12 Passive:
% 0.46/1.12 end_of_list.
% 0.46/1.12
% 0.46/1.12 Starting to process input.
% 0.46/1.12
% 0.46/1.12 ** KEPT: 1 (wt=5) [] multiply(identity,A) = A.
% 0.46/1.12 1 is a new demodulator.
% 0.46/1.12
% 0.46/1.12 ** KEPT: 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.46/1.12 2 is a new demodulator.
% 0.46/1.12
% 0.46/1.12 ** KEPT: 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.46/1.12 3 is a new demodulator.
% 0.46/1.12
% 0.46/1.12 ** KEPT: 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.46/1.12 clause forward subsumed: 0 (wt=7) [flip(4)] greatest_lower_bound(B,A) = greatest_lower_bound(A,B).
% 0.46/1.12
% 0.46/1.12 ** KEPT: 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.46/1.12 clause forward subsumed: 0 (wt=7) [flip(5)] least_upper_bound(B,A) = least_upper_bound(A,B).
% 0.46/1.12
% 0.46/1.12 ** 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.46/1.12 6 is a new demodulator.
% 0.46/1.12
% 0.46/1.12 ** 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.46/1.12 7 is a new demodulator.
% 0.46/1.12
% 0.46/1.12 ** KEPT: 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.46/1.12 8 is a new demodulator.
% 0.46/1.12
% 0.46/1.12 ** KEPT: 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.46/1.12 9 is a new demodulator.
% 0.46/1.12
% 0.46/1.12 ** KEPT: 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.46/1.12 10 is a new demodulator.
% 0.46/1.12
% 0.46/1.12 ** KEPT: 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.46/1.12 11 is a new demodulator.
% 0.46/1.12
% 0.46/1.12 ** KEPT: 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.46/1.12 12 is a new demodulator.
% 0.46/1.12
% 0.46/1.12 ** KEPT: 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.46/1.12 13 is a new demodulator.
% 0.46/1.12
% 0.46/1.12 ** KEPT: 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.46/1.12 14 is a new demodulator.
% 0.46/1.12
% 0.46/1.12 ** KEPT: 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.46/1.12 15 is a new demodulator.
% 0.46/1.12
% 0.46/1.12 ** KEPT: 16 (wt=5) [] greatest_lower_bound(a,identity) = identity.
% 0.46/1.12 16 is a new demodulator.
% 0.46/1.12
% 0.46/1.12 ** KEPT: 17 (wt=5) [] greatest_lower_bound(b,identity) = identity.
% 0.46/1.12 17 is a new demodulator.
% 0.46/1.12
% 0.46/1.12 ** KEPT: 18 (wt=7) [] -(greatest_lower_bound(a,multiply(b,a)) = a).
% 0.46/1.12 ---------------- PROOF FOUND ----------------
% 0.46/1.12 % SZS status Unsatisfiable
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 After processing input:
% 0.46/1.12
% 0.46/1.12 Usable:
% 0.46/1.12 end_of_list.
% 0.46/1.12
% 0.46/1.12 Sos:
% 0.46/1.12 1 (wt=5) [] multiply(identity,A) = A.
% 0.46/1.12 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.46/1.12 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.46/1.12 16 (wt=5) [] greatest_lower_bound(a,identity) = identity.
% 0.46/1.12 17 (wt=5) [] greatest_lower_bound(b,identity) = identity.
% 0.46/1.12 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.46/1.12 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.46/1.12 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.46/1.12 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.46/1.12 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.46/1.12 18 (wt=7) [] -(greatest_lower_bound(a,multiply(b,a)) = a).
% 0.46/1.12 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.46/1.12 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 0.46/1.12 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 0.46/1.12 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.46/1.12 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.46/1.12 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.46/1.12 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.46/1.12 end_of_list.
% 0.46/1.12
% 0.46/1.12 Demodulators:
% 0.46/1.12 1 (wt=5) [] multiply(identity,A) = A.
% 0.46/1.12 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.46/1.12 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.46/1.12 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 0.46/1.12 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 0.46/1.12 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.46/1.12 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.46/1.12 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.46/1.12 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.46/1.12 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.46/1.12 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.46/1.12 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.46/1.12 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.46/1.12 16 (wt=5) [] greatest_lower_bound(a,identity) = identity.
% 0.46/1.12 17 (wt=5) [] greatest_lower_bound(b,identity) = identity.
% 0.46/1.12 end_of_list.
% 0.46/1.12
% 0.46/1.12 Passive:
% 0.46/1.12 end_of_list.
% 0.46/1.12
% 0.46/1.12 UNIT CONFLICT from 67 and 18 at 0.00 seconds.
% 0.46/1.12
% 0.46/1.12 ---------------- PROOF ----------------
% 0.46/1.12 % SZS output start Refutation
% See solution above
% 0.46/1.12 ------------ end of proof -------------
% 0.46/1.12
% 0.46/1.12
% 0.46/1.12 ------------- memory usage ------------
% 0.46/1.12 Memory dynamically allocated (tp_alloc): 488.
% 0.46/1.12 type (bytes each) gets frees in use avail bytes
% 0.46/1.12 sym_ent ( 96) 58 0 58 0 5.4 K
% 0.46/1.12 term ( 16) 4803 4165 638 14 12.5 K
% 0.46/1.12 gen_ptr ( 8) 3143 1082 2061 7 16.2 K
% 0.46/1.12 context ( 808) 4701 4699 2 3 3.9 K
% 0.46/1.12 trail ( 12) 204 204 0 4 0.0 K
% 0.46/1.12 bt_node ( 68) 2191 2188 3 2 0.3 K
% 0.46/1.12 ac_position (285432) 0 0 0 0 0.0 K
% 0.46/1.12 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.46/1.12 ac_match_free_vars_pos (4020)
% 0.46/1.12 0 0 0 0 0.0 K
% 0.46/1.12 discrim ( 12) 618 28 590 0 6.9 K
% 0.46/1.12 flat ( 40) 4584 4584 0 13 0.5 K
% 0.46/1.12 discrim_pos ( 12) 235 235 0 1 0.0 K
% 0.46/1.12 fpa_head ( 12) 413 0 413 0 4.8 K
% 0.46/1.12 fpa_tree ( 28) 116 116 0 7 0.2 K
% 0.46/1.12 fpa_pos ( 36) 124 124 0 1 0.0 K
% 0.46/1.12 literal ( 12) 311 244 67 1 0.8 K
% 0.46/1.12 clause ( 24) 311 244 67 1 1.6 K
% 0.46/1.12 list ( 12) 116 60 56 3 0.7 K
% 0.46/1.12 list_pos ( 20) 281 38 243 0 4.7 K
% 0.46/1.12 pair_index ( 40) 2 0 2 0 0.1 K
% 0.46/1.12
% 0.46/1.12 -------------- statistics -------------
% 0.46/1.12 Clauses input 18
% 0.46/1.12 Usable input 0
% 0.46/1.12 Sos input 18
% 0.46/1.12 Demodulators input 0
% 0.46/1.12 Passive input 0
% 0.46/1.12
% 0.46/1.12 Processed BS (before search) 20
% 0.46/1.12 Forward subsumed BS 2
% 0.46/1.12 Kept BS 18
% 0.46/1.12 New demodulators BS 15
% 0.46/1.12 Back demodulated BS 0
% 0.46/1.12
% 0.46/1.12 Clauses or pairs given 616
% 0.46/1.12 Clauses generated 201
% 0.46/1.12 Forward subsumed 152
% 0.46/1.12 Deleted by weight 0
% 0.46/1.12 Deleted by variable count 0
% 0.46/1.12 Kept 49
% 0.46/1.12 New demodulators 42
% 0.46/1.12 Back demodulated 4
% 0.46/1.12 Ordered paramod prunes 0
% 0.46/1.12 Basic paramod prunes 830
% 0.46/1.12 Prime paramod prunes 1
% 0.46/1.12 Semantic prunes 0
% 0.46/1.12
% 0.46/1.12 Rewrite attmepts 1351
% 0.46/1.12 Rewrites 222
% 0.46/1.12
% 0.46/1.12 FPA overloads 0
% 0.46/1.12 FPA underloads 0
% 0.46/1.12
% 0.46/1.12 Usable size 0
% 0.46/1.12 Sos size 62
% 0.46/1.12 Demodulators size 53
% 0.46/1.12 Passive size 0
% 0.46/1.12 Disabled size 4
% 0.46/1.12
% 0.46/1.12 Proofs found 1
% 0.46/1.12
% 0.46/1.12 ----------- times (seconds) ----------- Mon Jun 13 03:58:42 2022
% 0.46/1.12
% 0.46/1.12 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.46/1.12 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.46/1.12 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.46/1.12 input time 0.00
% 0.46/1.12 paramodulation time 0.00
% 0.46/1.12 demodulation time 0.00
% 0.46/1.12 orient time 0.00
% 0.46/1.12 weigh time 0.00
% 0.46/1.12 forward subsume time 0.00
% 0.46/1.12 back demod find time 0.00
% 0.46/1.12 conflict time 0.00
% 0.46/1.12 LRPO time 0.00
% 0.46/1.12 store clause time 0.00
% 0.46/1.12 disable clause time 0.00
% 0.46/1.12 prime paramod time 0.00
% 0.46/1.12 semantics time 0.00
% 0.46/1.12
% 0.46/1.12 EQP interrupted
%------------------------------------------------------------------------------