%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP175-1 : 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:42 EDT 2022
% Result : Unsatisfiable 3.91s 4.30s
% Output : Refutation 3.91s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 7
% Syntax : Number of clauses : 15 ( 15 unt; 0 nHn; 3 RR)
% Number of literals : 15 ( 0 equ; 1 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 4 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-2 aty)
% Number of functors : 6 ( 6 usr; 3 con; 0-2 aty)
% Number of variables : 21 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(multiply(identity,A),A),
file('GRP175-1.p',unknown),
[] ).
cnf(2,plain,
equal(multiply(inverse(A),A),identity),
file('GRP175-1.p',unknown),
[] ).
cnf(3,plain,
equal(multiply(multiply(A,B),C),multiply(A,multiply(B,C))),
file('GRP175-1.p',unknown),
[] ).
cnf(12,plain,
equal(multiply(A,least_upper_bound(B,C)),least_upper_bound(multiply(A,B),multiply(A,C))),
file('GRP175-1.p',unknown),
[] ).
cnf(14,plain,
equal(multiply(least_upper_bound(A,B),C),least_upper_bound(multiply(A,C),multiply(B,C))),
file('GRP175-1.p',unknown),
[] ).
cnf(16,plain,
equal(least_upper_bound(identity,b),b),
file('GRP175-1.p',unknown),
[] ).
cnf(17,plain,
~ equal(least_upper_bound(identity,multiply(inverse(a),multiply(b,a))),multiply(inverse(a),multiply(b,a))),
file('GRP175-1.p',unknown),
[] ).
cnf(18,plain,
equal(multiply(inverse(A),multiply(A,B)),B),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[2,3]),1]),1]),
[iquote('para(2,3),demod([1]),flip(1)')] ).
cnf(48,plain,
equal(multiply(inverse(inverse(A)),identity),A),
inference(para,[status(thm),theory(equality)],[2,18]),
[iquote('para(2,18)')] ).
cnf(54,plain,
equal(multiply(inverse(inverse(A)),B),multiply(A,B)),
inference(para,[status(thm),theory(equality)],[18,18]),
[iquote('para(18,18)')] ).
cnf(55,plain,
equal(multiply(A,identity),A),
inference(demod,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[48]),54]),
[iquote('back_demod(48),demod([54])')] ).
cnf(60,plain,
equal(least_upper_bound(A,multiply(A,b)),multiply(A,b)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[16,12]),55]),1]),
[iquote('para(16,12),demod([55]),flip(1)')] ).
cnf(379,plain,
equal(least_upper_bound(multiply(A,B),multiply(A,multiply(b,B))),multiply(A,multiply(b,B))),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[60,14]),3,3]),1]),
[iquote('para(60,14),demod([3,3]),flip(1)')] ).
cnf(12450,plain,
equal(least_upper_bound(identity,multiply(inverse(A),multiply(b,A))),multiply(inverse(A),multiply(b,A))),
inference(para,[status(thm),theory(equality)],[2,379]),
[iquote('para(2,379)')] ).
cnf(12451,plain,
$false,
inference(conflict,[status(thm)],[12450,17]),
[iquote('conflict(12450,17)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11 % Problem : GRP175-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.00/0.12 % Command : tptp2X_and_run_eqp %s
% 0.11/0.31 % Computer : n016.cluster.edu
% 0.11/0.31 % Model : x86_64 x86_64
% 0.11/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31 % Memory : 8042.1875MB
% 0.11/0.31 % OS : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31 % CPULimit : 300
% 0.11/0.31 % WCLimit : 600
% 0.11/0.31 % DateTime : Mon Jun 13 11:59:29 EDT 2022
% 0.16/0.31 % CPUTime :
% 3.91/4.30 ----- EQP 0.9e, May 2009 -----
% 3.91/4.30 The job began on n016.cluster.edu, Mon Jun 13 11:59:30 2022
% 3.91/4.30 The command was "./eqp09e".
% 3.91/4.30
% 3.91/4.30 set(prolog_style_variables).
% 3.91/4.30 set(lrpo).
% 3.91/4.30 set(basic_paramod).
% 3.91/4.30 set(functional_subsume).
% 3.91/4.30 set(ordered_paramod).
% 3.91/4.30 set(prime_paramod).
% 3.91/4.30 set(para_pairs).
% 3.91/4.30 assign(pick_given_ratio,4).
% 3.91/4.30 clear(print_kept).
% 3.91/4.30 clear(print_new_demod).
% 3.91/4.30 clear(print_back_demod).
% 3.91/4.30 clear(print_given).
% 3.91/4.30 assign(max_mem,64000).
% 3.91/4.30 end_of_commands.
% 3.91/4.30
% 3.91/4.30 Usable:
% 3.91/4.30 end_of_list.
% 3.91/4.30
% 3.91/4.30 Sos:
% 3.91/4.30 0 (wt=-1) [] multiply(identity,A) = A.
% 3.91/4.30 0 (wt=-1) [] multiply(inverse(A),A) = identity.
% 3.91/4.30 0 (wt=-1) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 3.91/4.30 0 (wt=-1) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 3.91/4.30 0 (wt=-1) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 3.91/4.30 0 (wt=-1) [] greatest_lower_bound(A,greatest_lower_bound(B,C)) = greatest_lower_bound(greatest_lower_bound(A,B),C).
% 3.91/4.30 0 (wt=-1) [] least_upper_bound(A,least_upper_bound(B,C)) = least_upper_bound(least_upper_bound(A,B),C).
% 3.91/4.30 0 (wt=-1) [] least_upper_bound(A,A) = A.
% 3.91/4.30 0 (wt=-1) [] greatest_lower_bound(A,A) = A.
% 3.91/4.30 0 (wt=-1) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 3.91/4.30 0 (wt=-1) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 3.91/4.30 0 (wt=-1) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 3.91/4.30 0 (wt=-1) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 3.91/4.30 0 (wt=-1) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 3.91/4.30 0 (wt=-1) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 3.91/4.30 0 (wt=-1) [] least_upper_bound(identity,b) = b.
% 3.91/4.30 0 (wt=-1) [] -(least_upper_bound(identity,multiply(inverse(a),multiply(b,a))) = multiply(inverse(a),multiply(b,a))).
% 3.91/4.30 end_of_list.
% 3.91/4.30
% 3.91/4.30 Demodulators:
% 3.91/4.30 end_of_list.
% 3.91/4.30
% 3.91/4.30 Passive:
% 3.91/4.30 end_of_list.
% 3.91/4.30
% 3.91/4.30 Starting to process input.
% 3.91/4.30
% 3.91/4.30 ** KEPT: 1 (wt=5) [] multiply(identity,A) = A.
% 3.91/4.30 1 is a new demodulator.
% 3.91/4.30
% 3.91/4.30 ** KEPT: 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 3.91/4.30 2 is a new demodulator.
% 3.91/4.30
% 3.91/4.30 ** KEPT: 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 3.91/4.30 3 is a new demodulator.
% 3.91/4.30
% 3.91/4.30 ** KEPT: 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 3.91/4.30 clause forward subsumed: 0 (wt=7) [flip(4)] greatest_lower_bound(B,A) = greatest_lower_bound(A,B).
% 3.91/4.30
% 3.91/4.30 ** KEPT: 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 3.91/4.30 clause forward subsumed: 0 (wt=7) [flip(5)] least_upper_bound(B,A) = least_upper_bound(A,B).
% 3.91/4.30
% 3.91/4.30 ** KEPT: 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 3.91/4.30 6 is a new demodulator.
% 3.91/4.30
% 3.91/4.30 ** KEPT: 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 3.91/4.30 7 is a new demodulator.
% 3.91/4.30
% 3.91/4.30 ** KEPT: 8 (wt=5) [] least_upper_bound(A,A) = A.
% 3.91/4.30 8 is a new demodulator.
% 3.91/4.30
% 3.91/4.30 ** KEPT: 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 3.91/4.30 9 is a new demodulator.
% 3.91/4.30
% 3.91/4.30 ** KEPT: 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 3.91/4.30 10 is a new demodulator.
% 3.91/4.30
% 3.91/4.30 ** KEPT: 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 3.91/4.30 11 is a new demodulator.
% 3.91/4.30
% 3.91/4.30 ** KEPT: 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 3.91/4.30 12 is a new demodulator.
% 3.91/4.30
% 3.91/4.30 ** KEPT: 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 3.91/4.30 13 is a new demodulator.
% 3.91/4.30
% 3.91/4.30 ** KEPT: 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 3.91/4.30 14 is a new demodulator.
% 3.91/4.30
% 3.91/4.30 ** KEPT: 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 3.91/4.30 15 is a new demodulator.
% 3.91/4.30
% 3.91/4.30 ** KEPT: 16 (wt=5) [] least_upper_bound(identity,b) = b.
% 3.91/4.30 16 is a new demodulator.
% 3.91/4.30
% 3.91/4.30 ** KEPT: 17 (wt=15) [] -(least_upper_bound(identity,multiply(inverse(a),multiply(b,a))) = multiply(inverse(a),multiply(b,a))).
% 3.91/4.30 ---------------- PROOF FOUND ----------------
% 3.91/4.30 % SZS status Unsatisfiable
% 3.91/4.30
% 3.91/4.30
% 3.91/4.30 After processing input:
% 3.91/4.30
% 3.91/4.30 Usable:
% 3.91/4.30 end_of_list.
% 3.91/4.30
% 3.91/4.30 Sos:
% 3.91/4.30 1 (wt=5) [] multiply(identity,A) = A.
% 3.91/4.30 8 (wt=5) [] least_upper_bound(A,A) = A.
% 3.91/4.30 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 3.91/4.30 16 (wt=5) [] least_upper_bound(identity,b) = b.
% 3.91/4.30 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 3.91/4.30 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 3.91/4.30 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 3.91/4.30 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 3.91/4.30 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 3.91/4.30 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 3.91/4.30 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 3.91/4.30 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 3.91/4.30 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 3.91/4.30 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 3.91/4.30 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 3.91/4.30 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 3.91/4.30 17 (wt=15) [] -(least_upper_bound(identity,multiply(inverse(a),multiply(b,a))) = multiply(inverse(a),multiply(b,a))).
% 3.91/4.30 end_of_list.
% 3.91/4.30
% 3.91/4.30 Demodulators:
% 3.91/4.30 1 (wt=5) [] multiply(identity,A) = A.
% 3.91/4.30 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 3.91/4.30 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 3.91/4.30 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 3.91/4.30 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 3.91/4.30 8 (wt=5) [] least_upper_bound(A,A) = A.
% 3.91/4.30 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 3.91/4.30 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 3.91/4.30 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 3.91/4.30 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 3.91/4.30 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 3.91/4.30 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 3.91/4.30 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 3.91/4.30 16 (wt=5) [] least_upper_bound(identity,b) = b.
% 3.91/4.30 end_of_list.
% 3.91/4.30
% 3.91/4.30 Passive:
% 3.91/4.30 end_of_list.
% 3.91/4.30
% 3.91/4.30 UNIT CONFLICT from 12450 and 17 at 2.06 seconds.
% 3.91/4.30
% 3.91/4.30 ---------------- PROOF ----------------
% 3.91/4.30 % SZS output start Refutation
% See solution above
% 3.91/4.30 ------------ end of proof -------------
% 3.91/4.30
% 3.91/4.30
% 3.91/4.30 ------------- memory usage ------------
% 3.91/4.30 Memory dynamically allocated (tp_alloc): 25878.
% 3.91/4.30 type (bytes each) gets frees in use avail bytes
% 3.91/4.30 sym_ent ( 96) 58 0 58 0 5.4 K
% 3.91/4.30 term ( 16) 1883463 1529001 354462 18 6874.8 K
% 3.91/4.30 gen_ptr ( 8) 1911164 262295 1648869 14 12881.9 K
% 3.91/4.30 context ( 808) 2457506 2457504 2 6 6.3 K
% 3.91/4.30 trail ( 12) 130565 130565 0 7 0.1 K
% 3.91/4.30 bt_node ( 68) 1282168 1282165 3 24 1.8 K
% 3.91/4.30 ac_position (285432) 0 0 0 0 0.0 K
% 3.91/4.30 ac_match_pos (14044) 0 0 0 0 0.0 K
% 3.91/4.30 ac_match_free_vars_pos (4020)
% 3.91/4.30 0 0 0 0 0.0 K
% 3.91/4.30 discrim ( 12) 287326 9570 277756 0 3255.0 K
% 3.91/4.30 flat ( 40) 4196864 4196864 0 185 7.2 K
% 3.91/4.30 discrim_pos ( 12) 91408 91408 0 1 0.0 K
% 3.91/4.30 fpa_head ( 12) 24112 0 24112 0 282.6 K
% 3.91/4.30 fpa_tree ( 28) 53905 53905 0 83 2.3 K
% 3.91/4.30 fpa_pos ( 36) 20994 20994 0 1 0.0 K
% 3.91/4.30 literal ( 12) 73200 60750 12450 1 145.9 K
% 3.91/4.30 clause ( 24) 73200 60750 12450 1 291.8 K
% 3.91/4.30 list ( 12) 8603 8547 56 3 0.7 K
% 3.91/4.30 list_pos ( 20) 47566 3547 44019 0 859.7 K
% 3.91/4.30 pair_index ( 40) 2 0 2 0 0.1 K
% 3.91/4.30
% 3.91/4.30 -------------- statistics -------------
% 3.91/4.30 Clauses input 17
% 3.91/4.30 Usable input 0
% 3.91/4.30 Sos input 17
% 3.91/4.30 Demodulators input 0
% 3.91/4.30 Passive input 0
% 3.91/4.30
% 3.91/4.30 Processed BS (before search) 19
% 3.91/4.30 Forward subsumed BS 2
% 3.91/4.30 Kept BS 17
% 3.91/4.30 New demodulators BS 14
% 3.91/4.30 Back demodulated BS 0
% 3.91/4.30
% 3.91/4.30 Clauses or pairs given 244270
% 3.91/4.30 Clauses generated 50202
% 3.91/4.30 Forward subsumed 37769
% 3.91/4.30 Deleted by weight 0
% 3.91/4.30 Deleted by variable count 0
% 3.91/4.30 Kept 12433
% 3.91/4.30 New demodulators 8530
% 3.91/4.30 Back demodulated 828
% 3.91/4.30 Ordered paramod prunes 0
% 3.91/4.30 Basic paramod prunes 1465126
% 3.91/4.30 Prime paramod prunes 5289
% 3.91/4.31 Semantic prunes 0
% 3.91/4.31
% 3.91/4.31 Rewrite attmepts 721546
% 3.91/4.31 Rewrites 77719
% 3.91/4.31
% 3.91/4.31 FPA overloads 0
% 3.91/4.31 FPA underloads 0
% 3.91/4.31
% 3.91/4.31 Usable size 0
% 3.91/4.31 Sos size 11621
% 3.91/4.31 Demodulators size 8328
% 3.91/4.31 Passive size 0
% 3.91/4.31 Disabled size 828
% 3.91/4.31
% 3.91/4.31 Proofs found 1
% 3.91/4.31
% 3.91/4.31 ----------- times (seconds) ----------- Mon Jun 13 11:59:33 2022
% 3.91/4.31
% 3.91/4.31 user CPU time 2.06 (0 hr, 0 min, 2 sec)
% 3.91/4.31 system CPU time 1.22 (0 hr, 0 min, 1 sec)
% 3.91/4.31 wall-clock time 3 (0 hr, 0 min, 3 sec)
% 3.91/4.31 input time 0.00
% 3.91/4.31 paramodulation time 0.34
% 3.91/4.31 demodulation time 0.15
% 3.91/4.31 orient time 0.09
% 3.91/4.31 weigh time 0.03
% 3.91/4.31 forward subsume time 0.04
% 3.91/4.31 back demod find time 0.11
% 3.91/4.31 conflict time 0.00
% 3.91/4.31 LRPO time 0.03
% 3.91/4.31 store clause time 0.91
% 3.91/4.31 disable clause time 0.04
% 3.91/4.31 prime paramod time 0.05
% 3.91/4.31 semantics time 0.00
% 3.91/4.31
% 3.91/4.31 EQP interrupted
%------------------------------------------------------------------------------