TSTP Solution File: GRP166-3 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP166-3 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n016.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.72s 1.11s
% Output : Refutation 0.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 3
% Number of leaves : 5
% Syntax : Number of clauses : 8 ( 8 unt; 0 nHn; 4 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 : 7 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(multiply(identity,A),A),
file('GRP166-3.p',unknown),
[] ).
cnf(5,plain,
equal(least_upper_bound(A,B),least_upper_bound(B,A)),
file('GRP166-3.p',unknown),
[] ).
cnf(14,plain,
equal(multiply(least_upper_bound(A,B),C),least_upper_bound(multiply(A,C),multiply(B,C))),
file('GRP166-3.p',unknown),
[] ).
cnf(17,plain,
equal(least_upper_bound(b,identity),b),
file('GRP166-3.p',unknown),
[] ).
cnf(18,plain,
~ equal(least_upper_bound(a,multiply(b,a)),multiply(b,a)),
file('GRP166-3.p',unknown),
[] ).
cnf(21,plain,
equal(least_upper_bound(identity,b),b),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[17,5]),1]),
[iquote('para(17,5),flip(1)')] ).
cnf(79,plain,
equal(least_upper_bound(A,multiply(b,A)),multiply(b,A)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[21,14]),1]),1]),
[iquote('para(21,14),demod([1]),flip(1)')] ).
cnf(80,plain,
$false,
inference(conflict,[status(thm)],[79,18]),
[iquote('conflict(79,18)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : GRP166-3 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.11/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n016.cluster.edu
% 0.12/0.33 % Model : x86_64 x86_64
% 0.12/0.33 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33 % Memory : 8042.1875MB
% 0.12/0.33 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33 % CPULimit : 300
% 0.12/0.33 % WCLimit : 600
% 0.12/0.33 % DateTime : Tue Jun 14 02:14:01 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.72/1.11 ----- EQP 0.9e, May 2009 -----
% 0.72/1.11 The job began on n016.cluster.edu, Tue Jun 14 02:14:02 2022
% 0.72/1.11 The command was "./eqp09e".
% 0.72/1.11
% 0.72/1.11 set(prolog_style_variables).
% 0.72/1.11 set(lrpo).
% 0.72/1.11 set(basic_paramod).
% 0.72/1.11 set(functional_subsume).
% 0.72/1.11 set(ordered_paramod).
% 0.72/1.11 set(prime_paramod).
% 0.72/1.11 set(para_pairs).
% 0.72/1.11 assign(pick_given_ratio,4).
% 0.72/1.11 clear(print_kept).
% 0.72/1.11 clear(print_new_demod).
% 0.72/1.11 clear(print_back_demod).
% 0.72/1.11 clear(print_given).
% 0.72/1.11 assign(max_mem,64000).
% 0.72/1.11 end_of_commands.
% 0.72/1.11
% 0.72/1.11 Usable:
% 0.72/1.11 end_of_list.
% 0.72/1.11
% 0.72/1.11 Sos:
% 0.72/1.11 0 (wt=-1) [] multiply(identity,A) = A.
% 0.72/1.11 0 (wt=-1) [] multiply(inverse(A),A) = identity.
% 0.72/1.11 0 (wt=-1) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.72/1.11 0 (wt=-1) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.72/1.11 0 (wt=-1) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.72/1.11 0 (wt=-1) [] greatest_lower_bound(A,greatest_lower_bound(B,C)) = greatest_lower_bound(greatest_lower_bound(A,B),C).
% 0.72/1.11 0 (wt=-1) [] least_upper_bound(A,least_upper_bound(B,C)) = least_upper_bound(least_upper_bound(A,B),C).
% 0.72/1.11 0 (wt=-1) [] least_upper_bound(A,A) = A.
% 0.72/1.11 0 (wt=-1) [] greatest_lower_bound(A,A) = A.
% 0.72/1.11 0 (wt=-1) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.72/1.11 0 (wt=-1) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.72/1.11 0 (wt=-1) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.72/1.11 0 (wt=-1) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.72/1.11 0 (wt=-1) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.72/1.11 0 (wt=-1) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.72/1.11 0 (wt=-1) [] least_upper_bound(a,identity) = a.
% 0.72/1.11 0 (wt=-1) [] least_upper_bound(b,identity) = b.
% 0.72/1.11 0 (wt=-1) [] -(least_upper_bound(a,multiply(b,a)) = multiply(b,a)).
% 0.72/1.11 end_of_list.
% 0.72/1.11
% 0.72/1.11 Demodulators:
% 0.72/1.11 end_of_list.
% 0.72/1.11
% 0.72/1.11 Passive:
% 0.72/1.11 end_of_list.
% 0.72/1.11
% 0.72/1.11 Starting to process input.
% 0.72/1.11
% 0.72/1.11 ** KEPT: 1 (wt=5) [] multiply(identity,A) = A.
% 0.72/1.11 1 is a new demodulator.
% 0.72/1.11
% 0.72/1.11 ** KEPT: 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.72/1.11 2 is a new demodulator.
% 0.72/1.11
% 0.72/1.11 ** KEPT: 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.72/1.11 3 is a new demodulator.
% 0.72/1.11
% 0.72/1.11 ** KEPT: 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.72/1.11 clause forward subsumed: 0 (wt=7) [flip(4)] greatest_lower_bound(B,A) = greatest_lower_bound(A,B).
% 0.72/1.11
% 0.72/1.11 ** KEPT: 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.72/1.11 clause forward subsumed: 0 (wt=7) [flip(5)] least_upper_bound(B,A) = least_upper_bound(A,B).
% 0.72/1.11
% 0.72/1.11 ** 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.72/1.11 6 is a new demodulator.
% 0.72/1.11
% 0.72/1.11 ** 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.72/1.11 7 is a new demodulator.
% 0.72/1.11
% 0.72/1.11 ** KEPT: 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.72/1.11 8 is a new demodulator.
% 0.72/1.11
% 0.72/1.11 ** KEPT: 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.72/1.11 9 is a new demodulator.
% 0.72/1.11
% 0.72/1.11 ** KEPT: 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.72/1.11 10 is a new demodulator.
% 0.72/1.11
% 0.72/1.11 ** KEPT: 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.72/1.11 11 is a new demodulator.
% 0.72/1.11
% 0.72/1.11 ** KEPT: 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.72/1.11 12 is a new demodulator.
% 0.72/1.11
% 0.72/1.11 ** KEPT: 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.72/1.11 13 is a new demodulator.
% 0.72/1.11
% 0.72/1.11 ** KEPT: 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.72/1.11 14 is a new demodulator.
% 0.72/1.11
% 0.72/1.11 ** KEPT: 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.72/1.11 15 is a new demodulator.
% 0.72/1.11
% 0.72/1.11 ** KEPT: 16 (wt=5) [] least_upper_bound(a,identity) = a.
% 0.72/1.11 16 is a new demodulator.
% 0.72/1.11
% 0.72/1.11 ** KEPT: 17 (wt=5) [] least_upper_bound(b,identity) = b.
% 0.72/1.11 17 is a new demodulator.
% 0.72/1.11
% 0.72/1.11 ** KEPT: 18 (wt=9) [] -(least_upper_bound(a,multiply(b,a)) = multiply(b,a)).
% 0.72/1.11 ---------------- PROOF FOUND ----------------
% 0.72/1.11 % SZS status Unsatisfiable
% 0.72/1.11
% 0.72/1.11
% 0.72/1.11 After processing input:
% 0.72/1.11
% 0.72/1.11 Usable:
% 0.72/1.11 end_of_list.
% 0.72/1.11
% 0.72/1.11 Sos:
% 0.72/1.11 1 (wt=5) [] multiply(identity,A) = A.
% 0.72/1.11 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.72/1.11 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.72/1.11 16 (wt=5) [] least_upper_bound(a,identity) = a.
% 0.72/1.11 17 (wt=5) [] least_upper_bound(b,identity) = b.
% 0.72/1.11 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.72/1.11 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.72/1.11 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.72/1.11 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.72/1.11 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.72/1.11 18 (wt=9) [] -(least_upper_bound(a,multiply(b,a)) = multiply(b,a)).
% 0.72/1.11 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.72/1.11 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 0.72/1.11 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 0.72/1.11 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.72/1.11 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.72/1.11 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.72/1.11 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.72/1.11 end_of_list.
% 0.72/1.11
% 0.72/1.11 Demodulators:
% 0.72/1.11 1 (wt=5) [] multiply(identity,A) = A.
% 0.72/1.11 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.72/1.11 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.72/1.11 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 0.72/1.11 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 0.72/1.11 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.72/1.11 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.72/1.11 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.72/1.11 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.72/1.11 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.72/1.11 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.72/1.11 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.72/1.11 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.72/1.11 16 (wt=5) [] least_upper_bound(a,identity) = a.
% 0.72/1.11 17 (wt=5) [] least_upper_bound(b,identity) = b.
% 0.72/1.11 end_of_list.
% 0.72/1.11
% 0.72/1.11 Passive:
% 0.72/1.11 end_of_list.
% 0.72/1.11
% 0.72/1.11 UNIT CONFLICT from 79 and 18 at 0.00 seconds.
% 0.72/1.11
% 0.72/1.11 ---------------- PROOF ----------------
% 0.72/1.11 % SZS output start Refutation
% See solution above
% 0.72/1.11 ------------ end of proof -------------
% 0.72/1.11
% 0.72/1.11
% 0.72/1.11 ------------- memory usage ------------
% 0.72/1.11 Memory dynamically allocated (tp_alloc): 488.
% 0.72/1.11 type (bytes each) gets frees in use avail bytes
% 0.72/1.11 sym_ent ( 96) 58 0 58 0 5.4 K
% 0.72/1.11 term ( 16) 5194 4430 764 14 14.9 K
% 0.72/1.11 gen_ptr ( 8) 3734 1218 2516 7 19.7 K
% 0.72/1.11 context ( 808) 5364 5362 2 3 3.9 K
% 0.72/1.11 trail ( 12) 230 230 0 4 0.0 K
% 0.72/1.11 bt_node ( 68) 2441 2438 3 3 0.4 K
% 0.72/1.11 ac_position (285432) 0 0 0 0 0.0 K
% 0.72/1.11 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.72/1.11 ac_match_free_vars_pos (4020)
% 0.72/1.11 0 0 0 0 0.0 K
% 0.72/1.11 discrim ( 12) 730 69 661 0 7.7 K
% 0.72/1.11 flat ( 40) 5124 5124 0 13 0.5 K
% 0.72/1.11 discrim_pos ( 12) 259 259 0 1 0.0 K
% 0.72/1.11 fpa_head ( 12) 459 0 459 0 5.4 K
% 0.72/1.11 fpa_tree ( 28) 150 150 0 7 0.2 K
% 0.72/1.11 fpa_pos ( 36) 148 148 0 1 0.0 K
% 0.72/1.11 literal ( 12) 347 268 79 1 0.9 K
% 0.72/1.11 clause ( 24) 347 268 79 1 1.9 K
% 0.72/1.11 list ( 12) 128 72 56 3 0.7 K
% 0.72/1.11 list_pos ( 20) 339 63 276 0 5.4 K
% 0.72/1.11 pair_index ( 40) 2 0 2 0 0.1 K
% 0.72/1.11
% 0.72/1.11 -------------- statistics -------------
% 0.72/1.11 Clauses input 18
% 0.72/1.11 Usable input 0
% 0.72/1.11 Sos input 18
% 0.72/1.11 Demodulators input 0
% 0.72/1.11 Passive input 0
% 0.72/1.11
% 0.72/1.11 Processed BS (before search) 20
% 0.72/1.11 Forward subsumed BS 2
% 0.72/1.11 Kept BS 18
% 0.72/1.11 New demodulators BS 15
% 0.72/1.11 Back demodulated BS 0
% 0.72/1.11
% 0.72/1.11 Clauses or pairs given 730
% 0.72/1.11 Clauses generated 222
% 0.72/1.11 Forward subsumed 161
% 0.72/1.11 Deleted by weight 0
% 0.72/1.11 Deleted by variable count 0
% 0.72/1.11 Kept 61
% 0.72/1.11 New demodulators 54
% 0.72/1.11 Back demodulated 9
% 0.72/1.11 Ordered paramod prunes 0
% 0.72/1.11 Basic paramod prunes 1089
% 0.72/1.11 Prime paramod prunes 4
% 0.72/1.11 Semantic prunes 0
% 0.72/1.11
% 0.72/1.11 Rewrite attmepts 1517
% 0.72/1.11 Rewrites 243
% 0.72/1.11
% 0.72/1.11 FPA overloads 0
% 0.72/1.11 FPA underloads 0
% 0.72/1.11
% 0.72/1.11 Usable size 0
% 0.72/1.11 Sos size 69
% 0.72/1.11 Demodulators size 60
% 0.72/1.11 Passive size 0
% 0.72/1.11 Disabled size 9
% 0.72/1.11
% 0.72/1.11 Proofs found 1
% 0.72/1.11
% 0.72/1.11 ----------- times (seconds) ----------- Tue Jun 14 02:14:02 2022
% 0.72/1.11
% 0.72/1.11 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.72/1.11 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.72/1.11 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.72/1.11 input time 0.00
% 0.72/1.11 paramodulation time 0.00
% 0.72/1.11 demodulation time 0.00
% 0.72/1.11 orient time 0.00
% 0.72/1.11 weigh time 0.00
% 0.72/1.11 forward subsume time 0.00
% 0.72/1.11 back demod find time 0.00
% 0.72/1.11 conflict time 0.00
% 0.72/1.11 LRPO time 0.00
% 0.72/1.11 store clause time 0.00
% 0.72/1.11 disable clause time 0.00
% 0.72/1.11 prime paramod time 0.00
% 0.72/1.11 semantics time 0.00
% 0.72/1.11
% 0.72/1.11 EQP interrupted
%------------------------------------------------------------------------------