TSTP Solution File: GRP170-4 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP170-4 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n022.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:40 EDT 2022
% Result : Unsatisfiable 3.78s 4.16s
% Output : Refutation 3.78s
% Verified :
% SZS Type : Refutation
% Derivation depth : 6
% Number of leaves : 9
% Syntax : Number of clauses : 18 ( 18 unt; 0 nHn; 8 RR)
% Number of literals : 18 ( 0 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 20 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(multiply(identity,A),A),
file('GRP170-4.p',unknown),
[] ).
cnf(4,plain,
equal(greatest_lower_bound(A,B),greatest_lower_bound(B,A)),
file('GRP170-4.p',unknown),
[] ).
cnf(5,plain,
equal(least_upper_bound(A,B),least_upper_bound(B,A)),
file('GRP170-4.p',unknown),
[] ).
cnf(7,plain,
equal(least_upper_bound(least_upper_bound(A,B),C),least_upper_bound(A,least_upper_bound(B,C))),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(10,plain,
equal(least_upper_bound(A,greatest_lower_bound(A,B)),A),
file('GRP170-4.p',unknown),
[] ).
cnf(12,plain,
equal(multiply(A,least_upper_bound(B,C)),least_upper_bound(multiply(A,B),multiply(A,C))),
file('GRP170-4.p',unknown),
[] ).
cnf(14,plain,
equal(multiply(least_upper_bound(A,B),C),least_upper_bound(multiply(A,C),multiply(B,C))),
file('GRP170-4.p',unknown),
[] ).
cnf(16,plain,
equal(least_upper_bound(a,b),b),
file('GRP170-4.p',unknown),
[] ).
cnf(17,plain,
equal(greatest_lower_bound(c,d),c),
file('GRP170-4.p',unknown),
[] ).
cnf(18,plain,
~ equal(least_upper_bound(multiply(a,c),multiply(b,d)),multiply(b,d)),
file('GRP170-4.p',unknown),
[] ).
cnf(22,plain,
equal(greatest_lower_bound(d,c),c),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[17,4]),1]),
[iquote('para(17,4),flip(1)')] ).
cnf(27,plain,
equal(least_upper_bound(d,c),d),
inference(para,[status(thm),theory(equality)],[22,10]),
[iquote('para(22,10)')] ).
cnf(31,plain,
equal(least_upper_bound(c,d),d),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[27,5]),1]),
[iquote('para(27,5),flip(1)')] ).
cnf(61,plain,
equal(least_upper_bound(multiply(a,A),multiply(b,A)),multiply(b,A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[16,14]),1]),
[iquote('para(16,14),flip(1)')] ).
cnf(144,plain,
equal(least_upper_bound(multiply(A,c),multiply(A,d)),multiply(A,d)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[31,12]),1]),
[iquote('para(31,12),flip(1)')] ).
cnf(391,plain,
equal(least_upper_bound(multiply(a,A),least_upper_bound(multiply(b,A),B)),least_upper_bound(multiply(b,A),B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[61,7]),1]),
[iquote('para(61,7),flip(1)')] ).
cnf(12034,plain,
equal(least_upper_bound(multiply(a,c),multiply(b,d)),multiply(b,d)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[144,391]),144]),
[iquote('para(144,391),demod([144])')] ).
cnf(12035,plain,
$false,
inference(conflict,[status(thm)],[12034,18]),
[iquote('conflict(12034,18)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : GRP170-4 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.03/0.12 % Command : tptp2X_and_run_eqp %s
% 0.13/0.33 % Computer : n022.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 21:59:18 EDT 2022
% 0.13/0.33 % CPUTime :
% 3.78/4.16 ----- EQP 0.9e, May 2009 -----
% 3.78/4.16 The job began on n022.cluster.edu, Mon Jun 13 21:59:19 2022
% 3.78/4.16 The command was "./eqp09e".
% 3.78/4.16
% 3.78/4.16 set(prolog_style_variables).
% 3.78/4.16 set(lrpo).
% 3.78/4.16 set(basic_paramod).
% 3.78/4.16 set(functional_subsume).
% 3.78/4.16 set(ordered_paramod).
% 3.78/4.16 set(prime_paramod).
% 3.78/4.16 set(para_pairs).
% 3.78/4.16 assign(pick_given_ratio,4).
% 3.78/4.16 clear(print_kept).
% 3.78/4.16 clear(print_new_demod).
% 3.78/4.16 clear(print_back_demod).
% 3.78/4.16 clear(print_given).
% 3.78/4.16 assign(max_mem,64000).
% 3.78/4.16 end_of_commands.
% 3.78/4.16
% 3.78/4.16 Usable:
% 3.78/4.16 end_of_list.
% 3.78/4.16
% 3.78/4.16 Sos:
% 3.78/4.16 0 (wt=-1) [] multiply(identity,A) = A.
% 3.78/4.16 0 (wt=-1) [] multiply(inverse(A),A) = identity.
% 3.78/4.16 0 (wt=-1) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 3.78/4.16 0 (wt=-1) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 3.78/4.16 0 (wt=-1) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 3.78/4.16 0 (wt=-1) [] greatest_lower_bound(A,greatest_lower_bound(B,C)) = greatest_lower_bound(greatest_lower_bound(A,B),C).
% 3.78/4.16 0 (wt=-1) [] least_upper_bound(A,least_upper_bound(B,C)) = least_upper_bound(least_upper_bound(A,B),C).
% 3.78/4.16 0 (wt=-1) [] least_upper_bound(A,A) = A.
% 3.78/4.16 0 (wt=-1) [] greatest_lower_bound(A,A) = A.
% 3.78/4.16 0 (wt=-1) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 3.78/4.16 0 (wt=-1) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 3.78/4.16 0 (wt=-1) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 3.78/4.16 0 (wt=-1) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 3.78/4.16 0 (wt=-1) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 3.78/4.16 0 (wt=-1) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 3.78/4.16 0 (wt=-1) [] least_upper_bound(a,b) = b.
% 3.78/4.16 0 (wt=-1) [] greatest_lower_bound(c,d) = c.
% 3.78/4.16 0 (wt=-1) [] -(least_upper_bound(multiply(a,c),multiply(b,d)) = multiply(b,d)).
% 3.78/4.16 end_of_list.
% 3.78/4.16
% 3.78/4.16 Demodulators:
% 3.78/4.16 end_of_list.
% 3.78/4.16
% 3.78/4.16 Passive:
% 3.78/4.16 end_of_list.
% 3.78/4.16
% 3.78/4.16 Starting to process input.
% 3.78/4.16
% 3.78/4.16 ** KEPT: 1 (wt=5) [] multiply(identity,A) = A.
% 3.78/4.16 1 is a new demodulator.
% 3.78/4.16
% 3.78/4.16 ** KEPT: 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 3.78/4.16 2 is a new demodulator.
% 3.78/4.16
% 3.78/4.16 ** KEPT: 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 3.78/4.16 3 is a new demodulator.
% 3.78/4.16
% 3.78/4.16 ** KEPT: 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 3.78/4.16 clause forward subsumed: 0 (wt=7) [flip(4)] greatest_lower_bound(B,A) = greatest_lower_bound(A,B).
% 3.78/4.16
% 3.78/4.16 ** KEPT: 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 3.78/4.16 clause forward subsumed: 0 (wt=7) [flip(5)] least_upper_bound(B,A) = least_upper_bound(A,B).
% 3.78/4.16
% 3.78/4.16 ** KEPT: 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 3.78/4.16 6 is a new demodulator.
% 3.78/4.16
% 3.78/4.16 ** KEPT: 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 3.78/4.16 7 is a new demodulator.
% 3.78/4.16
% 3.78/4.16 ** KEPT: 8 (wt=5) [] least_upper_bound(A,A) = A.
% 3.78/4.16 8 is a new demodulator.
% 3.78/4.16
% 3.78/4.16 ** KEPT: 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 3.78/4.16 9 is a new demodulator.
% 3.78/4.16
% 3.78/4.16 ** KEPT: 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 3.78/4.16 10 is a new demodulator.
% 3.78/4.16
% 3.78/4.16 ** KEPT: 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 3.78/4.16 11 is a new demodulator.
% 3.78/4.16
% 3.78/4.16 ** KEPT: 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 3.78/4.16 12 is a new demodulator.
% 3.78/4.16
% 3.78/4.16 ** KEPT: 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 3.78/4.16 13 is a new demodulator.
% 3.78/4.16
% 3.78/4.16 ** KEPT: 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 3.78/4.16 14 is a new demodulator.
% 3.78/4.16
% 3.78/4.16 ** KEPT: 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 3.78/4.16 15 is a new demodulator.
% 3.78/4.16
% 3.78/4.16 ** KEPT: 16 (wt=5) [] least_upper_bound(a,b) = b.
% 3.78/4.16 16 is a new demodulator.
% 3.78/4.16
% 3.78/4.16 ** KEPT: 17 (wt=5) [] greatest_lower_bound(c,d) = c.
% 3.78/4.16 17 is a new demodulator.
% 3.78/4.16
% 3.78/4.16 ** KEPT: 18 (wt=11) [] -(least_upper_bound(multiply(a,c),multiply(b,d)) = multiply(b,d)).
% 3.78/4.16 ---------------- PROOF FOUND ----------------
% 3.78/4.16 % SZS status Unsatisfiable
% 3.78/4.16
% 3.78/4.16
% 3.78/4.16 After processing input:
% 3.78/4.16
% 3.78/4.16 Usable:
% 3.78/4.16 end_of_list.
% 3.78/4.16
% 3.78/4.16 Sos:
% 3.78/4.16 1 (wt=5) [] multiply(identity,A) = A.
% 3.78/4.16 8 (wt=5) [] least_upper_bound(A,A) = A.
% 3.78/4.16 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 3.78/4.16 16 (wt=5) [] least_upper_bound(a,b) = b.
% 3.78/4.16 17 (wt=5) [] greatest_lower_bound(c,d) = c.
% 3.78/4.16 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 3.78/4.16 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 3.78/4.16 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 3.78/4.16 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 3.78/4.16 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 3.78/4.16 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 3.78/4.16 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 3.78/4.16 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 3.78/4.16 18 (wt=11) [] -(least_upper_bound(multiply(a,c),multiply(b,d)) = multiply(b,d)).
% 3.78/4.16 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 3.78/4.16 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 3.78/4.16 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 3.78/4.16 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 3.78/4.16 end_of_list.
% 3.78/4.16
% 3.78/4.16 Demodulators:
% 3.78/4.16 1 (wt=5) [] multiply(identity,A) = A.
% 3.78/4.16 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 3.78/4.16 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 3.78/4.16 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 3.78/4.16 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 3.78/4.16 8 (wt=5) [] least_upper_bound(A,A) = A.
% 3.78/4.16 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 3.78/4.16 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 3.78/4.16 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 3.78/4.16 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 3.78/4.16 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 3.78/4.16 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 3.78/4.16 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 3.78/4.16 16 (wt=5) [] least_upper_bound(a,b) = b.
% 3.78/4.16 17 (wt=5) [] greatest_lower_bound(c,d) = c.
% 3.78/4.16 end_of_list.
% 3.78/4.16
% 3.78/4.16 Passive:
% 3.78/4.16 end_of_list.
% 3.78/4.16
% 3.78/4.16 UNIT CONFLICT from 12034 and 18 at 1.92 seconds.
% 3.78/4.16
% 3.78/4.16 ---------------- PROOF ----------------
% 3.78/4.16 % SZS output start Refutation
% See solution above
% 3.78/4.16 ------------ end of proof -------------
% 3.78/4.16
% 3.78/4.16
% 3.78/4.16 ------------- memory usage ------------
% 3.78/4.16 Memory dynamically allocated (tp_alloc): 23925.
% 3.78/4.16 type (bytes each) gets frees in use avail bytes
% 3.78/4.16 sym_ent ( 96) 60 0 60 0 5.6 K
% 3.78/4.16 term ( 16) 1734439 1404539 329900 27 6396.9 K
% 3.78/4.16 gen_ptr ( 8) 1764549 243306 1521243 17 11884.8 K
% 3.78/4.16 context ( 808) 2493823 2493821 2 6 6.3 K
% 3.78/4.16 trail ( 12) 117434 117434 0 7 0.1 K
% 3.78/4.16 bt_node ( 68) 1341991 1341986 5 22 1.8 K
% 3.78/4.16 ac_position (285432) 0 0 0 0 0.0 K
% 3.78/4.16 ac_match_pos (14044) 0 0 0 0 0.0 K
% 3.78/4.16 ac_match_free_vars_pos (4020)
% 3.78/4.16 0 0 0 0 0.0 K
% 3.78/4.16 discrim ( 12) 267953 9477 258476 46 3029.6 K
% 3.78/4.16 flat ( 40) 3850032 3850032 0 185 7.2 K
% 3.78/4.16 discrim_pos ( 12) 79405 79405 0 1 0.0 K
% 3.78/4.16 fpa_head ( 12) 24347 0 24347 0 285.3 K
% 3.78/4.16 fpa_tree ( 28) 52060 52060 0 83 2.3 K
% 3.78/4.16 fpa_pos ( 36) 20412 20412 0 1 0.0 K
% 3.78/4.16 literal ( 12) 70230 58196 12034 1 141.0 K
% 3.78/4.16 clause ( 24) 70230 58196 12034 1 282.1 K
% 3.78/4.16 list ( 12) 8437 8381 56 3 0.7 K
% 3.78/4.16 list_pos ( 20) 46105 3425 42680 7 833.7 K
% 3.78/4.16 pair_index ( 40) 2 0 2 0 0.1 K
% 3.78/4.16
% 3.78/4.16 -------------- statistics -------------
% 3.78/4.16 Clauses input 18
% 3.78/4.16 Usable input 0
% 3.78/4.16 Sos input 18
% 3.78/4.16 Demodulators input 0
% 3.78/4.16 Passive input 0
% 3.78/4.16
% 3.78/4.16 Processed BS (before search) 20
% 3.78/4.16 Forward subsumed BS 2
% 3.78/4.16 Kept BS 18
% 3.78/4.16 New demodulators BS 15
% 3.78/4.16 Back demodulated BS 0
% 3.78/4.16
% 3.78/4.16 Clauses or pairs given 250790
% 3.78/4.16 Clauses generated 47332
% 3.78/4.16 Forward subsumed 35316
% 3.78/4.16 Deleted by weight 0
% 3.78/4.16 Deleted by variable count 0
% 3.78/4.16 Kept 12016
% 3.78/4.16 New demodulators 8363
% 3.78/4.16 Back demodulated 805
% 3.78/4.16 Ordered paramod prunes 0
% 3.78/4.16 Basic paramod prunes 1601415
% 3.78/4.16 Prime paramod prunes 2016
% 3.78/4.16 Semantic prunes 0
% 3.78/4.16
% 3.78/4.16 Rewrite attmepts 680415
% 3.78/4.16 Rewrites 68770
% 3.78/4.16
% 3.78/4.16 FPA overloads 0
% 3.78/4.16 FPA underloads 0
% 3.78/4.16
% 3.78/4.16 Usable size 0
% 3.78/4.16 Sos size 11228
% 3.78/4.16 Demodulators size 8191
% 3.78/4.16 Passive size 0
% 3.78/4.16 Disabled size 805
% 3.78/4.16
% 3.78/4.16 Proofs found 1
% 3.78/4.16
% 3.78/4.16 ----------- times (seconds) ----------- Mon Jun 13 21:59:22 2022
% 3.78/4.16
% 3.78/4.16 user CPU time 1.92 (0 hr, 0 min, 1 sec)
% 3.78/4.16 system CPU time 1.18 (0 hr, 0 min, 1 sec)
% 3.78/4.16 wall-clock time 3 (0 hr, 0 min, 3 sec)
% 3.78/4.16 input time 0.00
% 3.78/4.16 paramodulation time 0.31
% 3.78/4.16 demodulation time 0.15
% 3.78/4.16 orient time 0.08
% 3.78/4.16 weigh time 0.02
% 3.78/4.16 forward subsume time 0.04
% 3.78/4.16 back demod find time 0.10
% 3.78/4.16 conflict time 0.01
% 3.78/4.16 LRPO time 0.03
% 3.78/4.16 store clause time 0.83
% 3.78/4.16 disable clause time 0.04
% 3.78/4.16 prime paramod time 0.06
% 3.78/4.16 semantics time 0.00
% 3.78/4.16
% 3.78/4.16 EQP interrupted
%------------------------------------------------------------------------------