TSTP Solution File: GRP172-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP172-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n011.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:41 EDT 2022
% Result : Unsatisfiable 0.86s 1.26s
% Output : Refutation 0.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 5
% Syntax : Number of clauses : 10 ( 10 unt; 0 nHn; 5 RR)
% Number of literals : 10 ( 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 : 9 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(multiply(identity,A),A),
file('GRP172-1.p',unknown),
[] ).
cnf(6,plain,
equal(greatest_lower_bound(greatest_lower_bound(A,B),C),greatest_lower_bound(A,greatest_lower_bound(B,C))),
inference(flip,[status(thm),theory(equality)],[1]),
[iquote('flip(1)')] ).
cnf(15,plain,
equal(multiply(greatest_lower_bound(A,B),C),greatest_lower_bound(multiply(A,C),multiply(B,C))),
file('GRP172-1.p',unknown),
[] ).
cnf(16,plain,
equal(greatest_lower_bound(identity,a),identity),
file('GRP172-1.p',unknown),
[] ).
cnf(17,plain,
equal(greatest_lower_bound(identity,b),identity),
file('GRP172-1.p',unknown),
[] ).
cnf(18,plain,
~ equal(greatest_lower_bound(identity,multiply(a,b)),identity),
file('GRP172-1.p',unknown),
[] ).
cnf(60,plain,
equal(greatest_lower_bound(A,multiply(a,A)),A),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[16,15]),1,1]),1]),
[iquote('para(16,15),demod([1,1]),flip(1)')] ).
cnf(61,plain,
equal(greatest_lower_bound(identity,greatest_lower_bound(b,A)),greatest_lower_bound(identity,A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[17,6]),1]),
[iquote('para(17,6),flip(1)')] ).
cnf(387,plain,
equal(greatest_lower_bound(identity,multiply(a,b)),identity),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[60,61]),17]),1]),
[iquote('para(60,61),demod([17]),flip(1)')] ).
cnf(388,plain,
$false,
inference(conflict,[status(thm)],[387,18]),
[iquote('conflict(387,18)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : GRP172-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.12/0.13 % Command : tptp2X_and_run_eqp %s
% 0.12/0.33 % Computer : n011.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 13:39:49 EDT 2022
% 0.12/0.34 % CPUTime :
% 0.86/1.26 ----- EQP 0.9e, May 2009 -----
% 0.86/1.26 The job began on n011.cluster.edu, Tue Jun 14 13:39:50 2022
% 0.86/1.26 The command was "./eqp09e".
% 0.86/1.26
% 0.86/1.26 set(prolog_style_variables).
% 0.86/1.26 set(lrpo).
% 0.86/1.26 set(basic_paramod).
% 0.86/1.26 set(functional_subsume).
% 0.86/1.26 set(ordered_paramod).
% 0.86/1.26 set(prime_paramod).
% 0.86/1.26 set(para_pairs).
% 0.86/1.26 assign(pick_given_ratio,4).
% 0.86/1.26 clear(print_kept).
% 0.86/1.26 clear(print_new_demod).
% 0.86/1.26 clear(print_back_demod).
% 0.86/1.26 clear(print_given).
% 0.86/1.26 assign(max_mem,64000).
% 0.86/1.26 end_of_commands.
% 0.86/1.26
% 0.86/1.26 Usable:
% 0.86/1.26 end_of_list.
% 0.86/1.26
% 0.86/1.26 Sos:
% 0.86/1.26 0 (wt=-1) [] multiply(identity,A) = A.
% 0.86/1.26 0 (wt=-1) [] multiply(inverse(A),A) = identity.
% 0.86/1.26 0 (wt=-1) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.86/1.26 0 (wt=-1) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.86/1.26 0 (wt=-1) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.86/1.26 0 (wt=-1) [] greatest_lower_bound(A,greatest_lower_bound(B,C)) = greatest_lower_bound(greatest_lower_bound(A,B),C).
% 0.86/1.26 0 (wt=-1) [] least_upper_bound(A,least_upper_bound(B,C)) = least_upper_bound(least_upper_bound(A,B),C).
% 0.86/1.26 0 (wt=-1) [] least_upper_bound(A,A) = A.
% 0.86/1.26 0 (wt=-1) [] greatest_lower_bound(A,A) = A.
% 0.86/1.26 0 (wt=-1) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.86/1.26 0 (wt=-1) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.86/1.26 0 (wt=-1) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.86/1.26 0 (wt=-1) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.86/1.26 0 (wt=-1) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.86/1.26 0 (wt=-1) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.86/1.26 0 (wt=-1) [] greatest_lower_bound(identity,a) = identity.
% 0.86/1.26 0 (wt=-1) [] greatest_lower_bound(identity,b) = identity.
% 0.86/1.26 0 (wt=-1) [] -(greatest_lower_bound(identity,multiply(a,b)) = identity).
% 0.86/1.26 end_of_list.
% 0.86/1.26
% 0.86/1.26 Demodulators:
% 0.86/1.26 end_of_list.
% 0.86/1.26
% 0.86/1.26 Passive:
% 0.86/1.26 end_of_list.
% 0.86/1.26
% 0.86/1.26 Starting to process input.
% 0.86/1.26
% 0.86/1.26 ** KEPT: 1 (wt=5) [] multiply(identity,A) = A.
% 0.86/1.26 1 is a new demodulator.
% 0.86/1.26
% 0.86/1.26 ** KEPT: 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.86/1.26 2 is a new demodulator.
% 0.86/1.26
% 0.86/1.26 ** KEPT: 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.86/1.26 3 is a new demodulator.
% 0.86/1.26
% 0.86/1.26 ** KEPT: 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.86/1.26 clause forward subsumed: 0 (wt=7) [flip(4)] greatest_lower_bound(B,A) = greatest_lower_bound(A,B).
% 0.86/1.26
% 0.86/1.26 ** KEPT: 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.86/1.26 clause forward subsumed: 0 (wt=7) [flip(5)] least_upper_bound(B,A) = least_upper_bound(A,B).
% 0.86/1.26
% 0.86/1.26 ** 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.86/1.26 6 is a new demodulator.
% 0.86/1.26
% 0.86/1.26 ** 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.86/1.26 7 is a new demodulator.
% 0.86/1.26
% 0.86/1.26 ** KEPT: 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.86/1.26 8 is a new demodulator.
% 0.86/1.26
% 0.86/1.26 ** KEPT: 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.86/1.26 9 is a new demodulator.
% 0.86/1.26
% 0.86/1.26 ** KEPT: 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.86/1.26 10 is a new demodulator.
% 0.86/1.26
% 0.86/1.26 ** KEPT: 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.86/1.26 11 is a new demodulator.
% 0.86/1.26
% 0.86/1.26 ** KEPT: 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.86/1.26 12 is a new demodulator.
% 0.86/1.26
% 0.86/1.26 ** KEPT: 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.86/1.26 13 is a new demodulator.
% 0.86/1.26
% 0.86/1.26 ** KEPT: 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.86/1.26 14 is a new demodulator.
% 0.86/1.26
% 0.86/1.26 ** KEPT: 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.86/1.26 15 is a new demodulator.
% 0.86/1.26
% 0.86/1.26 ** KEPT: 16 (wt=5) [] greatest_lower_bound(identity,a) = identity.
% 0.86/1.26 16 is a new demodulator.
% 0.86/1.26
% 0.86/1.26 ** KEPT: 17 (wt=5) [] greatest_lower_bound(identity,b) = identity.
% 0.86/1.26 17 is a new demodulator.
% 0.86/1.26
% 0.86/1.26 ** KEPT: 18 (wt=7) [] -(greatest_lower_bound(identity,multiply(a,b)) = identity).
% 0.86/1.26 ---------------- PROOF FOUND ----------------
% 0.86/1.26 % SZS status Unsatisfiable
% 0.86/1.26
% 0.86/1.26
% 0.86/1.26 After processing input:
% 0.86/1.26
% 0.86/1.26 Usable:
% 0.86/1.26 end_of_list.
% 0.86/1.26
% 0.86/1.26 Sos:
% 0.86/1.26 1 (wt=5) [] multiply(identity,A) = A.
% 0.86/1.26 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.86/1.26 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.86/1.26 16 (wt=5) [] greatest_lower_bound(identity,a) = identity.
% 0.86/1.26 17 (wt=5) [] greatest_lower_bound(identity,b) = identity.
% 0.86/1.26 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.86/1.26 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.86/1.26 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.86/1.26 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.86/1.26 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.86/1.26 18 (wt=7) [] -(greatest_lower_bound(identity,multiply(a,b)) = identity).
% 0.86/1.26 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.86/1.26 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 0.86/1.26 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 0.86/1.26 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.86/1.26 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.86/1.26 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.86/1.26 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.86/1.26 end_of_list.
% 0.86/1.26
% 0.86/1.26 Demodulators:
% 0.86/1.26 1 (wt=5) [] multiply(identity,A) = A.
% 0.86/1.26 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.86/1.26 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.86/1.26 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 0.86/1.26 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 0.86/1.26 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.86/1.26 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.86/1.26 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.86/1.26 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.86/1.26 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.86/1.26 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.86/1.26 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.86/1.26 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.86/1.26 16 (wt=5) [] greatest_lower_bound(identity,a) = identity.
% 0.86/1.26 17 (wt=5) [] greatest_lower_bound(identity,b) = identity.
% 0.86/1.26 end_of_list.
% 0.86/1.26
% 0.86/1.26 Passive:
% 0.86/1.26 end_of_list.
% 0.86/1.26
% 0.86/1.26 UNIT CONFLICT from 387 and 18 at 0.02 seconds.
% 0.86/1.26
% 0.86/1.26 ---------------- PROOF ----------------
% 0.86/1.26 % SZS output start Refutation
% See solution above
% 0.86/1.26 ------------ end of proof -------------
% 0.86/1.26
% 0.86/1.26
% 0.86/1.26 ------------- memory usage ------------
% 0.86/1.26 Memory dynamically allocated (tp_alloc): 976.
% 0.86/1.26 type (bytes each) gets frees in use avail bytes
% 0.86/1.26 sym_ent ( 96) 58 0 58 0 5.4 K
% 0.86/1.26 term ( 16) 33861 27820 6041 16 116.8 K
% 0.86/1.26 gen_ptr ( 8) 29953 6718 23235 9 181.6 K
% 0.86/1.26 context ( 808) 41691 41689 2 4 4.7 K
% 0.86/1.26 trail ( 12) 1560 1560 0 5 0.1 K
% 0.86/1.26 bt_node ( 68) 20850 20847 3 12 1.0 K
% 0.86/1.26 ac_position (285432) 0 0 0 0 0.0 K
% 0.86/1.26 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.86/1.26 ac_match_free_vars_pos (4020)
% 0.86/1.26 0 0 0 0 0.0 K
% 0.86/1.26 discrim ( 12) 5248 195 5053 0 59.2 K
% 0.86/1.26 flat ( 40) 55243 55243 0 35 1.4 K
% 0.86/1.26 discrim_pos ( 12) 1878 1878 0 1 0.0 K
% 0.86/1.26 fpa_head ( 12) 1725 0 1725 0 20.2 K
% 0.86/1.26 fpa_tree ( 28) 1054 1054 0 11 0.3 K
% 0.86/1.26 fpa_pos ( 36) 700 700 0 1 0.0 K
% 0.86/1.26 literal ( 12) 2034 1647 387 1 4.5 K
% 0.86/1.26 clause ( 24) 2034 1647 387 1 9.1 K
% 0.86/1.26 list ( 12) 372 316 56 3 0.7 K
% 0.86/1.26 list_pos ( 20) 1553 158 1395 0 27.2 K
% 0.86/1.26 pair_index ( 40) 2 0 2 0 0.1 K
% 0.86/1.26
% 0.86/1.26 -------------- statistics -------------
% 0.86/1.26 Clauses input 18
% 0.86/1.26 Usable input 0
% 0.86/1.26 Sos input 18
% 0.86/1.26 Demodulators input 0
% 0.86/1.26 Passive input 0
% 0.86/1.26
% 0.86/1.26 Processed BS (before search) 20
% 0.86/1.26 Forward subsumed BS 2
% 0.86/1.26 Kept BS 18
% 0.86/1.26 New demodulators BS 15
% 0.86/1.26 Back demodulated BS 0
% 0.86/1.26
% 0.86/1.26 Clauses or pairs given 5479
% 0.86/1.26 Clauses generated 1384
% 0.86/1.26 Forward subsumed 1015
% 0.86/1.26 Deleted by weight 0
% 0.86/1.26 Deleted by variable count 0
% 0.86/1.26 Kept 369
% 0.86/1.26 New demodulators 298
% 0.86/1.26 Back demodulated 32
% 0.86/1.26 Ordered paramod prunes 0
% 0.86/1.26 Basic paramod prunes 17251
% 0.86/1.26 Prime paramod prunes 44
% 0.86/1.26 Semantic prunes 0
% 0.86/1.26
% 0.86/1.26 Rewrite attmepts 12482
% 0.86/1.26 Rewrites 1670
% 0.86/1.26
% 0.86/1.26 FPA overloads 0
% 0.86/1.26 FPA underloads 0
% 0.86/1.26
% 0.86/1.26 Usable size 0
% 0.86/1.26 Sos size 354
% 0.86/1.26 Demodulators size 301
% 0.86/1.26 Passive size 0
% 0.86/1.26 Disabled size 32
% 0.86/1.26
% 0.86/1.26 Proofs found 1
% 0.86/1.26
% 0.86/1.26 ----------- times (seconds) ----------- Tue Jun 14 13:39:50 2022
% 0.86/1.26
% 0.86/1.26 user CPU time 0.02 (0 hr, 0 min, 0 sec)
% 0.86/1.26 system CPU time 0.07 (0 hr, 0 min, 0 sec)
% 0.86/1.26 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.86/1.26 input time 0.00
% 0.86/1.26 paramodulation time 0.01
% 0.86/1.26 demodulation time 0.00
% 0.86/1.26 orient time 0.00
% 0.86/1.26 weigh time 0.00
% 0.86/1.26 forward subsume time 0.00
% 0.86/1.26 back demod find time 0.00
% 0.86/1.26 conflict time 0.00
% 0.86/1.26 LRPO time 0.00
% 0.86/1.26 store clause time 0.00
% 0.86/1.26 disable clause time 0.00
% 0.86/1.26 prime paramod time 0.00
% 0.86/1.26 semantics time 0.00
% 0.86/1.26
% 0.86/1.26 EQP interrupted
%------------------------------------------------------------------------------