TSTP Solution File: GRP155-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP155-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n014.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:33 EDT 2022
% Result : Unsatisfiable 0.42s 1.08s
% Output : Refutation 0.42s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 4
% Syntax : Number of clauses : 6 ( 6 unt; 0 nHn; 3 RR)
% Number of literals : 6 ( 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 : 6 ( 6 usr; 4 con; 0-2 aty)
% Number of variables : 5 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(multiply(identity,A),A),
file('GRP155-1.p',unknown),
[] ).
cnf(15,plain,
equal(multiply(greatest_lower_bound(A,B),C),greatest_lower_bound(multiply(A,C),multiply(B,C))),
file('GRP155-1.p',unknown),
[] ).
cnf(16,plain,
equal(greatest_lower_bound(a,b),a),
file('GRP155-1.p',unknown),
[] ).
cnf(17,plain,
~ equal(greatest_lower_bound(multiply(a,c),multiply(b,c)),multiply(a,c)),
file('GRP155-1.p',unknown),
[] ).
cnf(61,plain,
equal(greatest_lower_bound(multiply(a,A),multiply(b,A)),multiply(a,A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[16,15]),1]),
[iquote('para(16,15),flip(1)')] ).
cnf(62,plain,
$false,
inference(conflict,[status(thm)],[61,17]),
[iquote('conflict(61,17)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP155-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.07/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n014.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 : Mon Jun 13 10:49:52 EDT 2022
% 0.12/0.33 % CPUTime :
% 0.42/1.08 ----- EQP 0.9e, May 2009 -----
% 0.42/1.08 The job began on n014.cluster.edu, Mon Jun 13 10:49:53 2022
% 0.42/1.08 The command was "./eqp09e".
% 0.42/1.08
% 0.42/1.08 set(prolog_style_variables).
% 0.42/1.08 set(lrpo).
% 0.42/1.08 set(basic_paramod).
% 0.42/1.08 set(functional_subsume).
% 0.42/1.08 set(ordered_paramod).
% 0.42/1.08 set(prime_paramod).
% 0.42/1.08 set(para_pairs).
% 0.42/1.08 assign(pick_given_ratio,4).
% 0.42/1.08 clear(print_kept).
% 0.42/1.08 clear(print_new_demod).
% 0.42/1.08 clear(print_back_demod).
% 0.42/1.08 clear(print_given).
% 0.42/1.08 assign(max_mem,64000).
% 0.42/1.08 end_of_commands.
% 0.42/1.08
% 0.42/1.08 Usable:
% 0.42/1.08 end_of_list.
% 0.42/1.08
% 0.42/1.08 Sos:
% 0.42/1.08 0 (wt=-1) [] multiply(identity,A) = A.
% 0.42/1.08 0 (wt=-1) [] multiply(inverse(A),A) = identity.
% 0.42/1.08 0 (wt=-1) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.42/1.08 0 (wt=-1) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.42/1.08 0 (wt=-1) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.42/1.08 0 (wt=-1) [] greatest_lower_bound(A,greatest_lower_bound(B,C)) = greatest_lower_bound(greatest_lower_bound(A,B),C).
% 0.42/1.08 0 (wt=-1) [] least_upper_bound(A,least_upper_bound(B,C)) = least_upper_bound(least_upper_bound(A,B),C).
% 0.42/1.08 0 (wt=-1) [] least_upper_bound(A,A) = A.
% 0.42/1.08 0 (wt=-1) [] greatest_lower_bound(A,A) = A.
% 0.42/1.08 0 (wt=-1) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.42/1.08 0 (wt=-1) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.42/1.08 0 (wt=-1) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.42/1.08 0 (wt=-1) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.42/1.08 0 (wt=-1) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.42/1.08 0 (wt=-1) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.42/1.08 0 (wt=-1) [] greatest_lower_bound(a,b) = a.
% 0.42/1.08 0 (wt=-1) [] -(greatest_lower_bound(multiply(a,c),multiply(b,c)) = multiply(a,c)).
% 0.42/1.08 end_of_list.
% 0.42/1.08
% 0.42/1.08 Demodulators:
% 0.42/1.08 end_of_list.
% 0.42/1.08
% 0.42/1.08 Passive:
% 0.42/1.08 end_of_list.
% 0.42/1.08
% 0.42/1.08 Starting to process input.
% 0.42/1.08
% 0.42/1.08 ** KEPT: 1 (wt=5) [] multiply(identity,A) = A.
% 0.42/1.08 1 is a new demodulator.
% 0.42/1.08
% 0.42/1.08 ** KEPT: 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.42/1.08 2 is a new demodulator.
% 0.42/1.08
% 0.42/1.08 ** KEPT: 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.42/1.08 3 is a new demodulator.
% 0.42/1.08
% 0.42/1.08 ** KEPT: 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.42/1.08 clause forward subsumed: 0 (wt=7) [flip(4)] greatest_lower_bound(B,A) = greatest_lower_bound(A,B).
% 0.42/1.08
% 0.42/1.08 ** KEPT: 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.42/1.08 clause forward subsumed: 0 (wt=7) [flip(5)] least_upper_bound(B,A) = least_upper_bound(A,B).
% 0.42/1.08
% 0.42/1.08 ** 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.42/1.08 6 is a new demodulator.
% 0.42/1.08
% 0.42/1.08 ** 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.42/1.08 7 is a new demodulator.
% 0.42/1.08
% 0.42/1.08 ** KEPT: 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.42/1.08 8 is a new demodulator.
% 0.42/1.08
% 0.42/1.08 ** KEPT: 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.42/1.08 9 is a new demodulator.
% 0.42/1.08
% 0.42/1.08 ** KEPT: 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.42/1.08 10 is a new demodulator.
% 0.42/1.08
% 0.42/1.08 ** KEPT: 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.42/1.08 11 is a new demodulator.
% 0.42/1.08
% 0.42/1.08 ** KEPT: 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.42/1.08 12 is a new demodulator.
% 0.42/1.08
% 0.42/1.08 ** KEPT: 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.42/1.08 13 is a new demodulator.
% 0.42/1.08
% 0.42/1.08 ** KEPT: 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.42/1.08 14 is a new demodulator.
% 0.42/1.08
% 0.42/1.08 ** KEPT: 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.42/1.08 15 is a new demodulator.
% 0.42/1.08
% 0.42/1.08 ** KEPT: 16 (wt=5) [] greatest_lower_bound(a,b) = a.
% 0.42/1.08 16 is a new demodulator.
% 0.42/1.08
% 0.42/1.08 ** KEPT: 17 (wt=11) [] -(greatest_lower_bound(multiply(a,c),multiply(b,c)) = multiply(a,c)).
% 0.42/1.08 ---------------- PROOF FOUND ----------------
% 0.42/1.08 % SZS status Unsatisfiable
% 0.42/1.08
% 0.42/1.08
% 0.42/1.08 After processing input:
% 0.42/1.08
% 0.42/1.08 Usable:
% 0.42/1.08 end_of_list.
% 0.42/1.08
% 0.42/1.08 Sos:
% 0.42/1.08 1 (wt=5) [] multiply(identity,A) = A.
% 0.42/1.08 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.42/1.08 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.42/1.08 16 (wt=5) [] greatest_lower_bound(a,b) = a.
% 0.42/1.08 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.42/1.08 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.42/1.08 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.42/1.08 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.42/1.08 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.42/1.08 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.42/1.08 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 0.42/1.08 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 0.42/1.08 17 (wt=11) [] -(greatest_lower_bound(multiply(a,c),multiply(b,c)) = multiply(a,c)).
% 0.42/1.08 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.42/1.08 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.42/1.08 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.42/1.08 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.42/1.08 end_of_list.
% 0.42/1.08
% 0.42/1.08 Demodulators:
% 0.42/1.08 1 (wt=5) [] multiply(identity,A) = A.
% 0.42/1.08 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.42/1.08 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.42/1.08 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 0.42/1.08 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 0.42/1.08 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.42/1.08 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.42/1.08 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.42/1.08 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.42/1.08 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.42/1.08 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.42/1.08 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.42/1.08 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.42/1.08 16 (wt=5) [] greatest_lower_bound(a,b) = a.
% 0.42/1.08 end_of_list.
% 0.42/1.08
% 0.42/1.08 Passive:
% 0.42/1.08 end_of_list.
% 0.42/1.08
% 0.42/1.08 UNIT CONFLICT from 61 and 17 at 0.00 seconds.
% 0.42/1.08
% 0.42/1.08 ---------------- PROOF ----------------
% 0.42/1.08 % SZS output start Refutation
% See solution above
% 0.42/1.08 ------------ end of proof -------------
% 0.42/1.08
% 0.42/1.08
% 0.42/1.08 ------------- memory usage ------------
% 0.42/1.08 Memory dynamically allocated (tp_alloc): 488.
% 0.42/1.08 type (bytes each) gets frees in use avail bytes
% 0.42/1.08 sym_ent ( 96) 59 0 59 0 5.5 K
% 0.42/1.08 term ( 16) 4464 3867 597 14 11.7 K
% 0.42/1.08 gen_ptr ( 8) 2877 982 1895 5 14.8 K
% 0.42/1.08 context ( 808) 3605 3603 2 3 3.9 K
% 0.42/1.08 trail ( 12) 196 196 0 4 0.0 K
% 0.42/1.08 bt_node ( 68) 1541 1538 3 3 0.4 K
% 0.42/1.08 ac_position (285432) 0 0 0 0 0.0 K
% 0.42/1.08 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.42/1.08 ac_match_free_vars_pos (4020)
% 0.42/1.08 0 0 0 0 0.0 K
% 0.42/1.08 discrim ( 12) 564 47 517 0 6.1 K
% 0.42/1.08 flat ( 40) 4217 4217 0 13 0.5 K
% 0.42/1.08 discrim_pos ( 12) 204 204 0 1 0.0 K
% 0.42/1.08 fpa_head ( 12) 399 0 399 0 4.7 K
% 0.42/1.08 fpa_tree ( 28) 98 98 0 7 0.2 K
% 0.42/1.08 fpa_pos ( 36) 112 112 0 1 0.0 K
% 0.42/1.08 literal ( 12) 278 217 61 1 0.7 K
% 0.42/1.08 clause ( 24) 278 217 61 1 1.5 K
% 0.42/1.08 list ( 12) 110 54 56 3 0.7 K
% 0.42/1.08 list_pos ( 20) 262 52 210 0 4.1 K
% 0.42/1.08 pair_index ( 40) 2 0 2 0 0.1 K
% 0.42/1.08
% 0.42/1.08 -------------- statistics -------------
% 0.42/1.08 Clauses input 17
% 0.42/1.08 Usable input 0
% 0.42/1.08 Sos input 17
% 0.42/1.08 Demodulators input 0
% 0.42/1.08 Passive input 0
% 0.42/1.08
% 0.42/1.08 Processed BS (before search) 19
% 0.42/1.08 Forward subsumed BS 2
% 0.42/1.08 Kept BS 17
% 0.42/1.08 New demodulators BS 14
% 0.42/1.08 Back demodulated BS 0
% 0.42/1.08
% 0.42/1.08 Clauses or pairs given 490
% 0.42/1.08 Clauses generated 173
% 0.42/1.08 Forward subsumed 129
% 0.42/1.08 Deleted by weight 0
% 0.42/1.08 Deleted by variable count 0
% 0.42/1.08 Kept 44
% 0.42/1.08 New demodulators 37
% 0.42/1.08 Back demodulated 7
% 0.42/1.08 Ordered paramod prunes 0
% 0.42/1.08 Basic paramod prunes 638
% 0.42/1.08 Prime paramod prunes 4
% 0.42/1.08 Semantic prunes 0
% 0.42/1.08
% 0.42/1.08 Rewrite attmepts 1168
% 0.42/1.08 Rewrites 188
% 0.42/1.08
% 0.42/1.08 FPA overloads 0
% 0.42/1.08 FPA underloads 0
% 0.42/1.08
% 0.42/1.08 Usable size 0
% 0.42/1.08 Sos size 53
% 0.42/1.08 Demodulators size 44
% 0.42/1.08 Passive size 0
% 0.42/1.08 Disabled size 7
% 0.42/1.08
% 0.42/1.08 Proofs found 1
% 0.42/1.08
% 0.42/1.08 ----------- times (seconds) ----------- Mon Jun 13 10:49:53 2022
% 0.42/1.08
% 0.42/1.08 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.42/1.08 system CPU time 0.01 (0 hr, 0 min, 0 sec)
% 0.42/1.08 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.42/1.08 input time 0.00
% 0.42/1.08 paramodulation time 0.00
% 0.42/1.08 demodulation time 0.00
% 0.42/1.08 orient time 0.00
% 0.42/1.08 weigh time 0.00
% 0.42/1.08 forward subsume time 0.00
% 0.42/1.08 back demod find time 0.00
% 0.42/1.08 conflict time 0.00
% 0.42/1.08 LRPO time 0.00
% 0.42/1.08 store clause time 0.00
% 0.42/1.08 disable clause time 0.00
% 0.42/1.08 prime paramod time 0.00
% 0.42/1.08 semantics time 0.00
% 0.42/1.08
% 0.42/1.08 EQP interrupted
%------------------------------------------------------------------------------