TSTP Solution File: GRP171-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP171-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n009.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 0.74s 1.18s
% Output : Refutation 0.74s
% 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('GRP171-1.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(14,plain,
equal(multiply(least_upper_bound(A,B),C),least_upper_bound(multiply(A,C),multiply(B,C))),
file('GRP171-1.p',unknown),
[] ).
cnf(16,plain,
equal(least_upper_bound(identity,a),a),
file('GRP171-1.p',unknown),
[] ).
cnf(17,plain,
equal(least_upper_bound(identity,b),b),
file('GRP171-1.p',unknown),
[] ).
cnf(18,plain,
~ equal(least_upper_bound(identity,multiply(a,b)),multiply(a,b)),
file('GRP171-1.p',unknown),
[] ).
cnf(60,plain,
equal(least_upper_bound(A,multiply(a,A)),multiply(a,A)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[16,14]),1]),1]),
[iquote('para(16,14),demod([1]),flip(1)')] ).
cnf(62,plain,
equal(least_upper_bound(identity,least_upper_bound(b,A)),least_upper_bound(b,A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[17,7]),1]),
[iquote('para(17,7),flip(1)')] ).
cnf(394,plain,
equal(least_upper_bound(identity,multiply(a,b)),multiply(a,b)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[60,62]),60]),
[iquote('para(60,62),demod([60])')] ).
cnf(395,plain,
$false,
inference(conflict,[status(thm)],[394,18]),
[iquote('conflict(394,18)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12 % Problem : GRP171-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.08/0.13 % Command : tptp2X_and_run_eqp %s
% 0.13/0.34 % Computer : n009.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 600
% 0.13/0.34 % DateTime : Mon Jun 13 22:27:23 EDT 2022
% 0.13/0.35 % CPUTime :
% 0.74/1.18 ----- EQP 0.9e, May 2009 -----
% 0.74/1.18 The job began on n009.cluster.edu, Mon Jun 13 22:27:23 2022
% 0.74/1.18 The command was "./eqp09e".
% 0.74/1.18
% 0.74/1.18 set(prolog_style_variables).
% 0.74/1.18 set(lrpo).
% 0.74/1.18 set(basic_paramod).
% 0.74/1.18 set(functional_subsume).
% 0.74/1.18 set(ordered_paramod).
% 0.74/1.18 set(prime_paramod).
% 0.74/1.18 set(para_pairs).
% 0.74/1.18 assign(pick_given_ratio,4).
% 0.74/1.18 clear(print_kept).
% 0.74/1.18 clear(print_new_demod).
% 0.74/1.18 clear(print_back_demod).
% 0.74/1.18 clear(print_given).
% 0.74/1.18 assign(max_mem,64000).
% 0.74/1.18 end_of_commands.
% 0.74/1.18
% 0.74/1.18 Usable:
% 0.74/1.18 end_of_list.
% 0.74/1.18
% 0.74/1.18 Sos:
% 0.74/1.18 0 (wt=-1) [] multiply(identity,A) = A.
% 0.74/1.18 0 (wt=-1) [] multiply(inverse(A),A) = identity.
% 0.74/1.18 0 (wt=-1) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.74/1.18 0 (wt=-1) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.74/1.18 0 (wt=-1) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.74/1.18 0 (wt=-1) [] greatest_lower_bound(A,greatest_lower_bound(B,C)) = greatest_lower_bound(greatest_lower_bound(A,B),C).
% 0.74/1.18 0 (wt=-1) [] least_upper_bound(A,least_upper_bound(B,C)) = least_upper_bound(least_upper_bound(A,B),C).
% 0.74/1.18 0 (wt=-1) [] least_upper_bound(A,A) = A.
% 0.74/1.18 0 (wt=-1) [] greatest_lower_bound(A,A) = A.
% 0.74/1.18 0 (wt=-1) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.74/1.18 0 (wt=-1) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.74/1.18 0 (wt=-1) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.74/1.18 0 (wt=-1) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.74/1.18 0 (wt=-1) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.74/1.18 0 (wt=-1) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.74/1.18 0 (wt=-1) [] least_upper_bound(identity,a) = a.
% 0.74/1.18 0 (wt=-1) [] least_upper_bound(identity,b) = b.
% 0.74/1.18 0 (wt=-1) [] -(least_upper_bound(identity,multiply(a,b)) = multiply(a,b)).
% 0.74/1.18 end_of_list.
% 0.74/1.18
% 0.74/1.18 Demodulators:
% 0.74/1.18 end_of_list.
% 0.74/1.18
% 0.74/1.18 Passive:
% 0.74/1.18 end_of_list.
% 0.74/1.18
% 0.74/1.18 Starting to process input.
% 0.74/1.18
% 0.74/1.18 ** KEPT: 1 (wt=5) [] multiply(identity,A) = A.
% 0.74/1.18 1 is a new demodulator.
% 0.74/1.18
% 0.74/1.18 ** KEPT: 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.74/1.18 2 is a new demodulator.
% 0.74/1.18
% 0.74/1.18 ** KEPT: 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.74/1.18 3 is a new demodulator.
% 0.74/1.18
% 0.74/1.18 ** KEPT: 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.74/1.18 clause forward subsumed: 0 (wt=7) [flip(4)] greatest_lower_bound(B,A) = greatest_lower_bound(A,B).
% 0.74/1.18
% 0.74/1.18 ** KEPT: 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.74/1.18 clause forward subsumed: 0 (wt=7) [flip(5)] least_upper_bound(B,A) = least_upper_bound(A,B).
% 0.74/1.18
% 0.74/1.18 ** 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.74/1.18 6 is a new demodulator.
% 0.74/1.18
% 0.74/1.18 ** 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.74/1.18 7 is a new demodulator.
% 0.74/1.18
% 0.74/1.18 ** KEPT: 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.74/1.18 8 is a new demodulator.
% 0.74/1.18
% 0.74/1.18 ** KEPT: 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.74/1.18 9 is a new demodulator.
% 0.74/1.18
% 0.74/1.18 ** KEPT: 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.74/1.18 10 is a new demodulator.
% 0.74/1.18
% 0.74/1.18 ** KEPT: 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.74/1.18 11 is a new demodulator.
% 0.74/1.18
% 0.74/1.18 ** KEPT: 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.74/1.18 12 is a new demodulator.
% 0.74/1.18
% 0.74/1.18 ** KEPT: 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.74/1.18 13 is a new demodulator.
% 0.74/1.18
% 0.74/1.18 ** KEPT: 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.74/1.18 14 is a new demodulator.
% 0.74/1.18
% 0.74/1.18 ** KEPT: 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.74/1.18 15 is a new demodulator.
% 0.74/1.18
% 0.74/1.18 ** KEPT: 16 (wt=5) [] least_upper_bound(identity,a) = a.
% 0.74/1.18 16 is a new demodulator.
% 0.74/1.18
% 0.74/1.18 ** KEPT: 17 (wt=5) [] least_upper_bound(identity,b) = b.
% 0.74/1.18 17 is a new demodulator.
% 0.74/1.18
% 0.74/1.18 ** KEPT: 18 (wt=9) [] -(least_upper_bound(identity,multiply(a,b)) = multiply(a,b)).
% 0.74/1.18 ---------------- PROOF FOUND ----------------
% 0.74/1.18 % SZS status Unsatisfiable
% 0.74/1.18
% 0.74/1.18
% 0.74/1.18 After processing input:
% 0.74/1.18
% 0.74/1.18 Usable:
% 0.74/1.18 end_of_list.
% 0.74/1.18
% 0.74/1.18 Sos:
% 0.74/1.18 1 (wt=5) [] multiply(identity,A) = A.
% 0.74/1.18 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.74/1.18 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.74/1.18 16 (wt=5) [] least_upper_bound(identity,a) = a.
% 0.74/1.18 17 (wt=5) [] least_upper_bound(identity,b) = b.
% 0.74/1.18 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.74/1.18 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 0.74/1.18 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 0.74/1.18 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.74/1.18 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.74/1.18 18 (wt=9) [] -(least_upper_bound(identity,multiply(a,b)) = multiply(a,b)).
% 0.74/1.18 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.74/1.18 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 0.74/1.18 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 0.74/1.18 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.74/1.18 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.74/1.18 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.74/1.18 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.74/1.18 end_of_list.
% 0.74/1.18
% 0.74/1.18 Demodulators:
% 0.74/1.18 1 (wt=5) [] multiply(identity,A) = A.
% 0.74/1.18 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 0.74/1.18 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 0.74/1.18 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 0.74/1.18 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 0.74/1.18 8 (wt=5) [] least_upper_bound(A,A) = A.
% 0.74/1.18 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 0.74/1.18 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 0.74/1.18 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 0.74/1.18 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 0.74/1.18 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 0.74/1.18 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 0.74/1.18 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 0.74/1.18 16 (wt=5) [] least_upper_bound(identity,a) = a.
% 0.74/1.18 17 (wt=5) [] least_upper_bound(identity,b) = b.
% 0.74/1.18 end_of_list.
% 0.74/1.18
% 0.74/1.18 Passive:
% 0.74/1.18 end_of_list.
% 0.74/1.18
% 0.74/1.18 UNIT CONFLICT from 394 and 18 at 0.03 seconds.
% 0.74/1.18
% 0.74/1.18 ---------------- PROOF ----------------
% 0.74/1.18 % SZS output start Refutation
% See solution above
% 0.74/1.18 ------------ end of proof -------------
% 0.74/1.18
% 0.74/1.18
% 0.74/1.18 ------------- memory usage ------------
% 0.74/1.18 Memory dynamically allocated (tp_alloc): 976.
% 0.74/1.18 type (bytes each) gets frees in use avail bytes
% 0.74/1.18 sym_ent ( 96) 58 0 58 0 5.4 K
% 0.74/1.18 term ( 16) 34956 28837 6119 16 118.3 K
% 0.74/1.18 gen_ptr ( 8) 30491 7032 23459 9 183.3 K
% 0.74/1.18 context ( 808) 41973 41971 2 4 4.7 K
% 0.74/1.18 trail ( 12) 1560 1560 0 5 0.1 K
% 0.74/1.18 bt_node ( 68) 20850 20847 3 12 1.0 K
% 0.74/1.18 ac_position (285432) 0 0 0 0 0.0 K
% 0.74/1.18 ac_match_pos (14044) 0 0 0 0 0.0 K
% 0.74/1.18 ac_match_free_vars_pos (4020)
% 0.74/1.18 0 0 0 0 0.0 K
% 0.74/1.18 discrim ( 12) 5259 212 5047 0 59.1 K
% 0.74/1.18 flat ( 40) 56781 56781 0 35 1.4 K
% 0.74/1.18 discrim_pos ( 12) 1959 1959 0 1 0.0 K
% 0.74/1.18 fpa_head ( 12) 1725 0 1725 0 20.2 K
% 0.74/1.18 fpa_tree ( 28) 1049 1049 0 11 0.3 K
% 0.74/1.18 fpa_pos ( 36) 710 710 0 1 0.0 K
% 0.74/1.18 literal ( 12) 2093 1699 394 1 4.6 K
% 0.74/1.18 clause ( 24) 2093 1699 394 1 9.3 K
% 0.74/1.18 list ( 12) 375 319 56 3 0.7 K
% 0.74/1.18 list_pos ( 20) 1579 163 1416 0 27.7 K
% 0.74/1.18 pair_index ( 40) 2 0 2 0 0.1 K
% 0.74/1.18
% 0.74/1.18 -------------- statistics -------------
% 0.74/1.18 Clauses input 18
% 0.74/1.18 Usable input 0
% 0.74/1.18 Sos input 18
% 0.74/1.18 Demodulators input 0
% 0.74/1.18 Passive input 0
% 0.74/1.18
% 0.74/1.18 Processed BS (before search) 20
% 0.74/1.18 Forward subsumed BS 2
% 0.74/1.18 Kept BS 18
% 0.74/1.18 New demodulators BS 15
% 0.74/1.18 Back demodulated BS 0
% 0.74/1.18
% 0.74/1.18 Clauses or pairs given 5565
% 0.74/1.18 Clauses generated 1437
% 0.74/1.18 Forward subsumed 1061
% 0.74/1.18 Deleted by weight 0
% 0.74/1.18 Deleted by variable count 0
% 0.74/1.18 Kept 376
% 0.74/1.18 New demodulators 301
% 0.74/1.18 Back demodulated 33
% 0.74/1.18 Ordered paramod prunes 0
% 0.74/1.18 Basic paramod prunes 17893
% 0.74/1.18 Prime paramod prunes 46
% 0.74/1.18 Semantic prunes 0
% 0.74/1.18
% 0.74/1.18 Rewrite attmepts 12987
% 0.74/1.18 Rewrites 1735
% 0.74/1.18
% 0.74/1.18 FPA overloads 0
% 0.74/1.18 FPA underloads 0
% 0.74/1.18
% 0.74/1.18 Usable size 0
% 0.74/1.18 Sos size 360
% 0.74/1.18 Demodulators size 303
% 0.74/1.18 Passive size 0
% 0.74/1.18 Disabled size 33
% 0.74/1.18
% 0.74/1.18 Proofs found 1
% 0.74/1.18
% 0.74/1.18 ----------- times (seconds) ----------- Mon Jun 13 22:27:23 2022
% 0.74/1.18
% 0.74/1.18 user CPU time 0.03 (0 hr, 0 min, 0 sec)
% 0.74/1.18 system CPU time 0.07 (0 hr, 0 min, 0 sec)
% 0.74/1.18 wall-clock time 0 (0 hr, 0 min, 0 sec)
% 0.74/1.18 input time 0.00
% 0.74/1.18 paramodulation time 0.01
% 0.74/1.18 demodulation time 0.00
% 0.74/1.18 orient time 0.00
% 0.74/1.18 weigh time 0.00
% 0.74/1.18 forward subsume time 0.00
% 0.74/1.18 back demod find time 0.00
% 0.74/1.18 conflict time 0.00
% 0.74/1.18 LRPO time 0.00
% 0.74/1.18 store clause time 0.01
% 0.74/1.18 disable clause time 0.00
% 0.74/1.18 prime paramod time 0.00
% 0.74/1.18 semantics time 0.00
% 0.74/1.18
% 0.74/1.18 EQP interrupted
%------------------------------------------------------------------------------