TSTP Solution File: GRP189-2 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP189-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n025.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:52 EDT 2022
% Result : Unsatisfiable 0.68s 1.09s
% Output : Refutation 0.68s
% Verified :
% SZS Type : Refutation
% Derivation depth : 2
% Number of leaves : 3
% Syntax : Number of clauses : 5 ( 5 unt; 0 nHn; 2 RR)
% Number of literals : 5 ( 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 : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 6 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(5,plain,
equal(least_upper_bound(A,B),least_upper_bound(B,A)),
file('GRP189-2.p',unknown),
[] ).
cnf(11,plain,
equal(greatest_lower_bound(A,least_upper_bound(A,B)),A),
file('GRP189-2.p',unknown),
[] ).
cnf(19,plain,
~ equal(greatest_lower_bound(b,least_upper_bound(a,b)),b),
file('GRP189-2.p',unknown),
[] ).
cnf(28,plain,
equal(greatest_lower_bound(A,least_upper_bound(B,A)),A),
inference(para,[status(thm),theory(equality)],[5,11]),
[iquote('para(5,11)')] ).
cnf(29,plain,
$false,
inference(conflict,[status(thm)],[28,19]),
[iquote('conflict(28,19)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12 % Problem : GRP189-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.10/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n025.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 06:20:39 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.68/1.09 ----- EQP 0.9e, May 2009 -----
% 0.68/1.09 The job began on n025.cluster.edu, Tue Jun 14 06:20:40 2022
% 0.68/1.09 The command was "./eqp09e".
% 0.68/1.09
% 0.68/1.09 set(prolog_style_variables).
% 0.68/1.09 set(lrpo).
% 0.68/1.09 set(basic_paramod).
% 0.68/1.09 set(functional_subsume).
% 0.68/1.09 set(ordered_paramod).
% 0.68/1.09 set(prime_paramod).
% 0.68/1.09 set(para_pairs).
% 0.68/1.09 assign(pick_given_ratio,4).
% 0.68/1.09 clear(print_kept).
% 0.68/1.09 clear(print_new_demod).
% 0.68/1.09 clear(print_back_demod).
% 0.68/1.09 clear(print_given).
% 0.68/1.09 assign(max_mem,64000).
% 0.68/1.09 end_of_commands.
% 0.68/1.09
% 0.68/1.09 Usable:
% 0.68/1.09 end_of_list.
% 0.68/1.09
% 0.68/1.09 Sos:
% 0.68/1.09 0 (wt=-1) [] multiply(identity,A) = A.
% 0.68/1.09 0 (wt=-1) [] multiply(inverse(A),A) = identity.
% 0.68/1.09 0 (wt=-1) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.68/1.09 0 (wt=-1) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.68/1.09 0 (wt=-1) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.68/1.09 0 (wt=-1) [] greatest_lower_bound(A,greatest_lower_bound(B,C)) = greatest_lower_bound(greatest_lower_bound(A,B),C).
% 0.68/1.09 0 (wt=-1) [] least_upper_bound(A,least_upper_bound(B,C)) = least_upper_bound(least_upper_bound(A,B),C).
% 0.68/1.09 0 (wt=-1) [] least_upper_bound(A,A) = A.
% 0.68/1.09 0 (wt=-1) [] greatest_lower_bound(A,A) = A.
% 0.68/1.09 0 (wt=-1) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.68/1.09 0 (wt=-1) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.68/1.09 0 (wt=-1) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.68/1.09 0 (wt=-1) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.68/1.09 0 (wt=-1) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.68/1.09 0 (wt=-1) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.68/1.09 0 (wt=-1) [] inverse(identity) = identity.
% 0.68/1.09 0 (wt=-1) [] inverse(inverse(A)) = A.
% 0.68/1.09 0 (wt=-1) [] inverse(multiply(A,B)) = multiply(inverse(B),inverse(A)).
% 0.68/1.09 0 (wt=-1) [] -(greatest_lower_bound(b,least_upper_bound(a,b)) = b).
% 0.68/1.09 end_of_list.
% 0.68/1.09
% 0.68/1.09 Demodulators:
% 0.68/1.09 end_of_list.
% 0.68/1.09
% 0.68/1.09 Passive:
% 0.68/1.09 end_of_list.
% 0.68/1.09
% 0.68/1.09 Starting to process input.
% 0.68/1.09
% 0.68/1.09 ** KEPT: 1 (wt=5) [] multiply(identity,A) = A.
% 0.68/1.09 1 is a new demodulator.
% 0.68/1.09
% 0.68/1.09 ** KEPT: 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.68/1.09 2 is a new demodulator.
% 0.68/1.09
% 0.68/1.09 ** KEPT: 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.68/1.09 3 is a new demodulator.
% 0.68/1.09
% 0.68/1.09 ** KEPT: 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.68/1.09 clause forward subsumed: 0 (wt=7) [flip(4)] greatest_lower_bound(B,A) = greatest_lower_bound(A,B).
% 0.68/1.09
% 0.68/1.09 ** KEPT: 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.68/1.09 clause forward subsumed: 0 (wt=7) [flip(5)] least_upper_bound(B,A) = least_upper_bound(A,B).
% 0.68/1.09
% 0.68/1.09 ** 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.68/1.09 6 is a new demodulator.
% 0.68/1.09
% 0.68/1.09 ** 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.68/1.09 7 is a new demodulator.
% 0.68/1.09
% 0.68/1.09 ** KEPT: 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.68/1.09 8 is a new demodulator.
% 0.68/1.09
% 0.68/1.09 ** KEPT: 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.68/1.09 9 is a new demodulator.
% 0.68/1.09
% 0.68/1.09 ** KEPT: 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.68/1.09 10 is a new demodulator.
% 0.68/1.09
% 0.68/1.09 ** KEPT: 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.68/1.09 11 is a new demodulator.
% 0.68/1.09
% 0.68/1.09 ** KEPT: 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.68/1.09 12 is a new demodulator.
% 0.68/1.09
% 0.68/1.09 ** KEPT: 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.68/1.09 13 is a new demodulator.
% 0.68/1.09
% 0.68/1.09 ** KEPT: 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.68/1.09 14 is a new demodulator.
% 0.68/1.09
% 0.68/1.09 ** KEPT: 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.68/1.09 15 is a new demodulator.
% 0.68/1.09
% 0.68/1.09 ** KEPT: 16 (wt=4) [] inverse(identity) = identity.
% 0.68/1.09 16 is a new demodulator.
% 0.68/1.09
% 0.68/1.09 ** KEPT: 17 (wt=5) [] inverse(inverse(A)) = A.
% 0.68/1.09 17 is a new demodulator.
% 0.68/1.09
% 0.68/1.09 ** KEPT: 18 (wt=10) [] inverse(multiply(A,B)) = multiply(inverse(B),inverse(A)).
% 0.68/1.09 18 is a new demodulator.
% 0.68/1.09
% 0.68/1.09 ** KEPT: 19 (wt=7) [] -(greatest_lower_bound(b,least_upper_bound(a,b)) = b).
% 0.68/1.09 ---------------- PROOF FOUND ----------------
% 0.68/1.09 % SZS status Unsatisfiable
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 After processing input:
% 0.68/1.09
% 0.68/1.09 Usable:
% 0.68/1.09 end_of_list.
% 0.68/1.09
% 0.68/1.09 Sos:
% 0.68/1.09 16 (wt=4) [] inverse(identity) = identity.
% 0.68/1.09 1 (wt=5) [] multiply(identity,A) = A.
% 0.68/1.09 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.68/1.09 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.68/1.09 17 (wt=5) [] inverse(inverse(A)) = A.
% 0.68/1.09 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.68/1.09 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.68/1.09 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.68/1.09 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.68/1.09 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.68/1.09 19 (wt=7) [] -(greatest_lower_bound(b,least_upper_bound(a,b)) = b).
% 0.68/1.09 18 (wt=10) [] inverse(multiply(A,B)) = multiply(inverse(B),inverse(A)).
% 0.68/1.09 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.68/1.09 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 0.68/1.09 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 0.68/1.09 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.68/1.09 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.68/1.09 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.68/1.09 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.68/1.09 end_of_list.
% 0.68/1.09
% 0.68/1.09 Demodulators:
% 0.68/1.09 1 (wt=5) [] multiply(identity,A) = A.
% 0.68/1.09 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.68/1.09 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.68/1.09 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 0.68/1.09 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 0.68/1.09 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.68/1.09 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.68/1.09 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.68/1.09 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.68/1.09 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.68/1.09 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.68/1.09 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.68/1.09 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.68/1.09 16 (wt=4) [] inverse(identity) = identity.
% 0.68/1.09 17 (wt=5) [] inverse(inverse(A)) = A.
% 0.68/1.09 18 (wt=10) [] inverse(multiply(A,B)) = multiply(inverse(B),inverse(A)).
% 0.68/1.09 end_of_list.
% 0.68/1.09
% 0.68/1.09 Passive:
% 0.68/1.09 end_of_list.
% 0.68/1.09
% 0.68/1.09 UNIT CONFLICT from 28 and 19 at 0.00 seconds.
% 0.68/1.09
% 0.68/1.09 ---------------- PROOF ----------------
% 0.68/1.09 % SZS output start Refutation
% See solution above
% 0.68/1.09 ------------ end of proof -------------
% 0.68/1.09
% 0.68/1.09
% 0.68/1.09 ------------- memory usage ------------
% 0.68/1.09 Memory dynamically allocated (tp_alloc): 488.
% 0.68/1.09 type (bytes each) gets frees in use avail bytes
% 0.68/1.09 sym_ent ( 96) 58 0 58 0 5.4 K
% 0.68/1.09 term ( 16) 1793 1554 239 16 4.9 K
% 0.68/1.09 gen_ptr ( 8) 930 280 650 4 5.1 K
% 0.68/1.09 context ( 808) 874 872 2 3 3.9 K
% 0.68/1.09 trail ( 12) 60 60 0 3 0.0 K
% 0.68/1.09 bt_node ( 68) 343 340 3 2 0.3 K
% 0.68/1.09 ac_position (285432) 0 0 0 0 0.0 K
% 0.68/1.09 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.68/1.09 ac_match_free_vars_pos (4020)
% 0.68/1.09 0 0 0 0 0.0 K
% 0.68/1.09 discrim ( 12) 228 0 228 0 2.7 K
% 0.68/1.09 flat ( 40) 793 793 0 11 0.4 K
% 0.68/1.09 discrim_pos ( 12) 29 29 0 1 0.0 K
% 0.68/1.09 fpa_head ( 12) 187 0 187 0 2.2 K
% 0.68/1.09 fpa_tree ( 28) 33 33 0 9 0.2 K
% 0.68/1.09 fpa_pos ( 36) 49 49 0 1 0.0 K
% 0.68/1.09 literal ( 12) 90 62 28 1 0.3 K
% 0.68/1.09 clause ( 24) 90 62 28 1 0.7 K
% 0.68/1.09 list ( 12) 80 24 56 3 0.7 K
% 0.68/1.09 list_pos ( 20) 121 19 102 0 2.0 K
% 0.68/1.09 pair_index ( 40) 2 0 2 0 0.1 K
% 0.68/1.09
% 0.68/1.09 -------------- statistics -------------
% 0.68/1.09 Clauses input 19
% 0.68/1.09 Usable input 0
% 0.68/1.09 Sos input 19
% 0.68/1.09 Demodulators input 0
% 0.68/1.09 Passive input 0
% 0.68/1.09
% 0.68/1.09 Processed BS (before search) 21
% 0.68/1.09 Forward subsumed BS 2
% 0.68/1.09 Kept BS 19
% 0.68/1.09 New demodulators BS 16
% 0.68/1.09 Back demodulated BS 0
% 0.68/1.09
% 0.68/1.09 Clauses or pairs given 109
% 0.68/1.09 Clauses generated 38
% 0.68/1.09 Forward subsumed 29
% 0.68/1.09 Deleted by weight 0
% 0.68/1.09 Deleted by variable count 0
% 0.68/1.09 Kept 9
% 0.68/1.09 New demodulators 5
% 0.68/1.09 Back demodulated 0
% 0.68/1.09 Ordered paramod prunes 0
% 0.68/1.09 Basic paramod prunes 34
% 0.68/1.09 Prime paramod prunes 1
% 0.68/1.09 Semantic prunes 0
% 0.68/1.09
% 0.68/1.09 Rewrite attmepts 255
% 0.68/1.09 Rewrites 24
% 0.68/1.09
% 0.68/1.09 FPA overloads 0
% 0.68/1.09 FPA underloads 0
% 0.68/1.09
% 0.68/1.09 Usable size 0
% 0.68/1.09 Sos size 27
% 0.68/1.09 Demodulators size 21
% 0.68/1.09 Passive size 0
% 0.68/1.09 Disabled size 0
% 0.68/1.09
% 0.68/1.09 Proofs found 1
% 0.68/1.09
% 0.68/1.09 ----------- times (seconds) ----------- Tue Jun 14 06:20:40 2022
% 0.68/1.09
% 0.68/1.09 user CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.68/1.09 system CPU time 0.00 (0 hr, 0 min, 0 sec)
% 0.68/1.09 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.68/1.09 input time 0.00
% 0.68/1.09 paramodulation time 0.00
% 0.68/1.09 demodulation time 0.00
% 0.68/1.09 orient time 0.00
% 0.68/1.09 weigh time 0.00
% 0.68/1.09 forward subsume time 0.00
% 0.68/1.09 back demod find time 0.00
% 0.68/1.09 conflict time 0.00
% 0.68/1.09 LRPO time 0.00
% 0.68/1.09 store clause time 0.00
% 0.68/1.09 disable clause time 0.00
% 0.68/1.09 prime paramod time 0.00
% 0.68/1.09 semantics time 0.00
% 0.68/1.09
% 0.68/1.09 EQP interrupted
%------------------------------------------------------------------------------