TSTP Solution File: GRP170-1 by EQP---0.9e
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : EQP---0.9e
% Problem : GRP170-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% Transfm : none
% Format : tptp:raw
% Command : tptp2X_and_run_eqp %s
% Computer : n010.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:39 EDT 2022
% Result : Unsatisfiable 4.00s 4.41s
% Output : Refutation 4.00s
% 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-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(12,plain,
equal(multiply(A,least_upper_bound(B,C)),least_upper_bound(multiply(A,B),multiply(A,C))),
file('GRP170-1.p',unknown),
[] ).
cnf(14,plain,
equal(multiply(least_upper_bound(A,B),C),least_upper_bound(multiply(A,C),multiply(B,C))),
file('GRP170-1.p',unknown),
[] ).
cnf(16,plain,
equal(least_upper_bound(a,b),b),
file('GRP170-1.p',unknown),
[] ).
cnf(17,plain,
equal(least_upper_bound(c,d),d),
file('GRP170-1.p',unknown),
[] ).
cnf(18,plain,
~ equal(least_upper_bound(multiply(a,c),multiply(b,d)),multiply(b,d)),
file('GRP170-1.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(11996,plain,
$false,
inference(conflict,[status(thm)],[11995,18]),
[iquote('conflict(11995,18)')] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : GRP170-1 : TPTP v8.1.0. Bugfixed v1.2.1.
% 0.07/0.13 % Command : tptp2X_and_run_eqp %s
% 0.13/0.34 % Computer : n010.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 : Tue Jun 14 03:48:24 EDT 2022
% 0.13/0.35 % CPUTime :
% 4.00/4.41 ----- EQP 0.9e, May 2009 -----
% 4.00/4.41 The job began on n010.cluster.edu, Tue Jun 14 03:48:25 2022
% 4.00/4.41 The command was "./eqp09e".
% 4.00/4.41
% 4.00/4.41 set(prolog_style_variables).
% 4.00/4.41 set(lrpo).
% 4.00/4.41 set(basic_paramod).
% 4.00/4.41 set(functional_subsume).
% 4.00/4.41 set(ordered_paramod).
% 4.00/4.41 set(prime_paramod).
% 4.00/4.41 set(para_pairs).
% 4.00/4.41 assign(pick_given_ratio,4).
% 4.00/4.41 clear(print_kept).
% 4.00/4.41 clear(print_new_demod).
% 4.00/4.41 clear(print_back_demod).
% 4.00/4.41 clear(print_given).
% 4.00/4.41 assign(max_mem,64000).
% 4.00/4.41 end_of_commands.
% 4.00/4.41
% 4.00/4.41 Usable:
% 4.00/4.41 end_of_list.
% 4.00/4.41
% 4.00/4.41 Sos:
% 4.00/4.41 0 (wt=-1) [] multiply(identity,A) = A.
% 4.00/4.41 0 (wt=-1) [] multiply(inverse(A),A) = identity.
% 4.00/4.41 0 (wt=-1) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 4.00/4.41 0 (wt=-1) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 4.00/4.41 0 (wt=-1) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 4.00/4.41 0 (wt=-1) [] greatest_lower_bound(A,greatest_lower_bound(B,C)) = greatest_lower_bound(greatest_lower_bound(A,B),C).
% 4.00/4.41 0 (wt=-1) [] least_upper_bound(A,least_upper_bound(B,C)) = least_upper_bound(least_upper_bound(A,B),C).
% 4.00/4.41 0 (wt=-1) [] least_upper_bound(A,A) = A.
% 4.00/4.41 0 (wt=-1) [] greatest_lower_bound(A,A) = A.
% 4.00/4.41 0 (wt=-1) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 4.00/4.41 0 (wt=-1) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 4.00/4.41 0 (wt=-1) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 4.00/4.41 0 (wt=-1) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 4.00/4.41 0 (wt=-1) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 4.00/4.41 0 (wt=-1) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 4.00/4.41 0 (wt=-1) [] least_upper_bound(a,b) = b.
% 4.00/4.41 0 (wt=-1) [] least_upper_bound(c,d) = d.
% 4.00/4.41 0 (wt=-1) [] -(least_upper_bound(multiply(a,c),multiply(b,d)) = multiply(b,d)).
% 4.00/4.41 end_of_list.
% 4.00/4.41
% 4.00/4.41 Demodulators:
% 4.00/4.41 end_of_list.
% 4.00/4.41
% 4.00/4.41 Passive:
% 4.00/4.41 end_of_list.
% 4.00/4.41
% 4.00/4.41 Starting to process input.
% 4.00/4.41
% 4.00/4.41 ** KEPT: 1 (wt=5) [] multiply(identity,A) = A.
% 4.00/4.41 1 is a new demodulator.
% 4.00/4.41
% 4.00/4.41 ** KEPT: 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 4.00/4.41 2 is a new demodulator.
% 4.00/4.41
% 4.00/4.41 ** KEPT: 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 4.00/4.41 3 is a new demodulator.
% 4.00/4.41
% 4.00/4.41 ** KEPT: 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 4.00/4.41 clause forward subsumed: 0 (wt=7) [flip(4)] greatest_lower_bound(B,A) = greatest_lower_bound(A,B).
% 4.00/4.41
% 4.00/4.41 ** KEPT: 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 4.00/4.41 clause forward subsumed: 0 (wt=7) [flip(5)] least_upper_bound(B,A) = least_upper_bound(A,B).
% 4.00/4.41
% 4.00/4.41 ** KEPT: 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 4.00/4.41 6 is a new demodulator.
% 4.00/4.41
% 4.00/4.41 ** KEPT: 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 4.00/4.41 7 is a new demodulator.
% 4.00/4.41
% 4.00/4.41 ** KEPT: 8 (wt=5) [] least_upper_bound(A,A) = A.
% 4.00/4.41 8 is a new demodulator.
% 4.00/4.41
% 4.00/4.41 ** KEPT: 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 4.00/4.41 9 is a new demodulator.
% 4.00/4.41
% 4.00/4.41 ** KEPT: 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 4.00/4.41 10 is a new demodulator.
% 4.00/4.41
% 4.00/4.41 ** KEPT: 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 4.00/4.41 11 is a new demodulator.
% 4.00/4.41
% 4.00/4.41 ** KEPT: 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 4.00/4.41 12 is a new demodulator.
% 4.00/4.41
% 4.00/4.41 ** KEPT: 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 4.00/4.41 13 is a new demodulator.
% 4.00/4.41
% 4.00/4.41 ** KEPT: 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 4.00/4.41 14 is a new demodulator.
% 4.00/4.41
% 4.00/4.41 ** KEPT: 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 4.00/4.41 15 is a new demodulator.
% 4.00/4.41
% 4.00/4.41 ** KEPT: 16 (wt=5) [] least_upper_bound(a,b) = b.
% 4.00/4.41 16 is a new demodulator.
% 4.00/4.41
% 4.00/4.41 ** KEPT: 17 (wt=5) [] least_upper_bound(c,d) = d.
% 4.00/4.41 17 is a new demodulator.
% 4.00/4.41
% 4.00/4.41 ** KEPT: 18 (wt=11) [] -(least_upper_bound(multiply(a,c),multiply(b,d)) = multiply(b,d)).
% 4.00/4.41 ---------------- PROOF FOUND ----------------
% 4.00/4.41 % SZS status Unsatisfiable
% 4.00/4.41
% 4.00/4.41
% 4.00/4.41 After processing input:
% 4.00/4.41
% 4.00/4.41 Usable:
% 4.00/4.41 end_of_list.
% 4.00/4.41
% 4.00/4.41 Sos:
% 4.00/4.41 1 (wt=5) [] multiply(identity,A) = A.
% 4.00/4.41 8 (wt=5) [] least_upper_bound(A,A) = A.
% 4.00/4.41 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 4.00/4.41 16 (wt=5) [] least_upper_bound(a,b) = b.
% 4.00/4.41 17 (wt=5) [] least_upper_bound(c,d) = d.
% 4.00/4.41 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 4.00/4.41 4 (wt=7) [] greatest_lower_bound(A,B) = greatest_lower_bound(B,A).
% 4.00/4.41 5 (wt=7) [] least_upper_bound(A,B) = least_upper_bound(B,A).
% 4.00/4.41 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 4.00/4.41 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 4.00/4.41 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 4.00/4.41 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 4.00/4.41 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 4.00/4.41 18 (wt=11) [] -(least_upper_bound(multiply(a,c),multiply(b,d)) = multiply(b,d)).
% 4.00/4.41 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 4.00/4.41 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 4.00/4.41 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 4.00/4.41 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 4.00/4.41 end_of_list.
% 4.00/4.41
% 4.00/4.41 Demodulators:
% 4.00/4.41 1 (wt=5) [] multiply(identity,A) = A.
% 4.00/4.41 2 (wt=6) [] multiply(inverse(A),A) = identity.
% 4.00/4.41 3 (wt=11) [] multiply(multiply(A,B),C) = multiply(A,multiply(B,C)).
% 4.00/4.41 6 (wt=11) [flip(1)] greatest_lower_bound(greatest_lower_bound(A,B),C) = greatest_lower_bound(A,greatest_lower_bound(B,C)).
% 4.00/4.41 7 (wt=11) [flip(1)] least_upper_bound(least_upper_bound(A,B),C) = least_upper_bound(A,least_upper_bound(B,C)).
% 4.00/4.41 8 (wt=5) [] least_upper_bound(A,A) = A.
% 4.00/4.41 9 (wt=5) [] greatest_lower_bound(A,A) = A.
% 4.00/4.41 10 (wt=7) [] least_upper_bound(A,greatest_lower_bound(A,B)) = A.
% 4.00/4.41 11 (wt=7) [] greatest_lower_bound(A,least_upper_bound(A,B)) = A.
% 4.00/4.41 12 (wt=13) [] multiply(A,least_upper_bound(B,C)) = least_upper_bound(multiply(A,B),multiply(A,C)).
% 4.00/4.41 13 (wt=13) [] multiply(A,greatest_lower_bound(B,C)) = greatest_lower_bound(multiply(A,B),multiply(A,C)).
% 4.00/4.41 14 (wt=13) [] multiply(least_upper_bound(A,B),C) = least_upper_bound(multiply(A,C),multiply(B,C)).
% 4.00/4.41 15 (wt=13) [] multiply(greatest_lower_bound(A,B),C) = greatest_lower_bound(multiply(A,C),multiply(B,C)).
% 4.00/4.41 16 (wt=5) [] least_upper_bound(a,b) = b.
% 4.00/4.41 17 (wt=5) [] least_upper_bound(c,d) = d.
% 4.00/4.41 end_of_list.
% 4.00/4.41
% 4.00/4.41 Passive:
% 4.00/4.41 end_of_list.
% 4.00/4.41
% 4.00/4.41 UNIT CONFLICT from 11995 and 18 at 2.19 seconds.
% 4.00/4.41
% 4.00/4.41 ---------------- PROOF ----------------
% 4.00/4.41 % SZS output start Refutation
% See solution above
% 4.00/4.41 ------------ end of proof -------------
% 4.00/4.41
% 4.00/4.41
% 4.00/4.41 ------------- memory usage ------------
% 4.00/4.41 Memory dynamically allocated (tp_alloc): 23925.
% 4.00/4.41 type (bytes each) gets frees in use avail bytes
% 4.00/4.41 sym_ent ( 96) 60 0 60 0 5.6 K
% 4.00/4.41 term ( 16) 1725192 1396306 328886 26 6377.2 K
% 4.00/4.41 gen_ptr ( 8) 1757584 240593 1516991 24 11851.7 K
% 4.00/4.41 context ( 808) 2466556 2466554 2 6 6.3 K
% 4.00/4.41 trail ( 12) 116532 116532 0 7 0.1 K
% 4.00/4.41 bt_node ( 68) 1325640 1325635 5 22 1.8 K
% 4.00/4.42 ac_position (285432) 0 0 0 0 0.0 K
% 4.00/4.42 ac_match_pos (14044) 0 0 0 0 0.0 K
% 4.00/4.42 ac_match_free_vars_pos (4020)
% 4.00/4.42 0 0 0 0 0.0 K
% 4.00/4.42 discrim ( 12) 267104 9206 257898 57 3022.9 K
% 4.00/4.42 flat ( 40) 3833708 3833708 0 185 7.2 K
% 4.00/4.42 discrim_pos ( 12) 78880 78880 0 1 0.0 K
% 4.00/4.42 fpa_head ( 12) 24290 0 24290 0 284.6 K
% 4.00/4.42 fpa_tree ( 28) 51899 51899 0 83 2.3 K
% 4.00/4.42 fpa_pos ( 36) 20346 20346 0 1 0.0 K
% 4.00/4.42 literal ( 12) 69730 57735 11995 1 140.6 K
% 4.00/4.42 clause ( 24) 69730 57735 11995 1 281.2 K
% 4.00/4.42 list ( 12) 8410 8354 56 3 0.7 K
% 4.00/4.42 list_pos ( 20) 45945 3393 42552 13 831.3 K
% 4.00/4.42 pair_index ( 40) 2 0 2 0 0.1 K
% 4.00/4.42
% 4.00/4.42 -------------- statistics -------------
% 4.00/4.42 Clauses input 18
% 4.00/4.42 Usable input 0
% 4.00/4.42 Sos input 18
% 4.00/4.42 Demodulators input 0
% 4.00/4.42 Passive input 0
% 4.00/4.42
% 4.00/4.42 Processed BS (before search) 20
% 4.00/4.42 Forward subsumed BS 2
% 4.00/4.42 Kept BS 18
% 4.00/4.42 New demodulators BS 15
% 4.00/4.42 Back demodulated BS 0
% 4.00/4.42
% 4.00/4.42 Clauses or pairs given 249780
% 4.00/4.42 Clauses generated 46907
% 4.00/4.42 Forward subsumed 34930
% 4.00/4.42 Deleted by weight 0
% 4.00/4.42 Deleted by variable count 0
% 4.00/4.42 Kept 11977
% 4.00/4.42 New demodulators 8336
% 4.00/4.42 Back demodulated 797
% 4.00/4.42 Ordered paramod prunes 0
% 4.00/4.42 Basic paramod prunes 1601961
% 4.00/4.42 Prime paramod prunes 1984
% 4.00/4.42 Semantic prunes 0
% 4.00/4.42
% 4.00/4.42 Rewrite attmepts 676539
% 4.00/4.42 Rewrites 68301
% 4.00/4.42
% 4.00/4.42 FPA overloads 0
% 4.00/4.42 FPA underloads 0
% 4.00/4.42
% 4.00/4.42 Usable size 0
% 4.00/4.42 Sos size 11197
% 4.00/4.42 Demodulators size 8164
% 4.00/4.42 Passive size 0
% 4.00/4.42 Disabled size 797
% 4.00/4.42
% 4.00/4.42 Proofs found 1
% 4.00/4.42
% 4.00/4.42 ----------- times (seconds) ----------- Tue Jun 14 03:48:28 2022
% 4.00/4.42
% 4.00/4.42 user CPU time 2.19 (0 hr, 0 min, 2 sec)
% 4.00/4.42 system CPU time 1.13 (0 hr, 0 min, 1 sec)
% 4.00/4.42 wall-clock time 3 (0 hr, 0 min, 3 sec)
% 4.00/4.42 input time 0.00
% 4.00/4.42 paramodulation time 0.40
% 4.00/4.42 demodulation time 0.15
% 4.00/4.42 orient time 0.07
% 4.00/4.42 weigh time 0.01
% 4.00/4.42 forward subsume time 0.06
% 4.00/4.42 back demod find time 0.17
% 4.00/4.42 conflict time 0.01
% 4.00/4.42 LRPO time 0.03
% 4.00/4.42 store clause time 0.93
% 4.00/4.42 disable clause time 0.04
% 4.00/4.42 prime paramod time 0.06
% 4.00/4.42 semantics time 0.00
% 4.00/4.42
% 4.00/4.42 EQP interrupted
%------------------------------------------------------------------------------