TSTP Solution File: GRP170-2 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP170-2 : 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:40 EDT 2022
% Result : Unsatisfiable 3.97s 4.39s
% Output : Refutation 3.97s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 6
% Syntax : Number of clauses : 12 ( 12 unt; 0 nHn; 5 RR)
% Number of literals : 12 ( 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 : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 14 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(1,plain,
equal(multiply(identity,A),A),
file('GRP170-2.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(13,plain,
equal(multiply(A,greatest_lower_bound(B,C)),greatest_lower_bound(multiply(A,B),multiply(A,C))),
file('GRP170-2.p',unknown),
[] ).
cnf(15,plain,
equal(multiply(greatest_lower_bound(A,B),C),greatest_lower_bound(multiply(A,C),multiply(B,C))),
file('GRP170-2.p',unknown),
[] ).
cnf(16,plain,
equal(greatest_lower_bound(a,b),a),
file('GRP170-2.p',unknown),
[] ).
cnf(17,plain,
equal(greatest_lower_bound(c,d),c),
file('GRP170-2.p',unknown),
[] ).
cnf(18,plain,
~ equal(greatest_lower_bound(multiply(a,c),multiply(b,d)),multiply(a,c)),
file('GRP170-2.p',unknown),
[] ).
cnf(61,plain,
equal(greatest_lower_bound(multiply(a,A),multiply(b,A)),multiply(a,A)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[16,15]),1]),
[iquote('para(16,15),flip(1)')] ).
cnf(63,plain,
equal(greatest_lower_bound(multiply(A,c),multiply(A,d)),multiply(A,c)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[17,13]),1]),
[iquote('para(17,13),flip(1)')] ).
cnf(388,plain,
equal(greatest_lower_bound(multiply(a,A),greatest_lower_bound(multiply(b,A),B)),greatest_lower_bound(multiply(a,A),B)),
inference(flip,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[61,6]),1]),
[iquote('para(61,6),flip(1)')] ).
cnf(12171,plain,
equal(greatest_lower_bound(multiply(a,c),multiply(b,d)),multiply(a,c)),
inference(flip,[status(thm),theory(equality)],[inference(demod,[status(thm),theory(equality)],[inference(para,[status(thm),theory(equality)],[63,388]),61]),1]),
[iquote('para(63,388),demod([61]),flip(1)')] ).
cnf(12172,plain,
$false,
inference(conflict,[status(thm)],[12171,18]),
[iquote('conflict(12171,18)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12 % Problem : GRP170-2 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.12/0.12 % Command : tptp2X_and_run_eqp %s
% 0.12/0.34 % Computer : n016.cluster.edu
% 0.12/0.34 % Model : x86_64 x86_64
% 0.12/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34 % Memory : 8042.1875MB
% 0.12/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34 % CPULimit : 300
% 0.12/0.34 % WCLimit : 600
% 0.12/0.34 % DateTime : Tue Jun 14 01:38:00 EDT 2022
% 0.12/0.34 % CPUTime :
% 3.97/4.39 ----- EQP 0.9e, May 2009 -----
% 3.97/4.39 The job began on n016.cluster.edu, Tue Jun 14 01:38:01 2022
% 3.97/4.39 The command was "./eqp09e".
% 3.97/4.39
% 3.97/4.39 set(prolog_style_variables).
% 3.97/4.39 set(lrpo).
% 3.97/4.39 set(basic_paramod).
% 3.97/4.39 set(functional_subsume).
% 3.97/4.39 set(ordered_paramod).
% 3.97/4.39 set(prime_paramod).
% 3.97/4.39 set(para_pairs).
% 3.97/4.39 assign(pick_given_ratio,4).
% 3.97/4.39 clear(print_kept).
% 3.97/4.39 clear(print_new_demod).
% 3.97/4.39 clear(print_back_demod).
% 3.97/4.39 clear(print_given).
% 3.97/4.39 assign(max_mem,64000).
% 3.97/4.39 end_of_commands.
% 3.97/4.39
% 3.97/4.39 Usable:
% 3.97/4.39 end_of_list.
% 3.97/4.39
% 3.97/4.39 Sos:
% 3.97/4.39 0 (wt=-1) [] multiply(identity,A) = A.
% 3.97/4.39 0 (wt=-1) [] multiply(inverse(A),A) = identity.
% 3.97/4.39 0 (wt=-1) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 3.97/4.39 0 (wt=-1) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 3.97/4.39 0 (wt=-1) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 3.97/4.39 0 (wt=-1) [] greatest_lower_bound(A,greatest_lower_bound(B,C)) = greatest_lower_bound(greatest_lower_bound(A,B),C).
% 3.97/4.39 0 (wt=-1) [] least_upper_bound(A,least_upper_bound(B,C)) = least_upper_bound(least_upper_bound(A,B),C).
% 3.97/4.39 0 (wt=-1) [] least_upper_bound(A,A) = A.
% 3.97/4.39 0 (wt=-1) [] greatest_lower_bound(A,A) = A.
% 3.97/4.39 0 (wt=-1) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 3.97/4.39 0 (wt=-1) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 3.97/4.39 0 (wt=-1) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 3.97/4.39 0 (wt=-1) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 3.97/4.39 0 (wt=-1) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 3.97/4.39 0 (wt=-1) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 3.97/4.39 0 (wt=-1) [] greatest_lower_bound(a,b) = a.
% 3.97/4.39 0 (wt=-1) [] greatest_lower_bound(c,d) = c.
% 3.97/4.39 0 (wt=-1) [] -(greatest_lower_bound(multiply(a,c),multiply(b,d)) = multiply(a,c)).
% 3.97/4.39 end_of_list.
% 3.97/4.39
% 3.97/4.39 Demodulators:
% 3.97/4.39 end_of_list.
% 3.97/4.39
% 3.97/4.39 Passive:
% 3.97/4.39 end_of_list.
% 3.97/4.39
% 3.97/4.39 Starting to process input.
% 3.97/4.39
% 3.97/4.39 ** KEPT: 1 (wt=5) [] multiply(identity,A) = A.
% 3.97/4.39 1 is a new demodulator.
% 3.97/4.39
% 3.97/4.39 ** KEPT: 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 3.97/4.39 2 is a new demodulator.
% 3.97/4.39
% 3.97/4.39 ** KEPT: 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 3.97/4.39 3 is a new demodulator.
% 3.97/4.39
% 3.97/4.39 ** KEPT: 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 3.97/4.39 clause forward subsumed: 0 (wt=7) [flip(4)] greatest_lower_bound(B,A) = greatest_lower_bound(A,B).
% 3.97/4.39
% 3.97/4.39 ** KEPT: 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 3.97/4.39 clause forward subsumed: 0 (wt=7) [flip(5)] least_upper_bound(B,A) = least_upper_bound(A,B).
% 3.97/4.39
% 3.97/4.39 ** 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.97/4.39 6 is a new demodulator.
% 3.97/4.39
% 3.97/4.39 ** 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.97/4.39 7 is a new demodulator.
% 3.97/4.39
% 3.97/4.39 ** KEPT: 8 (wt=5) [] least_upper_bound(A,A) = A.
% 3.97/4.39 8 is a new demodulator.
% 3.97/4.39
% 3.97/4.39 ** KEPT: 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 3.97/4.39 9 is a new demodulator.
% 3.97/4.39
% 3.97/4.39 ** KEPT: 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 3.97/4.39 10 is a new demodulator.
% 3.97/4.39
% 3.97/4.39 ** KEPT: 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 3.97/4.39 11 is a new demodulator.
% 3.97/4.39
% 3.97/4.39 ** KEPT: 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 3.97/4.39 12 is a new demodulator.
% 3.97/4.39
% 3.97/4.39 ** KEPT: 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 3.97/4.39 13 is a new demodulator.
% 3.97/4.39
% 3.97/4.39 ** KEPT: 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 3.97/4.39 14 is a new demodulator.
% 3.97/4.39
% 3.97/4.39 ** KEPT: 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 3.97/4.39 15 is a new demodulator.
% 3.97/4.39
% 3.97/4.39 ** KEPT: 16 (wt=5) [] greatest_lower_bound(a,b) = a.
% 3.97/4.39 16 is a new demodulator.
% 3.97/4.39
% 3.97/4.39 ** KEPT: 17 (wt=5) [] greatest_lower_bound(c,d) = c.
% 3.97/4.39 17 is a new demodulator.
% 3.97/4.39
% 3.97/4.39 ** KEPT: 18 (wt=11) [] -(greatest_lower_bound(multiply(a,c),multiply(b,d)) = multiply(a,c)).
% 3.97/4.39 ---------------- PROOF FOUND ----------------
% 3.97/4.39 % SZS status Unsatisfiable
% 3.97/4.39
% 3.97/4.39
% 3.97/4.39 After processing input:
% 3.97/4.39
% 3.97/4.39 Usable:
% 3.97/4.39 end_of_list.
% 3.97/4.39
% 3.97/4.39 Sos:
% 3.97/4.39 1 (wt=5) [] multiply(identity,A) = A.
% 3.97/4.39 8 (wt=5) [] least_upper_bound(A,A) = A.
% 3.97/4.39 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 3.97/4.39 16 (wt=5) [] greatest_lower_bound(a,b) = a.
% 3.97/4.39 17 (wt=5) [] greatest_lower_bound(c,d) = c.
% 3.97/4.39 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 3.97/4.39 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 3.97/4.39 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 3.97/4.39 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 3.97/4.39 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 3.97/4.39 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 3.97/4.39 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 3.97/4.39 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 3.97/4.39 18 (wt=11) [] -(greatest_lower_bound(multiply(a,c),multiply(b,d)) = multiply(a,c)).
% 3.97/4.39 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 3.97/4.39 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 3.97/4.39 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 3.97/4.39 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 3.97/4.39 end_of_list.
% 3.97/4.39
% 3.97/4.39 Demodulators:
% 3.97/4.39 1 (wt=5) [] multiply(identity,A) = A.
% 3.97/4.39 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 3.97/4.39 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 3.97/4.39 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 3.97/4.39 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 3.97/4.39 8 (wt=5) [] least_upper_bound(A,A) = A.
% 3.97/4.39 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 3.97/4.39 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 3.97/4.39 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 3.97/4.39 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 3.97/4.39 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 3.97/4.39 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 3.97/4.39 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 3.97/4.39 16 (wt=5) [] greatest_lower_bound(a,b) = a.
% 3.97/4.39 17 (wt=5) [] greatest_lower_bound(c,d) = c.
% 3.97/4.39 end_of_list.
% 3.97/4.39
% 3.97/4.39 Passive:
% 3.97/4.39 end_of_list.
% 3.97/4.39
% 3.97/4.39 UNIT CONFLICT from 12171 and 18 at 2.18 seconds.
% 3.97/4.39
% 3.97/4.39 ---------------- PROOF ----------------
% 3.97/4.39 % SZS output start Refutation
% See solution above
% 3.97/4.39 ------------ end of proof -------------
% 3.97/4.39
% 3.97/4.39
% 3.97/4.39 ------------- memory usage ------------
% 3.97/4.39 Memory dynamically allocated (tp_alloc): 24414.
% 3.97/4.39 type (bytes each) gets frees in use avail bytes
% 3.97/4.39 sym_ent ( 96) 60 0 60 0 5.6 K
% 3.97/4.39 term ( 16) 1741725 1409124 332601 25 6449.0 K
% 3.97/4.39 gen_ptr ( 8) 1775697 242235 1533462 22 11980.3 K
% 3.97/4.39 context ( 808) 2528041 2528039 2 6 6.3 K
% 3.97/4.39 trail ( 12) 117237 117237 0 7 0.1 K
% 3.97/4.39 bt_node ( 68) 1359513 1359508 5 22 1.8 K
% 3.97/4.39 ac_position (285432) 0 0 0 0 0.0 K
% 3.97/4.39 ac_match_pos (14044) 0 0 0 0 0.0 K
% 3.97/4.39 ac_match_free_vars_pos (4020)
% 3.97/4.39 0 0 0 0 0.0 K
% 3.97/4.39 discrim ( 12) 270661 9285 261376 103 3064.2 K
% 3.97/4.39 flat ( 40) 3875951 3875951 0 185 7.2 K
% 3.97/4.39 discrim_pos ( 12) 79809 79809 0 1 0.0 K
% 3.97/4.39 fpa_head ( 12) 24531 0 24531 0 287.5 K
% 3.97/4.39 fpa_tree ( 28) 52762 52762 0 83 2.3 K
% 3.97/4.39 fpa_pos ( 36) 20670 20670 0 1 0.0 K
% 3.97/4.39 literal ( 12) 70534 58363 12171 1 142.6 K
% 3.97/4.39 clause ( 24) 70534 58363 12171 1 285.3 K
% 3.97/4.39 list ( 12) 8558 8502 56 3 0.7 K
% 3.97/4.39 list_pos ( 20) 46615 3380 43235 19 844.8 K
% 3.97/4.39 pair_index ( 40) 2 0 2 0 0.1 K
% 3.97/4.39
% 3.97/4.39 -------------- statistics -------------
% 3.97/4.39 Clauses input 18
% 3.97/4.39 Usable input 0
% 3.97/4.39 Sos input 18
% 3.97/4.39 Demodulators input 0
% 3.97/4.39 Passive input 0
% 3.97/4.39
% 3.97/4.39 Processed BS (before search) 20
% 3.97/4.39 Forward subsumed BS 2
% 3.97/4.39 Kept BS 18
% 3.97/4.39 New demodulators BS 15
% 3.97/4.39 Back demodulated BS 0
% 3.97/4.39
% 3.97/4.39 Clauses or pairs given 255460
% 3.97/4.39 Clauses generated 47330
% 3.97/4.39 Forward subsumed 35177
% 3.97/4.39 Deleted by weight 0
% 3.97/4.39 Deleted by variable count 0
% 3.97/4.39 Kept 12153
% 3.97/4.39 New demodulators 8484
% 3.97/4.39 Back demodulated 794
% 3.97/4.39 Ordered paramod prunes 0
% 3.97/4.39 Basic paramod prunes 1638222
% 3.97/4.39 Prime paramod prunes 2053
% 3.97/4.39 Semantic prunes 0
% 3.97/4.39
% 3.97/4.39 Rewrite attmepts 684462
% 3.97/4.39 Rewrites 69035
% 3.97/4.39
% 3.97/4.39 FPA overloads 0
% 3.97/4.39 FPA underloads 0
% 3.97/4.39
% 3.97/4.39 Usable size 0
% 3.97/4.39 Sos size 11376
% 3.97/4.39 Demodulators size 8313
% 3.97/4.39 Passive size 0
% 3.97/4.39 Disabled size 794
% 3.97/4.39
% 3.97/4.39 Proofs found 1
% 3.97/4.39
% 3.97/4.39 ----------- times (seconds) ----------- Tue Jun 14 01:38:04 2022
% 3.97/4.39
% 3.97/4.39 user CPU time 2.18 (0 hr, 0 min, 2 sec)
% 3.97/4.39 system CPU time 1.12 (0 hr, 0 min, 1 sec)
% 3.97/4.39 wall-clock time 3 (0 hr, 0 min, 3 sec)
% 3.97/4.39 input time 0.00
% 3.97/4.39 paramodulation time 0.36
% 3.97/4.39 demodulation time 0.16
% 3.97/4.39 orient time 0.09
% 3.97/4.39 weigh time 0.02
% 3.97/4.39 forward subsume time 0.05
% 3.97/4.39 back demod find time 0.15
% 3.97/4.39 conflict time 0.01
% 3.97/4.39 LRPO time 0.04
% 3.97/4.39 store clause time 0.92
% 3.97/4.39 disable clause time 0.05
% 3.97/4.39 prime paramod time 0.06
% 3.97/4.39 semantics time 0.00
% 3.97/4.39
% 3.97/4.39 EQP interrupted
%------------------------------------------------------------------------------