TSTP Solution File: GRP170-3 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP170-3 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n022.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 3.92s 4.31s
% Output : Refutation 3.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 5
% Number of leaves : 7
% Syntax : Number of clauses : 14 ( 14 unt; 0 nHn; 6 RR)
% Number of literals : 14 ( 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 : 8 ( 8 usr; 5 con; 0-2 aty)
% Number of variables : 16 ( 1 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(multiply(identity,A),A),
file('GRP170-3.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(11,plain,
equal(greatest_lower_bound(A,least_upper_bound(A,B)),A),
file('GRP170-3.p',unknown),
[] ).
cnf(12,plain,
equal(multiply(A,least_upper_bound(B,C)),least_upper_bound(multiply(A,B),multiply(A,C))),
file('GRP170-3.p',unknown),
[] ).
cnf(14,plain,
equal(multiply(least_upper_bound(A,B),C),least_upper_bound(multiply(A,C),multiply(B,C))),
file('GRP170-3.p',unknown),
[] ).
cnf(16,plain,
equal(least_upper_bound(a,b),b),
file('GRP170-3.p',unknown),
[] ).
cnf(17,plain,
equal(least_upper_bound(c,d),d),
file('GRP170-3.p',unknown),
[] ).
cnf(18,plain,
~ equal(greatest_lower_bound(multiply(a,c),multiply(b,d)),multiply(a,c)),
file('GRP170-3.p',unknown),
[] ).
cnf(61,plain,
equal(least_upper_bound(multiply(a,A),multiply(b,A)),multiply(b,A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[16,14]),1]),
[iquote('para(16,14),flip(1)')] ).
cnf(63,plain,
equal(least_upper_bound(multiply(A,c),multiply(A,d)),multiply(A,d)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[17,12]),1]),
[iquote('para(17,12),flip(1)')] ).
cnf(390,plain,
equal(least_upper_bound(multiply(a,A),least_upper_bound(multiply(b,A),B)),least_upper_bound(multiply(b,A),B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[61,7]),1]),
[iquote('para(61,7),flip(1)')] ).
cnf(11995,plain,
equal(least_upper_bound(multiply(a,c),multiply(b,d)),multiply(b,d)),
inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[63,390]),63]),
[iquote('para(63,390),demod([63])')] ).
cnf(11998,plain,
equal(greatest_lower_bound(multiply(a,c),multiply(b,d)),multiply(a,c)),
inference(para,[status(thm),theory(equality)],[11995,11]),
[iquote('para(11995,11)')] ).
cnf(11999,plain,
$false,
inference(conflict,[status(thm)],[11998,18]),
[iquote('conflict(11998,18)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13 % Problem : GRP170-3 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.08/0.14 % Command : tptp2X_and_run_eqp %s
% 0.13/0.35 % Computer : n022.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 600
% 0.13/0.35 % DateTime : Mon Jun 13 10:00:18 EDT 2022
% 0.13/0.35 % CPUTime :
% 3.92/4.31 ----- EQP 0.9e, May 2009 -----
% 3.92/4.31 The job began on n022.cluster.edu, Mon Jun 13 10:00:19 2022
% 3.92/4.31 The command was "./eqp09e".
% 3.92/4.31
% 3.92/4.31 set(prolog_style_variables).
% 3.92/4.31 set(lrpo).
% 3.92/4.31 set(basic_paramod).
% 3.92/4.31 set(functional_subsume).
% 3.92/4.31 set(ordered_paramod).
% 3.92/4.31 set(prime_paramod).
% 3.92/4.31 set(para_pairs).
% 3.92/4.31 assign(pick_given_ratio,4).
% 3.92/4.31 clear(print_kept).
% 3.92/4.31 clear(print_new_demod).
% 3.92/4.31 clear(print_back_demod).
% 3.92/4.31 clear(print_given).
% 3.92/4.31 assign(max_mem,64000).
% 3.92/4.31 end_of_commands.
% 3.92/4.31
% 3.92/4.31 Usable:
% 3.92/4.31 end_of_list.
% 3.92/4.31
% 3.92/4.31 Sos:
% 3.92/4.31 0 (wt=-1) [] multiply(identity,A) = A.
% 3.92/4.31 0 (wt=-1) [] multiply(inverse(A),A) = identity.
% 3.92/4.31 0 (wt=-1) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 3.92/4.31 0 (wt=-1) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 3.92/4.31 0 (wt=-1) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 3.92/4.31 0 (wt=-1) [] greatest_lower_bound(A,greatest_lower_bound(B,C)) = greatest_lower_bound(greatest_lower_bound(A,B),C).
% 3.92/4.31 0 (wt=-1) [] least_upper_bound(A,least_upper_bound(B,C)) = least_upper_bound(least_upper_bound(A,B),C).
% 3.92/4.31 0 (wt=-1) [] least_upper_bound(A,A) = A.
% 3.92/4.31 0 (wt=-1) [] greatest_lower_bound(A,A) = A.
% 3.92/4.31 0 (wt=-1) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 3.92/4.31 0 (wt=-1) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 3.92/4.31 0 (wt=-1) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 3.92/4.31 0 (wt=-1) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 3.92/4.31 0 (wt=-1) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 3.92/4.31 0 (wt=-1) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 3.92/4.31 0 (wt=-1) [] least_upper_bound(a,b) = b.
% 3.92/4.31 0 (wt=-1) [] least_upper_bound(c,d) = d.
% 3.92/4.31 0 (wt=-1) [] -(greatest_lower_bound(multiply(a,c),multiply(b,d)) = multiply(a,c)).
% 3.92/4.31 end_of_list.
% 3.92/4.31
% 3.92/4.31 Demodulators:
% 3.92/4.31 end_of_list.
% 3.92/4.31
% 3.92/4.31 Passive:
% 3.92/4.31 end_of_list.
% 3.92/4.31
% 3.92/4.31 Starting to process input.
% 3.92/4.31
% 3.92/4.31 ** KEPT: 1 (wt=5) [] multiply(identity,A) = A.
% 3.92/4.31 1 is a new demodulator.
% 3.92/4.31
% 3.92/4.31 ** KEPT: 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 3.92/4.31 2 is a new demodulator.
% 3.92/4.31
% 3.92/4.31 ** KEPT: 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 3.92/4.31 3 is a new demodulator.
% 3.92/4.31
% 3.92/4.31 ** KEPT: 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 3.92/4.31 clause forward subsumed: 0 (wt=7) [flip(4)] greatest_lower_bound(B,A) = greatest_lower_bound(A,B).
% 3.92/4.31
% 3.92/4.31 ** KEPT: 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 3.92/4.31 clause forward subsumed: 0 (wt=7) [flip(5)] least_upper_bound(B,A) = least_upper_bound(A,B).
% 3.92/4.31
% 3.92/4.31 ** 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.92/4.31 6 is a new demodulator.
% 3.92/4.31
% 3.92/4.31 ** 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.92/4.31 7 is a new demodulator.
% 3.92/4.31
% 3.92/4.31 ** KEPT: 8 (wt=5) [] least_upper_bound(A,A) = A.
% 3.92/4.31 8 is a new demodulator.
% 3.92/4.31
% 3.92/4.31 ** KEPT: 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 3.92/4.31 9 is a new demodulator.
% 3.92/4.31
% 3.92/4.31 ** KEPT: 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 3.92/4.31 10 is a new demodulator.
% 3.92/4.31
% 3.92/4.31 ** KEPT: 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 3.92/4.31 11 is a new demodulator.
% 3.92/4.31
% 3.92/4.31 ** KEPT: 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 3.92/4.31 12 is a new demodulator.
% 3.92/4.31
% 3.92/4.31 ** KEPT: 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 3.92/4.31 13 is a new demodulator.
% 3.92/4.31
% 3.92/4.31 ** KEPT: 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 3.92/4.31 14 is a new demodulator.
% 3.92/4.31
% 3.92/4.31 ** KEPT: 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 3.92/4.31 15 is a new demodulator.
% 3.92/4.31
% 3.92/4.31 ** KEPT: 16 (wt=5) [] least_upper_bound(a,b) = b.
% 3.92/4.31 16 is a new demodulator.
% 3.92/4.31
% 3.92/4.31 ** KEPT: 17 (wt=5) [] least_upper_bound(c,d) = d.
% 3.92/4.31 17 is a new demodulator.
% 3.92/4.31
% 3.92/4.31 ** KEPT: 18 (wt=11) [] -(greatest_lower_bound(multiply(a,c),multiply(b,d)) = multiply(a,c)).
% 3.92/4.31 ---------------- PROOF FOUND ----------------
% 3.92/4.31 % SZS status Unsatisfiable
% 3.92/4.31
% 3.92/4.31
% 3.92/4.31 After processing input:
% 3.92/4.31
% 3.92/4.31 Usable:
% 3.92/4.31 end_of_list.
% 3.92/4.31
% 3.92/4.31 Sos:
% 3.92/4.31 1 (wt=5) [] multiply(identity,A) = A.
% 3.92/4.31 8 (wt=5) [] least_upper_bound(A,A) = A.
% 3.92/4.31 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 3.92/4.31 16 (wt=5) [] least_upper_bound(a,b) = b.
% 3.92/4.31 17 (wt=5) [] least_upper_bound(c,d) = d.
% 3.92/4.31 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 3.92/4.31 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 3.92/4.31 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 3.92/4.31 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 3.92/4.31 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 3.92/4.31 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 3.92/4.31 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 3.92/4.31 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 3.92/4.31 18 (wt=11) [] -(greatest_lower_bound(multiply(a,c),multiply(b,d)) = multiply(a,c)).
% 3.92/4.31 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 3.92/4.31 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 3.92/4.31 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 3.92/4.31 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 3.92/4.31 end_of_list.
% 3.92/4.31
% 3.92/4.31 Demodulators:
% 3.92/4.31 1 (wt=5) [] multiply(identity,A) = A.
% 3.92/4.31 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 3.92/4.31 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 3.92/4.31 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 3.92/4.31 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 3.92/4.31 8 (wt=5) [] least_upper_bound(A,A) = A.
% 3.92/4.31 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 3.92/4.31 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 3.92/4.31 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 3.92/4.31 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 3.92/4.31 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 3.92/4.31 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 3.92/4.31 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 3.92/4.31 16 (wt=5) [] least_upper_bound(a,b) = b.
% 3.92/4.31 17 (wt=5) [] least_upper_bound(c,d) = d.
% 3.92/4.31 end_of_list.
% 3.92/4.31
% 3.92/4.31 Passive:
% 3.92/4.31 end_of_list.
% 3.92/4.31
% 3.92/4.31 UNIT CONFLICT from 11998 and 18 at 2.11 seconds.
% 3.92/4.31
% 3.92/4.31 ---------------- PROOF ----------------
% 3.92/4.31 % SZS output start Refutation
% See solution above
% 3.92/4.31 ------------ end of proof -------------
% 3.92/4.31
% 3.92/4.31
% 3.92/4.31 ------------- memory usage ------------
% 3.92/4.31 Memory dynamically allocated (tp_alloc): 23925.
% 3.92/4.31 type (bytes each) gets frees in use avail bytes
% 3.92/4.31 sym_ent ( 96) 60 0 60 0 5.6 K
% 3.92/4.31 term ( 16) 1725489 1396565 328924 32 6378.0 K
% 3.92/4.31 gen_ptr ( 8) 1757772 240621 1517151 13 11852.8 K
% 3.92/4.31 context ( 808) 2466981 2466979 2 6 6.3 K
% 3.92/4.31 trail ( 12) 116535 116535 0 7 0.1 K
% 3.92/4.31 bt_node ( 68) 1325731 1325728 3 24 1.8 K
% 3.92/4.31 ac_position (285432) 0 0 0 0 0.0 K
% 3.92/4.31 ac_match_pos (14044) 0 0 0 0 0.0 K
% 3.92/4.31 ac_match_free_vars_pos (4020)
% 3.92/4.31 0 0 0 0 0.0 K
% 3.92/4.31 discrim ( 12) 267145 9206 257939 16 3022.9 K
% 3.92/4.31 flat ( 40) 3834249 3834249 0 185 7.2 K
% 3.92/4.31 discrim_pos ( 12) 78897 78897 0 1 0.0 K
% 3.92/4.31 fpa_head ( 12) 24294 0 24294 0 284.7 K
% 3.92/4.31 fpa_tree ( 28) 51823 51823 0 83 2.3 K
% 3.92/4.31 fpa_pos ( 36) 20352 20352 0 1 0.0 K
% 3.92/4.31 literal ( 12) 69739 57741 11998 1 140.6 K
% 3.92/4.31 clause ( 24) 69739 57741 11998 1 281.2 K
% 3.92/4.31 list ( 12) 8413 8357 56 3 0.7 K
% 3.92/4.31 list_pos ( 20) 45957 3393 42564 1 831.3 K
% 3.92/4.31 pair_index ( 40) 2 0 2 0 0.1 K
% 3.92/4.31
% 3.92/4.31 -------------- statistics -------------
% 3.92/4.31 Clauses input 18
% 3.92/4.31 Usable input 0
% 3.92/4.31 Sos input 18
% 3.92/4.31 Demodulators input 0
% 3.92/4.31 Passive input 0
% 3.92/4.31
% 3.92/4.31 Processed BS (before search) 20
% 3.92/4.31 Forward subsumed BS 2
% 3.92/4.31 Kept BS 18
% 3.92/4.31 New demodulators BS 15
% 3.92/4.31 Back demodulated BS 0
% 3.92/4.31
% 3.92/4.31 Clauses or pairs given 249824
% 3.92/4.31 Clauses generated 46913
% 3.92/4.31 Forward subsumed 34933
% 3.92/4.31 Deleted by weight 0
% 3.92/4.31 Deleted by variable count 0
% 3.92/4.31 Kept 11980
% 3.92/4.31 New demodulators 8339
% 3.92/4.31 Back demodulated 797
% 3.92/4.31 Ordered paramod prunes 0
% 3.92/4.31 Basic paramod prunes 1602206
% 3.92/4.31 Prime paramod prunes 1984
% 3.92/4.31 Semantic prunes 0
% 3.92/4.31
% 3.92/4.31 Rewrite attmepts 676665
% 3.92/4.31 Rewrites 68318
% 3.92/4.31
% 3.92/4.31 FPA overloads 0
% 3.92/4.31 FPA underloads 0
% 3.92/4.31
% 3.92/4.31 Usable size 0
% 3.92/4.31 Sos size 11200
% 3.92/4.31 Demodulators size 8167
% 3.92/4.31 Passive size 0
% 3.92/4.31 Disabled size 797
% 3.92/4.31
% 3.92/4.31 Proofs found 1
% 3.92/4.31
% 3.92/4.31 ----------- times (seconds) ----------- Mon Jun 13 10:00:22 2022
% 3.92/4.31
% 3.92/4.31 user CPU time 2.11 (0 hr, 0 min, 2 sec)
% 3.92/4.31 system CPU time 1.09 (0 hr, 0 min, 1 sec)
% 3.92/4.31 wall-clock time 3 (0 hr, 0 min, 3 sec)
% 3.92/4.31 input time 0.00
% 3.92/4.31 paramodulation time 0.36
% 3.92/4.31 demodulation time 0.14
% 3.92/4.31 orient time 0.09
% 3.92/4.31 weigh time 0.02
% 3.92/4.31 forward subsume time 0.06
% 3.92/4.31 back demod find time 0.15
% 3.92/4.31 conflict time 0.01
% 3.92/4.31 LRPO time 0.04
% 3.92/4.31 store clause time 0.84
% 3.92/4.31 disable clause time 0.05
% 3.92/4.31 prime paramod time 0.05
% 3.92/4.31 semantics time 0.00
% 3.92/4.31
% 3.92/4.31 EQP interrupted
%------------------------------------------------------------------------------